%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT016-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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 0.43s 6.29s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 10 unt; 1 def)
% Number of atoms : 22 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 4 |; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).
fof(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',compose_domain) ).
fof(f12,axiom,
there_exists(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_a_exists) ).
fof(f13,negated_conjecture,
~ there_exists(domain(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_a_exists) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_71,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_73,plain,
there_exists(a),
inference(cnf_transformation,[],[f12]) ).
tcf(c_74,negated_conjecture,
~ there_exists(domain(a)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_226,definition,
iPr_def_10 = domain(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_227,negated_conjecture,
~ there_exists(iPr_def_10),
inference(demodulation,[status(thm)],[c_74,c_226]) ).
tcf(c_363,plain,
compose(a,iPr_def_10) = a,
inference(superposition,[status(thm)],[c_226,c_71]) ).
tcf(c_383,plain,
( there_exists(domain(a))
| ~ there_exists(a) ),
inference(superposition,[status(thm)],[c_363,c_67]) ).
tcf(c_384,plain,
( there_exists(iPr_def_10)
| ~ there_exists(a) ),
inference(light_normalisation,[status(thm)],[c_383,c_226]) ).
tcf(c_385,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_384,c_227,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT016-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.39 % Computer : n011.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Fri Sep 25 06:57:19 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 0.43/6.29 % SZS status Started for theBenchmark.p
% 0.43/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/6.29
% 0.43/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.43/6.29
% 0.43/6.29 % ------ iProver source info
% 0.43/6.29
% 0.43/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.43/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.43/6.29 % git: non_committed_changes: false
% 0.43/6.29
% 0.43/6.29 % ------ Parsing...% successful
% 0.43/6.29
% 0.43/6.29
% 0.43/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.43/6.29
% 0.43/6.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.43/6.29
% 0.43/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.43/6.29
% 0.43/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/6.29 % ------ Proving...
% 0.43/6.29 % ------ Problem Properties
% 0.43/6.29
% 0.43/6.29 %
% 0.43/6.29 % clauses 11
% 0.43/6.29 % conjectures 1
% 0.43/6.29 % EPR 2
% 0.43/6.29 % Horn 11
% 0.43/6.29 % unary 6
% 0.43/6.29 % binary 4
% 0.43/6.29 % lits 17
% 0.43/6.29 % lits eq 6
% 0.43/6.29 % fd_pure 0
% 0.43/6.29 % fd_pseudo 0
% 0.43/6.29 % fd_cond 0
% 0.43/6.29 % fd_pseudo_cond 0
% 0.43/6.29 % AC symbols 0
% 0.43/6.29
% 0.43/6.29 % ------ Schedule dynamic 5 is on
% 0.43/6.29
% 0.43/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/6.29
% 0.43/6.29
% 0.43/6.29 % ------
% 0.43/6.29 % Current options:
% 0.43/6.29 % ------
% 0.43/6.29
% 0.43/6.29
% 0.43/6.29 %
% 0.43/6.29
% 0.43/6.29 % ------ Proving...
% 0.43/6.29 %
% 0.43/6.29
% 0.43/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.43/6.29
% 0.43/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/6.29
% 0.43/6.29
%------------------------------------------------------------------------------