%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN381+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 : n012.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:54 PM UTC 2026
% Result : Theorem 0.03s 5.35s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 29 ( 7 ~; 9 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 26 ( 2 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2133,conjecture,
( ( ! [X5,X6] :
( big_q(X5,X6)
=> ( big_q(X6,X6)
| big_q(X6,X5) ) )
& ! [X3] :
? [X4] : big_q(X4,X3)
& ! [X1] :
( ? [X2] : big_q(X1,X2)
=> big_p(X1) ) )
=> ! [X6] : big_p(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2133) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X5,X6] :
( big_q(X5,X6)
=> ( big_q(X6,X6)
| big_q(X6,X5) ) )
& ! [X3] :
? [X4] : big_q(X4,X3)
& ! [X1] :
( ? [X2] : big_q(X1,X2)
=> big_p(X1) ) )
=> ! [X6] : big_p(X6) ),
inference(assume_negation,[status(cth)],[x2133]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X9,X11,X12] :
( ~ big_p(esk2_0)
& ( big_q(X12,X12)
| big_q(X12,X11)
| ~ big_q(X11,X12) )
& big_q(esk1_1(X9),X9)
& ( big_p(X7)
| ~ big_q(X7,X8) ) ),
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_q(X1,X2)
| big_q(X2,X2)
| big_q(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_q(esk1_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_q(X1,X2)
| big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_q(X1,X1)
| big_q(X1,esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ big_p(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
big_p(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN381+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/5.31 % Computer : n012.cluster.edu
% 0.03/5.31 % Model : x86_64 x86_64
% 0.03/5.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/5.31 % Memory : 8046.5625MB
% 0.03/5.31 % OS : Linux 6.8.0-71-generic
% 0.03/5.32 % CPULimit : 300
% 0.03/5.32 % WCLimit : 300
% 0.03/5.32 % DateTime : Mon Sep 21 10:52:00 UTC 2026
% 0.03/5.32 % CPUTime :
% 0.03/5.32 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/5.34 Running first-order theorem proving
% 0.03/5.34 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.03/5.35 % Version: 3.5.1
% 0.03/5.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.03/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/5.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.03/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.03/5.35 % Starting new_bool_1 with 300s (1) cores
% 0.03/5.35 % Starting sh5l with 300s (1) cores
% 0.03/5.35 % new_bool_3 with pid 2208578 completed with status 0
% 0.03/5.35 % Result found by new_bool_3
% 0.03/5.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.03/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/5.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.03/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.03/5.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/5.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/5.35 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.03/5.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/5.35 % Starting SubtermCWHack with 31s (1) cores
% 0.03/5.35 % SubtermCWHack with pid 2208583 completed with status 0
% 0.03/5.35 % Result found by SubtermCWHack
% 0.03/5.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.03/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/5.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.03/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.03/5.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/5.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/5.35 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.03/5.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/5.35 % Starting SubtermCWHack with 31s (1) cores
% 0.03/5.35 % Preprocessing time : 0.001 s
% 0.03/5.35
% 0.03/5.35 % Proof found!
% 0.03/5.35 % SZS status Theorem
% 0.03/5.35 % SZS output start CNFRefutation
% See solution above
% 0.03/5.35 % Parsed axioms : 1
% 0.03/5.35 % Removed by relevancy pruning/SinE : 0
% 0.03/5.35 % Initial clauses : 4
% 0.03/5.35 % Removed in clause preprocessing : 0
% 0.03/5.35 % Initial clauses in saturation : 4
% 0.03/5.35 % Processed clauses : 7
% 0.03/5.35 % ...of these trivial : 0
% 0.03/5.35 % ...subsumed : 0
% 0.03/5.35 % ...remaining for further processing : 7
% 0.03/5.35 % Other redundant clauses eliminated : 0
% 0.03/5.35 % Clauses deleted for lack of memory : 0
% 0.03/5.35 % Backward-subsumed : 0
% 0.03/5.35 % Backward-rewritten : 3
% 0.03/5.35 % Generated clauses : 4
% 0.03/5.35 % ...of the previous two non-redundant : 3
% 0.03/5.35 % ...aggressively subsumed : 0
% 0.03/5.35 % Contextual simplify-reflections : 1
% 0.03/5.35 % Paramodulations : 4
% 0.03/5.35 % Factorizations : 0
% 0.03/5.35 % NegExts : 0
% 0.03/5.35 % Equation resolutions : 0
% 0.03/5.35 % Disequality decompositions : 0
% 0.03/5.35 % Total rewrite steps : 4
% 0.03/5.35 % ...of those cached : 0
% 0.03/5.35 % Propositional unsat checks : 0
% 0.03/5.35 % Propositional check models : 0
% 0.03/5.35 % Propositional check unsatisfiable : 0
% 0.03/5.35 % Propositional clauses : 0
% 0.03/5.35 % Propositional clauses after purity: 0
% 0.03/5.35 % Propositional unsat core size : 0
% 0.03/5.35 % Propositional preprocessing time : 0.000
% 0.03/5.35 % Propositional encoding time : 0.000
% 0.03/5.35 % Propositional solver time : 0.000
% 0.03/5.35 % Success case prop preproc time : 0.000
% 0.03/5.35 % Success case prop encoding time : 0.000
% 0.03/5.35 % Success case prop solver time : 0.000
% 0.03/5.35 % Current number of processed clauses : 4
% 0.03/5.35 % Positive orientable unit clauses : 2
% 0.03/5.35 % Positive unorientable unit clauses: 0
% 0.03/5.35 % Negative unit clauses : 0
% 0.03/5.35 % Non-unit-clauses : 2
% 0.03/5.35 % Current number of unprocessed clauses: 0
% 0.03/5.35 % ...number of literals in the above : 0
% 0.03/5.35 % Current number of archived formulas : 0
% 0.03/5.35 % Current number of archived clauses : 3
% 0.03/5.35 % Clause-clause subsumption calls (NU) : 1
% 0.03/5.35 % Rec. Clause-clause subsumption calls : 1
% 0.03/5.35 % Non-unit clause-clause subsumptions : 1
% 0.03/5.35 % Unit Clause-clause subsumption calls : 0
% 0.03/5.35 % Rewrite failures with RHS unbound : 0
% 0.03/5.35 % BW rewrite match attempts : 3
% 0.03/5.35 % BW rewrite match successes : 3
% 0.03/5.35 % Condensation attempts : 0
% 0.03/5.35 % Condensation successes : 0
% 0.03/5.35 % Termbank termtop insertions : 378
% 0.03/5.35 % Search garbage collected termcells : 129
% 0.03/5.35
% 0.03/5.35 % -------------------------------------------------
% 0.03/5.35 % User time : 0.001 s
% 0.03/5.35 % System time : 0.001 s
% 0.03/5.35 % Total time : 0.003 s
% 0.03/5.35 % Maximum resident set size: 3576 pages
% 0.03/5.35
% 0.03/5.35 % -------------------------------------------------
% 0.03/5.35 % User time : 0.003 s
% 0.03/5.35 % System time : 0.004 s
% 0.03/5.35 % Total time : 0.006 s
% 0.03/5.35 % Maximum resident set size: 4864 pages
% 0.03/5.35 % E exiting
%------------------------------------------------------------------------------