%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ANA023-2 : 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 : n020.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 12:03:06 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.58s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 43 ( 11 unt; 0 nHn; 40 RR)
% Number of literals : 97 ( 3 equ; 61 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Ocompare__rls__9_0,axiom,
( ~ c_lessequals(X2,c_minus(X3,X4,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| c_lessequals(c_plus(X2,X4,X1),X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_0) ).
cnf(cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0,axiom,
( ~ class_OrderedGroup_Ocomm__monoid__add(X1)
| c_plus(c_0,X2,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).
cnf(cls_OrderedGroup_Ocompare__rls__9_1,axiom,
( ~ c_lessequals(c_plus(X2,X3,X1),X4,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| c_lessequals(X2,c_minus(X4,X3,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_1) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(clsrel_Orderings_Olinorder_4,axiom,
( ~ class_Orderings_Olinorder(X1)
| class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Orderings_Olinorder_4) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_23,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Ocomm__monoid__add(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_23) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Opordered__ab__group__add(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(c_0_12,plain,
( ~ c_lessequals(X2,c_minus(X3,X4,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| c_lessequals(c_plus(X2,X4,X1),X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocompare__rls__9_0]) ).
cnf(c_0_13,plain,
( ~ class_OrderedGroup_Ocomm__monoid__add(X1)
| c_plus(c_0,X2,X1) = X2 ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0]) ).
cnf(c_0_14,plain,
( ~ c_lessequals(c_plus(X2,X3,X1),X4,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| c_lessequals(X2,c_minus(X4,X3,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocompare__rls__9_1]) ).
cnf(c_0_15,plain,
( ~ c_lessequals(X2,c_minus(X3,X4,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| c_lessequals(c_plus(X2,X4,X1),X3,X1) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ class_OrderedGroup_Ocomm__monoid__add(X1)
| c_plus(c_0,X2,X1) = X2 ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_18,plain,
( ~ c_lessequals(c_plus(X2,X3,X1),X4,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| c_lessequals(X2,c_minus(X4,X3,X1),X1) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).
cnf(c_0_20,plain,
( ~ class_OrderedGroup_Ocomm__monoid__add(X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3)
| ~ c_lessequals(c_0,c_minus(X2,X1,X3),X3)
| c_lessequals(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
cls_conjecture_1 ).
cnf(c_0_22,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
c_0_17 ).
cnf(c_0_23,plain,
( ~ class_OrderedGroup_Ocomm__monoid__add(X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3)
| ~ c_lessequals(X2,X1,X3)
| c_lessequals(c_0,c_minus(X1,X2,X3),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_24,plain,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
( ~ class_OrderedGroup_Ocomm__monoid__add(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| c_lessequals(v_g(v_x),v_k(v_x),t_b) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ class_Orderings_Olinorder(X1)
| class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Orderings_Olinorder_4]) ).
cnf(c_0_27,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).
cnf(c_0_28,negated_conjecture,
( ~ class_OrderedGroup_Ocomm__monoid__add(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ c_lessequals(v_g(v_x),v_f(v_x),t_b) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( ~ class_OrderedGroup_Ocomm__monoid__add(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ c_lessequals(v_k(v_x),X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| c_lessequals(v_g(v_x),X1,t_b) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
c_lessequals(v_k(v_x),v_f(v_x),t_b),
cls_conjecture_2 ).
cnf(c_0_31,plain,
( ~ class_Orderings_Olinorder(X1)
| class_Orderings_Oorder(X1) ),
c_0_26 ).
cnf(c_0_32,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
( ~ class_OrderedGroup_Ocomm__monoid__add(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ class_Orderings_Oorder(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Oorder(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_36,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Ocomm__monoid__add(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_23]) ).
cnf(c_0_37,negated_conjecture,
( ~ class_OrderedGroup_Ocomm__monoid__add(t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Ocomm__monoid__add(X1) ),
c_0_36 ).
cnf(c_0_39,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Opordered__ab__group__add(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_54]) ).
cnf(c_0_40,negated_conjecture,
~ class_OrderedGroup_Opordered__ab__group__add(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35])]) ).
cnf(c_0_41,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Opordered__ab__group__add(X1) ),
c_0_39 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ANA023-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n020.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 13:25:03 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.52 Running first-order theorem proving
% 0.26/0.52 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.26/0.58 % Version: 3.5.1
% 0.26/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % sh5l with pid 3025783 completed with status 0
% 0.26/0.58 % Result found by sh5l
% 0.26/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.58 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.58 % Search class: FHUSF-FFSS31-SFFFFFNN
% 0.26/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.58 % SubtermCWHack with pid 3025789 completed with status 0
% 0.26/0.58 % Result found by SubtermCWHack
% 0.26/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.58 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.58 % Search class: FHUSF-FFSS31-SFFFFFNN
% 0.26/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.58 % Preprocessing time : 0.002 s
% 0.26/0.58
% 0.26/0.58 % Proof found!
% 0.26/0.58 % SZS status Unsatisfiable
% 0.26/0.58 % SZS output start CNFRefutation
% See solution above
% 0.26/0.58 % Parsed axioms : 12
% 0.26/0.58 % Removed by relevancy pruning/SinE : 0
% 0.26/0.58 % Initial clauses : 12
% 0.26/0.58 % Removed in clause preprocessing : 0
% 0.26/0.58 % Initial clauses in saturation : 12
% 0.26/0.58 % Processed clauses : 24
% 0.26/0.58 % ...of these trivial : 0
% 0.26/0.58 % ...subsumed : 0
% 0.26/0.58 % ...remaining for further processing : 24
% 0.26/0.58 % Other redundant clauses eliminated : 0
% 0.26/0.58 % Clauses deleted for lack of memory : 0
% 0.26/0.58 % Backward-subsumed : 5
% 0.26/0.58 % Backward-rewritten : 0
% 0.26/0.58 % Generated clauses : 17
% 0.26/0.58 % ...of the previous two non-redundant : 14
% 0.26/0.58 % ...aggressively subsumed : 0
% 0.26/0.58 % Contextual simplify-reflections : 0
% 0.26/0.58 % Paramodulations : 17
% 0.26/0.58 % Factorizations : 0
% 0.26/0.58 % NegExts : 0
% 0.26/0.58 % Equation resolutions : 0
% 0.26/0.58 % Disequality decompositions : 0
% 0.26/0.58 % Total rewrite steps : 4
% 0.26/0.58 % ...of those cached : 2
% 0.26/0.58 % Propositional unsat checks : 0
% 0.26/0.58 % Propositional check models : 0
% 0.26/0.58 % Propositional check unsatisfiable : 0
% 0.26/0.58 % Propositional clauses : 0
% 0.26/0.58 % Propositional clauses after purity: 0
% 0.26/0.58 % Propositional unsat core size : 0
% 0.26/0.58 % Propositional preprocessing time : 0.000
% 0.26/0.58 % Propositional encoding time : 0.000
% 0.26/0.58 % Propositional solver time : 0.000
% 0.26/0.58 % Success case prop preproc time : 0.000
% 0.26/0.58 % Success case prop encoding time : 0.000
% 0.26/0.58 % Success case prop solver time : 0.000
% 0.26/0.58 % Current number of processed clauses : 19
% 0.26/0.58 % Positive orientable unit clauses : 3
% 0.26/0.58 % Positive unorientable unit clauses: 0
% 0.26/0.58 % Negative unit clauses : 2
% 0.26/0.58 % Non-unit-clauses : 14
% 0.26/0.58 % Current number of unprocessed clauses: 2
% 0.26/0.58 % ...number of literals in the above : 11
% 0.26/0.58 % Current number of archived formulas : 0
% 0.26/0.58 % Current number of archived clauses : 5
% 0.26/0.58 % Clause-clause subsumption calls (NU) : 63
% 0.26/0.58 % Rec. Clause-clause subsumption calls : 37
% 0.26/0.58 % Non-unit clause-clause subsumptions : 4
% 0.26/0.58 % Unit Clause-clause subsumption calls : 1
% 0.26/0.58 % Rewrite failures with RHS unbound : 0
% 0.26/0.58 % BW rewrite match attempts : 0
% 0.26/0.58 % BW rewrite match successes : 0
% 0.26/0.58 % Condensation attempts : 0
% 0.26/0.58 % Condensation successes : 0
% 0.26/0.58 % Termbank termtop insertions : 633
% 0.26/0.58 % Search garbage collected termcells : 28
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.005 s
% 0.26/0.58 % System time : 0.004 s
% 0.26/0.58 % Total time : 0.009 s
% 0.26/0.58 % Maximum resident set size: 3588 pages
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.007 s
% 0.26/0.58 % System time : 0.011 s
% 0.26/0.58 % Total time : 0.018 s
% 0.26/0.58 % Maximum resident set size: 4864 pages
% 0.26/0.58 % E exiting
%------------------------------------------------------------------------------