%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT016-3 : 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 : n020.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.69s 1.26s
% Output : CNFRefutation 1.69s
% 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/CAT003-0.ax',composition_implies_domain) ).
fof(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
fof(f20,axiom,
there_exists(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_a_exists) ).
fof(f21,negated_conjecture,
~ there_exists(domain(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_a_exists) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_77,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_85,plain,
there_exists(a),
inference(cnf_transformation,[],[f20]) ).
tcf(c_86,negated_conjecture,
~ there_exists(domain(a)),
inference(cnf_transformation,[],[f21]) ).
tcf(c_332,definition,
iPr_def_10 = domain(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_333,negated_conjecture,
~ there_exists(iPr_def_10),
inference(demodulation,[status(thm)],[c_86,c_332]) ).
tcf(c_509,plain,
compose(a,iPr_def_10) = a,
inference(superposition,[status(thm)],[c_332,c_77]) ).
tcf(c_529,plain,
( there_exists(domain(a))
| ~ there_exists(a) ),
inference(superposition,[status(thm)],[c_509,c_73]) ).
tcf(c_530,plain,
( there_exists(iPr_def_10)
| ~ there_exists(a) ),
inference(light_normalisation,[status(thm)],[c_529,c_332]) ).
tcf(c_531,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_530,c_333,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT016-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.35 % Computer : n020.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 25 06:58:18 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.69/1.26 % SZS status Started for theBenchmark.p
% 1.69/1.26 % SZS status Unsatisfiable for theBenchmark.p
% 1.69/1.26
% 1.69/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.69/1.26
% 1.69/1.26 % ------ iProver source info
% 1.69/1.26
% 1.69/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.69/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.69/1.26 % git: non_committed_changes: false
% 1.69/1.26
% 1.69/1.26 % ------ Parsing...% successful
% 1.69/1.26
% 1.69/1.26
% 1.69/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.69/1.26
% 1.69/1.26 % ------ 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.69/1.26
% 1.69/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.69/1.26
% 1.69/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.69/1.26 % ------ Proving...
% 1.69/1.26 % ------ Problem Properties
% 1.69/1.26
% 1.69/1.26 %
% 1.69/1.26 % clauses 15
% 1.69/1.26 % conjectures 1
% 1.69/1.26 % EPR 2
% 1.69/1.26 % Horn 13
% 1.69/1.26 % unary 6
% 1.69/1.26 % binary 6
% 1.69/1.26 % lits 27
% 1.69/1.26 % lits eq 13
% 1.69/1.26 % fd_pure 0
% 1.69/1.26 % fd_pseudo 0
% 1.69/1.26 % fd_cond 0
% 1.69/1.26 % fd_pseudo_cond 2
% 1.69/1.26 % AC symbols 0
% 1.69/1.26
% 1.69/1.26 % ------ Schedule dynamic 5 is on
% 1.69/1.26
% 1.69/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.69/1.26
% 1.69/1.26
% 1.69/1.26 % ------
% 1.69/1.26 % Current options:
% 1.69/1.26 % ------
% 1.69/1.26
% 1.69/1.26
% 1.69/1.26 %
% 1.69/1.26
% 1.69/1.26 % ------ Proving...
% 1.69/1.26 %
% 1.69/1.26
% 1.69/1.26 % SZS status Unsatisfiable for theBenchmark.p
% 1.69/1.26
% 1.69/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.26
% 1.69/1.26
%------------------------------------------------------------------------------