%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT017-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 : 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:11 PM UTC 2026
% Result : Unsatisfiable 1.67s 1.27s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 15 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 7 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
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(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_a_exists) ).
fof(f21,negated_conjecture,
~ there_exists(codomain(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_exists) ).
tcf(c_77,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( there_exists(codomain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_85,plain,
there_exists(a),
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,negated_conjecture,
~ there_exists(codomain(a)),
inference(cnf_transformation,[],[f21]) ).
tcf(c_546,plain,
! [X0: $i] :
( there_exists(codomain(X0))
| ~ there_exists(X0) ),
inference(superposition,[status(thm)],[c_77,c_81]) ).
tcf(c_556,plain,
( there_exists(codomain(a))
| ~ there_exists(a) ),
inference(instantiation,[status(thm)],[c_546]) ).
tcf(c_557,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_556,c_86,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT017-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.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 06:57:14 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.67/1.27 % SZS status Started for theBenchmark.p
% 1.67/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.67/1.27
% 1.67/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.67/1.27
% 1.67/1.27 % ------ iProver source info
% 1.67/1.27
% 1.67/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.67/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.67/1.27 % git: non_committed_changes: false
% 1.67/1.27
% 1.67/1.27 % ------ Parsing...% successful
% 1.67/1.27
% 1.67/1.27
% 1.67/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.67/1.27
% 1.67/1.27 % ------ 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.67/1.27
% 1.67/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.67/1.27
% 1.67/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.67/1.27 % ------ Proving...
% 1.67/1.27 % ------ Problem Properties
% 1.67/1.27
% 1.67/1.27 %
% 1.67/1.27 % clauses 15
% 1.67/1.27 % conjectures 1
% 1.67/1.27 % EPR 2
% 1.67/1.27 % Horn 13
% 1.67/1.27 % unary 6
% 1.67/1.27 % binary 6
% 1.67/1.27 % lits 27
% 1.67/1.27 % lits eq 13
% 1.67/1.27 % fd_pure 0
% 1.67/1.27 % fd_pseudo 0
% 1.67/1.27 % fd_cond 0
% 1.67/1.27 % fd_pseudo_cond 2
% 1.67/1.27 % AC symbols 0
% 1.67/1.27
% 1.67/1.27 % ------ Schedule dynamic 5 is on
% 1.67/1.27
% 1.67/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.67/1.27
% 1.67/1.27
% 1.67/1.27 % ------
% 1.67/1.27 % Current options:
% 1.67/1.27 % ------
% 1.67/1.27
% 1.67/1.27
% 1.67/1.27 %
% 1.67/1.27
% 1.67/1.27 % ------ Proving...
% 1.67/1.27 %
% 1.67/1.27
% 1.67/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.67/1.27
% 1.67/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/1.27
% 1.67/1.27
%------------------------------------------------------------------------------