%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO617-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 : n009.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:05 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of clauses : 53 ( 17 unt; 4 nHn; 32 RR)
% Number of literals : 103 ( 0 equ; 69 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 134 ( 72 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_02,axiom,
( ~ le(max(X1,X2),X3)
| le(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
cnf(sos_03,axiom,
( ~ le(max(X1,X2),X3)
| le(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
cnf(sos_01,axiom,
le(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
cnf(sos_07,axiom,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a2)
| ~ eq(f(X1),a2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
cnf(sos_06,axiom,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a1)
| ~ eq(f(X1),a1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
cnf(sos_05,axiom,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
cnf(sos_04,axiom,
( eq(f(X1),a2)
| eq(f(X1),a1)
| eq(f(X1),a0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
cnf(c_0_7,plain,
( ~ le(max(X1,X2),X3)
| le(X1,X3) ),
inference(fof_simplification,[status(thm)],[sos_02]) ).
cnf(c_0_8,plain,
( ~ le(max(X1,X2),X3)
| le(X2,X3) ),
inference(fof_simplification,[status(thm)],[sos_03]) ).
cnf(c_0_9,plain,
( ~ le(max(X1,X2),X3)
| le(X1,X3) ),
c_0_7 ).
cnf(c_0_10,axiom,
le(X1,X1),
sos_01 ).
cnf(c_0_11,plain,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a2)
| ~ eq(f(X1),a2) ),
inference(fof_simplification,[status(thm)],[sos_07]) ).
cnf(c_0_12,plain,
( ~ le(max(X1,X2),X3)
| le(X2,X3) ),
c_0_8 ).
cnf(c_0_13,plain,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a1)
| ~ eq(f(X1),a1) ),
inference(fof_simplification,[status(thm)],[sos_06]) ).
cnf(c_0_14,plain,
le(X1,max(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a2)
| ~ eq(f(X1),a2) ),
c_0_11 ).
cnf(c_0_16,plain,
le(X1,max(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,plain,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0) ),
inference(fof_simplification,[status(thm)],[sos_05]) ).
cnf(c_0_18,plain,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a1)
| ~ eq(f(X1),a1) ),
c_0_13 ).
cnf(c_0_19,plain,
le(X1,max(max(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_20,plain,
( ~ eq(f(X2),a2)
| ~ eq(f(max(X1,s(X2))),a2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
( eq(f(X1),a2)
| eq(f(X1),a1)
| eq(f(X1),a0) ),
sos_04 ).
cnf(c_0_22,plain,
( ~ le(s(X1),X2)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0) ),
c_0_17 ).
cnf(c_0_23,plain,
le(X1,max(max(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_24,plain,
( ~ eq(f(X1),a1)
| ~ eq(f(max(max(s(X1),X2),X3)),a1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ eq(f(X2),a2)
| eq(f(max(X1,s(X2))),a0)
| eq(f(max(X1,s(X2))),a1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
le(X1,max(X2,max(X3,X1))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_27,plain,
( ~ eq(f(X2),a0)
| ~ eq(f(max(max(X1,s(X2)),X3)),a0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ eq(f(X3),a2)
| ~ eq(f(X1),a1)
| eq(f(max(max(s(X1),X2),s(X3))),a0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
le(X1,max(X2,max(X3,max(X1,X4)))),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_30,plain,
( ~ eq(f(X2),a1)
| ~ eq(f(max(max(X1,s(X2)),X3)),a1) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_31,plain,
( ~ eq(f(X3),a2)
| ~ eq(f(X2),a1)
| ~ eq(f(X1),a0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ eq(f(X3),a2)
| ~ eq(f(max(X1,max(X2,max(s(X3),X4)))),a2) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_33,plain,
( ~ eq(f(X2),a2)
| ~ eq(f(X1),a1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_31]) ).
cnf(c_0_34,plain,
le(X1,max(X2,max(X3,max(X4,X1)))),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_35,plain,
( ~ eq(f(X1),a0)
| ~ eq(f(max(s(X1),X2)),a0) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_36,plain,
( ~ eq(f(X3),a2)
| eq(f(max(X1,max(X2,max(s(X3),X4)))),a0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_33]) ).
cnf(c_0_37,plain,
( ~ eq(f(X4),a2)
| ~ eq(f(max(X1,max(X2,max(X3,s(X4))))),a2) ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_38,plain,
( ~ eq(f(X2),a2)
| ~ eq(f(X1),a0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
~ eq(f(X1),a2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_21]),c_0_33]),c_0_38]) ).
cnf(c_0_40,plain,
le(X1,max(X2,max(X1,X3))),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_41,plain,
( ~ eq(f(X2),a1)
| ~ eq(f(max(X1,s(X2))),a1) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_42,plain,
( eq(f(X1),a0)
| eq(f(X1),a1) ),
inference(sr,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_43,plain,
le(X1,max(X2,max(max(X1,X3),X4))),
inference(spm,[status(thm)],[c_0_9,c_0_40]) ).
cnf(c_0_44,plain,
( ~ eq(f(X2),a1)
| eq(f(max(X1,s(X2))),a0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
le(X1,max(X2,max(max(max(X3,X1),X4),X5))),
inference(spm,[status(thm)],[c_0_12,c_0_43]) ).
cnf(c_0_46,plain,
( ~ eq(f(X1),a1)
| ~ eq(f(max(s(X1),X2)),a1) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_47,plain,
( ~ eq(f(X2),a1)
| ~ eq(f(X1),a0) ),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_48,plain,
le(X1,max(X2,max(max(max(X3,max(X4,X1)),X5),X6))),
inference(spm,[status(thm)],[c_0_12,c_0_45]) ).
cnf(c_0_49,plain,
~ eq(f(X1),a1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_47]) ).
cnf(c_0_50,plain,
( ~ eq(f(X4),a0)
| ~ eq(f(max(X1,max(max(max(X2,max(X3,s(X4))),X5),X6))),a0) ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_51,plain,
eq(f(X1),a0),
inference(sr,[status(thm)],[c_0_42,c_0_49]) ).
cnf(c_0_52,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO617-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.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 12:04:28 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_3 with pid 1702429 completed with status 9
% 0.10/0.44 % new_bool_1 with pid 1702430 completed with status 9
% 0.10/0.44 % sh5l with pid 1702431 completed with status 9
% 0.10/0.44 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1702428 completed with status 0
% 0.10/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S032N with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S032N with pid 1702437 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S032N with 136s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44 % Presaturation interreduction done
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 7
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 7
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 7
% 0.10/0.44 % Processed clauses : 228
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 32
% 0.10/0.44 % ...remaining for further processing : 196
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 109
% 0.10/0.44 % Backward-rewritten : 36
% 0.10/0.44 % Generated clauses : 552
% 0.10/0.44 % ...of the previous two non-redundant : 550
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 8
% 0.10/0.44 % Paramodulations : 550
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 4
% 0.10/0.44 % ...of those cached : 0
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 42
% 0.10/0.45 % Positive orientable unit clauses : 38
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 2
% 0.10/0.45 % Non-unit-clauses : 2
% 0.10/0.45 % Current number of unprocessed clauses: 272
% 0.10/0.45 % ...number of literals in the above : 711
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 154
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 2672
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 2473
% 0.10/0.45 % Non-unit clause-clause subsumptions : 53
% 0.10/0.45 % Unit Clause-clause subsumption calls : 168
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 322
% 0.10/0.45 % BW rewrite match successes : 40
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 11277
% 0.10/0.45 % Search garbage collected termcells : 21
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.022 s
% 0.10/0.45 % System time : 0.005 s
% 0.10/0.45 % Total time : 0.027 s
% 0.10/0.45 % Maximum resident set size: 3580 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.133 s
% 0.10/0.45 % System time : 0.055 s
% 0.10/0.45 % Total time : 0.188 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------