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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV757-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.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:55:16 EDT 2023

% Result   : Unsatisfiable 18.12s 2.85s
% Output   : CNFRefutation 18.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  14 unt;   0 nHn;  16 RR)
%            Number of literals    :   52 (   2 equ;  28 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   18 (  18 usr;   6 con; 0-3 aty)
%            Number of variables   :   70 (  21 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_usedI_0,axiom,
    ( hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg))
    | ~ hBOOL(c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_usedI_0) ).

cnf(cls_not__parts__not__analz_0,axiom,
    ( hBOOL(c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg))
    | ~ hBOOL(c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_not__parts__not__analz_0) ).

cnf(cls_predicate1D_0,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(hAPP(X3,X2))
    | ~ c_lessequals(X3,X1,tc_fun(X4,tc_bool)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_predicate1D_0) ).

cnf(cls_analz__increasing_0,axiom,
    c_lessequals(X1,c_Message_Oanalz(X1),tc_fun(tc_Message_Omsg,tc_bool)),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_analz__increasing_0) ).

cnf(cls_Nonce__supply1_0,axiom,
    ~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)),c_Event_Oused(X1),tc_Message_Omsg)),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_Nonce__supply1_0) ).

cnf(cls_mem__def_1,axiom,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_mem__def_1) ).

cnf(cls_keymode_Oinduct_0,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_keymode_Oinduct_0) ).

cnf(cls_insert__code_1,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_insert__code_1) ).

cnf(cls_knows__Notes_0,axiom,
    c_Event_Oknows(X1,c_List_Olist_OCons(c_Event_Oevent_ONotes(X1,X2),X3,tc_Event_Oevent)) = c_Set_Oinsert(X2,c_Event_Oknows(X1,X3),tc_Message_Omsg),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_knows__Notes_0) ).

cnf(cls_insert__code_2,axiom,
    ( hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4))
    | ~ hBOOL(hAPP(X2,X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.FTRpRmCOkj/E---3.1_8159.p',cls_insert__code_2) ).

cnf(c_0_10,axiom,
    ( hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg))
    | ~ hBOOL(c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)) ),
    cls_usedI_0 ).

cnf(c_0_11,axiom,
    ( hBOOL(c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg))
    | ~ hBOOL(c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)) ),
    cls_not__parts__not__analz_0 ).

cnf(c_0_12,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(hAPP(X3,X2))
    | ~ c_lessequals(X3,X1,tc_fun(X4,tc_bool)) ),
    cls_predicate1D_0 ).

cnf(c_0_13,axiom,
    c_lessequals(X1,c_Message_Oanalz(X1),tc_fun(tc_Message_Omsg,tc_bool)),
    cls_analz__increasing_0 ).

cnf(c_0_14,axiom,
    ~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)),c_Event_Oused(X1),tc_Message_Omsg)),
    cls_Nonce__supply1_0 ).

cnf(c_0_15,plain,
    ( hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg))
    | ~ hBOOL(c_in(X1,c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,axiom,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    cls_mem__def_1 ).

cnf(c_0_17,plain,
    ( hBOOL(hAPP(c_Message_Oanalz(X1),X2))
    | ~ hBOOL(hAPP(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    ~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,X1)),tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    ( hBOOL(c_in(X1,c_Message_Oanalz(X2),X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature)) ),
    cls_keymode_Oinduct_0 ).

cnf(c_0_21,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    cls_insert__code_1 ).

cnf(c_0_22,plain,
    ~ hBOOL(hAPP(c_Event_Oknows(c_Message_Oagent_OSpy,X1),c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,axiom,
    c_Event_Oknows(X1,c_List_Olist_OCons(c_Event_Oevent_ONotes(X1,X2),X3,tc_Event_Oevent)) = c_Set_Oinsert(X2,c_Event_Oknows(X1,X3),tc_Message_Omsg),
    cls_knows__Notes_0 ).

cnf(c_0_24,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X3))
    | ~ hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),c_Public_Okeymode_OEncryption)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,axiom,
    ( hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4))
    | ~ hBOOL(hAPP(X2,X4)) ),
    cls_insert__code_2 ).

cnf(c_0_26,plain,
    ~ hBOOL(hAPP(c_Set_Oinsert(X1,c_Event_Oknows(c_Message_Oagent_OSpy,X2),tc_Message_Omsg),c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(c_List_Olist_OCons(c_Event_Oevent_ONotes(c_Message_Oagent_OSpy,X1),X2,tc_Event_Oevent))))),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X3))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,plain,
    ~ hBOOL(hAPP(c_Event_Oknows(c_Message_Oagent_OSpy,X1),c_Public_Okeymode_OEncryption)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,plain,
    ~ hBOOL(hAPP(c_Set_Oinsert(X1,c_Event_Oknows(c_Message_Oagent_OSpy,X2),tc_Message_Omsg),c_Public_Okeymode_OEncryption)),
    inference(spm,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_30,plain,
    $false,
    inference(spm,[status(thm)],[c_0_29,c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15  % Problem    : SWV757-1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.16  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n014.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 2400
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Tue Oct  3 04:14:49 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.21/0.53  Running first-order theorem proving
% 0.21/0.53  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.FTRpRmCOkj/E---3.1_8159.p
% 18.12/2.85  # Version: 3.1pre001
% 18.12/2.85  # Preprocessing class: FSLSSMSMSSSNFFN.
% 18.12/2.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.12/2.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 18.12/2.85  # Starting new_bool_3 with 300s (1) cores
% 18.12/2.85  # Starting new_bool_1 with 300s (1) cores
% 18.12/2.85  # Starting sh5l with 300s (1) cores
% 18.12/2.85  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8237 completed with status 0
% 18.12/2.85  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 18.12/2.85  # Preprocessing class: FSLSSMSMSSSNFFN.
% 18.12/2.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.12/2.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 18.12/2.85  # No SInE strategy applied
% 18.12/2.85  # Search class: FGHSM-FSLM31-DFFFFFNN
% 18.12/2.85  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.12/2.85  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 680s (1) cores
% 18.12/2.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 18.12/2.85  # Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 18.12/2.85  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 18.12/2.85  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 18.12/2.85  # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 8247 completed with status 0
% 18.12/2.85  # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 18.12/2.85  # Preprocessing class: FSLSSMSMSSSNFFN.
% 18.12/2.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.12/2.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 18.12/2.85  # No SInE strategy applied
% 18.12/2.85  # Search class: FGHSM-FSLM31-DFFFFFNN
% 18.12/2.85  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.12/2.85  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 680s (1) cores
% 18.12/2.85  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 18.12/2.85  # Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 18.12/2.85  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 18.12/2.85  # Preprocessing time       : 0.130 s
% 18.12/2.85  
% 18.12/2.85  # Proof found!
% 18.12/2.85  # SZS status Unsatisfiable
% 18.12/2.85  # SZS output start CNFRefutation
% See solution above
% 18.12/2.85  # Parsed axioms                        : 588
% 18.12/2.85  # Removed by relevancy pruning/SinE    : 0
% 18.12/2.85  # Initial clauses                      : 588
% 18.12/2.85  # Removed in clause preprocessing      : 1
% 18.12/2.85  # Initial clauses in saturation        : 587
% 18.12/2.85  # Processed clauses                    : 7561
% 18.12/2.85  # ...of these trivial                  : 356
% 18.12/2.85  # ...subsumed                          : 4146
% 18.12/2.85  # ...remaining for further processing  : 3059
% 18.12/2.85  # Other redundant clauses eliminated   : 18
% 18.12/2.85  # Clauses deleted for lack of memory   : 0
% 18.12/2.85  # Backward-subsumed                    : 604
% 18.12/2.85  # Backward-rewritten                   : 309
% 18.12/2.85  # Generated clauses                    : 78479
% 18.12/2.85  # ...of the previous two non-redundant : 69424
% 18.12/2.85  # ...aggressively subsumed             : 0
% 18.12/2.85  # Contextual simplify-reflections      : 5
% 18.12/2.85  # Paramodulations                      : 78411
% 18.12/2.85  # Factorizations                       : 2
% 18.12/2.85  # NegExts                              : 0
% 18.12/2.85  # Equation resolutions                 : 66
% 18.12/2.85  # Total rewrite steps                  : 47121
% 18.12/2.85  # Propositional unsat checks           : 0
% 18.12/2.85  #    Propositional check models        : 0
% 18.12/2.85  #    Propositional check unsatisfiable : 0
% 18.12/2.85  #    Propositional clauses             : 0
% 18.12/2.85  #    Propositional clauses after purity: 0
% 18.12/2.85  #    Propositional unsat core size     : 0
% 18.12/2.85  #    Propositional preprocessing time  : 0.000
% 18.12/2.85  #    Propositional encoding time       : 0.000
% 18.12/2.85  #    Propositional solver time         : 0.000
% 18.12/2.85  #    Success case prop preproc time    : 0.000
% 18.12/2.85  #    Success case prop encoding time   : 0.000
% 18.12/2.85  #    Success case prop solver time     : 0.000
% 18.12/2.85  # Current number of processed clauses  : 2146
% 18.12/2.85  #    Positive orientable unit clauses  : 702
% 18.12/2.85  #    Positive unorientable unit clauses: 8
% 18.12/2.86  #    Negative unit clauses             : 229
% 18.12/2.86  #    Non-unit-clauses                  : 1207
% 18.12/2.86  # Current number of unprocessed clauses: 58139
% 18.12/2.86  # ...number of literals in the above   : 118782
% 18.12/2.86  # Current number of archived formulas  : 0
% 18.12/2.86  # Current number of archived clauses   : 914
% 18.12/2.86  # Clause-clause subsumption calls (NU) : 365230
% 18.12/2.86  # Rec. Clause-clause subsumption calls : 257973
% 18.12/2.86  # Non-unit clause-clause subsumptions  : 1866
% 18.12/2.86  # Unit Clause-clause subsumption calls : 61327
% 18.12/2.86  # Rewrite failures with RHS unbound    : 0
% 18.12/2.86  # BW rewrite match attempts            : 11237
% 18.12/2.86  # BW rewrite match successes           : 341
% 18.12/2.86  # Condensation attempts                : 0
% 18.12/2.86  # Condensation successes               : 0
% 18.12/2.86  # Termbank termtop insertions          : 1631372
% 18.12/2.86  
% 18.12/2.86  # -------------------------------------------------
% 18.12/2.86  # User time                : 2.123 s
% 18.12/2.86  # System time              : 0.099 s
% 18.12/2.86  # Total time               : 2.221 s
% 18.12/2.86  # Maximum resident set size: 2896 pages
% 18.12/2.86  
% 18.12/2.86  # -------------------------------------------------
% 18.12/2.86  # User time                : 10.593 s
% 18.12/2.86  # System time              : 0.374 s
% 18.12/2.86  # Total time               : 10.967 s
% 18.12/2.86  # Maximum resident set size: 2184 pages
% 18.12/2.86  % E---3.1 exiting
% 18.12/2.86  % E---3.1 exiting
%------------------------------------------------------------------------------