TSTP Solution File: ANA027-2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ANA027-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n004.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 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   46 (  11 unt;   0 nHn;  43 RR)
%            Number of literals    :  101 (   3 equ;  62 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   :   65 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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_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/theBenchmark.p',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).

cnf(cls_OrderedGroup_Ocompare__rls__9_1,axiom,
    ( c_lessequals(X2,c_minus(X4,X3,X1),X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ c_lessequals(c_plus(X2,X3,X1),X4,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_1) ).

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_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_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(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(clsrel_LOrder_Ojoin__semilorder_1,axiom,
    ( class_Orderings_Oorder(X1)
    | ~ class_LOrder_Ojoin__semilorder(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_LOrder_Ojoin__semilorder_1) ).

cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_15,axiom,
    ( class_LOrder_Ojoin__semilorder(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_OrderedGroup_Olordered__ab__group__abs_15) ).

cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_1,axiom,
    ( class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_OrderedGroup_Olordered__ab__group__abs_1) ).

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/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_23) ).

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_50,axiom,
    ( class_OrderedGroup_Olordered__ab__group__abs(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_50) ).

cnf(c_0_13,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_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,
    ( c_lessequals(X2,c_minus(X4,X3,X1),X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ c_lessequals(c_plus(X2,X3,X1),X4,X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ocompare__rls__9_1]) ).

cnf(c_0_16,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_17,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_13 ).

cnf(c_0_18,plain,
    ( c_plus(c_0,X2,X1) = X2
    | ~ class_OrderedGroup_Ocomm__monoid__add(X1) ),
    c_0_14 ).

cnf(c_0_19,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_20,plain,
    ( c_lessequals(X2,c_minus(X4,X3,X1),X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ c_lessequals(c_plus(X2,X3,X1),X4,X1) ),
    c_0_15 ).

cnf(c_0_21,plain,
    ( c_lessequals(X4,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ c_lessequals(X4,X2,X1) ),
    c_0_16 ).

cnf(c_0_22,negated_conjecture,
    c_lessequals(v_g(v_x),v_k(v_x),t_b),
    cls_conjecture_2 ).

cnf(c_0_23,plain,
    ( c_lessequals(X1,X2,X3)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X3)
    | ~ class_OrderedGroup_Ocomm__monoid__add(X3)
    | ~ c_lessequals(c_0,c_minus(X2,X1,X3),X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,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_25,negated_conjecture,
    ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    c_0_19 ).

cnf(c_0_26,plain,
    ( c_lessequals(c_0,c_minus(X1,X2,X3),X3)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X3)
    | ~ class_OrderedGroup_Ocomm__monoid__add(X3)
    | ~ c_lessequals(X2,X1,X3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_18]) ).

cnf(c_0_27,plain,
    ( class_Orderings_Oorder(X1)
    | ~ class_LOrder_Ojoin__semilorder(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_LOrder_Ojoin__semilorder_1]) ).

cnf(c_0_28,plain,
    ( class_LOrder_Ojoin__semilorder(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_OrderedGroup_Olordered__ab__group__abs_15]) ).

cnf(c_0_29,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_21,c_0_22]) ).

cnf(c_0_30,negated_conjecture,
    ( c_lessequals(v_k(v_x),v_f(v_x),t_b)
    | ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | ~ class_OrderedGroup_Ocomm__monoid__add(t_b) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | ~ class_OrderedGroup_Ocomm__monoid__add(t_b)
    | ~ c_lessequals(v_g(v_x),v_f(v_x),t_b) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    ( class_Orderings_Oorder(X1)
    | ~ class_LOrder_Ojoin__semilorder(X1) ),
    c_0_27 ).

cnf(c_0_33,plain,
    ( class_LOrder_Ojoin__semilorder(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    c_0_28 ).

cnf(c_0_34,plain,
    ( class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_OrderedGroup_Olordered__ab__group__abs_1]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ class_Orderings_Oorder(t_b)
    | ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | ~ class_OrderedGroup_Ocomm__monoid__add(t_b) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_36,plain,
    ( class_Orderings_Oorder(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,plain,
    ( class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    c_0_34 ).

cnf(c_0_38,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_39,negated_conjecture,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
    | ~ class_OrderedGroup_Ocomm__monoid__add(t_b) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_40,plain,
    ( class_OrderedGroup_Ocomm__monoid__add(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    c_0_38 ).

cnf(c_0_41,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    tfree_tcs ).

cnf(c_0_42,plain,
    ( class_OrderedGroup_Olordered__ab__group__abs(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_50]) ).

cnf(c_0_43,negated_conjecture,
    ~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).

cnf(c_0_44,plain,
    ( class_OrderedGroup_Olordered__ab__group__abs(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    c_0_42 ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_41])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : ANA027-2 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon May 20 08:00:07 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.46  Running first-order theorem proving
% 0.18/0.46  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.18/0.47  # Version: 3.1.0
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # sh5l with pid 14630 completed with status 0
% 0.18/0.47  # Result found by sh5l
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.47  # Search class: FHUSF-FFSS31-SFFFFFNN
% 0.18/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47  # SAT001_MinMin_p005000_rr_RG with pid 14638 completed with status 0
% 0.18/0.47  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.47  # Search class: FHUSF-FFSS31-SFFFFFNN
% 0.18/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47  # Preprocessing time       : 0.001 s
% 0.18/0.47  # Presaturation interreduction done
% 0.18/0.47  
% 0.18/0.47  # Proof found!
% 0.18/0.47  # SZS status Unsatisfiable
% 0.18/0.47  # SZS output start CNFRefutation
% See solution above
% 0.18/0.47  # Parsed axioms                        : 13
% 0.18/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.47  # Initial clauses                      : 13
% 0.18/0.47  # Removed in clause preprocessing      : 0
% 0.18/0.47  # Initial clauses in saturation        : 13
% 0.18/0.47  # Processed clauses                    : 36
% 0.18/0.47  # ...of these trivial                  : 0
% 0.18/0.47  # ...subsumed                          : 0
% 0.18/0.47  # ...remaining for further processing  : 36
% 0.18/0.47  # Other redundant clauses eliminated   : 0
% 0.18/0.47  # Clauses deleted for lack of memory   : 0
% 0.18/0.47  # Backward-subsumed                    : 1
% 0.18/0.47  # Backward-rewritten                   : 0
% 0.18/0.47  # Generated clauses                    : 17
% 0.18/0.47  # ...of the previous two non-redundant : 14
% 0.18/0.47  # ...aggressively subsumed             : 0
% 0.18/0.47  # Contextual simplify-reflections      : 2
% 0.18/0.47  # Paramodulations                      : 17
% 0.18/0.47  # Factorizations                       : 0
% 0.18/0.47  # NegExts                              : 0
% 0.18/0.47  # Equation resolutions                 : 0
% 0.18/0.47  # Disequality decompositions           : 0
% 0.18/0.47  # Total rewrite steps                  : 2
% 0.18/0.47  # ...of those cached                   : 1
% 0.18/0.47  # Propositional unsat checks           : 0
% 0.18/0.47  #    Propositional check models        : 0
% 0.18/0.47  #    Propositional check unsatisfiable : 0
% 0.18/0.47  #    Propositional clauses             : 0
% 0.18/0.47  #    Propositional clauses after purity: 0
% 0.18/0.47  #    Propositional unsat core size     : 0
% 0.18/0.47  #    Propositional preprocessing time  : 0.000
% 0.18/0.47  #    Propositional encoding time       : 0.000
% 0.18/0.47  #    Propositional solver time         : 0.000
% 0.18/0.47  #    Success case prop preproc time    : 0.000
% 0.18/0.47  #    Success case prop encoding time   : 0.000
% 0.18/0.47  #    Success case prop solver time     : 0.000
% 0.18/0.47  # Current number of processed clauses  : 22
% 0.18/0.47  #    Positive orientable unit clauses  : 3
% 0.18/0.47  #    Positive unorientable unit clauses: 0
% 0.18/0.47  #    Negative unit clauses             : 2
% 0.18/0.47  #    Non-unit-clauses                  : 17
% 0.18/0.47  # Current number of unprocessed clauses: 4
% 0.18/0.47  # ...number of literals in the above   : 19
% 0.18/0.47  # Current number of archived formulas  : 0
% 0.18/0.47  # Current number of archived clauses   : 14
% 0.18/0.47  # Clause-clause subsumption calls (NU) : 56
% 0.18/0.47  # Rec. Clause-clause subsumption calls : 46
% 0.18/0.47  # Non-unit clause-clause subsumptions  : 2
% 0.18/0.47  # Unit Clause-clause subsumption calls : 1
% 0.18/0.47  # Rewrite failures with RHS unbound    : 0
% 0.18/0.47  # BW rewrite match attempts            : 0
% 0.18/0.47  # BW rewrite match successes           : 0
% 0.18/0.47  # Condensation attempts                : 0
% 0.18/0.47  # Condensation successes               : 0
% 0.18/0.47  # Termbank termtop insertions          : 632
% 0.18/0.47  # Search garbage collected termcells   : 30
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.004 s
% 0.18/0.47  # System time              : 0.001 s
% 0.18/0.47  # Total time               : 0.005 s
% 0.18/0.47  # Maximum resident set size: 1604 pages
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.005 s
% 0.18/0.47  # System time              : 0.004 s
% 0.18/0.47  # Total time               : 0.008 s
% 0.18/0.47  # Maximum resident set size: 1692 pages
% 0.18/0.47  % E---3.1 exiting
% 0.18/0.47  % E exiting
%------------------------------------------------------------------------------