TSTP Solution File: SWV237+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 56 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 25 ~; 22 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 4 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(encrypt_a_stored_comms_key,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(enc(i(tmk),X2),enc(i(tc),X1))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',encrypt_a_stored_comms_key) ).
fof(intruder_knows_8,axiom,
p(a),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intruder_knows_8) ).
fof(dec_enc_cancel,axiom,
! [X1,X2] : enc(X1,enc(i(X1),X2)) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dec_enc_cancel) ).
fof(double_inverse_cancel,axiom,
! [X1] : i(i(X1)) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',double_inverse_cancel) ).
fof(encrypt_clear_key_as_Tcomms_key,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(tc,X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',encrypt_clear_key_as_Tcomms_key) ).
fof(intruder_knows_1,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intruder_knows_1) ).
fof(co1,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ p(X4)
| ~ p(X5)
| ~ p(X6)
| p(enc(enc(i(tmk),X5),enc(i(tc),X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_a_stored_comms_key])])])]) ).
cnf(c_0_8,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
| ~ p(X3)
| ~ p(X1)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,plain,
p(a),
inference(split_conjunct,[status(thm)],[intruder_knows_8]) ).
fof(c_0_10,plain,
! [X3,X4] : enc(X3,enc(i(X3),X4)) = X4,
inference(variable_rename,[status(thm)],[dec_enc_cancel]) ).
fof(c_0_11,plain,
! [X2] : i(i(X2)) = X2,
inference(variable_rename,[status(thm)],[double_inverse_cancel]) ).
cnf(c_0_12,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
| ~ p(X2)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
enc(X1,enc(i(X1),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
i(i(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ p(X4)
| ~ p(X5)
| ~ p(X6)
| p(enc(tc,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_clear_key_as_Tcomms_key])])])]) ).
cnf(c_0_16,plain,
( p(enc(X1,enc(i(tc),X2)))
| ~ p(enc(tmk,X1))
| ~ p(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
p(enc(tmk,pp)),
inference(split_conjunct,[status(thm)],[intruder_knows_1]) ).
cnf(c_0_18,plain,
( p(enc(tc,X1))
| ~ p(X2)
| ~ p(X3)
| ~ p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,negated_conjecture,
~ p(enc(pp,a)),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_20,plain,
( p(enc(pp,enc(i(tc),X1)))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( p(enc(tc,X1))
| ~ p(X2)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
fof(c_0_22,negated_conjecture,
~ p(enc(pp,a)),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( p(enc(pp,X1))
| ~ p(enc(tc,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_14]) ).
cnf(c_0_24,plain,
( p(enc(tc,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ p(enc(pp,a)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( p(enc(pp,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 01:26:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 28
% 0.23/1.41 # Proof object clause steps : 15
% 0.23/1.41 # Proof object formula steps : 13
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 7
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 4
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 25
% 0.23/1.41 # Removed by relevancy pruning/SinE : 9
% 0.23/1.41 # Initial clauses : 16
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 16
% 0.23/1.41 # Processed clauses : 91
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 34
% 0.23/1.41 # ...remaining for further processing : 56
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 9
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 237
% 0.23/1.41 # ...of the previous two non-trivial : 200
% 0.23/1.41 # Contextual simplify-reflections : 2
% 0.23/1.41 # Paramodulations : 237
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 47
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 7
% 0.23/1.41 # Non-unit-clauses : 33
% 0.23/1.41 # Current number of unprocessed clauses: 56
% 0.23/1.41 # ...number of literals in the above : 209
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 9
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 773
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 626
% 0.23/1.41 # Non-unit clause-clause subsumptions : 37
% 0.23/1.41 # Unit Clause-clause subsumption calls : 78
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 4950
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.017 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.021 s
% 0.23/1.41 # Maximum resident set size: 2796 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------