%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN376+1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n014.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:39:54 PM UTC 2026
% Result : Theorem 1.46s 1.27s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 25 ~; 15 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 21 !; 15 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X0] : ~ big_p(X0)
| ! [X0] : big_p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2127) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X0] : ~ big_p(X0)
| ! [X0] : big_p(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X3] : ~ big_p(X3)
| ! [X2] : big_p(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
& ? [X3] : big_p(X3)
& ? [X2] : ~ big_p(X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
& ? [X3] : big_p(X3)
& ? [X2] : ~ big_p(X2) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
! [X1] :
( ( ~ big_p(X1)
| big_p(X0) )
& ( ~ big_p(X0)
| big_p(X1) ) )
& ? [X3] : big_p(X3)
& ? [X2] : ~ big_p(X2) ),
inference(nnf_transformation,[],[f5]) ).
fof(f7,plain,
( ? [X2] :
! [X3] :
( ( ~ big_p(X3)
| big_p(X2) )
& ( ~ big_p(X2)
| big_p(X3) ) )
& ? [X1] : big_p(X1)
& ? [X0] : ~ big_p(X0) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ! [X3] :
( ( ~ big_p(X3)
| big_p(sK2) )
& ( ~ big_p(sK2)
| big_p(X3) ) )
& big_p(sK1)
& ~ big_p(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f7]) ).
fof(f9,plain,
! [X3] :
( ~ big_p(X3)
| big_p(sK2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X3] :
( ~ big_p(sK2)
| big_p(X3) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
big_p(sK1),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
~ big_p(sK0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,negated_conjecture,
~ big_p(sK0),
inference(cnf_transformation,[],[f12]) ).
tcf(c_50,negated_conjecture,
big_p(sK1),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( big_p(X0)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( big_p(sK2)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] :
( big_p(sK2)
| ~ big_p(X0) ),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_66,negated_conjecture,
! [X0: $i] :
( big_p(X0)
| ~ big_p(sK2) ),
inference(demodulation,[status(thm)],[c_51]) ).
tcf(c_67,negated_conjecture,
big_p(sK1),
inference(demodulation,[status(thm)],[c_50]) ).
tcf(c_68,negated_conjecture,
~ big_p(sK0),
inference(demodulation,[status(thm)],[c_49]) ).
tcf(c_69,plain,
big_p(sK2),
inference(resolution,[status(thm)],[c_65,c_67]) ).
tcf(c_70,negated_conjecture,
! [X0: $i] : big_p(X0),
inference(global_subsumption_just,[status(thm)],[c_66,c_51,c_69]) ).
tcf(c_72,plain,
$false,
inference(resolution,[status(thm)],[c_70,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN376+1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 01:01:32 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.46/1.27 % SZS status Started for theBenchmark.p
% 1.46/1.27 % SZS status Theorem for theBenchmark.p
% 1.46/1.27
% 1.46/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.46/1.27
% 1.46/1.27 % ------ iProver source info
% 1.46/1.27
% 1.46/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.46/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.46/1.27 % git: non_committed_changes: false
% 1.46/1.27
% 1.46/1.27 % ------ Parsing...
% 1.46/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.46/1.27 %
% 1.46/1.27
% 1.46/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 1.46/1.27
% 1.46/1.27 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.46/1.27 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.46/1.27 % ------ Proving...
% 1.46/1.27 % ------ Problem Properties
% 1.46/1.27
% 1.46/1.27 %
% 1.46/1.27 % clauses 4
% 1.46/1.27 % conjectures 4
% 1.46/1.27 % EPR 4
% 1.46/1.27 % Horn 4
% 1.46/1.27 % unary 2
% 1.46/1.27 % binary 2
% 1.46/1.27 % lits 6
% 1.46/1.27 % lits eq 0
% 1.46/1.27 % fd_pure 0
% 1.46/1.27 % fd_pseudo 0
% 1.46/1.27 % fd_cond 0
% 1.46/1.27 % fd_pseudo_cond 0
% 1.46/1.27 % AC symbols 0
% 1.46/1.27
% 1.46/1.27 % ------ Schedule EPR Horn non eq is on
% 1.46/1.27
% 1.46/1.27 % ------ no equalities: superposition off
% 1.46/1.27
% 1.46/1.27 % ------ Option_epr_horn Time Limit: Unbounded
% 1.46/1.27
% 1.46/1.27
% 1.46/1.27 % ------
% 1.46/1.27 % Current options:
% 1.46/1.27 % ------
% 1.46/1.27
% 1.46/1.27
% 1.46/1.27 %
% 1.46/1.27
% 1.46/1.27 % ------ Proving...
% 1.46/1.27 %
% 1.46/1.27
% 1.46/1.27 % SZS status Theorem for theBenchmark.p
% 1.46/1.27
% 1.46/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.46/1.27
% 1.46/1.27
%------------------------------------------------------------------------------