%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT011-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 : n011.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:09 PM UTC 2026
% Result : Unsatisfiable 2.75s 1.51s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 20 unt; 2 def)
% Number of atoms : 64 ( 21 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 5 :)
% 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(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(f11,axiom,
! [X0] : compose(codomain(X0),X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_codomain) ).
fof(f12,axiom,
there_exists(domain(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_domain_exists) ).
fof(f13,negated_conjecture,
domain(domain(a)) != domain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_is_idempotent) ).
fof(f14,plain,
domain(a) != domain(domain(a)),
inference(reorient_equations,[],[f13]) ).
tcf(c_65,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = codomain(X1) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_71,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_72,plain,
! [X0: $i] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_73,plain,
there_exists(domain(a)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_74,negated_conjecture,
domain(domain(a)) != domain(a),
inference(cnf_transformation,[],[f14]) ).
tcf(c_229,definition,
iPr_def_10 = domain(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_230,definition,
iPr_def_11 = domain(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_231,negated_conjecture,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_74,c_229,c_230]) ).
tcf(c_364,plain,
there_exists(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_73,c_229]) ).
tcf(c_367,plain,
( there_exists(a)
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_229,c_65]) ).
tcf(c_369,plain,
there_exists(a),
inference(forward_subsumption_resolution,[status(thm)],[c_367,c_364]) ).
tcf(c_374,plain,
compose(a,iPr_def_10) = a,
inference(superposition,[status(thm)],[c_229,c_71]) ).
tcf(c_395,plain,
( ( domain(a) = codomain(iPr_def_10) )
| ~ there_exists(a) ),
inference(superposition,[status(thm)],[c_374,c_68]) ).
tcf(c_396,plain,
( ( codomain(iPr_def_10) = iPr_def_10 )
| ~ there_exists(a) ),
inference(light_normalisation,[status(thm)],[c_395,c_229]) ).
tcf(c_397,plain,
codomain(iPr_def_10) = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_396,c_369]) ).
tcf(c_424,plain,
compose(iPr_def_10,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_397,c_72]) ).
tcf(c_450,plain,
( ( domain(iPr_def_10) = codomain(iPr_def_10) )
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_424,c_68]) ).
tcf(c_452,plain,
( ( iPr_def_10 = iPr_def_11 )
| ~ there_exists(iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_450,c_230,c_397]) ).
tcf(c_453,plain,
iPr_def_10 = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_452,c_364]) ).
tcf(c_458,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_231,c_453]) ).
tcf(c_459,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_458]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT011-4 : 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.58 % Computer : n011.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Fri Sep 25 06:55:29 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.63 Running first-order theorem proving
% 0.11/0.63 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.16/0.64
% 0.16/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.64
% 0.16/0.64 % Detected problem language: tptp
% 0.16/0.65 % Proving...
% 2.75/1.51 % SZS status Started for theBenchmark.p
% 2.75/1.51 % SZS status Unsatisfiable for theBenchmark.p
% 2.75/1.51
% 2.75/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.75/1.51
% 2.75/1.51 % ------ iProver source info
% 2.75/1.51
% 2.75/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 2.75/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.75/1.51 % git: non_committed_changes: false
% 2.75/1.51
% 2.75/1.51 % ------ Parsing...% successful
% 2.75/1.51
% 2.75/1.51
% 2.75/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.75/1.51
% 2.75/1.51 % ------ 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.75/1.51
% 2.75/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.75/1.51
% 2.75/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.75/1.51 % ------ Proving...
% 2.75/1.51 % ------ Problem Properties
% 2.75/1.51
% 2.75/1.51 %
% 2.75/1.51 % clauses 12
% 2.75/1.51 % conjectures 1
% 2.75/1.51 % EPR 1
% 2.75/1.51 % Horn 12
% 2.75/1.51 % unary 7
% 2.75/1.51 % binary 4
% 2.75/1.51 % lits 18
% 2.75/1.51 % lits eq 8
% 2.75/1.51 % fd_pure 0
% 2.75/1.51 % fd_pseudo 0
% 2.75/1.51 % fd_cond 0
% 2.75/1.51 % fd_pseudo_cond 0
% 2.75/1.51 % AC symbols 0
% 2.75/1.51
% 2.75/1.51 % ------ Schedule dynamic 5 is on
% 2.75/1.51
% 2.75/1.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.75/1.51
% 2.75/1.51
% 2.75/1.51 % ------
% 2.75/1.51 % Current options:
% 2.75/1.51 % ------
% 2.75/1.51
% 2.75/1.51
% 2.75/1.51 %
% 2.75/1.51
% 2.75/1.51 % ------ Proving...
% 2.75/1.51 %
% 2.75/1.51
% 2.75/1.51 % SZS status Unsatisfiable for theBenchmark.p
% 2.75/1.51
% 2.75/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.75/1.51
% 2.75/1.51
%------------------------------------------------------------------------------