%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT005-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 : n013.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 0.90s 1.29s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 18 unt; 1 def)
% Number of atoms : 50 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 16 ~; 11 |; 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(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(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,d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ad_exists) ).
fof(f21,axiom,
! [X0] :
( compose(X0,d) = X0
| ~ there_exists(compose(X0,d)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xd_equals_x) ).
fof(f23,negated_conjecture,
domain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_of_a_is_d) ).
fof(f24,plain,
d != domain(a),
inference(reorient_equations,[],[f23]) ).
tcf(c_74,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = codomain(X1) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_80,plain,
! [X0: $i] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_87,plain,
there_exists(compose(a,d)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_88,plain,
! [X0: $i] :
( ( compose(X0,d) = X0 )
| ~ there_exists(compose(X0,d)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_90,negated_conjecture,
domain(a) != d,
inference(cnf_transformation,[],[f24]) ).
tcf(c_373,definition,
iPr_def_10 = domain(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_589,plain,
there_exists(domain(a)),
inference(superposition,[status(thm)],[c_87,c_75]) ).
tcf(c_594,plain,
there_exists(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_589,c_373]) ).
tcf(c_665,plain,
domain(a) = codomain(d),
inference(superposition,[status(thm)],[c_87,c_76]) ).
tcf(c_672,plain,
codomain(d) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_665,c_373]) ).
tcf(c_697,plain,
compose(iPr_def_10,d) = d,
inference(superposition,[status(thm)],[c_672,c_80]) ).
tcf(c_698,plain,
( there_exists(d)
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_672,c_74]) ).
tcf(c_699,plain,
there_exists(d),
inference(forward_subsumption_resolution,[status(thm)],[c_698,c_594]) ).
tcf(c_735,plain,
( ( compose(codomain(d),d) = codomain(d) )
| ~ there_exists(d) ),
inference(superposition,[status(thm)],[c_80,c_88]) ).
tcf(c_736,plain,
( ( d = iPr_def_10 )
| ~ there_exists(d) ),
inference(light_normalisation,[status(thm)],[c_735,c_672,c_697]) ).
tcf(c_737,plain,
d = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_736,c_699]) ).
tcf(c_744,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_374,c_737]) ).
tcf(c_745,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_744]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT005-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.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 06:51:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.90/1.29 % SZS status Started for theBenchmark.p
% 0.90/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.90/1.29
% 0.90/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.90/1.29
% 0.90/1.29 % ------ iProver source info
% 0.90/1.29
% 0.90/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.90/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.90/1.29 % git: non_committed_changes: false
% 0.90/1.29
% 0.90/1.29 % ------ Parsing...% successful
% 0.90/1.29
% 0.90/1.29
% 0.90/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.90/1.29
% 0.90/1.29 % ------ 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 %
% 0.90/1.29
% 0.90/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.90/1.29
% 0.90/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.90/1.29 % ------ Proving...
% 0.90/1.29 % ------ Problem Properties
% 0.90/1.29
% 0.90/1.29 %
% 0.90/1.29 % clauses 17
% 0.90/1.29 % conjectures 1
% 0.90/1.29 % EPR 1
% 0.90/1.29 % Horn 15
% 0.90/1.29 % unary 6
% 0.90/1.29 % binary 8
% 0.90/1.29 % lits 31
% 0.90/1.29 % lits eq 16
% 0.90/1.29 % fd_pure 0
% 0.90/1.29 % fd_pseudo 0
% 0.90/1.29 % fd_cond 0
% 0.90/1.29 % fd_pseudo_cond 2
% 0.90/1.29 % AC symbols 0
% 0.90/1.29
% 0.90/1.29 % ------ Schedule dynamic 5 is on
% 0.90/1.29
% 0.90/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.90/1.29
% 0.90/1.29
% 0.90/1.29 % ------
% 0.90/1.29 % Current options:
% 0.90/1.29 % ------
% 0.90/1.29
% 0.90/1.29
% 0.90/1.29 %
% 0.90/1.29
% 0.90/1.29 % ------ Proving...
% 0.90/1.29 %
% 0.90/1.29
% 0.90/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.90/1.29
% 0.90/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.90/1.29
% 0.90/1.29
%------------------------------------------------------------------------------