%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT009-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:01:08 PM UTC 2026
% Result : Unsatisfiable 3.86s 1.18s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 25 unt; 3 def)
% Number of atoms : 98 ( 24 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_has_elements) ).
fof(f5,axiom,
! [X0] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
fof(f6,axiom,
! [X0,X1] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',composition_implies_domain) ).
fof(f7,axiom,
! [X0,X1] :
( domain(X0) = codomain(X1)
| ~ there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
fof(f9,axiom,
! [X2,X0,X1] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',associativity_of_compose) ).
fof(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
fof(f20,axiom,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).
fof(f21,negated_conjecture,
domain(compose(a,b)) != domain(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_of_ab_equals_domain_of_b) ).
tcf(c_71,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_72,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = codomain(X1) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] : compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_77,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_85,plain,
there_exists(compose(a,b)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,negated_conjecture,
domain(compose(a,b)) != domain(b),
inference(cnf_transformation,[],[f21]) ).
tcf(c_336,definition,
iPr_def_10 = compose(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_337,definition,
iPr_def_11 = domain(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_338,definition,
iPr_def_12 = domain(b),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_339,negated_conjecture,
iPr_def_11 != iPr_def_12,
inference(demodulation,[status(thm)],[c_86,c_338,c_336,c_337]) ).
tcf(c_516,plain,
there_exists(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_85,c_336]) ).
tcf(c_519,plain,
( there_exists(b)
| ~ there_exists(iPr_def_12) ),
inference(superposition,[status(thm)],[c_338,c_71]) ).
tcf(c_531,plain,
! [X0: $i] : compose(a,compose(b,X0)) = compose(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_336,c_76]) ).
tcf(c_537,plain,
compose(b,iPr_def_12) = b,
inference(superposition,[status(thm)],[c_338,c_77]) ).
tcf(c_538,plain,
compose(iPr_def_10,iPr_def_11) = iPr_def_10,
inference(superposition,[status(thm)],[c_337,c_77]) ).
tcf(c_597,plain,
( there_exists(domain(iPr_def_10))
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_538,c_73]) ).
tcf(c_599,plain,
( there_exists(iPr_def_11)
| ~ there_exists(iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_597,c_337]) ).
tcf(c_600,plain,
there_exists(iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_599,c_516]) ).
tcf(c_625,plain,
compose(a,b) = compose(iPr_def_10,iPr_def_12),
inference(superposition,[status(thm)],[c_537,c_531]) ).
tcf(c_629,plain,
compose(iPr_def_10,iPr_def_12) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_625,c_336]) ).
tcf(c_645,plain,
( ( domain(b) = codomain(iPr_def_12) )
| ~ there_exists(b) ),
inference(superposition,[status(thm)],[c_537,c_74]) ).
tcf(c_649,plain,
( ( codomain(iPr_def_12) = iPr_def_12 )
| ~ there_exists(b) ),
inference(light_normalisation,[status(thm)],[c_645,c_338]) ).
tcf(c_716,plain,
( ( domain(iPr_def_10) = codomain(iPr_def_12) )
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_629,c_74]) ).
tcf(c_720,plain,
( ( codomain(iPr_def_12) = iPr_def_11 )
| ~ there_exists(iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_716,c_337]) ).
tcf(c_721,plain,
codomain(iPr_def_12) = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_720,c_516]) ).
tcf(c_726,plain,
( there_exists(iPr_def_12)
| ~ there_exists(iPr_def_11) ),
inference(superposition,[status(thm)],[c_721,c_72]) ).
tcf(c_728,plain,
there_exists(iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_726,c_600]) ).
tcf(c_732,plain,
there_exists(b),
inference(backward_subsumption_resolution,[status(thm)],[c_519,c_728]) ).
tcf(c_804,plain,
codomain(iPr_def_12) = iPr_def_12,
inference(global_subsumption_just,[status(thm)],[c_649,c_649,c_732]) ).
tcf(c_806,plain,
iPr_def_11 = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_804,c_721]) ).
tcf(c_807,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_806,c_339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT009-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n014.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 06:53:48 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 3.86/1.18 % SZS status Started for theBenchmark.p
% 3.86/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.18
% 3.86/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.86/1.18
% 3.86/1.18 % ------ iProver source info
% 3.86/1.18
% 3.86/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.86/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.86/1.18 % git: non_committed_changes: false
% 3.86/1.18
% 3.86/1.18 % ------ Parsing...% successful
% 3.86/1.18
% 3.86/1.18
% 3.86/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.86/1.18
% 3.86/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.86/1.18
% 3.86/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.86/1.18
% 3.86/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.86/1.18 % ------ Proving...
% 3.86/1.18 % ------ Problem Properties
% 3.86/1.18
% 3.86/1.18 %
% 3.86/1.18 % clauses 17
% 3.86/1.18 % conjectures 1
% 3.86/1.18 % EPR 1
% 3.86/1.18 % Horn 15
% 3.86/1.18 % unary 8
% 3.86/1.18 % binary 6
% 3.86/1.18 % lits 29
% 3.86/1.18 % lits eq 16
% 3.86/1.18 % fd_pure 0
% 3.86/1.18 % fd_pseudo 0
% 3.86/1.18 % fd_cond 0
% 3.86/1.18 % fd_pseudo_cond 2
% 3.86/1.18 % AC symbols 0
% 3.86/1.18
% 3.86/1.18 % ------ Schedule dynamic 5 is on
% 3.86/1.18
% 3.86/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.86/1.18
% 3.86/1.18
% 3.86/1.18 % ------
% 3.86/1.18 % Current options:
% 3.86/1.18 % ------
% 3.86/1.18
% 3.86/1.18
% 3.86/1.18 %
% 3.86/1.18
% 3.86/1.18 % ------ Proving...
% 3.86/1.18 %
% 3.86/1.18
% 3.86/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.18
% 3.86/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.86/1.18
% 3.86/1.18
%------------------------------------------------------------------------------