%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM343+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:51:40 PM UTC 2026
% Result : Theorem 0.42s 0.66s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 27 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 5 |; 8 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 13 ( 1 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( X2 != X1
& ~ less(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(sum_something_n0_samething,conjecture,
? [X1] :
( ( less(X1,n1)
& less(nn1,X1) )
=> sum(n21,X1,n21) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_something_n0_samething) ).
fof(c_0_2,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( X2 != X1
& ~ less(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_3,plain,
! [X90,X91] :
( ( less(X90,X91)
| X91 = X90
| less(X91,X90) )
& ( ~ less(X90,X91)
| X91 != X90 )
& ( ~ less(X90,X91)
| ~ less(X91,X90) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( ( less(X1,n1)
& less(nn1,X1) )
=> sum(n21,X1,n21) ),
inference(assume_negation,[status(cth)],[sum_something_n0_samething]) ).
cnf(c_0_5,plain,
( ~ less(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
! [X33] :
( ~ sum(n21,X33,n21)
& less(X33,n1)
& less(nn1,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
less(nn1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM343+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n026.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Mon Sep 21 02:25:36 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.57 Running first-order theorem proving
% 0.23/0.57 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.42/0.66 % Version: 3.5.1
% 0.42/0.66 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.42/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.66 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.42/0.66 % Starting new_bool_3 with 600s (2) cores
% 0.42/0.66 % Starting new_bool_1 with 600s (2) cores
% 0.42/0.66 % Starting sh5l with 300s (1) cores
% 0.42/0.66 % sh5l with pid 1162050 completed with status 0
% 0.42/0.66 % Result found by sh5l
% 0.42/0.66 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.42/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.66 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.42/0.66 % Starting new_bool_3 with 600s (2) cores
% 0.42/0.66 % Starting new_bool_1 with 600s (2) cores
% 0.42/0.66 % Starting sh5l with 300s (1) cores
% 0.42/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.42/0.66 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.42/0.66 % Search class: FGHSS-FFLM21-MFFFFFNN
% 0.42/0.66 % partial match(1): FGHSS-FFMM21-MFFFFFNN
% 0.42/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.42/0.66 % SubtermCWHack with pid 1162051 completed with status 0
% 0.42/0.66 % Result found by SubtermCWHack
% 0.42/0.66 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.42/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.66 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.42/0.66 % Starting new_bool_3 with 600s (2) cores
% 0.42/0.66 % Starting new_bool_1 with 600s (2) cores
% 0.42/0.66 % Starting sh5l with 300s (1) cores
% 0.42/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.42/0.66 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.42/0.66 % Search class: FGHSS-FFLM21-MFFFFFNN
% 0.42/0.66 % partial match(1): FGHSS-FFMM21-MFFFFFNN
% 0.42/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.42/0.66 % Preprocessing time : 0.005 s
% 0.42/0.66
% 0.42/0.66 % Proof found!
% 0.42/0.66 % SZS status Theorem
% 0.42/0.66 % SZS output start CNFRefutation
% See solution above
% 0.42/0.66 % Parsed axioms : 402
% 0.42/0.66 % Removed by relevancy pruning/SinE : 245
% 0.42/0.66 % Initial clauses : 163
% 0.42/0.66 % Removed in clause preprocessing : 0
% 0.42/0.66 % Initial clauses in saturation : 163
% 0.42/0.66 % Processed clauses : 36
% 0.42/0.66 % ...of these trivial : 0
% 0.42/0.66 % ...subsumed : 0
% 0.42/0.66 % ...remaining for further processing : 36
% 0.42/0.66 % Other redundant clauses eliminated : 2
% 0.42/0.66 % Clauses deleted for lack of memory : 0
% 0.42/0.66 % Backward-subsumed : 0
% 0.42/0.66 % Backward-rewritten : 0
% 0.42/0.66 % Generated clauses : 4
% 0.42/0.66 % ...of the previous two non-redundant : 2
% 0.42/0.66 % ...aggressively subsumed : 0
% 0.42/0.66 % Contextual simplify-reflections : 0
% 0.42/0.66 % Paramodulations : 2
% 0.42/0.66 % Factorizations : 0
% 0.42/0.66 % NegExts : 0
% 0.42/0.66 % Equation resolutions : 2
% 0.42/0.66 % Disequality decompositions : 0
% 0.42/0.66 % Total rewrite steps : 0
% 0.42/0.66 % ...of those cached : 0
% 0.42/0.66 % Propositional unsat checks : 0
% 0.42/0.66 % Propositional check models : 0
% 0.42/0.66 % Propositional check unsatisfiable : 0
% 0.42/0.66 % Propositional clauses : 0
% 0.42/0.66 % Propositional clauses after purity: 0
% 0.42/0.66 % Propositional unsat core size : 0
% 0.42/0.66 % Propositional preprocessing time : 0.000
% 0.42/0.66 % Propositional encoding time : 0.000
% 0.42/0.66 % Propositional solver time : 0.000
% 0.42/0.66 % Success case prop preproc time : 0.000
% 0.42/0.66 % Success case prop encoding time : 0.000
% 0.42/0.66 % Success case prop solver time : 0.000
% 0.42/0.66 % Current number of processed clauses : 34
% 0.42/0.66 % Positive orientable unit clauses : 32
% 0.42/0.66 % Positive unorientable unit clauses: 0
% 0.42/0.66 % Negative unit clauses : 2
% 0.42/0.66 % Non-unit-clauses : 0
% 0.42/0.66 % Current number of unprocessed clauses: 129
% 0.42/0.66 % ...number of literals in the above : 201
% 0.42/0.66 % Current number of archived formulas : 0
% 0.42/0.66 % Current number of archived clauses : 0
% 0.42/0.66 % Clause-clause subsumption calls (NU) : 0
% 0.42/0.66 % Rec. Clause-clause subsumption calls : 0
% 0.42/0.66 % Non-unit clause-clause subsumptions : 0
% 0.42/0.66 % Unit Clause-clause subsumption calls : 1
% 0.42/0.66 % Rewrite failures with RHS unbound : 0
% 0.42/0.66 % BW rewrite match attempts : 0
% 0.42/0.66 % BW rewrite match successes : 0
% 0.42/0.66 % Condensation attempts : 0
% 0.42/0.66 % Condensation successes : 0
% 0.42/0.66 % Termbank termtop insertions : 11461
% 0.42/0.66 % Search garbage collected termcells : 1861
% 0.42/0.66
% 0.42/0.66 % -------------------------------------------------
% 0.42/0.66 % User time : 0.009 s
% 0.42/0.66 % System time : 0.008 s
% 0.42/0.66 % Total time : 0.017 s
% 0.42/0.66 % Maximum resident set size: 4252 pages
% 0.42/0.66
% 0.42/0.66 % -------------------------------------------------
% 0.42/0.66 % User time : 0.024 s
% 0.42/0.66 % System time : 0.015 s
% 0.42/0.66 % Total time : 0.038 s
% 0.42/0.66 % Maximum resident set size: 5120 pages
% 0.42/0.66 % E exiting
%------------------------------------------------------------------------------