TSTP Solution File: ANA044-2 by E---3.1

View Problem - Process Solution

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

% Computer : n005.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:09 EDT 2023

% Result   : Unsatisfiable 0.22s 0.50s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  16 RR)
%            Number of literals    :   36 (   4 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   20 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
    c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',cls_conjecture_3) ).

cnf(cls_OrderedGroup_Oabs__of__nonneg_0,axiom,
    ( c_HOL_Oabs(X2,X1) = X2
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | ~ c_lessequals(c_0,X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',cls_OrderedGroup_Oabs__of__nonneg_0) ).

cnf(cls_Ring__and__Field_Omult__nonneg__nonneg_0,axiom,
    ( c_lessequals(c_0,c_times(X3,X2,X1),X1)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | ~ c_lessequals(c_0,X2,X1)
    | ~ c_lessequals(c_0,X3,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',cls_Ring__and__Field_Omult__nonneg__nonneg_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(c_0,v_l(X1,X2),t_b),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(c_0,v_h(X1),t_b),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',cls_conjecture_1) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_40,axiom,
    ( class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',clsrel_Ring__and__Field_Oordered__idom_40) ).

cnf(tfree_tcs,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    file('/export/starexec/sandbox/tmp/tmp.vJsMr44kWn/E---3.1_2561.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/tmp/tmp.vJsMr44kWn/E---3.1_2561.p',clsrel_Ring__and__Field_Oordered__idom_50) ).

cnf(c_0_8,negated_conjecture,
    c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b),
    cls_conjecture_3 ).

cnf(c_0_9,axiom,
    ( c_HOL_Oabs(X2,X1) = X2
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | ~ c_lessequals(c_0,X2,X1) ),
    cls_OrderedGroup_Oabs__of__nonneg_0 ).

cnf(c_0_10,negated_conjecture,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
    | ~ c_lessequals(c_0,c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    ( c_lessequals(c_0,c_times(X3,X2,X1),X1)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | ~ c_lessequals(c_0,X2,X1)
    | ~ c_lessequals(c_0,X3,X1) ),
    cls_Ring__and__Field_Omult__nonneg__nonneg_0 ).

cnf(c_0_12,negated_conjecture,
    c_lessequals(c_0,v_l(X1,X2),t_b),
    cls_conjecture_0 ).

cnf(c_0_13,negated_conjecture,
    c_lessequals(c_0,v_h(X1),t_b),
    cls_conjecture_1 ).

cnf(c_0_14,negated_conjecture,
    ( ~ class_Ring__and__Field_Opordered__cancel__semiring(t_b)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).

cnf(c_0_15,axiom,
    ( class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    clsrel_Ring__and__Field_Oordered__idom_40 ).

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

cnf(c_0_17,negated_conjecture,
    ~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_18,axiom,
    ( class_OrderedGroup_Olordered__ab__group__abs(X1)
    | ~ class_Ring__and__Field_Oordered__idom(X1) ),
    clsrel_Ring__and__Field_Oordered__idom_50 ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : ANA044-2 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n005.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Oct  2 15:06:16 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.22/0.49  Running first-order theorem proving
% 0.22/0.49  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/tmp/tmp.vJsMr44kWn/E---3.1_2561.p
% 0.22/0.50  # Version: 3.1pre001
% 0.22/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50  # Starting sh5l with 300s (1) cores
% 0.22/0.50  # new_bool_1 with pid 2650 completed with status 0
% 0.22/0.50  # Result found by new_bool_1
% 0.22/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50  # Search class: FHUSS-FFSF32-MFFFFFNN
% 0.22/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50  # SAT001_MinMin_p005000_rr_RG with pid 2657 completed with status 0
% 0.22/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50  # Search class: FHUSS-FFSF32-MFFFFFNN
% 0.22/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50  # Preprocessing time       : 0.001 s
% 0.22/0.50  # Presaturation interreduction done
% 0.22/0.50  
% 0.22/0.50  # Proof found!
% 0.22/0.50  # SZS status Unsatisfiable
% 0.22/0.50  # SZS output start CNFRefutation
% See solution above
% 0.22/0.50  # Parsed axioms                        : 8
% 0.22/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.50  # Initial clauses                      : 8
% 0.22/0.50  # Removed in clause preprocessing      : 0
% 0.22/0.50  # Initial clauses in saturation        : 8
% 0.22/0.50  # Processed clauses                    : 19
% 0.22/0.50  # ...of these trivial                  : 0
% 0.22/0.50  # ...subsumed                          : 0
% 0.22/0.50  # ...remaining for further processing  : 19
% 0.22/0.50  # Other redundant clauses eliminated   : 0
% 0.22/0.50  # Clauses deleted for lack of memory   : 0
% 0.22/0.50  # Backward-subsumed                    : 2
% 0.22/0.50  # Backward-rewritten                   : 0
% 0.22/0.50  # Generated clauses                    : 4
% 0.22/0.50  # ...of the previous two non-redundant : 3
% 0.22/0.50  # ...aggressively subsumed             : 0
% 0.22/0.50  # Contextual simplify-reflections      : 0
% 0.22/0.50  # Paramodulations                      : 4
% 0.22/0.50  # Factorizations                       : 0
% 0.22/0.50  # NegExts                              : 0
% 0.22/0.50  # Equation resolutions                 : 0
% 0.22/0.50  # Total rewrite steps                  : 4
% 0.22/0.50  # Propositional unsat checks           : 0
% 0.22/0.50  #    Propositional check models        : 0
% 0.22/0.50  #    Propositional check unsatisfiable : 0
% 0.22/0.50  #    Propositional clauses             : 0
% 0.22/0.50  #    Propositional clauses after purity: 0
% 0.22/0.50  #    Propositional unsat core size     : 0
% 0.22/0.50  #    Propositional preprocessing time  : 0.000
% 0.22/0.50  #    Propositional encoding time       : 0.000
% 0.22/0.50  #    Propositional solver time         : 0.000
% 0.22/0.50  #    Success case prop preproc time    : 0.000
% 0.22/0.50  #    Success case prop encoding time   : 0.000
% 0.22/0.50  #    Success case prop solver time     : 0.000
% 0.22/0.50  # Current number of processed clauses  : 9
% 0.22/0.50  #    Positive orientable unit clauses  : 3
% 0.22/0.50  #    Positive unorientable unit clauses: 0
% 0.22/0.50  #    Negative unit clauses             : 2
% 0.22/0.50  #    Non-unit-clauses                  : 4
% 0.22/0.50  # Current number of unprocessed clauses: 0
% 0.22/0.50  # ...number of literals in the above   : 0
% 0.22/0.50  # Current number of archived formulas  : 0
% 0.22/0.50  # Current number of archived clauses   : 10
% 0.22/0.50  # Clause-clause subsumption calls (NU) : 13
% 0.22/0.50  # Rec. Clause-clause subsumption calls : 11
% 0.22/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.50  # Unit Clause-clause subsumption calls : 2
% 0.22/0.50  # Rewrite failures with RHS unbound    : 0
% 0.22/0.50  # BW rewrite match attempts            : 0
% 0.22/0.50  # BW rewrite match successes           : 0
% 0.22/0.50  # Condensation attempts                : 0
% 0.22/0.50  # Condensation successes               : 0
% 0.22/0.50  # Termbank termtop insertions          : 282
% 0.22/0.50  
% 0.22/0.50  # -------------------------------------------------
% 0.22/0.50  # User time                : 0.003 s
% 0.22/0.50  # System time              : 0.001 s
% 0.22/0.50  # Total time               : 0.004 s
% 0.22/0.50  # Maximum resident set size: 1692 pages
% 0.22/0.50  
% 0.22/0.50  # -------------------------------------------------
% 0.22/0.50  # User time                : 0.006 s
% 0.22/0.50  # System time              : 0.002 s
% 0.22/0.50  # Total time               : 0.007 s
% 0.22/0.50  # Maximum resident set size: 1680 pages
% 0.22/0.50  % E---3.1 exiting
% 0.22/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------