↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV281-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 : n026.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 02:54:13 PM UTC 2026

% Result   : Unsatisfiable 9.73s 2.38s
% Output   : CNFRefutation 9.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   34 (  19 unt;   4 nHn;  20 RR)
%            Number of literals    :   54 (  21 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :   56 (  11 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(cls_Public_ONonce__supply__lemma_0,axiom,
    ( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Public_ONonce__supply__lemma_0) ).

cnf(clsarity_nat_3,axiom,
    class_Orderings_Oorder(tc_nat),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsarity_nat_3) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_OrderedGroup_Oadd__left__cancel_0,axiom,
    ( c_plus(X2,X3,X1) != c_plus(X2,X4,X1)
    | ~ class_OrderedGroup_Ocancel__semigroup__add(X1)
    | X3 = X4 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oadd__left__cancel_0) ).

cnf(cls_Nat_Ole__add2_0,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Ole__add2_0) ).

cnf(cls_Nat_Oadd__0__right_0,axiom,
    c_plus(X1,c_0,tc_nat) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oadd__0__right_0) ).

cnf(clsarity_nat_27,axiom,
    class_OrderedGroup_Ocancel__semigroup__add(tc_nat),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsarity_nat_27) ).

cnf(cls_Datatype__Universe_OLeaf__not__Numb_0,axiom,
    c_Datatype__Universe_OLeaf(X1,X2,X3) != c_Datatype__Universe_ONumb(X4,X2,X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Datatype__Universe_OLeaf__not__Numb_0) ).

cnf(c_0_9,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_10,plain,
    ( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_Public_ONonce__supply__lemma_0]) ).

cnf(c_0_11,plain,
    ( ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X2,X1) ),
    c_0_9 ).

cnf(c_0_12,axiom,
    class_Orderings_Oorder(tc_nat),
    clsarity_nat_3 ).

cnf(c_0_13,plain,
    ( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    c_0_10 ).

cnf(c_0_14,plain,
    c_lessequals(X1,X1,tc_nat),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ~ c_in(c_Message_Omsg_ONonce(v_sko__urX(X1)),c_Event_Oused(X1),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | X1 = X2 ),
    cls_conjecture_0 ).

cnf(c_0_17,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | v_sko__urX(v_evs) = X1 ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    v_sko__urX(v_evs) = v_sko__urX(v_evs_H),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_19,plain,
    ( c_plus(X2,X3,X1) != c_plus(X2,X4,X1)
    | ~ class_OrderedGroup_Ocancel__semigroup__add(X1)
    | X3 = X4 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oadd__left__cancel_0]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_21,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    cls_Nat_Ole__add2_0 ).

cnf(c_0_22,plain,
    ( c_plus(X2,X3,X1) != c_plus(X2,X4,X1)
    | ~ class_OrderedGroup_Ocancel__semigroup__add(X1)
    | X3 = X4 ),
    c_0_19 ).

cnf(c_0_23,axiom,
    c_plus(X1,c_0,tc_nat) = X1,
    cls_Nat_Oadd__0__right_0 ).

cnf(c_0_24,axiom,
    class_OrderedGroup_Ocancel__semigroup__add(tc_nat),
    clsarity_nat_27 ).

cnf(c_0_25,negated_conjecture,
    ~ c_in(c_Message_Omsg_ONonce(c_plus(X1,v_sko__urX(v_evs_H),tc_nat)),c_Event_Oused(v_evs),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | X1 = v_sko__urX(v_evs_H) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_27,plain,
    ( c_plus(X2,X1,tc_nat) != X2
    | X1 = c_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_28,negated_conjecture,
    c_plus(X1,v_sko__urX(v_evs_H),tc_nat) = v_sko__urX(v_evs_H),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    c_Datatype__Universe_OLeaf(X1,X2,X3) != c_Datatype__Universe_ONumb(X4,X2,X3),
    inference(fof_simplification,[status(thm)],[cls_Datatype__Universe_OLeaf__not__Numb_0]) ).

cnf(c_0_30,negated_conjecture,
    v_sko__urX(v_evs_H) = c_0,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]) ).

cnf(c_0_31,plain,
    c_Datatype__Universe_OLeaf(X1,X2,X3) != c_Datatype__Universe_ONumb(X4,X2,X3),
    c_0_29 ).

cnf(c_0_32,negated_conjecture,
    X1 = c_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_30]),c_0_23]),c_0_30]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV281-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.09/0.36  % Computer : n026.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 08:40:38 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42  Running first-order theorem proving
% 0.14/0.42  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
% 9.73/2.38  % Version: 3.5.1
% 9.73/2.38  % Preprocessing class: FMLMSMSMSSSNFFN.
% 9.73/2.38  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.73/2.38  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.73/2.38  % Starting new_bool_3 with 300s (1) cores
% 9.73/2.38  % Starting new_bool_1 with 300s (1) cores
% 9.73/2.38  % Starting sh5l with 300s (1) cores
% 9.73/2.38  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1865892 completed with status 0
% 9.73/2.38  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 9.73/2.38  % Preprocessing class: FMLMSMSMSSSNFFN.
% 9.73/2.38  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.73/2.38  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.73/2.38  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.73/2.38  % No SInE strategy applied
% 9.73/2.38  % Search class: FGHSM-SMLM32-DFFFFFNN
% 9.73/2.38  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 9.73/2.38  % Starting SubtermCWHack with 136s (1) cores
% 9.73/2.38  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 9.73/2.38  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 9.73/2.38  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 9.73/2.38  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 9.73/2.38  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1865901 completed with status 0
% 9.73/2.38  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 9.73/2.38  % Preprocessing class: FMLMSMSMSSSNFFN.
% 9.73/2.38  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.73/2.38  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.73/2.38  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.73/2.38  % No SInE strategy applied
% 9.73/2.38  % Search class: FGHSM-SMLM32-DFFFFFNN
% 9.73/2.38  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 9.73/2.38  % Starting SubtermCWHack with 136s (1) cores
% 9.73/2.38  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 9.73/2.38  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 9.73/2.38  % Preprocessing time       : 0.045 s
% 9.73/2.38  
% 9.73/2.38  % Proof found!
% 9.73/2.38  % SZS status Unsatisfiable
% 9.73/2.38  % SZS output start CNFRefutation
% See solution above
% 9.73/2.38  % Parsed axioms                        : 2938
% 9.73/2.38  % Removed by relevancy pruning/SinE    : 0
% 9.73/2.38  % Initial clauses                      : 2938
% 9.73/2.38  % Removed in clause preprocessing      : 12
% 9.73/2.38  % Initial clauses in saturation        : 2926
% 9.73/2.38  % Processed clauses                    : 7177
% 9.73/2.38  % ...of these trivial                  : 204
% 9.73/2.38  % ...subsumed                          : 3648
% 9.73/2.38  % ...remaining for further processing  : 3325
% 9.73/2.38  % Other redundant clauses eliminated   : 84
% 9.73/2.38  % Clauses deleted for lack of memory   : 0
% 9.73/2.38  % Backward-subsumed                    : 33
% 9.73/2.38  % Backward-rewritten                   : 2303
% 9.73/2.38  % Generated clauses                    : 16505
% 9.73/2.38  % ...of the previous two non-redundant : 13912
% 9.73/2.38  % ...aggressively subsumed             : 0
% 9.73/2.38  % Contextual simplify-reflections      : 5
% 9.73/2.38  % Paramodulations                      : 16330
% 9.73/2.38  % Factorizations                       : 5
% 9.73/2.38  % NegExts                              : 0
% 9.73/2.38  % Equation resolutions                 : 163
% 9.73/2.38  % Disequality decompositions           : 0
% 9.73/2.38  % Total rewrite steps                  : 8275
% 9.73/2.38  % ...of those cached                   : 4789
% 9.73/2.38  % Propositional unsat checks           : 0
% 9.73/2.38  %    Propositional check models        : 0
% 9.73/2.38  %    Propositional check unsatisfiable : 0
% 9.73/2.38  %    Propositional clauses             : 0
% 9.73/2.38  %    Propositional clauses after purity: 0
% 9.73/2.38  %    Propositional unsat core size     : 0
% 9.73/2.38  %    Propositional preprocessing time  : 0.000
% 9.73/2.38  %    Propositional encoding time       : 0.000
% 9.73/2.38  %    Propositional solver time         : 0.000
% 9.73/2.38  %    Success case prop preproc time    : 0.000
% 9.73/2.38  %    Success case prop encoding time   : 0.000
% 9.73/2.38  %    Success case prop solver time     : 0.000
% 9.73/2.38  % Current number of processed clauses  : 982
% 9.73/2.38  %    Positive orientable unit clauses  : 53
% 9.73/2.38  %    Positive unorientable unit clauses: 1
% 9.73/2.38  %    Negative unit clauses             : 7
% 9.73/2.38  %    Non-unit-clauses                  : 921
% 9.73/2.38  % Current number of unprocessed clauses: 9612
% 9.73/2.38  % ...number of literals in the above   : 21637
% 9.73/2.38  % Current number of archived formulas  : 0
% 9.73/2.38  % Current number of archived clauses   : 2353
% 9.73/2.38  % Clause-clause subsumption calls (NU) : 3170689
% 9.73/2.38  % Rec. Clause-clause subsumption calls : 2065700
% 9.73/2.38  % Non-unit clause-clause subsumptions  : 3394
% 9.73/2.38  % Unit Clause-clause subsumption calls : 129552
% 9.73/2.38  % Rewrite failures with RHS unbound    : 6
% 9.73/2.38  % BW rewrite match attempts            : 4466
% 9.73/2.38  % BW rewrite match successes           : 2052
% 9.73/2.38  % Condensation attempts                : 0
% 9.73/2.38  % Condensation successes               : 0
% 9.73/2.38  % Termbank termtop insertions          : 308952
% 9.73/2.38  % Search garbage collected termcells   : 4234
% 9.73/2.38  
% 9.73/2.38  % -------------------------------------------------
% 9.73/2.38  % User time                : 1.715 s
% 9.73/2.38  % System time              : 0.063 s
% 9.73/2.38  % Total time               : 1.778 s
% 9.73/2.38  % Maximum resident set size: 8348 pages
% 9.73/2.38  
% 9.73/2.38  % -------------------------------------------------
% 9.73/2.38  % User time                : 7.663 s
% 9.73/2.38  % System time              : 0.254 s
% 9.73/2.38  % Total time               : 7.917 s
% 9.73/2.38  % Maximum resident set size: 6656 pages
% 9.73/2.38  % E exiting
%------------------------------------------------------------------------------