%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT007-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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 1.67s 6.27s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 9 unt; 1 def)
% Number of atoms : 22 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 4 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( there_exists(compose(X0,X1))
| ~ equalish(domain(X0),codomain(X1))
| ~ there_exists(domain(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_codomain_composition2) ).
fof(f9,axiom,
there_exists(domain(c2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_of_c2_exists) ).
fof(f11,axiom,
equalish(domain(c2),codomain(c1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_of_c2_equals_codomain_of_c1) ).
fof(f12,negated_conjecture,
~ there_exists(compose(c2,c1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c1_c2_is_defined) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( there_exists(compose(X0,X1))
| ~ there_exists(domain(X0))
| ~ equalish(domain(X0),codomain(X1)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_69,plain,
there_exists(domain(c2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_71,plain,
equalish(domain(c2),codomain(c1)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_72,negated_conjecture,
~ there_exists(compose(c2,c1)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_164,definition,
iPr_def_10 = compose(c2,c1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_165,negated_conjecture,
~ there_exists(iPr_def_10),
inference(demodulation,[status(thm)],[c_72,c_164]) ).
tcf(c_394,plain,
( there_exists(compose(c2,c1))
| ~ there_exists(domain(c2)) ),
inference(superposition,[status(thm)],[c_71,c_65]) ).
tcf(c_395,plain,
( there_exists(iPr_def_10)
| ~ there_exists(domain(c2)) ),
inference(light_normalisation,[status(thm)],[c_394,c_164]) ).
tcf(c_396,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_395,c_165,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.37 % Computer : n005.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Fri Sep 25 06:53:08 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.42
% 0.14/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42
% 0.14/5.42 % Detected problem language: tptp
% 0.14/5.43 % Proving...
% 1.67/6.27 % SZS status Started for theBenchmark.p
% 1.67/6.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.67/6.27
% 1.67/6.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.67/6.27
% 1.67/6.27 % ------ iProver source info
% 1.67/6.27
% 1.67/6.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.67/6.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.67/6.27 % git: non_committed_changes: false
% 1.67/6.27
% 1.67/6.27 % ------ Parsing...% successful
% 1.67/6.27
% 1.67/6.27
% 1.67/6.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.67/6.27
% 1.67/6.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.67/6.27
% 1.67/6.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.67/6.27
% 1.67/6.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.67/6.27 % ------ Proving...
% 1.67/6.27 % ------ Problem Properties
% 1.67/6.27
% 1.67/6.27 %
% 1.67/6.27 % clauses 12
% 1.67/6.27 % conjectures 1
% 1.67/6.27 % EPR 4
% 1.67/6.27 % Horn 11
% 1.67/6.27 % unary 6
% 1.67/6.27 % binary 2
% 1.67/6.27 % lits 22
% 1.67/6.27 % lits eq 1
% 1.67/6.27 % fd_pure 0
% 1.67/6.27 % fd_pseudo 0
% 1.67/6.27 % fd_cond 0
% 1.67/6.27 % fd_pseudo_cond 0
% 1.67/6.27 % AC symbols 0
% 1.67/6.27
% 1.67/6.27 % ------ Schedule dynamic 5 is on
% 1.67/6.27
% 1.67/6.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.67/6.27
% 1.67/6.27
% 1.67/6.27 % ------
% 1.67/6.27 % Current options:
% 1.67/6.27 % ------
% 1.67/6.27
% 1.67/6.27
% 1.67/6.27 %
% 1.67/6.27
% 1.67/6.27 % ------ Proving...
% 1.67/6.27 %
% 1.67/6.27
% 1.67/6.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.67/6.27
% 1.67/6.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/6.27
% 1.67/6.27
%------------------------------------------------------------------------------