%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT006-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 : n019.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:07 PM UTC 2026
% Result : Unsatisfiable 2.17s 1.15s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 17 unt; 1 def)
% Number of atoms : 47 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 10 |; 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
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(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
fof(f14,axiom,
! [X0,X1] :
( there_exists(codomain(X0))
| ~ there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',composition_implies_codomain) ).
fof(f20,axiom,
there_exists(compose(d,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',da_exists) ).
fof(f22,axiom,
! [X0] :
( compose(d,X0) = X0
| ~ there_exists(compose(d,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dx_equals_x) ).
fof(f23,negated_conjecture,
codomain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_is_d) ).
fof(f24,plain,
d != codomain(a),
inference(reorient_equations,[],[f23]) ).
tcf(c_74,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ( codomain(X1) = domain(X0) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_79,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( there_exists(codomain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_87,plain,
there_exists(compose(d,a)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_89,plain,
! [X0: $i] :
( ( compose(d,X0) = X0 )
| ~ there_exists(compose(d,X0)) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_90,negated_conjecture,
codomain(a) != d,
inference(cnf_transformation,[],[f24]) ).
tcf(c_373,definition,
iPr_def_10 = codomain(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_374,negated_conjecture,
iPr_def_10 != d,
inference(demodulation,[status(thm)],[c_90,c_373]) ).
tcf(c_592,plain,
there_exists(codomain(d)),
inference(superposition,[status(thm)],[c_87,c_83]) ).
tcf(c_611,plain,
codomain(a) = domain(d),
inference(superposition,[status(thm)],[c_87,c_76]) ).
tcf(c_615,plain,
domain(d) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_611,c_373]) ).
tcf(c_627,plain,
there_exists(d),
inference(superposition,[status(thm)],[c_592,c_74]) ).
tcf(c_628,plain,
compose(d,iPr_def_10) = d,
inference(superposition,[status(thm)],[c_615,c_79]) ).
tcf(c_680,plain,
( ( compose(d,iPr_def_10) = iPr_def_10 )
| ~ there_exists(d) ),
inference(superposition,[status(thm)],[c_628,c_89]) ).
tcf(c_681,plain,
( ( d = iPr_def_10 )
| ~ there_exists(d) ),
inference(light_normalisation,[status(thm)],[c_680,c_628]) ).
tcf(c_682,plain,
d = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_681,c_627]) ).
tcf(c_692,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_374,c_682]) ).
tcf(c_693,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_692]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT006-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.10/0.35 % Computer : n019.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 25 06:52:48 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 2.17/1.15 % SZS status Started for theBenchmark.p
% 2.17/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.17/1.15
% 2.17/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.17/1.15
% 2.17/1.15 % ------ iProver source info
% 2.17/1.15
% 2.17/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 2.17/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.17/1.15 % git: non_committed_changes: false
% 2.17/1.15
% 2.17/1.15 % ------ Parsing...% successful
% 2.17/1.15
% 2.17/1.15
% 2.17/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.17/1.15
% 2.17/1.15 % ------ 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 %
% 2.17/1.15
% 2.17/1.15 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.17/1.15
% 2.17/1.15 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.17/1.15 % ------ Proving...
% 2.17/1.15 % ------ Problem Properties
% 2.17/1.15
% 2.17/1.15 %
% 2.17/1.15 % clauses 17
% 2.17/1.15 % conjectures 1
% 2.17/1.15 % EPR 1
% 2.17/1.15 % Horn 15
% 2.17/1.15 % unary 6
% 2.17/1.15 % binary 8
% 2.17/1.15 % lits 31
% 2.17/1.15 % lits eq 16
% 2.17/1.15 % fd_pure 0
% 2.17/1.15 % fd_pseudo 0
% 2.17/1.15 % fd_cond 0
% 2.17/1.15 % fd_pseudo_cond 2
% 2.17/1.15 % AC symbols 0
% 2.17/1.15
% 2.17/1.15 % ------ Schedule dynamic 5 is on
% 2.17/1.15
% 2.17/1.15 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.17/1.15
% 2.17/1.15
% 2.17/1.15 % ------
% 2.17/1.15 % Current options:
% 2.17/1.15 % ------
% 2.17/1.15
% 2.17/1.15
% 2.17/1.15 %
% 2.17/1.15
% 2.17/1.15 % ------ Proving...
% 2.17/1.15 %
% 2.17/1.15
% 2.17/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.17/1.15
% 2.17/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.15
% 2.17/1.15
%------------------------------------------------------------------------------