TSTP Solution File: SWV237+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV237+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:52:10 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP19713/SWV237+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19713/SWV237+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19713/SWV237+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 19846
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,p(a),file('/tmp/SRASS.s.p', intruder_knows_8)).
% fof(3, axiom,p(enc(tmk,pp)),file('/tmp/SRASS.s.p', intruder_knows_1)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((p(X1)&p(X2))&p(X3))=>p(enc(tc,X1))),file('/tmp/SRASS.s.p', encrypt_clear_key_as_Tcomms_key)).
% fof(7, axiom,![X1]:i(i(X1))=X1,file('/tmp/SRASS.s.p', double_inverse_cancel)).
% fof(11, axiom,p(kk),file('/tmp/SRASS.s.p', intruder_knows_6)).
% fof(13, axiom,![X1]:![X2]:![X3]:(((p(X1)&p(X2))&p(X3))=>p(enc(enc(i(tmk),X2),enc(i(tc),X1)))),file('/tmp/SRASS.s.p', encrypt_a_stored_comms_key)).
% fof(21, axiom,![X1]:![X2]:enc(X1,enc(i(X1),X2))=X2,file('/tmp/SRASS.s.p', dec_enc_cancel)).
% fof(25, conjecture,p(enc(pp,a)),file('/tmp/SRASS.s.p', co1)).
% fof(26, negated_conjecture,~(p(enc(pp,a))),inference(assume_negation,[status(cth)],[25])).
% fof(27, negated_conjecture,~(p(enc(pp,a))),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% cnf(31,plain,(p(a)),inference(split_conjunct,[status(thm)],[2])).
% cnf(32,plain,(p(enc(tmk,pp))),inference(split_conjunct,[status(thm)],[3])).
% fof(39, plain,![X1]:![X2]:![X3]:(((~(p(X1))|~(p(X2)))|~(p(X3)))|p(enc(tc,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(40, plain,![X4]:![X5]:![X6]:(((~(p(X4))|~(p(X5)))|~(p(X6)))|p(enc(tc,X4))),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(p(enc(tc,X1))|~p(X2)|~p(X3)|~p(X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X2]:i(i(X2))=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(43,plain,(i(i(X1))=X1),inference(split_conjunct,[status(thm)],[42])).
% cnf(53,plain,(p(kk)),inference(split_conjunct,[status(thm)],[11])).
% fof(57, plain,![X1]:![X2]:![X3]:(((~(p(X1))|~(p(X2)))|~(p(X3)))|p(enc(enc(i(tmk),X2),enc(i(tc),X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(58, plain,![X4]:![X5]:![X6]:(((~(p(X4))|~(p(X5)))|~(p(X6)))|p(enc(enc(i(tmk),X5),enc(i(tc),X4)))),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(p(enc(enc(i(tmk),X1),enc(i(tc),X2)))|~p(X3)|~p(X1)|~p(X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(76, plain,![X3]:![X4]:enc(X3,enc(i(X3),X4))=X4,inference(variable_rename,[status(thm)],[21])).
% cnf(77,plain,(enc(X1,enc(i(X1),X2))=X2),inference(split_conjunct,[status(thm)],[76])).
% cnf(81,negated_conjecture,(~p(enc(pp,a))),inference(split_conjunct,[status(thm)],[27])).
% cnf(99,plain,(p(enc(tc,X1))|~p(X2)|~p(X1)),inference(spm,[status(thm)],[41,53,theory(equality)])).
% cnf(144,plain,(p(enc(enc(i(tmk),X1),enc(i(tc),X2)))|~p(X2)|~p(X1)),inference(spm,[status(thm)],[59,53,theory(equality)])).
% cnf(238,plain,(p(enc(tc,X1))|~p(X1)),inference(spm,[status(thm)],[99,53,theory(equality)])).
% cnf(394,plain,(p(enc(enc(i(tmk),X1),X2))|~p(enc(i(i(tc)),X2))|~p(X1)),inference(spm,[status(thm)],[144,77,theory(equality)])).
% cnf(398,plain,(p(enc(enc(i(tmk),X1),X2))|~p(enc(tc,X2))|~p(X1)),inference(rw,[status(thm)],[394,43,theory(equality)])).
% cnf(822,plain,(p(enc(X1,X2))|~p(enc(tc,X2))|~p(enc(i(i(tmk)),X1))),inference(spm,[status(thm)],[398,77,theory(equality)])).
% cnf(825,plain,(p(enc(X1,X2))|~p(enc(tc,X2))|~p(enc(tmk,X1))),inference(rw,[status(thm)],[822,43,theory(equality)])).
% cnf(838,plain,(p(enc(X1,X2))|~p(enc(tmk,X1))|~p(X2)),inference(spm,[status(thm)],[825,238,theory(equality)])).
% cnf(871,plain,(p(enc(pp,X1))|~p(X1)),inference(spm,[status(thm)],[838,32,theory(equality)])).
% cnf(875,negated_conjecture,(~p(a)),inference(spm,[status(thm)],[81,871,theory(equality)])).
% cnf(877,negated_conjecture,($false),inference(rw,[status(thm)],[875,31,theory(equality)])).
% cnf(878,negated_conjecture,($false),inference(cn,[status(thm)],[877,theory(equality)])).
% cnf(879,negated_conjecture,($false),878,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 260
% # ...of these trivial : 1
% # ...subsumed : 117
% # ...remaining for further processing: 142
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 0
% # Generated clauses : 660
% # ...of the previous two non-trivial : 594
% # Contextual simplify-reflections : 21
% # Paramodulations : 660
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 104
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 78
% # Current number of unprocessed clauses: 165
% # ...number of literals in the above : 664
% # Clause-clause subsumption calls (NU) : 1286
% # Rec. Clause-clause subsumption calls : 1101
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 128 leaves, 1.55+/-1.391 terms/leaf
% # Paramod-from index: 29 leaves, 1.38+/-1.031 terms/leaf
% # Paramod-into index: 119 leaves, 1.54+/-1.383 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.002 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP19713/SWV237+1.tptp
%
%------------------------------------------------------------------------------