%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA012-1 : 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 : n012.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:44 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.56s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 11 unt; 3 nHn; 24 RR)
% Number of literals : 59 ( 16 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 33 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(clsrel_Ring__and__Field_Oordered__field_58,axiom,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__field_58) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_1,c_times(X1,c_HOL_Oabs(v_c,t_a),t_a),t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Ring__and__Field_Ofield__class_Oaxioms__1_0,axiom,
( ~ class_Ring__and__Field_Ofield(X1)
| c_times(c_HOL_Oinverse(X2,X1),X2,X1) = c_1
| X2 = c_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Ring__and__Field_Ofield__class_Oaxioms__1_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__field(t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(cls_OrderedGroup_Oabs__0__eq_0,axiom,
( c_0 != c_HOL_Oabs(X2,X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| X2 = c_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__0__eq_0) ).
cnf(cls_conjecture_0,negated_conjecture,
v_c != c_0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(clsrel_Ring__and__Field_Oordered__field_47,axiom,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__field_47) ).
cnf(clsrel_Ring__and__Field_Oordered__field_0,axiom,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_Ring__and__Field_Ofield(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__field_0) ).
cnf(c_0_9,plain,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).
cnf(c_0_10,plain,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__field_58]) ).
cnf(c_0_11,plain,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
c_0_9 ).
cnf(c_0_12,plain,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_Orderings_Oorder(X1) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
~ c_lessequals(c_1,c_times(X1,c_HOL_Oabs(v_c,t_a),t_a),t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_14,plain,
( ~ class_Ring__and__Field_Ofield(X1)
| c_times(c_HOL_Oinverse(X2,X1),X2,X1) = c_1
| X2 = c_0 ),
inference(fof_simplification,[status(thm)],[cls_Ring__and__Field_Ofield__class_Oaxioms__1_0]) ).
cnf(c_0_15,plain,
( ~ class_Ring__and__Field_Oordered__field(X2)
| c_lessequals(X1,X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
class_Ring__and__Field_Oordered__field(t_a),
tfree_tcs ).
cnf(c_0_17,plain,
( c_0 != c_HOL_Oabs(X2,X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| X2 = c_0 ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__0__eq_0]) ).
cnf(c_0_18,negated_conjecture,
~ c_lessequals(c_1,c_times(X1,c_HOL_Oabs(v_c,t_a),t_a),t_a),
c_0_13 ).
cnf(c_0_19,plain,
( ~ class_Ring__and__Field_Ofield(X1)
| c_times(c_HOL_Oinverse(X2,X1),X2,X1) = c_1
| X2 = c_0 ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
c_lessequals(X1,X1,t_a),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
v_c != c_0,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_22,plain,
( c_0 != c_HOL_Oabs(X2,X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| X2 = c_0 ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( ~ class_Ring__and__Field_Ofield(t_a)
| c_HOL_Oabs(v_c,t_a) = c_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
v_c != c_0,
c_0_21 ).
cnf(c_0_25,plain,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_OrderedGroup_Olordered__ab__group__abs(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__field_47]) ).
cnf(c_0_26,negated_conjecture,
( ~ class_Ring__and__Field_Ofield(t_a)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_OrderedGroup_Olordered__ab__group__abs(X1) ),
c_0_25 ).
cnf(c_0_28,plain,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_Ring__and__Field_Ofield(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__field_0]) ).
cnf(c_0_29,negated_conjecture,
~ class_Ring__and__Field_Ofield(t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16])]) ).
cnf(c_0_30,plain,
( ~ class_Ring__and__Field_Oordered__field(X1)
| class_Ring__and__Field_Ofield(X1) ),
c_0_28 ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ANA012-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 13:23:06 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.38 Running first-order theorem proving
% 0.08/0.38 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.23/0.56 % Version: 3.5.1
% 0.23/0.56 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 % Starting sh5l with 300s (1) cores
% 0.23/0.56 % new_bool_1 with pid 2451319 completed with status 0
% 0.23/0.56 % Result found by new_bool_1
% 0.23/0.56 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.23/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.56 % SubtermCWHack with pid 2451321 completed with status 0
% 0.23/0.56 % Result found by SubtermCWHack
% 0.23/0.56 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.23/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.56 % Preprocessing time : 0.007 s
% 0.23/0.56
% 0.23/0.56 % Proof found!
% 0.23/0.56 % SZS status Unsatisfiable
% 0.23/0.56 % SZS output start CNFRefutation
% See solution above
% 0.23/0.56 % Parsed axioms : 2786
% 0.23/0.56 % Removed by relevancy pruning/SinE : 1668
% 0.23/0.56 % Initial clauses : 1118
% 0.23/0.56 % Removed in clause preprocessing : 0
% 0.23/0.56 % Initial clauses in saturation : 1118
% 0.23/0.56 % Processed clauses : 1334
% 0.23/0.56 % ...of these trivial : 14
% 0.23/0.56 % ...subsumed : 558
% 0.23/0.56 % ...remaining for further processing : 762
% 0.23/0.56 % Other redundant clauses eliminated : 28
% 0.23/0.56 % Clauses deleted for lack of memory : 0
% 0.23/0.56 % Backward-subsumed : 9
% 0.23/0.56 % Backward-rewritten : 8
% 0.23/0.56 % Generated clauses : 1646
% 0.23/0.56 % ...of the previous two non-redundant : 1185
% 0.23/0.56 % ...aggressively subsumed : 0
% 0.23/0.56 % Contextual simplify-reflections : 3
% 0.23/0.56 % Paramodulations : 1613
% 0.23/0.56 % Factorizations : 0
% 0.23/0.56 % NegExts : 0
% 0.23/0.56 % Equation resolutions : 33
% 0.23/0.56 % Disequality decompositions : 0
% 0.23/0.56 % Total rewrite steps : 722
% 0.23/0.56 % ...of those cached : 584
% 0.23/0.56 % Propositional unsat checks : 0
% 0.23/0.56 % Propositional check models : 0
% 0.23/0.56 % Propositional check unsatisfiable : 0
% 0.23/0.56 % Propositional clauses : 0
% 0.23/0.56 % Propositional clauses after purity: 0
% 0.23/0.56 % Propositional unsat core size : 0
% 0.23/0.56 % Propositional preprocessing time : 0.000
% 0.23/0.56 % Propositional encoding time : 0.000
% 0.23/0.56 % Propositional solver time : 0.000
% 0.23/0.56 % Success case prop preproc time : 0.000
% 0.23/0.56 % Success case prop encoding time : 0.000
% 0.23/0.56 % Success case prop solver time : 0.000
% 0.23/0.56 % Current number of processed clauses : 745
% 0.23/0.56 % Positive orientable unit clauses : 176
% 0.23/0.56 % Positive unorientable unit clauses: 0
% 0.23/0.56 % Negative unit clauses : 56
% 0.23/0.56 % Non-unit-clauses : 513
% 0.23/0.56 % Current number of unprocessed clauses: 966
% 0.23/0.56 % ...number of literals in the above : 2941
% 0.23/0.56 % Current number of archived formulas : 0
% 0.23/0.56 % Current number of archived clauses : 17
% 0.23/0.56 % Clause-clause subsumption calls (NU) : 107003
% 0.23/0.56 % Rec. Clause-clause subsumption calls : 105149
% 0.23/0.56 % Non-unit clause-clause subsumptions : 436
% 0.23/0.56 % Unit Clause-clause subsumption calls : 740
% 0.23/0.56 % Rewrite failures with RHS unbound : 0
% 0.23/0.56 % BW rewrite match attempts : 140
% 0.23/0.56 % BW rewrite match successes : 4
% 0.23/0.56 % Condensation attempts : 0
% 0.23/0.56 % Condensation successes : 0
% 0.23/0.56 % Termbank termtop insertions : 64403
% 0.23/0.56 % Search garbage collected termcells : 6566
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.070 s
% 0.23/0.56 % System time : 0.010 s
% 0.23/0.56 % Total time : 0.080 s
% 0.23/0.56 % Maximum resident set size: 6968 pages
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.098 s
% 0.23/0.56 % System time : 0.015 s
% 0.23/0.56 % Total time : 0.113 s
% 0.23/0.56 % Maximum resident set size: 6656 pages
% 0.23/0.56 % E exiting
%------------------------------------------------------------------------------