%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 01:28:38 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 25 ~; 24 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 39 ( 2 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(transitive_less,axiom,
! [X1,X2,X3] :
( ( less(X2,X3)
& less(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_less) ).
fof(serial_less,axiom,
! [X1] :
? [X2] : less(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',serial_less) ).
fof(left_to_right,axiom,
! [X1,X2] :
( ( p(X2)
& less(X1,X2)
& p(X1) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_to_right) ).
fof(right_to_left,axiom,
! [X1] :
( ? [X2] :
( p(X2)
& less(X1,X2) )
| p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_to_left) ).
fof(c_0_5,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[goal_to_be_proved]) ).
fof(c_0_6,plain,
! [X8,X9,X10] :
( less(X8,X10)
| ~ less(X9,X10)
| ~ less(X8,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive_less])])]) ).
fof(c_0_7,plain,
! [X11] : less(X11,esk2_1(X11)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[serial_less])]) ).
fof(c_0_8,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ less(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
less(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X4,X5] :
( goal
| ~ p(X5)
| ~ less(X4,X5)
| ~ p(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[left_to_right])])]) ).
fof(c_0_12,negated_conjecture,
~ goal,
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X6] :
( ( p(X6)
| p(esk1_1(X6)) )
& ( p(X6)
| less(X6,esk1_1(X6)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[right_to_left])])]) ).
cnf(c_0_14,plain,
( ~ less(X1,X2)
| less(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ p(X2)
| ~ less(X1,X2)
| ~ p(X1)
| goal ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( p(X1)
| less(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ less(X3,X2)
| ~ less(X1,X3)
| less(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_19,plain,
( ~ p(X1)
| ~ p(X2)
| ~ less(X1,X2) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ less(X1,X2)
| p(X2)
| less(X1,esk1_1(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_21,plain,
( p(X1)
| p(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( ~ less(esk2_1(X1),X2)
| less(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_23,plain,
( ~ p(X1)
| ~ less(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_19]) ).
cnf(c_0_24,plain,
less(X1,esk2_1(esk2_1(esk2_1(X1)))),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_25,plain,
~ p(X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_25]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:26:52 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % new_bool_3 with pid 3864472 completed with status 0
% 0.13/0.43 % Result found by new_bool_3
% 0.13/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 3864479 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 5
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 6
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 6
% 0.13/0.43 % Processed clauses : 21
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 0
% 0.13/0.43 % ...remaining for further processing : 21
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 6
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 48
% 0.13/0.43 % ...of the previous two non-redundant : 43
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 2
% 0.13/0.43 % Paramodulations : 45
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 0
% 0.13/0.43 % ...of those cached : 0
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 12
% 0.13/0.43 % Positive orientable unit clauses : 3
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 2
% 0.13/0.43 % Non-unit-clauses : 7
% 0.13/0.43 % Current number of unprocessed clauses: 28
% 0.13/0.43 % ...number of literals in the above : 70
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 9
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 43
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 24
% 0.13/0.43 % Non-unit clause-clause subsumptions : 4
% 0.13/0.43 % Unit Clause-clause subsumption calls : 4
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 1
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 903
% 0.13/0.43 % Search garbage collected termcells : 63
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.006 s
% 0.13/0.43 % System time : 0.000 s
% 0.13/0.43 % Total time : 0.006 s
% 0.13/0.43 % Maximum resident set size: 3628 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.008 s
% 0.13/0.43 % System time : 0.004 s
% 0.13/0.43 % Total time : 0.012 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------