↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ANA039-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n002.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:51 PM UTC 2026

% Result   : Unsatisfiable 0.32s 0.61s
% Output   : CNFRefutation 0.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (   9 unt;   0 nHn;  26 RR)
%            Number of literals    :   75 (   0 equ;  47 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   51 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
    ( ~ c_lessequals(X4,X2,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X4,X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(c_HOL_Oabs(v_h(X1),t_a),c_times(v_c,c_HOL_Oabs(v_f(X1),t_a),t_a),t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom,
    ( ~ c_lessequals(c_0,X4,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Ring__and__Field_Opordered__semiring(X1)
    | c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0) ).

cnf(clsrel_Ring__and__Field_Opordered__semiring_10,axiom,
    ( ~ class_Ring__and__Field_Opordered__semiring(X1)
    | class_Orderings_Oorder(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Opordered__semiring_10) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_h(v_x),t_a),c_times(c_HOL_Oabs(v_c,t_a),c_HOL_Oabs(v_f(v_x),t_a),t_a),t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Oabs__ge__zero_0) ).

cnf(cls_OrderedGroup_Oabs__ge__self_0,axiom,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(X2,c_HOL_Oabs(X2,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_OrderedGroup_Oabs__ge__self_0) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_50) ).

cnf(tfree_tcs,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Ring__and__Field_Opordered__semiring(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_42) ).

cnf(c_0_10,plain,
    ( ~ c_lessequals(X4,X2,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X4,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).

cnf(c_0_11,plain,
    ( ~ c_lessequals(X4,X2,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X4,X3,X1) ),
    c_0_10 ).

cnf(c_0_12,negated_conjecture,
    c_lessequals(c_HOL_Oabs(v_h(X1),t_a),c_times(v_c,c_HOL_Oabs(v_f(X1),t_a),t_a),t_a),
    cls_conjecture_0 ).

cnf(c_0_13,plain,
    ( ~ c_lessequals(c_0,X4,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Ring__and__Field_Opordered__semiring(X1)
    | c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0]) ).

cnf(c_0_14,plain,
    ( ~ class_Ring__and__Field_Opordered__semiring(X1)
    | class_Orderings_Oorder(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Opordered__semiring_10]) ).

cnf(c_0_15,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_h(v_x),t_a),c_times(c_HOL_Oabs(v_c,t_a),c_HOL_Oabs(v_f(v_x),t_a),t_a),t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ c_lessequals(c_times(v_c,c_HOL_Oabs(v_f(X1),t_a),t_a),X2,t_a)
    | ~ class_Orderings_Oorder(t_a)
    | c_lessequals(c_HOL_Oabs(v_h(X1),t_a),X2,t_a) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,plain,
    ( ~ c_lessequals(c_0,X4,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Ring__and__Field_Opordered__semiring(X1)
    | c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1) ),
    c_0_13 ).

cnf(c_0_18,plain,
    ( ~ class_Ring__and__Field_Opordered__semiring(X1)
    | class_Orderings_Oorder(X1) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_h(v_x),t_a),c_times(c_HOL_Oabs(v_c,t_a),c_HOL_Oabs(v_f(v_x),t_a),t_a),t_a),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    ( ~ c_lessequals(v_c,X2,t_a)
    | ~ c_lessequals(c_0,c_HOL_Oabs(v_f(X1),t_a),t_a)
    | ~ class_Ring__and__Field_Opordered__semiring(t_a)
    | c_lessequals(c_HOL_Oabs(v_h(X1),t_a),c_times(X2,c_HOL_Oabs(v_f(X1),t_a),t_a),t_a) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_21,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__ge__zero_0]) ).

cnf(c_0_22,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(X2,c_HOL_Oabs(X2,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__ge__self_0]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ c_lessequals(v_c,c_HOL_Oabs(v_c,t_a),t_a)
    | ~ c_lessequals(c_0,c_HOL_Oabs(v_f(v_x),t_a),t_a)
    | ~ class_Ring__and__Field_Opordered__semiring(t_a) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
    c_0_21 ).

cnf(c_0_25,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(X2,c_HOL_Oabs(X2,X1),X1) ),
    c_0_22 ).

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

cnf(c_0_27,negated_conjecture,
    ( ~ class_Ring__and__Field_Opordered__semiring(t_a)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(t_a) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

cnf(c_0_28,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    c_0_26 ).

cnf(c_0_29,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_a),
    tfree_tcs ).

cnf(c_0_30,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Ring__and__Field_Opordered__semiring(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_42]) ).

cnf(c_0_31,negated_conjecture,
    ~ class_Ring__and__Field_Opordered__semiring(t_a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

cnf(c_0_32,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Ring__and__Field_Opordered__semiring(X1) ),
    c_0_30 ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ANA039-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n002.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 13:28:48 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.32/0.61  % Version: 3.5.1
% 0.32/0.61  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.32/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.32/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.32/0.61  % Starting sh5l with 300s (1) cores
% 0.32/0.61  % new_bool_3 with pid 3385786 completed with status 0
% 0.32/0.61  % Result found by new_bool_3
% 0.32/0.61  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.32/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.32/0.61  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.61  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.61  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.32/0.61  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.61  % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.61  % SubtermCWHack with pid 3385794 completed with status 0
% 0.32/0.61  % Result found by SubtermCWHack
% 0.32/0.61  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.32/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.32/0.61  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.61  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.61  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.32/0.61  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.61  % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.61  % Preprocessing time       : 0.006 s
% 0.32/0.61  
% 0.32/0.61  % Proof found!
% 0.32/0.61  % SZS status Unsatisfiable
% 0.32/0.61  % SZS output start CNFRefutation
% See solution above
% 0.32/0.61  % Parsed axioms                        : 1418
% 0.32/0.61  % Removed by relevancy pruning/SinE    : 586
% 0.32/0.61  % Initial clauses                      : 832
% 0.32/0.61  % Removed in clause preprocessing      : 0
% 0.32/0.61  % Initial clauses in saturation        : 832
% 0.32/0.61  % Processed clauses                    : 2698
% 0.32/0.61  % ...of these trivial                  : 1
% 0.32/0.61  % ...subsumed                          : 1749
% 0.32/0.61  % ...remaining for further processing  : 948
% 0.32/0.61  % Other redundant clauses eliminated   : 0
% 0.32/0.61  % Clauses deleted for lack of memory   : 0
% 0.32/0.61  % Backward-subsumed                    : 13
% 0.32/0.61  % Backward-rewritten                   : 3
% 0.32/0.61  % Generated clauses                    : 2604
% 0.32/0.61  % ...of the previous two non-redundant : 2089
% 0.32/0.61  % ...aggressively subsumed             : 0
% 0.32/0.61  % Contextual simplify-reflections      : 13
% 0.32/0.61  % Paramodulations                      : 2601
% 0.32/0.61  % Factorizations                       : 0
% 0.32/0.61  % NegExts                              : 0
% 0.32/0.61  % Equation resolutions                 : 3
% 0.32/0.61  % Disequality decompositions           : 0
% 0.32/0.61  % Total rewrite steps                  : 692
% 0.32/0.61  % ...of those cached                   : 614
% 0.32/0.61  % Propositional unsat checks           : 0
% 0.32/0.61  %    Propositional check models        : 0
% 0.32/0.61  %    Propositional check unsatisfiable : 0
% 0.32/0.61  %    Propositional clauses             : 0
% 0.32/0.61  %    Propositional clauses after purity: 0
% 0.32/0.61  %    Propositional unsat core size     : 0
% 0.32/0.61  %    Propositional preprocessing time  : 0.000
% 0.32/0.61  %    Propositional encoding time       : 0.000
% 0.32/0.61  %    Propositional solver time         : 0.000
% 0.32/0.61  %    Success case prop preproc time    : 0.000
% 0.32/0.61  %    Success case prop encoding time   : 0.000
% 0.32/0.61  %    Success case prop solver time     : 0.000
% 0.32/0.61  % Current number of processed clauses  : 932
% 0.32/0.61  %    Positive orientable unit clauses  : 92
% 0.32/0.61  %    Positive unorientable unit clauses: 0
% 0.32/0.61  %    Negative unit clauses             : 7
% 0.32/0.61  %    Non-unit-clauses                  : 833
% 0.32/0.61  % Current number of unprocessed clauses: 194
% 0.32/0.61  % ...number of literals in the above   : 700
% 0.32/0.61  % Current number of archived formulas  : 0
% 0.32/0.61  % Current number of archived clauses   : 16
% 0.32/0.61  % Clause-clause subsumption calls (NU) : 584931
% 0.32/0.61  % Rec. Clause-clause subsumption calls : 565231
% 0.32/0.61  % Non-unit clause-clause subsumptions  : 1770
% 0.32/0.61  % Unit Clause-clause subsumption calls : 134
% 0.32/0.61  % Rewrite failures with RHS unbound    : 0
% 0.32/0.61  % BW rewrite match attempts            : 16
% 0.32/0.61  % BW rewrite match successes           : 3
% 0.32/0.61  % Condensation attempts                : 0
% 0.32/0.61  % Condensation successes               : 0
% 0.32/0.61  % Termbank termtop insertions          : 44037
% 0.32/0.61  % Search garbage collected termcells   : 2528
% 0.32/0.61  
% 0.32/0.61  % -------------------------------------------------
% 0.32/0.61  % User time                : 0.154 s
% 0.32/0.61  % System time              : 0.009 s
% 0.32/0.61  % Total time               : 0.163 s
% 0.32/0.61  % Maximum resident set size: 5420 pages
% 0.32/0.61  
% 0.32/0.61  % -------------------------------------------------
% 0.32/0.61  % User time                : 0.174 s
% 0.32/0.61  % System time              : 0.016 s
% 0.32/0.61  % Total time               : 0.191 s
% 0.32/0.61  % Maximum resident set size: 5632 pages
% 0.32/0.61  % E exiting
%------------------------------------------------------------------------------