%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT006-4 : 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 : n007.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.77s 1.28s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 17 unt; 1 def)
% Number of atoms : 50 ( 19 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(f4,axiom,
! [X0] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-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/CAT004-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/CAT004-0.ax',domain_codomain_composition1) ).
fof(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_domain) ).
fof(f12,axiom,
there_exists(compose(d,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',da_exists) ).
fof(f14,axiom,
! [X0] :
( compose(d,X0) = X0
| ~ there_exists(compose(d,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dx_equals_x) ).
fof(f15,negated_conjecture,
codomain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_is_d) ).
fof(f16,plain,
d != codomain(a),
inference(reorient_equations,[],[f15]) ).
tcf(c_67,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( ( codomain(X1) = domain(X0) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_73,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_75,plain,
there_exists(compose(d,a)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_77,plain,
! [X0: $i] :
( ( compose(d,X0) = X0 )
| ~ there_exists(compose(d,X0)) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_78,negated_conjecture,
codomain(a) != d,
inference(cnf_transformation,[],[f16]) ).
tcf(c_80,plain,
( there_exists(d)
| ~ there_exists(domain(d)) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_267,definition,
iPr_def_10 = codomain(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_268,negated_conjecture,
iPr_def_10 != d,
inference(demodulation,[status(thm)],[c_78,c_267]) ).
tcf(c_431,plain,
there_exists(domain(d)),
inference(superposition,[status(thm)],[c_75,c_69]) ).
tcf(c_446,plain,
codomain(a) = domain(d),
inference(superposition,[status(thm)],[c_75,c_70]) ).
tcf(c_450,plain,
domain(d) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_446,c_267]) ).
tcf(c_472,plain,
( ( compose(d,domain(d)) = domain(d) )
| ~ there_exists(d) ),
inference(superposition,[status(thm)],[c_73,c_77]) ).
tcf(c_473,plain,
( ( compose(d,iPr_def_10) = iPr_def_10 )
| ~ there_exists(d) ),
inference(light_normalisation,[status(thm)],[c_472,c_450]) ).
tcf(c_478,plain,
compose(d,iPr_def_10) = d,
inference(superposition,[status(thm)],[c_450,c_73]) ).
tcf(c_589,plain,
compose(d,iPr_def_10) = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_473,c_80,c_431,c_473]) ).
tcf(c_591,plain,
d = iPr_def_10,
inference(demodulation,[status(thm)],[c_478,c_589]) ).
tcf(c_598,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_268,c_591]) ).
tcf(c_599,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_598]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT006-4 : 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 : n007.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.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Fri Sep 25 06:51:09 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...
% 1.77/1.28 % SZS status Started for theBenchmark.p
% 1.77/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.77/1.28
% 1.77/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.77/1.28
% 1.77/1.28 % ------ iProver source info
% 1.77/1.28
% 1.77/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.77/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.77/1.28 % git: non_committed_changes: false
% 1.77/1.28
% 1.77/1.28 % ------ Parsing...% successful
% 1.77/1.28
% 1.77/1.28
% 1.77/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.77/1.28
% 1.77/1.28 % ------ 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 %
% 1.77/1.28
% 1.77/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.77/1.28
% 1.77/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.77/1.28 % ------ Proving...
% 1.77/1.28 % ------ Problem Properties
% 1.77/1.28
% 1.77/1.28 %
% 1.77/1.28 % clauses 13
% 1.77/1.28 % conjectures 1
% 1.77/1.28 % EPR 1
% 1.77/1.28 % Horn 13
% 1.77/1.28 % unary 6
% 1.77/1.28 % binary 6
% 1.77/1.28 % lits 21
% 1.77/1.28 % lits eq 9
% 1.77/1.28 % fd_pure 0
% 1.77/1.28 % fd_pseudo 0
% 1.77/1.28 % fd_cond 0
% 1.77/1.28 % fd_pseudo_cond 0
% 1.77/1.28 % AC symbols 0
% 1.77/1.28
% 1.77/1.28 % ------ Schedule dynamic 5 is on
% 1.77/1.28
% 1.77/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.77/1.28
% 1.77/1.28
% 1.77/1.28 % ------
% 1.77/1.28 % Current options:
% 1.77/1.28 % ------
% 1.77/1.28
% 1.77/1.28
% 1.77/1.28 %
% 1.77/1.28
% 1.77/1.28 % ------ Proving...
% 1.77/1.28 %
% 1.77/1.28
% 1.77/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.77/1.28
% 1.77/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.77/1.28
% 1.77/1.28
%------------------------------------------------------------------------------