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

View Problem - Process Solution

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

% Computer : n026.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 19:44:01 EDT 2023

% Result   : Unsatisfiable 0.16s 0.42s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  12 unt;   4 nHn;  10 RR)
%            Number of literals    :   30 (  15 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :   34 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Public_ONonce__supply__lemma_0,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
    file('/export/starexec/sandbox2/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p',cls_Public_ONonce__supply__lemma_0) ).

cnf(cls_Nat_Ole__add2_0,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    file('/export/starexec/sandbox2/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p',cls_Nat_Ole__add2_0) ).

cnf(cls_Nat_Oop_A_L_Oadd__0_0,axiom,
    c_plus(c_0,X1,tc_nat) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p',cls_Nat_Oop_A_L_Oadd__0_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( X1 = X2
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p',cls_conjecture_0) ).

cnf(cls_Nat_Onat__add__right__cancel_0,axiom,
    ( X1 = X3
    | c_plus(X1,X2,tc_nat) != c_plus(X3,X2,tc_nat) ),
    file('/export/starexec/sandbox2/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p',cls_Nat_Onat__add__right__cancel_0) ).

cnf(cls_List_Olist_Odistinct__1_0,axiom,
    c_List_Olist_ONil != c_List_Olist_OCons(X1,X2,X3),
    file('/export/starexec/sandbox2/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p',cls_List_Olist_Odistinct__1_0) ).

cnf(c_0_6,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
    cls_Public_ONonce__supply__lemma_0 ).

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

cnf(c_0_8,plain,
    ~ c_in(c_Message_Omsg_ONonce(c_plus(X1,v_sko__urX(X2),tc_nat)),c_Event_Oused(X2),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    c_plus(c_0,X1,tc_nat) = X1,
    cls_Nat_Oop_A_L_Oadd__0_0 ).

cnf(c_0_10,plain,
    ~ c_in(c_Message_Omsg_ONonce(v_sko__urX(X1)),c_Event_Oused(X1),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_12,negated_conjecture,
    ( v_sko__urX(v_evs) = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    ( X1 = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    v_sko__urX(v_evs) = v_sko__urX(v_evs_H),
    inference(spm,[status(thm)],[c_0_10,c_0_12]) ).

cnf(c_0_15,axiom,
    ( X1 = X3
    | c_plus(X1,X2,tc_nat) != c_plus(X3,X2,tc_nat) ),
    cls_Nat_Onat__add__right__cancel_0 ).

cnf(c_0_16,negated_conjecture,
    c_plus(X1,v_sko__urX(v_evs_H),tc_nat) = v_sko__urX(v_evs_H),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_14]) ).

cnf(c_0_17,axiom,
    c_List_Olist_ONil != c_List_Olist_OCons(X1,X2,X3),
    cls_List_Olist_Odistinct__1_0 ).

cnf(c_0_18,negated_conjecture,
    X1 = X2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SWV281-2 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.10  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n026.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Oct  3 03:59:59 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.41  Running first-order theorem proving
% 0.16/0.41  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/tmp/tmp.t1aMeP5Gos/E---3.1_28542.p
% 0.16/0.42  # Version: 3.1pre001
% 0.16/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42  # Starting sh5l with 300s (1) cores
% 0.16/0.42  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28620 completed with status 0
% 0.16/0.42  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42  # No SInE strategy applied
% 0.16/0.42  # Search class: FGHSS-FFSF31-SFFFFFNN
% 0.16/0.42  # partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.16/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.42  # Starting new_bool_3 with 136s (1) cores
% 0.16/0.42  # Starting new_bool_1 with 136s (1) cores
% 0.16/0.42  # Starting sh5l with 136s (1) cores
% 0.16/0.42  # SAT001_MinMin_p005000_rr_RG with pid 28625 completed with status 0
% 0.16/0.42  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42  # No SInE strategy applied
% 0.16/0.42  # Search class: FGHSS-FFSF31-SFFFFFNN
% 0.16/0.42  # partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.16/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.42  # Preprocessing time       : 0.001 s
% 0.16/0.42  # Presaturation interreduction done
% 0.16/0.42  
% 0.16/0.42  # Proof found!
% 0.16/0.42  # SZS status Unsatisfiable
% 0.16/0.42  # SZS output start CNFRefutation
% See solution above
% 0.16/0.42  # Parsed axioms                        : 6
% 0.16/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.42  # Initial clauses                      : 6
% 0.16/0.42  # Removed in clause preprocessing      : 0
% 0.16/0.42  # Initial clauses in saturation        : 6
% 0.16/0.42  # Processed clauses                    : 30
% 0.16/0.42  # ...of these trivial                  : 0
% 0.16/0.42  # ...subsumed                          : 5
% 0.16/0.42  # ...remaining for further processing  : 25
% 0.16/0.42  # Other redundant clauses eliminated   : 8
% 0.16/0.42  # Clauses deleted for lack of memory   : 0
% 0.16/0.42  # Backward-subsumed                    : 0
% 0.16/0.42  # Backward-rewritten                   : 17
% 0.16/0.42  # Generated clauses                    : 83
% 0.16/0.42  # ...of the previous two non-redundant : 75
% 0.16/0.42  # ...aggressively subsumed             : 0
% 0.16/0.42  # Contextual simplify-reflections      : 0
% 0.16/0.42  # Paramodulations                      : 74
% 0.16/0.42  # Factorizations                       : 0
% 0.16/0.42  # NegExts                              : 0
% 0.16/0.42  # Equation resolutions                 : 9
% 0.16/0.42  # Total rewrite steps                  : 22
% 0.16/0.42  # Propositional unsat checks           : 0
% 0.16/0.42  #    Propositional check models        : 0
% 0.16/0.42  #    Propositional check unsatisfiable : 0
% 0.16/0.42  #    Propositional clauses             : 0
% 0.16/0.42  #    Propositional clauses after purity: 0
% 0.16/0.42  #    Propositional unsat core size     : 0
% 0.16/0.42  #    Propositional preprocessing time  : 0.000
% 0.16/0.42  #    Propositional encoding time       : 0.000
% 0.16/0.42  #    Propositional solver time         : 0.000
% 0.16/0.42  #    Success case prop preproc time    : 0.000
% 0.16/0.42  #    Success case prop encoding time   : 0.000
% 0.16/0.42  #    Success case prop solver time     : 0.000
% 0.16/0.42  # Current number of processed clauses  : 2
% 0.16/0.42  #    Positive orientable unit clauses  : 1
% 0.16/0.42  #    Positive unorientable unit clauses: 1
% 0.16/0.42  #    Negative unit clauses             : 0
% 0.16/0.42  #    Non-unit-clauses                  : 0
% 0.16/0.42  # Current number of unprocessed clauses: 51
% 0.16/0.42  # ...number of literals in the above   : 149
% 0.16/0.42  # Current number of archived formulas  : 0
% 0.16/0.42  # Current number of archived clauses   : 23
% 0.16/0.42  # Clause-clause subsumption calls (NU) : 6
% 0.16/0.42  # Rec. Clause-clause subsumption calls : 3
% 0.16/0.42  # Non-unit clause-clause subsumptions  : 2
% 0.16/0.42  # Unit Clause-clause subsumption calls : 8
% 0.16/0.42  # Rewrite failures with RHS unbound    : 0
% 0.16/0.42  # BW rewrite match attempts            : 81
% 0.16/0.42  # BW rewrite match successes           : 53
% 0.16/0.42  # Condensation attempts                : 0
% 0.16/0.42  # Condensation successes               : 0
% 0.16/0.42  # Termbank termtop insertions          : 979
% 0.16/0.42  
% 0.16/0.42  # -------------------------------------------------
% 0.16/0.42  # User time                : 0.003 s
% 0.16/0.42  # System time              : 0.003 s
% 0.16/0.42  # Total time               : 0.005 s
% 0.16/0.42  # Maximum resident set size: 1632 pages
% 0.16/0.42  
% 0.16/0.42  # -------------------------------------------------
% 0.16/0.42  # User time                : 0.015 s
% 0.16/0.42  # System time              : 0.008 s
% 0.16/0.42  # Total time               : 0.023 s
% 0.16/0.42  # Maximum resident set size: 1676 pages
% 0.16/0.42  % E---3.1 exiting
% 0.16/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------