TSTP Solution File: SWV010+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWV010+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n031.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:48 EDT 2023

% Result   : Satisfiable 0.15s 0.41s
% Output   : Saturation 0.15s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_23)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_16,plain,
    ( message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))
    | ~ message(sent(X2,b,pair(X2,X1)))
    | ~ fresh_to_b(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]),
    [final] ).

cnf(c_0_17,plain,
    message(sent(a,b,pair(a,an_a_nonce))),
    inference(split_conjunct,[status(thm)],[a_sent_message_i_to_b]),
    [final] ).

cnf(c_0_18,plain,
    fresh_to_b(an_a_nonce),
    inference(split_conjunct,[status(thm)],[nonce_a_is_fresh_to_b]),
    [final] ).

cnf(c_0_20,plain,
    ( message(sent(t,X3,triple(encrypt(quadruple(X1,X4,generate_key(X4),X5),X7),encrypt(triple(X3,generate_key(X4),X5),X6),X2)))
    | ~ message(sent(X1,t,triple(X1,X2,encrypt(triple(X3,X4,X5),X6))))
    | ~ t_holds(key(X6,X1))
    | ~ t_holds(key(X7,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]),
    [final] ).

cnf(c_0_21,plain,
    message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
    [final] ).

cnf(c_0_22,plain,
    t_holds(key(bt,b)),
    inference(split_conjunct,[status(thm)],[t_holds_key_bt_for_b]),
    [final] ).

cnf(c_0_24,plain,
    ( message(sent(a,X1,pair(X2,encrypt(X3,X4))))
    | ~ message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3)))
    | ~ a_stored(pair(X1,X5)) ),
    inference(split_conjunct,[status(thm)],[c_0_19]),
    [final] ).

cnf(c_0_25,plain,
    ( message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),X1),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce))))
    | ~ t_holds(key(X1,a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
    [final] ).

cnf(c_0_26,plain,
    a_stored(pair(b,an_a_nonce)),
    inference(split_conjunct,[status(thm)],[a_stored_message_i]),
    [final] ).

cnf(c_0_27,plain,
    t_holds(key(at,a)),
    inference(split_conjunct,[status(thm)],[t_holds_key_at_for_a]),
    [final] ).

cnf(c_0_28,plain,
    ( b_stored(pair(X1,X2))
    | ~ message(sent(X1,b,pair(X1,X2)))
    | ~ fresh_to_b(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]),
    [final] ).

cnf(c_0_29,plain,
    ( b_holds(key(X2,X1))
    | ~ message(sent(X1,b,pair(encrypt(triple(X1,X2,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X2))))
    | ~ b_stored(pair(X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_23]),
    [final] ).

cnf(c_0_30,plain,
    message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce))))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),
    [final] ).

cnf(c_0_31,plain,
    b_stored(pair(a,an_a_nonce)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_18])]),
    [final] ).

cnf(c_0_32,plain,
    ( a_holds(key(X1,X2))
    | ~ message(sent(t,a,triple(encrypt(quadruple(X2,X3,X1,X4),at),X5,X6)))
    | ~ a_stored(pair(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_19]),
    [final] ).

cnf(c_0_33,plain,
    b_holds(key(generate_key(an_a_nonce),a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
    [final] ).

cnf(c_0_34,plain,
    a_holds(key(generate_key(an_a_nonce),b)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_26]),c_0_27])]),
    [final] ).

cnf(c_0_35,plain,
    b_holds(key(bt,t)),
    inference(split_conjunct,[status(thm)],[b_hold_key_bt_for_t]),
    [final] ).

cnf(c_0_36,plain,
    a_holds(key(at,t)),
    inference(split_conjunct,[status(thm)],[a_holds_key_at_for_t]),
    [final] ).

cnf(c_0_37,plain,
    party_of_protocol(b),
    inference(split_conjunct,[status(thm)],[b_is_party_of_protocol]),
    [final] ).

cnf(c_0_38,plain,
    party_of_protocol(a),
    inference(split_conjunct,[status(thm)],[a_is_party_of_protocol]),
    [final] ).

cnf(c_0_39,plain,
    party_of_protocol(t),
    inference(split_conjunct,[status(thm)],[t_is_party_of_protocol]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SWV010+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n031.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Tue Oct  3 03:47:58 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.15/0.39  Running first-order model finding
% 0.15/0.39  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.dcOj351cuq/E---3.1_24185.p
% 0.15/0.41  # Version: 3.1pre001
% 0.15/0.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41  # Starting sh5l with 300s (1) cores
% 0.15/0.41  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24262 completed with status 1
% 0.15/0.41  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41  # No SInE strategy applied
% 0.15/0.41  # Search class: FHUNF-FFSM32-MFFFFFNN
% 0.15/0.41  # partial match(1): FHUNF-FFSF32-MFFFFFNN
% 0.15/0.41  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.41  # Starting new_bool_3 with 136s (1) cores
% 0.15/0.41  # Starting new_bool_1 with 136s (1) cores
% 0.15/0.41  # Starting sh5l with 136s (1) cores
% 0.15/0.41  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24273 completed with status 1
% 0.15/0.41  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41  # No SInE strategy applied
% 0.15/0.41  # Search class: FHUNF-FFSM32-MFFFFFNN
% 0.15/0.41  # partial match(1): FHUNF-FFSF32-MFFFFFNN
% 0.15/0.41  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.41  # Preprocessing time       : 0.001 s
% 0.15/0.41  # Presaturation interreduction done
% 0.15/0.41  
% 0.15/0.41  # No proof found!
% 0.15/0.41  # SZS status Satisfiable
% 0.15/0.41  # SZS output start Saturation
% See solution above
% 0.15/0.41  # Parsed axioms                        : 14
% 0.15/0.41  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.41  # Initial clauses                      : 16
% 0.15/0.41  # Removed in clause preprocessing      : 0
% 0.15/0.41  # Initial clauses in saturation        : 16
% 0.15/0.41  # Processed clauses                    : 38
% 0.15/0.41  # ...of these trivial                  : 0
% 0.15/0.41  # ...subsumed                          : 0
% 0.15/0.41  # ...remaining for further processing  : 38
% 0.15/0.41  # Other redundant clauses eliminated   : 0
% 0.15/0.41  # Clauses deleted for lack of memory   : 0
% 0.15/0.41  # Backward-subsumed                    : 0
% 0.15/0.41  # Backward-rewritten                   : 0
% 0.15/0.41  # Generated clauses                    : 6
% 0.15/0.41  # ...of the previous two non-redundant : 6
% 0.15/0.41  # ...aggressively subsumed             : 0
% 0.15/0.41  # Contextual simplify-reflections      : 0
% 0.15/0.41  # Paramodulations                      : 6
% 0.15/0.41  # Factorizations                       : 0
% 0.15/0.41  # NegExts                              : 0
% 0.15/0.41  # Equation resolutions                 : 0
% 0.15/0.41  # Total rewrite steps                  : 8
% 0.15/0.41  # Propositional unsat checks           : 0
% 0.15/0.41  #    Propositional check models        : 0
% 0.15/0.41  #    Propositional check unsatisfiable : 0
% 0.15/0.41  #    Propositional clauses             : 0
% 0.15/0.41  #    Propositional clauses after purity: 0
% 0.15/0.41  #    Propositional unsat core size     : 0
% 0.15/0.41  #    Propositional preprocessing time  : 0.000
% 0.15/0.41  #    Propositional encoding time       : 0.000
% 0.15/0.41  #    Propositional solver time         : 0.000
% 0.15/0.41  #    Success case prop preproc time    : 0.000
% 0.15/0.41  #    Success case prop encoding time   : 0.000
% 0.15/0.41  #    Success case prop solver time     : 0.000
% 0.15/0.41  # Current number of processed clauses  : 22
% 0.15/0.41  #    Positive orientable unit clauses  : 15
% 0.15/0.41  #    Positive unorientable unit clauses: 0
% 0.15/0.41  #    Negative unit clauses             : 0
% 0.15/0.41  #    Non-unit-clauses                  : 7
% 0.15/0.41  # Current number of unprocessed clauses: 0
% 0.15/0.41  # ...number of literals in the above   : 0
% 0.15/0.41  # Current number of archived formulas  : 0
% 0.15/0.41  # Current number of archived clauses   : 16
% 0.15/0.41  # Clause-clause subsumption calls (NU) : 2
% 0.15/0.41  # Rec. Clause-clause subsumption calls : 2
% 0.15/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.41  # Unit Clause-clause subsumption calls : 2
% 0.15/0.41  # Rewrite failures with RHS unbound    : 0
% 0.15/0.41  # BW rewrite match attempts            : 2
% 0.15/0.41  # BW rewrite match successes           : 0
% 0.15/0.41  # Condensation attempts                : 0
% 0.15/0.41  # Condensation successes               : 0
% 0.15/0.41  # Termbank termtop insertions          : 1372
% 0.15/0.41  
% 0.15/0.41  # -------------------------------------------------
% 0.15/0.41  # User time                : 0.003 s
% 0.15/0.41  # System time              : 0.003 s
% 0.15/0.41  # Total time               : 0.006 s
% 0.15/0.41  # Maximum resident set size: 1764 pages
% 0.15/0.41  
% 0.15/0.41  # -------------------------------------------------
% 0.15/0.41  # User time                : 0.017 s
% 0.15/0.41  # System time              : 0.007 s
% 0.15/0.41  # Total time               : 0.023 s
% 0.15/0.41  # Maximum resident set size: 1696 pages
% 0.15/0.41  % E---3.1 exiting
%------------------------------------------------------------------------------