TSTP Solution File: SWV236+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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 : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:15:41 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 78 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 69 ( 33 ~; 28 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(decrypt_data,axiom,
! [X1,X6] :
( ( p(X1)
& p(crypt(xor(km,data),X6)) )
=> p(decrypt(X6,X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',decrypt_data) ).
fof(xor_commutative,axiom,
! [X1,X2] : xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',xor_commutative) ).
fof(key_export,axiom,
! [X9,X6,X4] :
( ( p(crypt(xor(km,X9),X6))
& p(X9)
& p(crypt(xor(km,exp),X4)) )
=> p(crypt(xor(X4,X9),X6)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',key_export) ).
fof(encryption_decryption_cancellation,axiom,
! [X1,X2] : decrypt(X1,crypt(X1,X2)) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',encryption_decryption_cancellation) ).
fof(initial_knowledge_of_intruder_7,axiom,
p(crypt(xor(km,exp),eurk)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',initial_knowledge_of_intruder_7) ).
fof(find_known_exporter,conjecture,
? [X12] :
( p(crypt(xor(km,exp),X12))
& p(X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',find_known_exporter) ).
fof(initial_knowledge_of_intruder_8,axiom,
p(crypt(xor(km,data),eurk)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',initial_knowledge_of_intruder_8) ).
fof(xor_rules_1,axiom,
! [X1] : xor(X1,id) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',xor_rules_1) ).
fof(data_cv_is_known_to_be_zero,axiom,
! [X1,X2] :
( p(crypt(xor(X1,data),X2))
=> p(crypt(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',data_cv_is_known_to_be_zero) ).
fof(initial_knowledge_of_intruder_4,axiom,
p(id),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',initial_knowledge_of_intruder_4) ).
fof(c_0_10,plain,
! [X7,X8] :
( ~ p(X7)
| ~ p(crypt(xor(km,data),X8))
| p(decrypt(X8,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[decrypt_data])]) ).
fof(c_0_11,plain,
! [X3,X4] : xor(X3,X4) = xor(X4,X3),
inference(variable_rename,[status(thm)],[xor_commutative]) ).
fof(c_0_12,plain,
! [X10,X11,X12] :
( ~ p(crypt(xor(km,X10),X11))
| ~ p(X10)
| ~ p(crypt(xor(km,exp),X12))
| p(crypt(xor(X12,X10),X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_export])]) ).
cnf(c_0_13,plain,
( p(decrypt(X1,X2))
| ~ p(crypt(xor(km,data),X1))
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
xor(X1,X2) = xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X3,X4] : decrypt(X3,crypt(X3,X4)) = X4,
inference(variable_rename,[status(thm)],[encryption_decryption_cancellation]) ).
cnf(c_0_16,plain,
( p(crypt(xor(X1,X2),X3))
| ~ p(crypt(xor(km,exp),X1))
| ~ p(X2)
| ~ p(crypt(xor(km,X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
p(crypt(xor(km,exp),eurk)),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_7]) ).
fof(c_0_18,negated_conjecture,
~ ? [X12] :
( p(crypt(xor(km,exp),X12))
& p(X12) ),
inference(assume_negation,[status(cth)],[find_known_exporter]) ).
cnf(c_0_19,plain,
( p(decrypt(X1,X2))
| ~ p(crypt(xor(data,km),X1))
| ~ p(X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
decrypt(X1,crypt(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
p(crypt(xor(km,data),eurk)),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_8]) ).
cnf(c_0_22,plain,
( p(crypt(xor(X1,X2),X3))
| ~ p(crypt(xor(exp,km),X1))
| ~ p(crypt(xor(km,X2),X3))
| ~ p(X2) ),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_23,plain,
p(crypt(xor(exp,km),eurk)),
inference(rw,[status(thm)],[c_0_17,c_0_14]) ).
fof(c_0_24,plain,
! [X2] : xor(X2,id) = X2,
inference(variable_rename,[status(thm)],[xor_rules_1]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ p(crypt(xor(X3,data),X4))
| p(crypt(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[data_cv_is_known_to_be_zero])]) ).
fof(c_0_26,negated_conjecture,
! [X13] :
( ~ p(crypt(xor(km,exp),X13))
| ~ p(X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
cnf(c_0_27,plain,
( p(X1)
| ~ p(crypt(xor(data,km),X2))
| ~ p(crypt(X2,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
p(crypt(xor(data,km),eurk)),
inference(rw,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_29,plain,
( p(crypt(xor(eurk,X1),X2))
| ~ p(crypt(xor(km,X1),X2))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
xor(X1,id) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
p(id),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_4]) ).
cnf(c_0_32,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(X1,data),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ p(X1)
| ~ p(crypt(xor(km,exp),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( p(X1)
| ~ p(crypt(eurk,X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( p(crypt(eurk,X1))
| ~ p(crypt(km,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(data,X1),X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( ~ p(crypt(xor(exp,km),X1))
| ~ p(X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_38,plain,
( p(X1)
| ~ p(crypt(km,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
p(crypt(km,eurk)),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_40,negated_conjecture,
~ p(eurk),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 22:17:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.24/1.43 # Preprocessing time : 0.015 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 42
% 0.24/1.43 # Proof object clause steps : 24
% 0.24/1.43 # Proof object formula steps : 18
% 0.24/1.43 # Proof object conjectures : 6
% 0.24/1.43 # Proof object clause conjectures : 3
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 10
% 0.24/1.43 # Proof object initial formulas used : 10
% 0.24/1.43 # Proof object generating inferences : 9
% 0.24/1.43 # Proof object simplifying inferences : 9
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 28
% 0.24/1.43 # Removed by relevancy pruning/SinE : 0
% 0.24/1.43 # Initial clauses : 28
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 28
% 0.24/1.43 # Processed clauses : 126
% 0.24/1.43 # ...of these trivial : 4
% 0.24/1.43 # ...subsumed : 53
% 0.24/1.43 # ...remaining for further processing : 69
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 1
% 0.24/1.43 # Backward-rewritten : 8
% 0.24/1.43 # Generated clauses : 567
% 0.24/1.43 # ...of the previous two non-trivial : 456
% 0.24/1.43 # Contextual simplify-reflections : 9
% 0.24/1.43 # Paramodulations : 567
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 60
% 0.24/1.43 # Positive orientable unit clauses : 20
% 0.24/1.43 # Positive unorientable unit clauses: 3
% 0.24/1.43 # Negative unit clauses : 3
% 0.24/1.43 # Non-unit-clauses : 34
% 0.24/1.43 # Current number of unprocessed clauses: 274
% 0.24/1.43 # ...number of literals in the above : 694
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 9
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 610
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 457
% 0.24/1.43 # Non-unit clause-clause subsumptions : 35
% 0.24/1.43 # Unit Clause-clause subsumption calls : 46
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 45
% 0.24/1.43 # BW rewrite match successes : 31
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 8688
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.023 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.025 s
% 0.24/1.43 # Maximum resident set size: 3328 pages
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: CPU time limit exceeded, terminating
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------