%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO629-1 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:06 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.54s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 13 unt; 8 nHn; 21 RR)
% Number of literals : 61 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10_06,axiom,
( ~ iLEQ(X1,X2)
| ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X2),'0')
| 'E'('0',f(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10_06) ).
cnf(clause_7_05,axiom,
~ 'LE'(f(X1),'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7_05) ).
cnf(clause_1_07,axiom,
( ~ 'E'(s('0'),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| 'E'(f(X1),f(g(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1_07) ).
cnf(clause_8_01,axiom,
~ 'E'(f(X1),f(g(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8_01) ).
cnf(clause_6_04,axiom,
( 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6_04) ).
cnf(clause_11_03,axiom,
( ~ 'E'('0',f(g(X1)))
| ~ 'E'('0',f(X1))
| 'E'(f(X1),f(g(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11_03) ).
cnf(clause_0_02,axiom,
iLEQ(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_0_02) ).
cnf(clause_3_09,axiom,
iLEQ(X1,g(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3_09) ).
cnf(c_0_8,plain,
( ~ iLEQ(X1,X2)
| ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X2),'0')
| 'E'('0',f(X2)) ),
inference(fof_simplification,[status(thm)],[clause_10_06]) ).
cnf(c_0_9,plain,
~ 'LE'(f(X1),'0'),
inference(fof_simplification,[status(thm)],[clause_7_05]) ).
cnf(c_0_10,plain,
( ~ iLEQ(X1,X2)
| ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X2),'0')
| 'E'('0',f(X2)) ),
c_0_8 ).
cnf(c_0_11,plain,
~ 'LE'(f(X1),'0'),
c_0_9 ).
cnf(c_0_12,plain,
( ~ 'E'(s('0'),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| 'E'(f(X1),f(g(X1))) ),
inference(fof_simplification,[status(thm)],[clause_1_07]) ).
cnf(c_0_13,plain,
~ 'E'(f(X1),f(g(X1))),
inference(fof_simplification,[status(thm)],[clause_8_01]) ).
cnf(c_0_14,plain,
( ~ iLEQ(X2,X1)
| ~ 'LE'(f(X2),s('0'))
| 'E'('0',f(X1)) ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
( 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
clause_6_04 ).
cnf(c_0_16,plain,
( ~ 'E'('0',f(g(X1)))
| ~ 'E'('0',f(X1))
| 'E'(f(X1),f(g(X1))) ),
inference(fof_simplification,[status(thm)],[clause_11_03]) ).
cnf(c_0_17,plain,
( ~ 'E'(s('0'),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| 'E'(f(X1),f(g(X1))) ),
c_0_12 ).
cnf(c_0_18,plain,
~ 'E'(f(X1),f(g(X1))),
c_0_13 ).
cnf(c_0_19,plain,
( ~ iLEQ(X1,X2)
| 'E'('0',f(X2))
| 'E'(s('0'),f(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
iLEQ(X1,X1),
clause_0_02 ).
cnf(c_0_21,axiom,
iLEQ(X1,g(X1)),
clause_3_09 ).
cnf(c_0_22,plain,
( ~ 'E'('0',f(g(X1)))
| ~ 'E'('0',f(X1))
| 'E'(f(X1),f(g(X1))) ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(g(X1))) ),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( 'E'('0',f(X1))
| 'E'(s('0'),f(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( 'E'(s('0'),f(X1))
| 'E'('0',f(g(X1))) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_26,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(g(X1))) ),
inference(sr,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_27,plain,
'E'('0',f(g(X1))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
~ 'E'('0',f(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO629-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 % Computer : n001.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Mon Sep 21 12:11:44 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.24/0.54 % Version: 3.5.1
% 0.24/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 % Starting sh5l with 300s (1) cores
% 0.24/0.54 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3071051 completed with status 0
% 0.24/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.54 % No SInE strategy applied
% 0.24/0.54 % Search class: FGUNM-FFSF11-SFFFFFNN
% 0.24/0.54 % partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.24/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.54 % Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 0.24/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.54 % SubtermCWHack with pid 3071053 completed with status 0
% 0.24/0.54 % Result found by SubtermCWHack
% 0.24/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.54 % No SInE strategy applied
% 0.24/0.54 % Search class: FGUNM-FFSF11-SFFFFFNN
% 0.24/0.54 % partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.24/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.54 % Preprocessing time : 0.002 s
% 0.24/0.54
% 0.24/0.54 % Proof found!
% 0.24/0.54 % SZS status Unsatisfiable
% 0.24/0.54 % SZS output start CNFRefutation
% See solution above
% 0.24/0.54 % Parsed axioms : 12
% 0.24/0.54 % Removed by relevancy pruning/SinE : 0
% 0.24/0.54 % Initial clauses : 12
% 0.24/0.54 % Removed in clause preprocessing : 0
% 0.24/0.54 % Initial clauses in saturation : 12
% 0.24/0.54 % Processed clauses : 17
% 0.24/0.54 % ...of these trivial : 2
% 0.24/0.54 % ...subsumed : 2
% 0.24/0.54 % ...remaining for further processing : 13
% 0.24/0.54 % Other redundant clauses eliminated : 0
% 0.24/0.54 % Clauses deleted for lack of memory : 0
% 0.24/0.54 % Backward-subsumed : 0
% 0.24/0.54 % Backward-rewritten : 2
% 0.24/0.54 % Generated clauses : 7
% 0.24/0.54 % ...of the previous two non-redundant : 7
% 0.24/0.54 % ...aggressively subsumed : 0
% 0.24/0.54 % Contextual simplify-reflections : 1
% 0.24/0.54 % Paramodulations : 5
% 0.24/0.54 % Factorizations : 0
% 0.24/0.54 % NegExts : 0
% 0.24/0.54 % Equation resolutions : 0
% 0.24/0.54 % Disequality decompositions : 0
% 0.24/0.54 % Total rewrite steps : 4
% 0.24/0.54 % ...of those cached : 1
% 0.24/0.54 % Propositional unsat checks : 0
% 0.24/0.54 % Propositional check models : 0
% 0.24/0.54 % Propositional check unsatisfiable : 0
% 0.24/0.54 % Propositional clauses : 0
% 0.24/0.54 % Propositional clauses after purity: 0
% 0.24/0.54 % Propositional unsat core size : 0
% 0.24/0.54 % Propositional preprocessing time : 0.000
% 0.24/0.54 % Propositional encoding time : 0.000
% 0.24/0.54 % Propositional solver time : 0.000
% 0.24/0.54 % Success case prop preproc time : 0.000
% 0.24/0.54 % Success case prop encoding time : 0.000
% 0.24/0.54 % Success case prop solver time : 0.000
% 0.24/0.54 % Current number of processed clauses : 9
% 0.24/0.54 % Positive orientable unit clauses : 2
% 0.24/0.54 % Positive unorientable unit clauses: 0
% 0.24/0.54 % Negative unit clauses : 3
% 0.24/0.54 % Non-unit-clauses : 4
% 0.24/0.54 % Current number of unprocessed clauses: 1
% 0.24/0.54 % ...number of literals in the above : 2
% 0.24/0.54 % Current number of archived formulas : 0
% 0.24/0.54 % Current number of archived clauses : 4
% 0.24/0.54 % Clause-clause subsumption calls (NU) : 5
% 0.24/0.54 % Rec. Clause-clause subsumption calls : 5
% 0.24/0.54 % Non-unit clause-clause subsumptions : 1
% 0.24/0.54 % Unit Clause-clause subsumption calls : 1
% 0.24/0.54 % Rewrite failures with RHS unbound : 0
% 0.24/0.54 % BW rewrite match attempts : 1
% 0.24/0.54 % BW rewrite match successes : 1
% 0.24/0.54 % Condensation attempts : 0
% 0.24/0.54 % Condensation successes : 0
% 0.24/0.54 % Termbank termtop insertions : 451
% 0.24/0.54 % Search garbage collected termcells : 21
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.004 s
% 0.24/0.54 % System time : 0.004 s
% 0.24/0.54 % Total time : 0.008 s
% 0.24/0.54 % Maximum resident set size: 3636 pages
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.016 s
% 0.24/0.54 % System time : 0.017 s
% 0.24/0.54 % Total time : 0.034 s
% 0.24/0.54 % Maximum resident set size: 4864 pages
% 0.24/0.54 % E exiting
%------------------------------------------------------------------------------