%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN072+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 : n018.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:02 PM UTC 2026
% Result : Theorem 0.26s 0.54s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 43 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 13 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel49,conjecture,
! [X1] : big_p(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49) ).
fof(pel49_1,axiom,
? [X1,X2] :
! [X3] :
( X3 = X2
| X3 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_1) ).
fof(pel49_3,axiom,
big_p(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_3) ).
fof(pel49_4,axiom,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_4) ).
fof(pel49_2,axiom,
big_p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_2) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] : big_p(X1),
inference(assume_negation,[status(cth)],[pel49]) ).
fof(c_0_6,negated_conjecture,
~ big_p(esk3_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X6] :
( X6 = esk2_0
| X6 = esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel49_1])]) ).
cnf(c_0_8,negated_conjecture,
~ big_p(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = esk2_0
| X1 = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_p(esk2_0)
| esk3_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( ~ big_p(X1)
| X1 = esk1_0
| esk3_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
big_p(b),
inference(split_conjunct,[status(thm)],[pel49_3]) ).
cnf(c_0_13,negated_conjecture,
( esk3_0 = esk1_0
| esk1_0 = b ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
a != b,
inference(fof_simplification,[status(thm)],[pel49_4]) ).
cnf(c_0_15,plain,
big_p(a),
inference(split_conjunct,[status(thm)],[pel49_2]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_p(esk1_0)
| esk1_0 = b ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_17,plain,
( X2 = X1
| X2 = esk1_0
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
fof(c_0_18,plain,
a != b,
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( esk3_0 = esk1_0
| esk1_0 = a ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ big_p(X2)
| X1 = X2
| X2 = b
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
a != b,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ big_p(esk1_0)
| esk1_0 = a ),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( X1 = esk1_0
| X1 = a ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ big_p(X1)
| X1 = a ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN072+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.39 % Computer : n018.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8046.5625MB
% 0.15/0.39 % OS : Linux 6.8.0-71-generic
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Mon Sep 21 10:44:29 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1674066 completed with status 0
% 0.26/0.54 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.54 % new_bool_3 with pid 1674072 completed with status 0
% 0.26/0.54 % Result found by new_bool_3
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Preprocessing time : 0.002 s
% 0.26/0.54 % Presaturation interreduction done
% 0.26/0.54
% 0.26/0.54 % Proof found!
% 0.26/0.54 % SZS status Theorem
% 0.26/0.54 % SZS output start CNFRefutation
% See solution above
% 0.26/0.54 % Parsed axioms : 5
% 0.26/0.54 % Removed by relevancy pruning/SinE : 0
% 0.26/0.54 % Initial clauses : 5
% 0.26/0.54 % Removed in clause preprocessing : 0
% 0.26/0.54 % Initial clauses in saturation : 5
% 0.26/0.54 % Processed clauses : 44
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 22
% 0.26/0.54 % ...remaining for further processing : 22
% 0.26/0.54 % Other redundant clauses eliminated : 4
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 1
% 0.26/0.54 % Backward-rewritten : 0
% 0.26/0.54 % Generated clauses : 114
% 0.26/0.54 % ...of the previous two non-redundant : 78
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 0
% 0.26/0.54 % Paramodulations : 76
% 0.26/0.54 % Factorizations : 34
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 4
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 0
% 0.26/0.54 % ...of those cached : 0
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 16
% 0.26/0.54 % Positive orientable unit clauses : 2
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 2
% 0.26/0.54 % Non-unit-clauses : 12
% 0.26/0.54 % Current number of unprocessed clauses: 44
% 0.26/0.54 % ...number of literals in the above : 170
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 6
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 113
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 96
% 0.26/0.54 % Non-unit clause-clause subsumptions : 23
% 0.26/0.54 % Unit Clause-clause subsumption calls : 0
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 0
% 0.26/0.54 % BW rewrite match successes : 0
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 462
% 0.26/0.54 % Search garbage collected termcells : 19
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.007 s
% 0.26/0.54 % System time : 0.004 s
% 0.26/0.54 % Total time : 0.011 s
% 0.26/0.54 % Maximum resident set size: 3576 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.025 s
% 0.26/0.54 % System time : 0.017 s
% 0.26/0.54 % Total time : 0.042 s
% 0.26/0.54 % Maximum resident set size: 4864 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------