%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN374+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 : Thu Sep 24 03:23:52 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 88 ( 28 ~; 47 |; 7 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 35 ( 18 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2125,conjecture,
( ? [X1] :
! [X2] :
( big_p(X1)
<=> big_p(X2) )
<=> ( ? [X1] : big_p(X1)
<=> ! [X2] : big_p(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2125) ).
fof(c_0_1,negated_conjecture,
~ ( ? [X1] :
! [X2] :
( big_p(X1)
<=> big_p(X2) )
<=> ( ? [X1] : big_p(X1)
<=> ! [X2] : big_p(X2) ) ),
inference(assume_negation,[status(cth)],[x2125]) ).
fof(c_0_2,negated_conjecture,
! [X3,X5,X8,X10,X11,X12] :
( ( big_p(esk4_0)
| ~ big_p(X10)
| big_p(esk6_0)
| ~ big_p(esk5_0) )
& ( big_p(esk4_0)
| ~ big_p(X10)
| big_p(X12)
| ~ big_p(X11) )
& ( big_p(X10)
| ~ big_p(esk4_0)
| big_p(esk6_0)
| ~ big_p(esk5_0) )
& ( big_p(X10)
| ~ big_p(esk4_0)
| big_p(X12)
| ~ big_p(X11) )
& ( big_p(esk1_1(X3))
| big_p(X3)
| big_p(X8)
| big_p(esk3_0) )
& ( big_p(esk1_1(X3))
| big_p(X3)
| ~ big_p(esk2_0)
| ~ big_p(X5) )
& ( ~ big_p(esk1_1(X3))
| ~ big_p(X3)
| big_p(X8)
| big_p(esk3_0) )
& ( ~ big_p(esk1_1(X3))
| ~ big_p(X3)
| ~ big_p(esk2_0)
| ~ big_p(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(esk1_1(X2))
| big_p(X2)
| big_p(X1)
| big_p(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ big_p(X3)
| ~ big_p(X1)
| big_p(esk4_0)
| big_p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_p(X1)
| big_p(esk3_0)
| big_p(esk1_1(X1)) ),
inference(ef,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( ~ big_p(X1)
| big_p(esk4_0)
| big_p(esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_4]),c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_p(esk3_0)
| big_p(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_5]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_p(X2)
| big_p(X1)
| big_p(esk4_0) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( big_p(X1)
| big_p(esk4_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_p(esk4_0)
| ~ big_p(X1)
| big_p(X3)
| big_p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
big_p(esk4_0),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ big_p(X3)
| big_p(X2)
| big_p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_13,negated_conjecture,
( big_p(X2)
| big_p(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_p(esk1_1(X2))
| ~ big_p(X2)
| ~ big_p(esk2_0)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
big_p(X1),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN374+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 10:54:50 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_1 with pid 3121002 completed with status 0
% 0.11/0.44 % Result found by new_bool_1
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 3121004 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 1
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 8
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 8
% 0.11/0.44 % Processed clauses : 18
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 1
% 0.11/0.44 % ...remaining for further processing : 17
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 13
% 0.11/0.44 % Backward-rewritten : 3
% 0.11/0.44 % Generated clauses : 27
% 0.11/0.44 % ...of the previous two non-redundant : 26
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 3
% 0.11/0.44 % Paramodulations : 21
% 0.11/0.44 % Factorizations : 6
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 5
% 0.11/0.44 % ...of those cached : 0
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 1
% 0.11/0.44 % Positive orientable unit clauses : 1
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 0
% 0.11/0.44 % Non-unit-clauses : 0
% 0.11/0.44 % Current number of unprocessed clauses: 12
% 0.11/0.44 % ...number of literals in the above : 44
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 16
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 16
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 16
% 0.11/0.44 % Non-unit clause-clause subsumptions : 15
% 0.11/0.44 % Unit Clause-clause subsumption calls : 2
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 6
% 0.11/0.44 % BW rewrite match successes : 6
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 1063
% 0.11/0.44 % Search garbage collected termcells : 227
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.002 s
% 0.11/0.44 % System time : 0.002 s
% 0.11/0.44 % Total time : 0.005 s
% 0.11/0.44 % Maximum resident set size: 3624 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.002 s
% 0.11/0.44 % System time : 0.008 s
% 0.11/0.44 % Total time : 0.010 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------