%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT018-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 : n002.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:12 PM UTC 2026
% Result : Unsatisfiable 3.95s 1.35s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 22 unt; 2 def)
% Number of atoms : 88 ( 21 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 21 :)
% 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(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(f8,axiom,
! [X0,X1] :
( there_exists(compose(X0,X1))
| domain(X0) != codomain(X1)
| ~ there_exists(domain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition2) ).
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(f11,axiom,
! [X0] : compose(codomain(X0),X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_codomain) ).
fof(f20,axiom,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_ab_exists) ).
fof(f21,axiom,
there_exists(compose(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_bc_exists) ).
fof(f22,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_bc_exists) ).
tcf(c_72,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_75,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] :
( there_exists(compose(X0,X1))
| ~ there_exists(domain(X0))
| ( domain(X0) != codomain(X1) ) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i,X2: $i] : compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_79,plain,
! [X0: $i] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_86,plain,
there_exists(compose(a,b)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_87,plain,
there_exists(compose(b,c)),
inference(cnf_transformation,[],[f21]) ).
tcf(c_88,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
inference(cnf_transformation,[],[f22]) ).
tcf(c_340,definition,
iPr_def_10 = compose(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_341,definition,
iPr_def_11 = compose(a,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_342,negated_conjecture,
~ there_exists(iPr_def_11),
inference(demodulation,[status(thm)],[c_88,c_340,c_341]) ).
tcf(c_347,plain,
! [X0: $i,X1: $i] :
( there_exists(X0)
| ~ there_exists(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_509,plain,
there_exists(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_87,c_340]) ).
tcf(c_534,plain,
there_exists(domain(a)),
inference(superposition,[status(thm)],[c_86,c_74]) ).
tcf(c_536,plain,
! [X0: $i,X1: $i,X2: $i] :
( there_exists(domain(compose(X0,X1)))
| ~ there_exists(compose(X0,compose(X1,X2))) ),
inference(superposition,[status(thm)],[c_77,c_74]) ).
tcf(c_623,plain,
! [X0: $i] :
( there_exists(domain(compose(X0,b)))
| ~ there_exists(compose(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_340,c_536]) ).
tcf(c_659,plain,
! [X0: $i] :
( there_exists(iPr_def_11)
| ~ there_exists(X0)
| ( iPr_def_11 != X0 ) ),
inference(instantiation,[status(thm)],[c_347]) ).
tcf(c_665,plain,
domain(a) = codomain(b),
inference(superposition,[status(thm)],[c_86,c_75]) ).
tcf(c_669,plain,
! [X0: $i] :
( ( domain(codomain(X0)) = codomain(X0) )
| ~ there_exists(X0) ),
inference(superposition,[status(thm)],[c_79,c_75]) ).
tcf(c_778,plain,
( there_exists(iPr_def_11)
| ~ there_exists(compose(a,iPr_def_10))
| ( iPr_def_11 != compose(a,iPr_def_10) ) ),
inference(instantiation,[status(thm)],[c_659]) ).
tcf(c_1158,plain,
! [X0: $i] :
( there_exists(compose(X0,b))
| ~ there_exists(compose(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_623,c_72]) ).
tcf(c_1170,plain,
( there_exists(compose(codomain(iPr_def_10),b))
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_79,c_1158]) ).
tcf(c_1172,plain,
there_exists(compose(codomain(iPr_def_10),b)),
inference(forward_subsumption_resolution,[status(thm)],[c_1170,c_509]) ).
tcf(c_1176,plain,
domain(codomain(iPr_def_10)) = codomain(b),
inference(superposition,[status(thm)],[c_1172,c_75]) ).
tcf(c_1179,plain,
domain(codomain(iPr_def_10)) = domain(a),
inference(light_normalisation,[status(thm)],[c_1176,c_665]) ).
tcf(c_1469,plain,
domain(codomain(iPr_def_10)) = codomain(iPr_def_10),
inference(superposition,[status(thm)],[c_509,c_669]) ).
tcf(c_1485,plain,
domain(a) = codomain(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_1469,c_1179]) ).
tcf(c_1617,plain,
! [X0: $i] :
( there_exists(compose(a,X0))
| ~ there_exists(domain(a))
| ( domain(a) != codomain(X0) ) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_4100,plain,
( there_exists(compose(a,iPr_def_10))
| ~ there_exists(domain(a))
| ( domain(a) != codomain(iPr_def_10) ) ),
inference(instantiation,[status(thm)],[c_1617]) ).
tcf(c_4101,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4100,c_1485,c_778,c_534,c_342,c_341]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT018-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Fri Sep 25 07:00:23 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 3.95/1.35 % SZS status Started for theBenchmark.p
% 3.95/1.35 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.35
% 3.95/1.35 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.95/1.35
% 3.95/1.35 % ------ iProver source info
% 3.95/1.35
% 3.95/1.35 % git: date: 2026-07-19 20:42:38 +0200
% 3.95/1.35 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.95/1.35 % git: non_committed_changes: false
% 3.95/1.35
% 3.95/1.35 % ------ Parsing...% successful
% 3.95/1.35
% 3.95/1.35
% 3.95/1.35 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.95/1.35
% 3.95/1.35 % ------ 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.95/1.35
% 3.95/1.35 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.95/1.35
% 3.95/1.35 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.35 % ------ Proving...
% 3.95/1.35 % ------ Problem Properties
% 3.95/1.35
% 3.95/1.35 %
% 3.95/1.35 % clauses 17
% 3.95/1.35 % conjectures 1
% 3.95/1.35 % EPR 1
% 3.95/1.35 % Horn 15
% 3.95/1.35 % unary 8
% 3.95/1.35 % binary 6
% 3.95/1.35 % lits 29
% 3.95/1.35 % lits eq 14
% 3.95/1.35 % fd_pure 0
% 3.95/1.35 % fd_pseudo 0
% 3.95/1.35 % fd_cond 0
% 3.95/1.35 % fd_pseudo_cond 2
% 3.95/1.35 % AC symbols 0
% 3.95/1.35
% 3.95/1.35 % ------ Schedule dynamic 5 is on
% 3.95/1.35
% 3.95/1.35 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.35
% 3.95/1.35
% 3.95/1.35 % ------
% 3.95/1.35 % Current options:
% 3.95/1.35 % ------
% 3.95/1.35
% 3.95/1.35
% 3.95/1.35 %
% 3.95/1.35
% 3.95/1.35 % ------ Proving...
% 3.95/1.35 %
% 3.95/1.35
% 3.95/1.35 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.35
% 3.95/1.35 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.35
% 3.95/1.35
%------------------------------------------------------------------------------