%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN962+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 : n010.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.15s 21.32s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 14 ~; 5 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 19 ( 0 sgn 15 !; 4 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] : p(X0)
=> ( ! [X1] : p(X1)
& ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] : p(X0)
=> ( ! [X1] : p(X1)
& ! [X0] : p(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0] : p(X0)
=> ( ! [X2] : p(X2)
& ! [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] : p(X0)
& ( ? [X2] : ~ p(X2)
| ? [X1] : ~ p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X2] : p(X2)
& ( ? [X1] : ~ p(X1)
| ? [X0] : ~ p(X0) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ! [X2] : p(X2)
& ( ~ p(sK1)
| ~ p(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f5]) ).
fof(f7,plain,
! [X2] : p(X2),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,negated_conjecture,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] : p(X0),
inference(cnf_transformation,[],[f7]) ).
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.03 % Problem : SYN962+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/20.40 % Computer : n010.cluster.edu
% 0.10/20.40 % Model : x86_64 x86_64
% 0.10/20.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/20.40 % Memory : 8046.5625MB
% 0.10/20.40 % OS : Linux 6.8.0-71-generic
% 0.10/20.40 % CPULimit : 300
% 0.10/20.40 % WCLimit : 300
% 0.10/20.40 % DateTime : Fri Sep 25 02:40:21 UTC 2026
% 0.10/20.40 % CPUTime :
% 0.10/20.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/20.44 Running first-order theorem proving
% 0.10/20.44 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.10/20.45
% 0.10/20.45 % ======== iProver multi-core TPTP/SMT =========
% 0.10/20.45
% 0.10/20.45 % Detected problem language: tptp
% 0.10/20.47 % Proving...
% 1.15/21.32 % SZS status Started for theBenchmark.p
% 1.15/21.32 % SZS status Theorem for theBenchmark.p
% 1.15/21.32
% 1.15/21.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.15/21.32
% 1.15/21.32 % ------ iProver source info
% 1.15/21.32
% 1.15/21.32 % git: date: 2026-07-19 20:42:38 +0200
% 1.15/21.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.15/21.32 % git: non_committed_changes: false
% 1.15/21.32
% 1.15/21.32 % ------ Parsing...
% 1.15/21.32 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.15/21.32 %
% 1.15/21.32
% 1.15/21.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 1.15/21.32
% 1.15/21.32 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.15/21.32 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.15/21.32 % ------ Proving...
% 1.15/21.32 % ------ Problem Properties
% 1.15/21.32
% 1.15/21.32 %
% 1.15/21.32 % clauses 2
% 1.15/21.32 % conjectures 2
% 1.15/21.32 % EPR 2
% 1.15/21.32 % Horn 2
% 1.15/21.32 % unary 2
% 1.15/21.32 % binary 0
% 1.15/21.32 % lits 2
% 1.15/21.32 % lits eq 0
% 1.15/21.32 % fd_pure 0
% 1.15/21.32 % fd_pseudo 0
% 1.15/21.32 % fd_cond 0
% 1.15/21.32 % fd_pseudo_cond 0
% 1.15/21.32 % AC symbols 0
% 1.15/21.32
% 1.15/21.32 % ------ Schedule EPR Horn non eq is on
% 1.15/21.32
% 1.15/21.32 % ------ no equalities: superposition off
% 1.15/21.32
% 1.15/21.32 % ------ Option_epr_horn Time Limit: Unbounded
% 1.15/21.32
% 1.15/21.32
% 1.15/21.32 % ------
% 1.15/21.32 % Current options:
% 1.15/21.32 % ------
% 1.15/21.32
% 1.15/21.32
% 1.15/21.32 %
% 1.15/21.32
% 1.15/21.32 % ------ Proving...
% 1.15/21.32 %
% 1.15/21.32
% 1.15/21.32 % SZS status Theorem for theBenchmark.p
% 1.15/21.32
% 1.15/21.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/21.32
% 1.15/21.32
%------------------------------------------------------------------------------