%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO613-1 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:48:04 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 10 unt; 0 nHn; 21 RR)
% Number of literals : 156 ( 0 equ; 141 neg)
% Maximal clause size : 23 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 145 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_05,axiom,
( ~ le(s(X11),X12)
| ~ le(s(X10),X11)
| ~ le(s(X9),X10)
| ~ le(s(X8),X9)
| ~ le(s(X7),X8)
| ~ le(s(X6),X7)
| ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ eq(f(X12),a0)
| ~ eq(f(X11),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
cnf(sos_04,axiom,
eq(f(X1),a0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
cnf(sos_01,axiom,
le(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
cnf(sos_03,axiom,
( ~ le(max(X1,X2),X3)
| le(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
cnf(sos_02,axiom,
( ~ le(max(X1,X2),X3)
| le(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
cnf(c_0_5,plain,
( ~ le(s(X11),X12)
| ~ le(s(X10),X11)
| ~ le(s(X9),X10)
| ~ le(s(X8),X9)
| ~ le(s(X7),X8)
| ~ le(s(X6),X7)
| ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ eq(f(X12),a0)
| ~ eq(f(X11),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0) ),
inference(fof_simplification,[status(thm)],[sos_05]) ).
cnf(c_0_6,plain,
( ~ le(s(X11),X12)
| ~ le(s(X10),X11)
| ~ le(s(X9),X10)
| ~ le(s(X8),X9)
| ~ le(s(X7),X8)
| ~ le(s(X6),X7)
| ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ eq(f(X12),a0)
| ~ eq(f(X11),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0) ),
c_0_5 ).
cnf(c_0_7,axiom,
eq(f(X1),a0),
sos_04 ).
cnf(c_0_8,plain,
( ~ le(s(X12),X11)
| ~ le(s(X11),X10)
| ~ le(s(X10),X9)
| ~ le(s(X9),X8)
| ~ le(s(X8),X7)
| ~ le(s(X7),X6)
| ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7])]) ).
cnf(c_0_9,axiom,
le(X1,X1),
sos_01 ).
cnf(c_0_10,plain,
( ~ le(max(X1,X2),X3)
| le(X2,X3) ),
inference(fof_simplification,[status(thm)],[sos_03]) ).
cnf(c_0_11,plain,
( ~ le(s(X11),X10)
| ~ le(s(X10),X9)
| ~ le(s(X9),X8)
| ~ le(s(X8),X7)
| ~ le(s(X7),X6)
| ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ le(max(X1,X2),X3)
| le(X1,X3) ),
inference(fof_simplification,[status(thm)],[sos_02]) ).
cnf(c_0_13,plain,
( ~ le(max(X1,X2),X3)
| le(X2,X3) ),
c_0_10 ).
cnf(c_0_14,plain,
( ~ le(s(X10),X9)
| ~ le(s(X9),X8)
| ~ le(s(X8),X7)
| ~ le(s(X7),X6)
| ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,plain,
( ~ le(max(X1,X2),X3)
| le(X1,X3) ),
c_0_12 ).
cnf(c_0_16,plain,
le(X1,max(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_17,plain,
( ~ le(s(X9),X8)
| ~ le(s(X8),X7)
| ~ le(s(X7),X6)
| ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,plain,
le(X1,max(X2,max(X1,X3))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
le(X1,max(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_20,plain,
( ~ le(s(X8),X7)
| ~ le(s(X7),X6)
| ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
le(X1,max(max(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_22,plain,
( ~ le(s(X7),X6)
| ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( ~ le(s(X6),X5)
| ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_24,plain,
( ~ le(s(X5),X4)
| ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_25,plain,
( ~ le(s(X4),X3)
| ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_26,plain,
( ~ le(s(X3),X1)
| ~ le(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_27,plain,
~ le(s(X1),X2),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_28,plain,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO613-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n014.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % 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 12:04:22 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.43 Running first-order theorem proving
% 0.11/0.43 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.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4013518 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FHHNS-FFSF21-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 4013527 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FHHNS-FFSF21-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45 % Presaturation interreduction done
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 5
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 5
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 5
% 0.11/0.45 % Processed clauses : 25
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 25
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 10
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 67
% 0.11/0.45 % ...of the previous two non-redundant : 61
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 67
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 12
% 0.11/0.45 % ...of those cached : 0
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 10
% 0.11/0.45 % Positive orientable unit clauses : 7
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 1
% 0.11/0.45 % Non-unit-clauses : 2
% 0.11/0.45 % Current number of unprocessed clauses: 46
% 0.11/0.45 % ...number of literals in the above : 179
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 15
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 13
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 13
% 0.11/0.45 % Non-unit clause-clause subsumptions : 9
% 0.11/0.45 % Unit Clause-clause subsumption calls : 11
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 2
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 1753
% 0.11/0.45 % Search garbage collected termcells : 71
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.004 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.008 s
% 0.11/0.45 % Maximum resident set size: 3644 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.021 s
% 0.11/0.45 % System time : 0.010 s
% 0.11/0.45 % Total time : 0.031 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------