TSTP Solution File: ANA023-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : ANA023-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:16:23 EDT 2023

% Result   : Unsatisfiable 10.53s 1.99s
% Output   : CNFRefutation 10.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  11 unt;   0 nHn;  24 RR)
%            Number of literals    :   50 (   2 equ;  27 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   31 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.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/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',cls_conjecture_1) ).

cnf(cls_OrderedGroup_Ocompare__rls__8_1,axiom,
    ( c_lessequals(c_minus(X2,X4,X1),X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ c_lessequals(X2,c_plus(X3,X4,X1),X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',cls_OrderedGroup_Ocompare__rls__8_1) ).

cnf(clsrel_OrderedGroup_Opordered__ab__group__add_10,axiom,
    ( class_Orderings_Oorder(X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',clsrel_OrderedGroup_Opordered__ab__group__add_10) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
    ( class_OrderedGroup_Oab__group__add(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',clsrel_Ring__and__Field_Oordered__idom_4) ).

cnf(tfree_tcs,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    file('/export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',tfree_tcs) ).

cnf(cls_OrderedGroup_Ocompare__rls__10_0,axiom,
    ( X2 = c_plus(c_minus(X2,X3,X1),X3,X1)
    | ~ class_OrderedGroup_Oab__group__add(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',cls_OrderedGroup_Ocompare__rls__10_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/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',cls_conjecture_3) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(v_k(v_x),v_f(v_x),t_b),
    file('/export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',cls_conjecture_2) ).

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/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p',clsrel_Ring__and__Field_Oordered__idom_54) ).

cnf(c_0_10,axiom,
    ( c_lessequals(X4,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ c_lessequals(X4,X2,X1) ),
    cls_Orderings_Oorder__class_Oorder__trans_0 ).

cnf(c_0_11,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_12,negated_conjecture,
    ( c_lessequals(c_0,X1,t_b)
    | ~ class_Orderings_Oorder(t_b)
    | ~ c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),X1,t_b) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    ( c_lessequals(c_minus(X2,X4,X1),X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ c_lessequals(X2,c_plus(X3,X4,X1),X1) ),
    cls_OrderedGroup_Ocompare__rls__8_1 ).

cnf(c_0_14,axiom,
    ( class_Orderings_Oorder(X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1) ),
    clsrel_OrderedGroup_Opordered__ab__group__add_10 ).

cnf(c_0_15,axiom,
    ( class_OrderedGroup_Oab__group__add(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    clsrel_Ring__and__Field_Oordered__idom_4 ).

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

cnf(c_0_17,negated_conjecture,
    ( c_lessequals(c_0,X1,t_b)
    | ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | ~ c_lessequals(v_k(v_x),c_plus(X1,v_g(v_x),t_b),t_b) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_18,axiom,
    ( X2 = c_plus(c_minus(X2,X3,X1),X3,X1)
    | ~ class_OrderedGroup_Oab__group__add(X1) ),
    cls_OrderedGroup_Ocompare__rls__10_0 ).

cnf(c_0_19,negated_conjecture,
    class_OrderedGroup_Oab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    cls_conjecture_3 ).

cnf(c_0_21,negated_conjecture,
    ( c_lessequals(c_0,c_minus(X1,v_g(v_x),t_b),t_b)
    | ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | ~ c_lessequals(v_k(v_x),X1,t_b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

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

cnf(c_0_23,negated_conjecture,
    ~ class_OrderedGroup_Opordered__ab__group__add(t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_24,axiom,
    ( class_OrderedGroup_Opordered__ab__group__add(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    clsrel_Ring__and__Field_Oordered__idom_54 ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : ANA023-1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n017.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 14:36:26 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.44/0.62  Running first-order model finding
% 0.44/0.62  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.LZZRp62Tuf/E---3.1_5353.p
% 10.53/1.99  # Version: 3.1pre001
% 10.53/1.99  # Preprocessing class: FMLMSMSMSSSNFFN.
% 10.53/1.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.53/1.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.53/1.99  # Starting new_bool_3 with 300s (1) cores
% 10.53/1.99  # Starting new_bool_1 with 300s (1) cores
% 10.53/1.99  # Starting sh5l with 300s (1) cores
% 10.53/1.99  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5430 completed with status 0
% 10.53/1.99  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.53/1.99  # Preprocessing class: FMLMSMSMSSSNFFN.
% 10.53/1.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.53/1.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.53/1.99  # No SInE strategy applied
% 10.53/1.99  # Search class: FGHSM-SMLM32-DFFFFFNN
% 10.53/1.99  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 10.53/1.99  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 10.53/1.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.53/1.99  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 10.53/1.99  # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 10.53/1.99  # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 10.53/1.99  # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 5439 completed with status 0
% 10.53/1.99  # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 10.53/1.99  # Preprocessing class: FMLMSMSMSSSNFFN.
% 10.53/1.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.53/1.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.53/1.99  # No SInE strategy applied
% 10.53/1.99  # Search class: FGHSM-SMLM32-DFFFFFNN
% 10.53/1.99  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 10.53/1.99  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 10.53/1.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.53/1.99  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 10.53/1.99  # Preprocessing time       : 0.023 s
% 10.53/1.99  
% 10.53/1.99  # Proof found!
% 10.53/1.99  # SZS status Unsatisfiable
% 10.53/1.99  # SZS output start CNFRefutation
% See solution above
% 10.53/1.99  # Parsed axioms                        : 2809
% 10.53/1.99  # Removed by relevancy pruning/SinE    : 0
% 10.53/1.99  # Initial clauses                      : 2809
% 10.53/1.99  # Removed in clause preprocessing      : 9
% 10.53/1.99  # Initial clauses in saturation        : 2800
% 10.53/1.99  # Processed clauses                    : 6242
% 10.53/1.99  # ...of these trivial                  : 104
% 10.53/1.99  # ...subsumed                          : 2866
% 10.53/1.99  # ...remaining for further processing  : 3272
% 10.53/1.99  # Other redundant clauses eliminated   : 300
% 10.53/1.99  # Clauses deleted for lack of memory   : 0
% 10.53/1.99  # Backward-subsumed                    : 32
% 10.53/1.99  # Backward-rewritten                   : 72
% 10.53/1.99  # Generated clauses                    : 35488
% 10.53/1.99  # ...of the previous two non-redundant : 29372
% 10.53/1.99  # ...aggressively subsumed             : 0
% 10.53/1.99  # Contextual simplify-reflections      : 36
% 10.53/1.99  # Paramodulations                      : 35136
% 10.53/1.99  # Factorizations                       : 3
% 10.53/1.99  # NegExts                              : 0
% 10.53/1.99  # Equation resolutions                 : 349
% 10.53/1.99  # Total rewrite steps                  : 18570
% 10.53/1.99  # Propositional unsat checks           : 0
% 10.53/1.99  #    Propositional check models        : 0
% 10.53/1.99  #    Propositional check unsatisfiable : 0
% 10.53/1.99  #    Propositional clauses             : 0
% 10.53/1.99  #    Propositional clauses after purity: 0
% 10.53/1.99  #    Propositional unsat core size     : 0
% 10.53/1.99  #    Propositional preprocessing time  : 0.000
% 10.53/1.99  #    Propositional encoding time       : 0.000
% 10.53/1.99  #    Propositional solver time         : 0.000
% 10.53/1.99  #    Success case prop preproc time    : 0.000
% 10.53/1.99  #    Success case prop encoding time   : 0.000
% 10.53/1.99  #    Success case prop solver time     : 0.000
% 10.53/1.99  # Current number of processed clauses  : 3168
% 10.53/1.99  #    Positive orientable unit clauses  : 645
% 10.53/1.99  #    Positive unorientable unit clauses: 16
% 10.53/1.99  #    Negative unit clauses             : 137
% 10.53/1.99  #    Non-unit-clauses                  : 2370
% 10.53/1.99  # Current number of unprocessed clauses: 25813
% 10.53/1.99  # ...number of literals in the above   : 94938
% 10.53/1.99  # Current number of archived formulas  : 0
% 10.53/1.99  # Current number of archived clauses   : 112
% 10.53/1.99  # Clause-clause subsumption calls (NU) : 3006274
% 10.53/1.99  # Rec. Clause-clause subsumption calls : 1569972
% 10.53/1.99  # Non-unit clause-clause subsumptions  : 1635
% 10.53/1.99  # Unit Clause-clause subsumption calls : 99646
% 10.53/1.99  # Rewrite failures with RHS unbound    : 2
% 10.53/1.99  # BW rewrite match attempts            : 1085
% 10.53/1.99  # BW rewrite match successes           : 59
% 10.53/1.99  # Condensation attempts                : 0
% 10.53/1.99  # Condensation successes               : 0
% 10.53/1.99  # Termbank termtop insertions          : 600126
% 10.53/1.99  
% 10.53/1.99  # -------------------------------------------------
% 10.53/1.99  # User time                : 1.241 s
% 10.53/1.99  # System time              : 0.044 s
% 10.53/1.99  # Total time               : 1.285 s
% 10.53/1.99  # Maximum resident set size: 6440 pages
% 10.53/1.99  
% 10.53/1.99  # -------------------------------------------------
% 10.53/1.99  # User time                : 6.118 s
% 10.53/1.99  # System time              : 0.151 s
% 10.53/1.99  # Total time               : 6.269 s
% 10.53/1.99  # Maximum resident set size: 3528 pages
% 10.53/1.99  % E---3.1 exiting
%------------------------------------------------------------------------------