%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN961+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n003.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 03:45:31 PM UTC 2026
% Result : Theorem 1.10s 6.27s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 4 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn 11 !; 2 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( ! [X2] : p(X2)
=> ( p(X1)
& p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] : p(X2)
=> ( p(X1)
& p(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X2] : p(X2)
& ( ~ p(X1)
| ~ p(X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X2] : p(X2)
& ( ~ p(sK1)
| ~ p(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).
fof(f5,plain,
! [X2] : p(X2),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_49,negated_conjecture,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] : p(X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_51,plain,
p(sK0),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_52,negated_conjecture,
~ p(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_51,c_49]) ).
tcf(c_54,negated_conjecture,
~ p(sK1),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] : p(X0),
inference(demodulation,[status(thm)],[c_50]) ).
tcf(c_56,plain,
$false,
inference(resolution,[status(thm)],[c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN961+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.36 % Computer : n003.cluster.edu
% 0.10/5.36 % Model : x86_64 x86_64
% 0.10/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36 % Memory : 8046.5625MB
% 0.10/5.36 % OS : Linux 6.8.0-71-generic
% 0.10/5.36 % CPULimit : 300
% 0.10/5.36 % WCLimit : 300
% 0.10/5.36 % DateTime : Fri Sep 25 02:41:42 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.40 Running first-order theorem proving
% 0.13/5.40 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.13/5.42
% 0.13/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.42
% 0.13/5.42 % Detected problem language: tptp
% 0.13/5.43 % Proving...
% 1.10/6.27 % SZS status Started for theBenchmark.p
% 1.10/6.27 % SZS status Theorem for theBenchmark.p
% 1.10/6.27
% 1.10/6.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.10/6.27
% 1.10/6.27 % ------ iProver source info
% 1.10/6.27
% 1.10/6.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.10/6.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.10/6.27 % git: non_committed_changes: false
% 1.10/6.27
% 1.10/6.27 % ------ Parsing...
% 1.10/6.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.10/6.27 %
% 1.10/6.27
% 1.10/6.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 1.10/6.27
% 1.10/6.27 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.10/6.27 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.10/6.27 % ------ Proving...
% 1.10/6.27 % ------ Problem Properties
% 1.10/6.27
% 1.10/6.27 %
% 1.10/6.27 % clauses 2
% 1.10/6.27 % conjectures 2
% 1.10/6.27 % EPR 2
% 1.10/6.27 % Horn 2
% 1.10/6.27 % unary 2
% 1.10/6.27 % binary 0
% 1.10/6.27 % lits 2
% 1.10/6.27 % lits eq 0
% 1.10/6.27 % fd_pure 0
% 1.10/6.27 % fd_pseudo 0
% 1.10/6.27 % fd_cond 0
% 1.10/6.27 % fd_pseudo_cond 0
% 1.10/6.27 % AC symbols 0
% 1.10/6.27
% 1.10/6.27 % ------ Schedule EPR Horn non eq is on
% 1.10/6.27
% 1.10/6.27 % ------ no equalities: superposition off
% 1.10/6.27
% 1.10/6.27 % ------ Option_epr_horn Time Limit: Unbounded
% 1.10/6.27
% 1.10/6.27
% 1.10/6.27 % ------
% 1.10/6.27 % Current options:
% 1.10/6.27 % ------
% 1.10/6.27
% 1.10/6.27
% 1.10/6.27 %
% 1.10/6.27
% 1.10/6.27 % ------ Proving...
% 1.10/6.27 %
% 1.10/6.27
% 1.10/6.27 % SZS status Theorem for theBenchmark.p
% 1.10/6.27
% 1.10/6.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.10/6.27
% 1.10/6.27
%------------------------------------------------------------------------------