%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT011-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 : n017.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 0.85s 1.15s
% Output : CNFRefutation 0.85s
% 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/CAT003-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/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(f11,axiom,
! [X0] : compose(codomain(X0),X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_codomain) ).
fof(f20,axiom,
there_exists(domain(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_domain_exists) ).
fof(f21,negated_conjecture,
domain(domain(a)) != domain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_is_idempotent) ).
fof(f22,plain,
domain(a) != domain(domain(a)),
inference(reorient_equations,[],[f21]) ).
tcf(c_71,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = codomain(X1) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_77,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_78,plain,
! [X0: $i] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_85,plain,
there_exists(domain(a)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,negated_conjecture,
domain(domain(a)) != domain(a),
inference(cnf_transformation,[],[f22]) ).
tcf(c_335,definition,
iPr_def_10 = domain(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_336,definition,
iPr_def_11 = domain(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_337,negated_conjecture,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_86,c_335,c_336]) ).
tcf(c_510,plain,
there_exists(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_85,c_335]) ).
tcf(c_513,plain,
( there_exists(a)
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_335,c_71]) ).
tcf(c_515,plain,
there_exists(a),
inference(forward_subsumption_resolution,[status(thm)],[c_513,c_510]) ).
tcf(c_520,plain,
compose(a,iPr_def_10) = a,
inference(superposition,[status(thm)],[c_335,c_77]) ).
tcf(c_587,plain,
( ( domain(a) = codomain(iPr_def_10) )
| ~ there_exists(a) ),
inference(superposition,[status(thm)],[c_520,c_74]) ).
tcf(c_591,plain,
( ( codomain(iPr_def_10) = iPr_def_10 )
| ~ there_exists(a) ),
inference(light_normalisation,[status(thm)],[c_587,c_335]) ).
tcf(c_592,plain,
codomain(iPr_def_10) = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_591,c_515]) ).
tcf(c_610,plain,
compose(iPr_def_10,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_592,c_78]) ).
tcf(c_710,plain,
( ( domain(iPr_def_10) = codomain(iPr_def_10) )
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_610,c_74]) ).
tcf(c_713,plain,
( ( iPr_def_10 = iPr_def_11 )
| ~ there_exists(iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_710,c_336,c_592]) ).
tcf(c_714,plain,
iPr_def_10 = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_713,c_510]) ).
tcf(c_721,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_337,c_714]) ).
tcf(c_722,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_721]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CAT011-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/0.44 % Computer : n017.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Fri Sep 25 06:50:18 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.23/0.48 Running first-order theorem proving
% 0.23/0.48 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.23/0.50
% 0.23/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.50
% 0.23/0.50 % Detected problem language: tptp
% 0.23/0.51 % Proving...
% 0.85/1.15 % SZS status Started for theBenchmark.p
% 0.85/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.85/1.15
% 0.85/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.85/1.15
% 0.85/1.15 % ------ iProver source info
% 0.85/1.15
% 0.85/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 0.85/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.85/1.15 % git: non_committed_changes: false
% 0.85/1.15
% 0.85/1.15 % ------ Parsing...% successful
% 0.85/1.15
% 0.85/1.15
% 0.85/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.85/1.15
% 0.85/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 %
% 0.85/1.15
% 0.85/1.15 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.85/1.15
% 0.85/1.15 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.85/1.15 % ------ Proving...
% 0.85/1.15 % ------ Problem Properties
% 0.85/1.15
% 0.85/1.15 %
% 0.85/1.15 % clauses 16
% 0.85/1.15 % conjectures 1
% 0.85/1.15 % EPR 1
% 0.85/1.15 % Horn 14
% 0.85/1.15 % unary 7
% 0.85/1.15 % binary 6
% 0.85/1.15 % lits 28
% 0.85/1.15 % lits eq 15
% 0.85/1.15 % fd_pure 0
% 0.85/1.15 % fd_pseudo 0
% 0.85/1.15 % fd_cond 0
% 0.85/1.15 % fd_pseudo_cond 2
% 0.85/1.15 % AC symbols 0
% 0.85/1.15
% 0.85/1.15 % ------ Schedule dynamic 5 is on
% 0.85/1.15
% 0.85/1.15 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.85/1.15
% 0.85/1.15
% 0.85/1.15 % ------
% 0.85/1.15 % Current options:
% 0.85/1.15 % ------
% 0.85/1.15
% 0.85/1.15
% 0.85/1.15 %
% 0.85/1.15
% 0.85/1.15 % ------ Proving...
% 0.85/1.15 %
% 0.85/1.15
% 0.85/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.85/1.15
% 0.85/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.85/1.15
% 0.85/1.15
%------------------------------------------------------------------------------