TSTP Solution File: SWV284-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV284-1 : 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:02 EDT 2023

% Result   : Unsatisfiable 0.43s 0.86s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (   6 unt;   2 nHn;  12 RR)
%            Number of literals    :   30 (   0 equ;  16 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-3 aty)
%            Number of variables   :   29 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Message_Omsg__Nonce__supply_0,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__upX(X2),X1,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p',cls_Message_Omsg__Nonce__supply_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p',cls_conjecture_2) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lessequals(v_N,X1,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p',cls_conjecture_1) ).

cnf(cls_Nat_Oadd__leE_0,axiom,
    ( c_lessequals(X2,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p',cls_Nat_Oadd__leE_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(X1,v_x(X1),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p',cls_conjecture_0) ).

cnf(cls_Nat_Oadd__leE_1,axiom,
    ( c_lessequals(X1,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p',cls_Nat_Oadd__leE_1) ).

cnf(c_0_6,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__upX(X2),X1,tc_nat) ),
    cls_Message_Omsg__Nonce__supply_0 ).

cnf(c_0_7,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    cls_conjecture_2 ).

cnf(c_0_8,negated_conjecture,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lessequals(v_N,X1,tc_nat) ),
    cls_conjecture_1 ).

cnf(c_0_9,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__upX(v_msg),v_x(X1),tc_nat) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    ( c_lessequals(X2,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    cls_Nat_Oadd__leE_0 ).

cnf(c_0_11,negated_conjecture,
    c_lessequals(X1,v_x(X1),tc_nat),
    cls_conjecture_0 ).

cnf(c_0_12,negated_conjecture,
    ( ~ c_lessequals(v_sko__upX(v_msg),v_x(X1),tc_nat)
    | ~ c_lessequals(v_N,v_x(X1),tc_nat) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    c_lessequals(X1,v_x(c_plus(X2,X1,tc_nat)),tc_nat),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,axiom,
    ( c_lessequals(X1,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    cls_Nat_Oadd__leE_1 ).

cnf(c_0_15,negated_conjecture,
    ~ c_lessequals(v_N,v_x(c_plus(X1,v_sko__upX(v_msg),tc_nat)),tc_nat),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    c_lessequals(X1,v_x(c_plus(X1,X2,tc_nat)),tc_nat),
    inference(spm,[status(thm)],[c_0_14,c_0_11]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.18/0.18  % Problem    : SWV284-1 : TPTP v8.1.2. Released v3.2.0.
% 0.18/0.19  % Command    : run_E %s %d THM
% 0.18/0.39  % Computer : n026.cluster.edu
% 0.18/0.39  % Model    : x86_64 x86_64
% 0.18/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39  % Memory   : 8042.1875MB
% 0.18/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.24/0.39  % CPULimit   : 2400
% 0.24/0.39  % WCLimit    : 300
% 0.24/0.39  % DateTime   : Tue Oct  3 04:33:29 EDT 2023
% 0.24/0.39  % CPUTime    : 
% 0.36/0.59  Running first-order theorem proving
% 0.36/0.59  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/tmp/tmp.AgBbTsr2eo/E---3.1_16411.p
% 0.43/0.86  # Version: 3.1pre001
% 0.43/0.86  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.43/0.86  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/0.86  # Starting new_bool_3 with 300s (1) cores
% 0.43/0.86  # Starting new_bool_1 with 300s (1) cores
% 0.43/0.86  # Starting sh5l with 300s (1) cores
% 0.43/0.86  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16489 completed with status 0
% 0.43/0.86  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.43/0.86  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.43/0.86  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/0.86  # No SInE strategy applied
% 0.43/0.86  # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.43/0.86  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.43/0.86  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.43/0.86  # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.43/0.86  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.43/0.86  # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 16499 completed with status 0
% 0.43/0.86  # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.43/0.86  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.43/0.86  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/0.86  # No SInE strategy applied
% 0.43/0.86  # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.43/0.86  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 0.43/0.86  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.43/0.86  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.43/0.86  # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.43/0.86  # Preprocessing time       : 0.009 s
% 0.43/0.86  # Presaturation interreduction done
% 0.43/0.86  
% 0.43/0.86  # Proof found!
% 0.43/0.86  # SZS status Unsatisfiable
% 0.43/0.86  # SZS output start CNFRefutation
% See solution above
% 0.43/0.86  # Parsed axioms                        : 1448
% 0.43/0.86  # Removed by relevancy pruning/SinE    : 0
% 0.43/0.86  # Initial clauses                      : 1448
% 0.43/0.86  # Removed in clause preprocessing      : 3
% 0.43/0.86  # Initial clauses in saturation        : 1445
% 0.43/0.86  # Processed clauses                    : 3164
% 0.43/0.86  # ...of these trivial                  : 28
% 0.43/0.86  # ...subsumed                          : 316
% 0.43/0.86  # ...remaining for further processing  : 2820
% 0.43/0.86  # Other redundant clauses eliminated   : 4
% 0.43/0.86  # Clauses deleted for lack of memory   : 0
% 0.43/0.86  # Backward-subsumed                    : 2
% 0.43/0.86  # Backward-rewritten                   : 26
% 0.43/0.86  # Generated clauses                    : 1898
% 0.43/0.86  # ...of the previous two non-redundant : 826
% 0.43/0.86  # ...aggressively subsumed             : 0
% 0.43/0.86  # Contextual simplify-reflections      : 1
% 0.43/0.86  # Paramodulations                      : 1845
% 0.43/0.86  # Factorizations                       : 0
% 0.43/0.86  # NegExts                              : 0
% 0.43/0.86  # Equation resolutions                 : 53
% 0.43/0.86  # Total rewrite steps                  : 1162
% 0.43/0.86  # Propositional unsat checks           : 0
% 0.43/0.86  #    Propositional check models        : 0
% 0.43/0.86  #    Propositional check unsatisfiable : 0
% 0.43/0.86  #    Propositional clauses             : 0
% 0.43/0.86  #    Propositional clauses after purity: 0
% 0.43/0.86  #    Propositional unsat core size     : 0
% 0.43/0.86  #    Propositional preprocessing time  : 0.000
% 0.43/0.86  #    Propositional encoding time       : 0.000
% 0.43/0.86  #    Propositional solver time         : 0.000
% 0.43/0.86  #    Success case prop preproc time    : 0.000
% 0.43/0.86  #    Success case prop encoding time   : 0.000
% 0.43/0.86  #    Success case prop solver time     : 0.000
% 0.43/0.86  # Current number of processed clauses  : 1401
% 0.43/0.86  #    Positive orientable unit clauses  : 200
% 0.43/0.86  #    Positive unorientable unit clauses: 0
% 0.43/0.86  #    Negative unit clauses             : 48
% 0.43/0.86  #    Non-unit-clauses                  : 1153
% 0.43/0.86  # Current number of unprocessed clauses: 476
% 0.43/0.86  # ...number of literals in the above   : 1162
% 0.43/0.86  # Current number of archived formulas  : 0
% 0.43/0.86  # Current number of archived clauses   : 1420
% 0.43/0.86  # Clause-clause subsumption calls (NU) : 1020263
% 0.43/0.86  # Rec. Clause-clause subsumption calls : 989705
% 0.43/0.86  # Non-unit clause-clause subsumptions  : 264
% 0.43/0.86  # Unit Clause-clause subsumption calls : 13437
% 0.43/0.86  # Rewrite failures with RHS unbound    : 0
% 0.43/0.86  # BW rewrite match attempts            : 90
% 0.43/0.86  # BW rewrite match successes           : 20
% 0.43/0.86  # Condensation attempts                : 0
% 0.43/0.86  # Condensation successes               : 0
% 0.43/0.86  # Termbank termtop insertions          : 49037
% 0.43/0.86  
% 0.43/0.86  # -------------------------------------------------
% 0.43/0.86  # User time                : 0.223 s
% 0.43/0.86  # System time              : 0.004 s
% 0.43/0.86  # Total time               : 0.227 s
% 0.43/0.86  # Maximum resident set size: 3896 pages
% 0.43/0.86  
% 0.43/0.86  # -------------------------------------------------
% 0.43/0.86  # User time                : 1.068 s
% 0.43/0.86  # System time              : 0.034 s
% 0.43/0.86  # Total time               : 1.101 s
% 0.43/0.86  # Maximum resident set size: 2456 pages
% 0.43/0.86  % E---3.1 exiting
% 0.43/0.86  % E---3.1 exiting
%------------------------------------------------------------------------------