↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ANA007-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 : n001.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:43 PM UTC 2026

% Result   : Unsatisfiable 0.37s 1.07s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   18 (   8 unt;   0 nHn;   9 RR)
%            Number of literals    :   28 (   4 equ;  13 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-3 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
    ( ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Orderings_Oorder__class_Oaxioms__1_0) ).

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

cnf(cls_Ring__and__Field_Omult__cancel__right1_2,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | X2 = c_times(c_1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Ring__and__Field_Omult__cancel__right1_2) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_f(v_x(X1)),t_b),c_times(X1,c_HOL_Oabs(v_f(v_x(X1)),t_b),t_b),t_b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

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

cnf(c_0_5,plain,
    ( ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X2,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).

cnf(c_0_6,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_7,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | X2 = c_times(c_1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Ring__and__Field_Omult__cancel__right1_2]) ).

cnf(c_0_8,plain,
    ( ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X2,X1) ),
    c_0_5 ).

cnf(c_0_9,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    c_0_6 ).

cnf(c_0_10,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_f(v_x(X1)),t_b),c_times(X1,c_HOL_Oabs(v_f(v_x(X1)),t_b),t_b),t_b),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_11,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | X2 = c_times(c_1,X2,X1) ),
    c_0_7 ).

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

cnf(c_0_13,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X2)
    | c_lessequals(X1,X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    ~ c_lessequals(c_HOL_Oabs(v_f(v_x(X1)),t_b),c_times(X1,c_HOL_Oabs(v_f(v_x(X1)),t_b),t_b),t_b),
    c_0_10 ).

cnf(c_0_15,negated_conjecture,
    c_times(c_1,X1,t_b) = X1,
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    c_lessequals(X1,X1,t_b),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : ANA007-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.42  % Computer : n001.cluster.edu
% 0.18/0.42  % Model    : x86_64 x86_64
% 0.18/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42  % Memory   : 8046.5625MB
% 0.18/0.42  % OS       : Linux 6.8.0-71-generic
% 0.18/0.42  % CPULimit : 300
% 0.18/0.42  % WCLimit  : 300
% 0.18/0.42  % DateTime : Mon Sep 21 13:28:46 UTC 2026
% 0.18/0.42  % CPUTime  : 
% 0.18/0.42  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.49  Running first-order theorem proving
% 0.18/0.49  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.37/1.07  % Version: 3.5.1
% 0.37/1.07  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.37/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/1.07  % Starting new_bool_3 with 300s (1) cores
% 0.37/1.07  % Starting new_bool_1 with 300s (1) cores
% 0.37/1.07  % Starting sh5l with 300s (1) cores
% 0.37/1.07  % new_bool_3 with pid 3226422 completed with status 0
% 0.37/1.07  % Result found by new_bool_3
% 0.37/1.07  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.37/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/1.07  % Starting new_bool_3 with 300s (1) cores
% 0.37/1.07  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/1.07  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/1.07  % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.37/1.07  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.37/1.07  % Starting SubtermCWHack with 28s (1) cores
% 0.37/1.07  % SubtermCWHack with pid 3226426 completed with status 0
% 0.37/1.07  % Result found by SubtermCWHack
% 0.37/1.07  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.37/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/1.07  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/1.07  % Starting new_bool_3 with 300s (1) cores
% 0.37/1.07  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/1.07  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/1.07  % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.37/1.07  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.37/1.07  % Starting SubtermCWHack with 28s (1) cores
% 0.37/1.07  % Preprocessing time       : 0.010 s
% 0.37/1.07  
% 0.37/1.07  % Proof found!
% 0.37/1.07  % SZS status Unsatisfiable
% 0.37/1.07  % SZS output start CNFRefutation
% See solution above
% 0.37/1.07  % Parsed axioms                        : 2784
% 0.37/1.07  % Removed by relevancy pruning/SinE    : 1668
% 0.37/1.07  % Initial clauses                      : 1116
% 0.37/1.07  % Removed in clause preprocessing      : 0
% 0.37/1.07  % Initial clauses in saturation        : 1116
% 0.37/1.07  % Processed clauses                    : 6402
% 0.37/1.07  % ...of these trivial                  : 50
% 0.37/1.07  % ...subsumed                          : 4530
% 0.37/1.07  % ...remaining for further processing  : 1822
% 0.37/1.07  % Other redundant clauses eliminated   : 210
% 0.37/1.07  % Clauses deleted for lack of memory   : 0
% 0.37/1.07  % Backward-subsumed                    : 109
% 0.37/1.07  % Backward-rewritten                   : 129
% 0.37/1.07  % Generated clauses                    : 20543
% 0.37/1.07  % ...of the previous two non-redundant : 15923
% 0.37/1.07  % ...aggressively subsumed             : 0
% 0.37/1.07  % Contextual simplify-reflections      : 18
% 0.37/1.07  % Paramodulations                      : 20320
% 0.37/1.07  % Factorizations                       : 3
% 0.37/1.07  % NegExts                              : 0
% 0.37/1.07  % Equation resolutions                 : 220
% 0.37/1.07  % Disequality decompositions           : 0
% 0.37/1.07  % Total rewrite steps                  : 11858
% 0.37/1.07  % ...of those cached                   : 11106
% 0.37/1.07  % Propositional unsat checks           : 0
% 0.37/1.07  %    Propositional check models        : 0
% 0.37/1.07  %    Propositional check unsatisfiable : 0
% 0.37/1.07  %    Propositional clauses             : 0
% 0.37/1.07  %    Propositional clauses after purity: 0
% 0.37/1.07  %    Propositional unsat core size     : 0
% 0.37/1.07  %    Propositional preprocessing time  : 0.000
% 0.37/1.07  %    Propositional encoding time       : 0.000
% 0.37/1.07  %    Propositional solver time         : 0.000
% 0.37/1.07  %    Success case prop preproc time    : 0.000
% 0.37/1.07  %    Success case prop encoding time   : 0.000
% 0.37/1.07  %    Success case prop solver time     : 0.000
% 0.37/1.07  % Current number of processed clauses  : 1584
% 0.37/1.07  %    Positive orientable unit clauses  : 249
% 0.37/1.07  %    Positive unorientable unit clauses: 6
% 0.37/1.07  %    Negative unit clauses             : 121
% 0.37/1.07  %    Non-unit-clauses                  : 1208
% 0.37/1.07  % Current number of unprocessed clauses: 10239
% 0.37/1.07  % ...number of literals in the above   : 33640
% 0.37/1.07  % Current number of archived formulas  : 0
% 0.37/1.07  % Current number of archived clauses   : 238
% 0.37/1.07  % Clause-clause subsumption calls (NU) : 537292
% 0.37/1.07  % Rec. Clause-clause subsumption calls : 359515
% 0.37/1.07  % Non-unit clause-clause subsumptions  : 1603
% 0.37/1.07  % Unit Clause-clause subsumption calls : 5208
% 0.37/1.07  % Rewrite failures with RHS unbound    : 0
% 0.37/1.07  % BW rewrite match attempts            : 354
% 0.37/1.07  % BW rewrite match successes           : 57
% 0.37/1.07  % Condensation attempts                : 0
% 0.37/1.07  % Condensation successes               : 0
% 0.37/1.07  % Termbank termtop insertions          : 308864
% 0.37/1.07  % Search garbage collected termcells   : 6563
% 0.37/1.07  
% 0.37/1.07  % -------------------------------------------------
% 0.37/1.07  % User time                : 0.423 s
% 0.37/1.07  % System time              : 0.021 s
% 0.37/1.07  % Total time               : 0.443 s
% 0.37/1.07  % Maximum resident set size: 6968 pages
% 0.37/1.07  
% 0.37/1.07  % -------------------------------------------------
% 0.37/1.07  % User time                : 0.513 s
% 0.37/1.07  % System time              : 0.035 s
% 0.37/1.07  % Total time               : 0.548 s
% 0.37/1.07  % Maximum resident set size: 6656 pages
% 0.37/1.07  % E exiting
%------------------------------------------------------------------------------