TSTP Solution File: ANA027-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ANA027-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:38:06 EDT 2024
% Result : Unsatisfiable 14.36s 2.40s
% Output : CNFRefutation 14.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 53 ( 13 unt; 5 nHn; 43 RR)
% Number of literals : 115 ( 5 equ; 67 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0,axiom,
( c_plus(c_0,X2,X1) = X2
| ~ class_OrderedGroup_Ocomm__monoid__add(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_23,axiom,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_23) ).
cnf(cls_Orderings_Olinorder__not__le_0,axiom,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_OrderedGroup_Ocompare__rls__9_0,axiom,
( c_lessequals(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_minus(X3,X4,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_0) ).
cnf(cls_Orderings_Olinorder__not__le_1,axiom,
( ~ class_Orderings_Olinorder(X1)
| ~ c_less(X2,X3,X1)
| ~ c_lessequals(X3,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_1) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_g(v_x),v_k(v_x),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(clsrel_Orderings_Olinorder_4,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Orderings_Olinorder_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).
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_OrderedGroup_Ocompare__rls__6_0,axiom,
( c_less(X2,c_plus(X4,X3,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(c_minus(X2,X3,X1),X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__6_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(c_0_14,plain,
( c_plus(c_0,X2,X1) = X2
| ~ class_OrderedGroup_Ocomm__monoid__add(X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0]) ).
cnf(c_0_15,plain,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_23]) ).
cnf(c_0_16,plain,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_0]) ).
cnf(c_0_17,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).
cnf(c_0_18,plain,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).
cnf(c_0_19,plain,
( c_lessequals(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_minus(X3,X4,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocompare__rls__9_0]) ).
cnf(c_0_20,plain,
( c_plus(c_0,X2,X1) = X2
| ~ class_OrderedGroup_Ocomm__monoid__add(X1) ),
c_0_14 ).
cnf(c_0_21,plain,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_15 ).
cnf(c_0_22,plain,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
c_0_16 ).
cnf(c_0_23,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_17 ).
cnf(c_0_24,plain,
( ~ class_Orderings_Olinorder(X1)
| ~ c_less(X2,X3,X1)
| ~ c_lessequals(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_1]) ).
cnf(c_0_25,plain,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
c_lessequals(v_g(v_x),v_k(v_x),t_b),
cls_conjecture_2 ).
cnf(c_0_27,plain,
( class_Orderings_Oorder(X1)
| ~ class_Orderings_Olinorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Orderings_Olinorder_4]) ).
cnf(c_0_28,plain,
( c_lessequals(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_minus(X3,X4,X1),X1) ),
c_0_19 ).
cnf(c_0_29,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
cls_conjecture_1 ).
cnf(c_0_30,plain,
( c_plus(c_0,X1,X2) = X1
| ~ class_Ring__and__Field_Oordered__idom(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_32,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_33,plain,
( c_less(X1,X2,X3)
| c_lessequals(X2,X1,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_34,plain,
( ~ class_Orderings_Olinorder(X1)
| ~ c_less(X2,X3,X1)
| ~ c_lessequals(X3,X2,X1) ),
c_0_24 ).
cnf(c_0_35,negated_conjecture,
( c_lessequals(v_g(v_x),X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(v_k(v_x),X1,t_b) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,plain,
( class_Orderings_Oorder(X1)
| ~ class_Orderings_Olinorder(X1) ),
c_0_27 ).
cnf(c_0_37,negated_conjecture,
( c_lessequals(c_plus(c_0,v_k(v_x),t_b),v_f(v_x),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
c_plus(c_0,X1,t_b) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( c_less(X2,c_plus(X4,X3,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(c_minus(X2,X3,X1),X4,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocompare__rls__6_0]) ).
cnf(c_0_40,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
c_0_32 ).
cnf(c_0_41,negated_conjecture,
( c_less(X1,X2,t_b)
| c_lessequals(X2,X1,t_b) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_42,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ c_less(X1,v_g(v_x),t_b)
| ~ c_lessequals(v_k(v_x),X1,t_b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( c_lessequals(v_k(v_x),v_f(v_x),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( c_less(X2,c_plus(X4,X3,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(c_minus(X2,X3,X1),X4,X1) ),
c_0_39 ).
cnf(c_0_45,negated_conjecture,
c_less(c_minus(v_f(v_x),v_g(v_x),t_b),c_0,t_b),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ class_Orderings_Olinorder(t_b)
| ~ c_less(v_f(v_x),v_g(v_x),t_b) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( c_less(v_f(v_x),v_g(v_x),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_38]) ).
cnf(c_0_48,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_54]) ).
cnf(c_0_49,negated_conjecture,
( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_48 ).
cnf(c_0_51,negated_conjecture,
~ class_Orderings_Olinorder(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_31])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_23]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA027-1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:48:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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
% 14.36/2.40 # Version: 3.1.0
% 14.36/2.40 # Preprocessing class: FMLMSMSMSSSNFFN.
% 14.36/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.36/2.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.36/2.40 # Starting new_bool_3 with 300s (1) cores
% 14.36/2.40 # Starting new_bool_1 with 300s (1) cores
% 14.36/2.40 # Starting sh5l with 300s (1) cores
% 14.36/2.40 # sh5l with pid 11654 completed with status 0
% 14.36/2.40 # Result found by sh5l
% 14.36/2.40 # Preprocessing class: FMLMSMSMSSSNFFN.
% 14.36/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.36/2.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.36/2.40 # Starting new_bool_3 with 300s (1) cores
% 14.36/2.40 # Starting new_bool_1 with 300s (1) cores
% 14.36/2.40 # Starting sh5l with 300s (1) cores
% 14.36/2.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 14.36/2.40 # Search class: FGHSM-SMLM32-DFFFFFNN
% 14.36/2.40 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 14.36/2.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 14.36/2.40 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 11657 completed with status 0
% 14.36/2.40 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 14.36/2.40 # Preprocessing class: FMLMSMSMSSSNFFN.
% 14.36/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.36/2.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.36/2.40 # Starting new_bool_3 with 300s (1) cores
% 14.36/2.40 # Starting new_bool_1 with 300s (1) cores
% 14.36/2.40 # Starting sh5l with 300s (1) cores
% 14.36/2.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 14.36/2.40 # Search class: FGHSM-SMLM32-DFFFFFNN
% 14.36/2.40 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 14.36/2.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 14.36/2.40 # Preprocessing time : 0.026 s
% 14.36/2.40 # Presaturation interreduction done
% 14.36/2.40
% 14.36/2.40 # Proof found!
% 14.36/2.40 # SZS status Unsatisfiable
% 14.36/2.40 # SZS output start CNFRefutation
% See solution above
% 14.36/2.40 # Parsed axioms : 2809
% 14.36/2.40 # Removed by relevancy pruning/SinE : 267
% 14.36/2.40 # Initial clauses : 2542
% 14.36/2.40 # Removed in clause preprocessing : 1
% 14.36/2.40 # Initial clauses in saturation : 2541
% 14.36/2.40 # Processed clauses : 17631
% 14.36/2.40 # ...of these trivial : 98
% 14.36/2.40 # ...subsumed : 10597
% 14.36/2.40 # ...remaining for further processing : 6936
% 14.36/2.40 # Other redundant clauses eliminated : 417
% 14.36/2.40 # Clauses deleted for lack of memory : 0
% 14.36/2.40 # Backward-subsumed : 295
% 14.36/2.40 # Backward-rewritten : 267
% 14.36/2.40 # Generated clauses : 60937
% 14.36/2.40 # ...of the previous two non-redundant : 53989
% 14.36/2.40 # ...aggressively subsumed : 0
% 14.36/2.40 # Contextual simplify-reflections : 77
% 14.36/2.40 # Paramodulations : 60478
% 14.36/2.40 # Factorizations : 5
% 14.36/2.40 # NegExts : 0
% 14.36/2.40 # Equation resolutions : 454
% 14.36/2.40 # Disequality decompositions : 0
% 14.36/2.40 # Total rewrite steps : 26412
% 14.36/2.40 # ...of those cached : 24625
% 14.36/2.40 # Propositional unsat checks : 1
% 14.36/2.40 # Propositional check models : 1
% 14.36/2.40 # Propositional check unsatisfiable : 0
% 14.36/2.40 # Propositional clauses : 0
% 14.36/2.40 # Propositional clauses after purity: 0
% 14.36/2.40 # Propositional unsat core size : 0
% 14.36/2.40 # Propositional preprocessing time : 0.000
% 14.36/2.40 # Propositional encoding time : 0.021
% 14.36/2.40 # Propositional solver time : 0.018
% 14.36/2.40 # Success case prop preproc time : 0.000
% 14.36/2.40 # Success case prop encoding time : 0.000
% 14.36/2.40 # Success case prop solver time : 0.000
% 14.36/2.40 # Current number of processed clauses : 3940
% 14.36/2.40 # Positive orientable unit clauses : 562
% 14.36/2.40 # Positive unorientable unit clauses: 8
% 14.36/2.40 # Negative unit clauses : 198
% 14.36/2.40 # Non-unit-clauses : 3172
% 14.36/2.40 # Current number of unprocessed clauses: 39410
% 14.36/2.40 # ...number of literals in the above : 147105
% 14.36/2.40 # Current number of archived formulas : 0
% 14.36/2.40 # Current number of archived clauses : 2996
% 14.36/2.40 # Clause-clause subsumption calls (NU) : 8478082
% 14.36/2.40 # Rec. Clause-clause subsumption calls : 4712521
% 14.36/2.40 # Non-unit clause-clause subsumptions : 6496
% 14.36/2.40 # Unit Clause-clause subsumption calls : 82042
% 14.36/2.40 # Rewrite failures with RHS unbound : 0
% 14.36/2.40 # BW rewrite match attempts : 1489
% 14.36/2.40 # BW rewrite match successes : 117
% 14.36/2.40 # Condensation attempts : 0
% 14.36/2.40 # Condensation successes : 0
% 14.36/2.40 # Termbank termtop insertions : 1065220
% 14.36/2.40 # Search garbage collected termcells : 4740
% 14.36/2.40
% 14.36/2.40 # -------------------------------------------------
% 14.36/2.40 # User time : 1.770 s
% 14.36/2.40 # System time : 0.043 s
% 14.36/2.40 # Total time : 1.814 s
% 14.36/2.40 # Maximum resident set size: 7040 pages
% 14.36/2.40
% 14.36/2.40 # -------------------------------------------------
% 14.36/2.40 # User time : 1.834 s
% 14.36/2.40 # System time : 0.047 s
% 14.36/2.40 # Total time : 1.880 s
% 14.36/2.40 # Maximum resident set size: 3508 pages
% 14.36/2.40 % E---3.1 exiting
% 14.36/2.40 % E exiting
%------------------------------------------------------------------------------