%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA025-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:02:48 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 49 ( 10 unt; 10 nHn; 36 RR)
% Number of literals : 112 ( 0 equ; 63 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 79 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Orderings_Olinorder__not__le_0,axiom,
( ~ class_Orderings_Olinorder(X1)
| c_lessequals(X3,X2,X1)
| c_less(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_Orderings_Oorder__less__imp__le_0,axiom,
( ~ c_less(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__imp__le_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(clsrel_LOrder_Ojoin__semilorder_1,axiom,
( ~ class_LOrder_Ojoin__semilorder(X1)
| class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_LOrder_Ojoin__semilorder_1) ).
cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_15,axiom,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| class_LOrder_Ojoin__semilorder(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_OrderedGroup_Olordered__ab__group__abs_15) ).
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/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Oabs__ge__zero_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2,axiom,
( ~ c_lessequals(X4,X3,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Olinorder(X1)
| c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_12,plain,
( ~ class_Orderings_Olinorder(X1)
| c_lessequals(X3,X2,X1)
| c_less(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_0]) ).
cnf(c_0_13,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_14,plain,
( ~ class_Orderings_Olinorder(X1)
| c_lessequals(X3,X2,X1)
| c_less(X2,X3,X1) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
c_0_13 ).
cnf(c_0_16,plain,
( ~ c_less(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__less__imp__le_0]) ).
cnf(c_0_17,plain,
( ~ class_Ring__and__Field_Oordered__idom(X3)
| c_lessequals(X2,X1,X3)
| c_less(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_19,plain,
( ~ class_LOrder_Ojoin__semilorder(X1)
| class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_LOrder_Ojoin__semilorder_1]) ).
cnf(c_0_20,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| class_LOrder_Ojoin__semilorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_OrderedGroup_Olordered__ab__group__abs_15]) ).
cnf(c_0_21,plain,
( ~ c_less(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X3,X1) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( c_lessequals(X2,X1,t_b)
| c_less(X1,X2,t_b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ class_LOrder_Ojoin__semilorder(X1)
| class_Orderings_Oorder(X1) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| class_LOrder_Ojoin__semilorder(X1) ),
c_0_20 ).
cnf(c_0_25,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_26,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__ge__zero_0]) ).
cnf(c_0_27,negated_conjecture,
( ~ class_Orderings_Oorder(t_b)
| c_lessequals(X2,X1,t_b)
| c_lessequals(X1,X2,t_b) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| class_Orderings_Oorder(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Olordered__ab__group__abs(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_50]) ).
cnf(c_0_30,plain,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
c_0_25 ).
cnf(c_0_31,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| c_lessequals(X2,X1,t_b)
| c_lessequals(X1,X2,t_b) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_OrderedGroup_Olordered__ab__group__abs(X1) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_35,plain,
( ~ c_lessequals(X4,X3,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Olinorder(X1)
| c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2]) ).
cnf(c_0_36,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X2)
| ~ c_lessequals(c_HOL_Oabs(X3,X2),X1,X2)
| c_lessequals(c_0,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( c_lessequals(X2,X1,t_b)
| c_lessequals(X1,X2,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]) ).
cnf(c_0_38,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
c_0_34 ).
cnf(c_0_39,plain,
( ~ c_lessequals(X4,X3,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Olinorder(X1)
| c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1) ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| c_lessequals(c_0,X1,t_b)
| c_lessequals(X1,c_HOL_Oabs(X2,t_b),t_b) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_42,negated_conjecture,
( ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| c_lessequals(X1,c_HOL_Oabs(X2,t_b),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_18])]) ).
cnf(c_0_44,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
( ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(spm,[status(thm)],[c_0_45,c_0_31]) ).
cnf(c_0_47,negated_conjecture,
~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_15]),c_0_18])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA025-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n007.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 13:22:37 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.44 % Version: 3.5.1
% 0.16/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 % Starting sh5l with 300s (1) cores
% 0.16/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1182054 completed with status 0
% 0.16/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.44 % No SInE strategy applied
% 0.16/0.44 % Search class: FGUNF-FFSF31-MFFFFFNN
% 0.16/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1182059 completed with status 0
% 0.16/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.44 % No SInE strategy applied
% 0.16/0.44 % Search class: FGUNF-FFSF31-MFFFFFNN
% 0.16/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 % Preprocessing time : 0.001 s
% 0.16/0.44 % Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 % Proof found!
% 0.16/0.44 % SZS status Unsatisfiable
% 0.16/0.44 % SZS output start CNFRefutation
% See solution above
% 0.16/0.44 % Parsed axioms : 12
% 0.16/0.44 % Removed by relevancy pruning/SinE : 0
% 0.16/0.44 % Initial clauses : 12
% 0.16/0.44 % Removed in clause preprocessing : 0
% 0.16/0.44 % Initial clauses in saturation : 12
% 0.16/0.44 % Processed clauses : 49
% 0.16/0.44 % ...of these trivial : 2
% 0.16/0.44 % ...subsumed : 2
% 0.16/0.44 % ...remaining for further processing : 45
% 0.16/0.44 % Other redundant clauses eliminated : 0
% 0.16/0.44 % Clauses deleted for lack of memory : 0
% 0.16/0.44 % Backward-subsumed : 8
% 0.16/0.44 % Backward-rewritten : 0
% 0.16/0.44 % Generated clauses : 52
% 0.16/0.44 % ...of the previous two non-redundant : 49
% 0.16/0.44 % ...aggressively subsumed : 0
% 0.16/0.44 % Contextual simplify-reflections : 1
% 0.16/0.44 % Paramodulations : 50
% 0.16/0.44 % Factorizations : 2
% 0.16/0.44 % NegExts : 0
% 0.16/0.44 % Equation resolutions : 0
% 0.16/0.44 % Disequality decompositions : 0
% 0.16/0.44 % Total rewrite steps : 8
% 0.16/0.44 % ...of those cached : 3
% 0.16/0.44 % Propositional unsat checks : 0
% 0.16/0.44 % Propositional check models : 0
% 0.16/0.44 % Propositional check unsatisfiable : 0
% 0.16/0.44 % Propositional clauses : 0
% 0.16/0.44 % Propositional clauses after purity: 0
% 0.16/0.44 % Propositional unsat core size : 0
% 0.16/0.44 % Propositional preprocessing time : 0.000
% 0.16/0.44 % Propositional encoding time : 0.000
% 0.16/0.44 % Propositional solver time : 0.000
% 0.16/0.44 % Success case prop preproc time : 0.000
% 0.16/0.44 % Success case prop encoding time : 0.000
% 0.16/0.44 % Success case prop solver time : 0.000
% 0.16/0.44 % Current number of processed clauses : 25
% 0.16/0.44 % Positive orientable unit clauses : 4
% 0.16/0.44 % Positive unorientable unit clauses: 0
% 0.16/0.44 % Negative unit clauses : 3
% 0.16/0.44 % Non-unit-clauses : 18
% 0.16/0.44 % Current number of unprocessed clauses: 24
% 0.16/0.44 % ...number of literals in the above : 98
% 0.16/0.44 % Current number of archived formulas : 0
% 0.16/0.44 % Current number of archived clauses : 20
% 0.16/0.44 % Clause-clause subsumption calls (NU) : 215
% 0.16/0.44 % Rec. Clause-clause subsumption calls : 161
% 0.16/0.44 % Non-unit clause-clause subsumptions : 9
% 0.16/0.44 % Unit Clause-clause subsumption calls : 5
% 0.16/0.44 % Rewrite failures with RHS unbound : 0
% 0.16/0.44 % BW rewrite match attempts : 16
% 0.16/0.44 % BW rewrite match successes : 1
% 0.16/0.44 % Condensation attempts : 0
% 0.16/0.44 % Condensation successes : 0
% 0.16/0.44 % Termbank termtop insertions : 1321
% 0.16/0.44 % Search garbage collected termcells : 29
% 0.16/0.44
% 0.16/0.44 % -------------------------------------------------
% 0.16/0.44 % User time : 0.006 s
% 0.16/0.44 % System time : 0.002 s
% 0.16/0.44 % Total time : 0.008 s
% 0.16/0.44 % Maximum resident set size: 3640 pages
% 0.16/0.44
% 0.16/0.44 % -------------------------------------------------
% 0.16/0.44 % User time : 0.025 s
% 0.16/0.44 % System time : 0.013 s
% 0.16/0.44 % Total time : 0.038 s
% 0.16/0.44 % Maximum resident set size: 4864 pages
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------