↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Computer : n011.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:03:05 PM UTC 2026

% Result   : Unsatisfiable 6.42s 1.41s
% Output   : CNFRefutation 6.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   42 (  17 unt;   0 nHn;  39 RR)
%            Number of literals    :   77 (   8 equ;  42 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   39 (   3 sgn)

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

cnf(cls_conjecture_1,negated_conjecture,
    c_less(c_0,v_c,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_44) ).

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

cnf(cls_OrderedGroup_Oabs__0__eq_1,axiom,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_0 = c_HOL_Oabs(c_0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__0__eq_1) ).

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/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_50) ).

cnf(cls_Ring__and__Field_Omult__nonneg__nonneg_0,axiom,
    ( ~ c_lessequals(c_0,X3,X1)
    | ~ c_lessequals(c_0,X2,X1)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | c_lessequals(c_0,c_times(X3,X2,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Ring__and__Field_Omult__nonneg__nonneg_0) ).

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

cnf(cls_conjecture_3,negated_conjecture,
    v_x = c_0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_0,negated_conjecture,
    v_f(c_0) = c_0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_40,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Ring__and__Field_Opordered__cancel__semiring(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_40) ).

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/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__ge__zero_0) ).

cnf(c_0_12,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__less__imp__le_0]) ).

cnf(c_0_13,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X3,X1) ),
    c_0_12 ).

cnf(c_0_14,negated_conjecture,
    c_less(c_0,v_c,t_a),
    cls_conjecture_1 ).

cnf(c_0_15,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_44]) ).

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

cnf(c_0_17,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_0 = c_HOL_Oabs(c_0,X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__0__eq_1]) ).

cnf(c_0_18,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_19,plain,
    ( ~ c_lessequals(c_0,X3,X1)
    | ~ c_lessequals(c_0,X2,X1)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | c_lessequals(c_0,c_times(X3,X2,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_Ring__and__Field_Omult__nonneg__nonneg_0]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ class_Orderings_Oorder(t_a)
    | c_lessequals(c_0,v_c,t_a) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    c_0_15 ).

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

cnf(c_0_23,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
    c_0_16 ).

cnf(c_0_24,negated_conjecture,
    v_x = c_0,
    cls_conjecture_3 ).

cnf(c_0_25,negated_conjecture,
    v_f(c_0) = c_0,
    cls_conjecture_0 ).

cnf(c_0_26,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_0 = c_HOL_Oabs(c_0,X1) ),
    c_0_17 ).

cnf(c_0_27,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    c_0_18 ).

cnf(c_0_28,plain,
    ( ~ c_lessequals(c_0,X3,X1)
    | ~ c_lessequals(c_0,X2,X1)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(X1)
    | c_lessequals(c_0,c_times(X3,X2,X1),X1) ),
    c_0_19 ).

cnf(c_0_29,negated_conjecture,
    c_lessequals(c_0,v_c,t_a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

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

cnf(c_0_31,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(c_0,t_a),c_times(v_c,c_HOL_Oabs(v_h(c_0),t_a),t_a),t_a),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_24]) ).

cnf(c_0_32,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | c_HOL_Oabs(c_0,X1) = c_0 ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ c_lessequals(c_0,X1,t_a)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(t_a)
    | c_lessequals(c_0,c_times(v_c,X1,t_a),t_a) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Ring__and__Field_Opordered__cancel__semiring(X1) ),
    c_0_30 ).

cnf(c_0_35,negated_conjecture,
    ~ c_lessequals(c_0,c_times(v_c,c_HOL_Oabs(v_h(c_0),t_a),t_a),t_a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22])]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ c_lessequals(c_0,X1,t_a)
    | c_lessequals(c_0,c_times(v_c,X1,t_a),t_a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22])]) ).

cnf(c_0_37,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_38,negated_conjecture,
    ~ c_lessequals(c_0,c_HOL_Oabs(v_h(c_0),t_a),t_a),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1) ),
    c_0_37 ).

cnf(c_0_40,negated_conjecture,
    ~ class_OrderedGroup_Olordered__ab__group__abs(t_a),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA020-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n011.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 13:24:11 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39  Running first-order theorem proving
% 0.14/0.39  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
% 6.42/1.41  % Version: 3.5.1
% 6.42/1.41  % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.42/1.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.42/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.42/1.41  % Starting new_bool_3 with 300s (1) cores
% 6.42/1.41  % Starting new_bool_1 with 300s (1) cores
% 6.42/1.41  % Starting sh5l with 300s (1) cores
% 6.42/1.41  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2006670 completed with status 0
% 6.42/1.41  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.42/1.41  % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.42/1.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.42/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.42/1.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.42/1.41  % No SInE strategy applied
% 6.42/1.41  % Search class: FGHSM-SMLM32-DFFFFFNN
% 6.42/1.41  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.42/1.41  % Starting SubtermCWHack with 136s (1) cores
% 6.42/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.42/1.41  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 6.42/1.41  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 6.42/1.41  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 6.42/1.41  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2006678 completed with status 0
% 6.42/1.41  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.42/1.41  % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.42/1.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.42/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.42/1.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.42/1.41  % No SInE strategy applied
% 6.42/1.41  % Search class: FGHSM-SMLM32-DFFFFFNN
% 6.42/1.41  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.42/1.41  % Starting SubtermCWHack with 136s (1) cores
% 6.42/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.42/1.41  % Preprocessing time       : 0.032 s
% 6.42/1.41  % Presaturation interreduction done
% 6.42/1.41  
% 6.42/1.41  % Proof found!
% 6.42/1.41  % SZS status Unsatisfiable
% 6.42/1.41  % SZS output start CNFRefutation
% See solution above
% 6.42/1.41  % Parsed axioms                        : 2791
% 6.42/1.41  % Removed by relevancy pruning/SinE    : 0
% 6.42/1.41  % Initial clauses                      : 2791
% 6.42/1.41  % Removed in clause preprocessing      : 9
% 6.42/1.41  % Initial clauses in saturation        : 2782
% 6.42/1.41  % Processed clauses                    : 6176
% 6.42/1.41  % ...of these trivial                  : 23
% 6.42/1.41  % ...subsumed                          : 1199
% 6.42/1.41  % ...remaining for further processing  : 4954
% 6.42/1.41  % Other redundant clauses eliminated   : 91
% 6.42/1.41  % Clauses deleted for lack of memory   : 0
% 6.42/1.41  % Backward-subsumed                    : 32
% 6.42/1.41  % Backward-rewritten                   : 58
% 6.42/1.41  % Generated clauses                    : 9684
% 6.42/1.41  % ...of the previous two non-redundant : 7525
% 6.42/1.41  % ...aggressively subsumed             : 0
% 6.42/1.41  % Contextual simplify-reflections      : 7
% 6.42/1.41  % Paramodulations                      : 9553
% 6.42/1.41  % Factorizations                       : 0
% 6.42/1.41  % NegExts                              : 0
% 6.42/1.41  % Equation resolutions                 : 131
% 6.42/1.41  % Disequality decompositions           : 0
% 6.42/1.41  % Total rewrite steps                  : 3569
% 6.42/1.41  % ...of those cached                   : 2843
% 6.42/1.41  % Propositional unsat checks           : 0
% 6.42/1.41  %    Propositional check models        : 0
% 6.42/1.41  %    Propositional check unsatisfiable : 0
% 6.42/1.41  %    Propositional clauses             : 0
% 6.42/1.41  %    Propositional clauses after purity: 0
% 6.42/1.41  %    Propositional unsat core size     : 0
% 6.42/1.41  %    Propositional preprocessing time  : 0.000
% 6.42/1.41  %    Propositional encoding time       : 0.000
% 6.42/1.41  %    Propositional solver time         : 0.000
% 6.42/1.41  %    Success case prop preproc time    : 0.000
% 6.42/1.41  %    Success case prop encoding time   : 0.000
% 6.42/1.41  %    Success case prop solver time     : 0.000
% 6.42/1.41  % Current number of processed clauses  : 2209
% 6.42/1.41  %    Positive orientable unit clauses  : 521
% 6.42/1.41  %    Positive unorientable unit clauses: 3
% 6.42/1.41  %    Negative unit clauses             : 68
% 6.42/1.41  %    Non-unit-clauses                  : 1617
% 6.42/1.41  % Current number of unprocessed clauses: 6726
% 6.42/1.41  % ...number of literals in the above   : 16806
% 6.42/1.41  % Current number of archived formulas  : 0
% 6.42/1.41  % Current number of archived clauses   : 2753
% 6.42/1.41  % Clause-clause subsumption calls (NU) : 2551923
% 6.42/1.41  % Rec. Clause-clause subsumption calls : 1722773
% 6.42/1.41  % Non-unit clause-clause subsumptions  : 975
% 6.42/1.41  % Unit Clause-clause subsumption calls : 78676
% 6.42/1.41  % Rewrite failures with RHS unbound    : 0
% 6.42/1.41  % BW rewrite match attempts            : 608
% 6.42/1.41  % BW rewrite match successes           : 56
% 6.42/1.41  % Condensation attempts                : 0
% 6.42/1.41  % Condensation successes               : 0
% 6.42/1.41  % Termbank termtop insertions          : 200998
% 6.42/1.41  % Search garbage collected termcells   : 4072
% 6.42/1.41  
% 6.42/1.41  % -------------------------------------------------
% 6.42/1.41  % User time                : 0.904 s
% 6.42/1.41  % System time              : 0.029 s
% 6.42/1.41  % Total time               : 0.933 s
% 6.42/1.41  % Maximum resident set size: 8248 pages
% 6.42/1.41  
% 6.42/1.41  % -------------------------------------------------
% 6.42/1.41  % User time                : 4.235 s
% 6.42/1.41  % System time              : 0.178 s
% 6.42/1.41  % Total time               : 4.413 s
% 6.42/1.41  % Maximum resident set size: 6400 pages
% 6.42/1.41  % E exiting
%------------------------------------------------------------------------------