TSTP Solution File: SWV234+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV234+2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 08:47:05 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP6863/SWV234+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6863/SWV234+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6863/SWV234+2.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 6959
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,public(a),file('/tmp/SRASS.s.p', initial_knowledge8)).
% fof(5, axiom,public(enc(xor(kek,pin),pp)),file('/tmp/SRASS.s.p', initial_knowledge5)).
% fof(8, axiom,![X1]:![X2]:![X3]:enc(X1,enc(inv(X1),X2))=X2,file('/tmp/SRASS.s.p', encrypt_decrypt_cancel)).
% fof(9, axiom,public(data),file('/tmp/SRASS.s.p', initial_knowledge2)).
% fof(10, axiom,public(enc(xor(km,imp),xor(kek,xor(pin,data)))),file('/tmp/SRASS.s.p', initial_knowledge9)).
% fof(12, axiom,![X1]:![X2]:((public(X1)&public(X2))=>public(enc(enc(inv(xor(data,km)),X1),X2))),file('/tmp/SRASS.s.p', encrypt_data_cmd)).
% fof(13, axiom,![X1]:![X2]:![X3]:(((public(X2)&public(enc(xor(X1,X2),X3)))&public(enc(xor(km,imp),X1)))=>public(enc(xor(km,X2),X3))),file('/tmp/SRASS.s.p', key_import_cmd)).
% fof(17, axiom,![X1]:![X2]:![X3]:xor(X1,X1)=z,file('/tmp/SRASS.s.p', xor_self_cancel)).
% fof(18, axiom,![X1]:![X2]:![X3]:xor(X1,z)=X1,file('/tmp/SRASS.s.p', xor_zero)).
% fof(20, axiom,![X1]:![X2]:![X3]:xor(X1,X2)=xor(X2,X1),file('/tmp/SRASS.s.p', xor_commutes)).
% fof(21, axiom,![X1]:![X2]:![X3]:xor(X1,xor(X2,X3))=xor(xor(X1,X2),X3),file('/tmp/SRASS.s.p', xor_assosciative)).
% fof(22, conjecture,public(enc(pp,a)),file('/tmp/SRASS.s.p', co1)).
% fof(23, negated_conjecture,~(public(enc(pp,a))),inference(assume_negation,[status(cth)],[22])).
% fof(24, negated_conjecture,~(public(enc(pp,a))),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% cnf(28,plain,(public(a)),inference(split_conjunct,[status(thm)],[2])).
% cnf(33,plain,(public(enc(xor(kek,pin),pp))),inference(split_conjunct,[status(thm)],[5])).
% fof(40, plain,![X4]:![X5]:![X6]:enc(X4,enc(inv(X4),X5))=X5,inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(enc(X1,enc(inv(X1),X2))=X2),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(public(data)),inference(split_conjunct,[status(thm)],[9])).
% cnf(43,plain,(public(enc(xor(km,imp),xor(kek,xor(pin,data))))),inference(split_conjunct,[status(thm)],[10])).
% fof(45, plain,![X1]:![X2]:((~(public(X1))|~(public(X2)))|public(enc(enc(inv(xor(data,km)),X1),X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(46, plain,![X3]:![X4]:((~(public(X3))|~(public(X4)))|public(enc(enc(inv(xor(data,km)),X3),X4))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(public(enc(enc(inv(xor(data,km)),X1),X2))|~public(X2)|~public(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X1]:![X2]:![X3]:(((~(public(X2))|~(public(enc(xor(X1,X2),X3))))|~(public(enc(xor(km,imp),X1))))|public(enc(xor(km,X2),X3))),inference(fof_nnf,[status(thm)],[13])).
% fof(49, plain,![X4]:![X5]:![X6]:(((~(public(X5))|~(public(enc(xor(X4,X5),X6))))|~(public(enc(xor(km,imp),X4))))|public(enc(xor(km,X5),X6))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(56, plain,![X4]:![X5]:![X6]:xor(X4,X4)=z,inference(variable_rename,[status(thm)],[17])).
% cnf(57,plain,(xor(X1,X1)=z),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X4]:![X5]:![X6]:xor(X4,z)=X4,inference(variable_rename,[status(thm)],[18])).
% cnf(59,plain,(xor(X1,z)=X1),inference(split_conjunct,[status(thm)],[58])).
% fof(61, plain,![X4]:![X5]:![X6]:xor(X4,X5)=xor(X5,X4),inference(variable_rename,[status(thm)],[20])).
% cnf(62,plain,(xor(X1,X2)=xor(X2,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X4]:![X5]:![X6]:xor(X4,xor(X5,X6))=xor(xor(X4,X5),X6),inference(variable_rename,[status(thm)],[21])).
% cnf(64,plain,(xor(X1,xor(X2,X3))=xor(xor(X1,X2),X3)),inference(split_conjunct,[status(thm)],[63])).
% cnf(65,negated_conjecture,(~public(enc(pp,a))),inference(split_conjunct,[status(thm)],[24])).
% cnf(66,plain,(public(enc(xor(pin,kek),pp))),inference(rw,[status(thm)],[33,62,theory(equality)])).
% cnf(67,plain,(public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1)),inference(rw,[status(thm)],[47,62,theory(equality)])).
% cnf(77,plain,(enc(X1,X2)=enc(inv(inv(X1)),X2)),inference(spm,[status(thm)],[41,41,theory(equality)])).
% cnf(89,plain,(xor(X1,xor(X2,X3))=xor(X3,xor(X1,X2))),inference(spm,[status(thm)],[62,64,theory(equality)])).
% cnf(133,plain,(enc(inv(X1),enc(X1,X2))=X2),inference(spm,[status(thm)],[41,77,theory(equality)])).
% cnf(154,plain,(public(enc(X1,X2))|~public(X2)|~public(enc(xor(km,data),X1))),inference(spm,[status(thm)],[67,133,theory(equality)])).
% cnf(222,plain,(xor(X1,z)=xor(X2,xor(X1,X2))),inference(spm,[status(thm)],[89,57,theory(equality)])).
% cnf(225,plain,(public(enc(xor(km,imp),xor(pin,xor(data,kek))))),inference(rw,[status(thm)],[43,89,theory(equality)])).
% cnf(257,plain,(X1=xor(X2,xor(X1,X2))),inference(rw,[status(thm)],[222,59,theory(equality)])).
% cnf(362,plain,(public(enc(xor(km,X1),X2))|~public(enc(xor(xor(pin,xor(data,kek)),X1),X2))|~public(X1)),inference(spm,[status(thm)],[50,225,theory(equality)])).
% cnf(363,plain,(public(enc(xor(km,X1),X2))|~public(enc(xor(pin,xor(data,xor(kek,X1))),X2))|~public(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[362,64,theory(equality)]),64,theory(equality)])).
% cnf(1739,plain,(public(enc(xor(km,data),X1))|~public(enc(xor(pin,kek),X1))|~public(data)),inference(spm,[status(thm)],[363,257,theory(equality)])).
% cnf(1749,plain,(public(enc(xor(km,data),X1))|~public(enc(xor(pin,kek),X1))|$false),inference(rw,[status(thm)],[1739,42,theory(equality)])).
% cnf(1750,plain,(public(enc(xor(km,data),X1))|~public(enc(xor(pin,kek),X1))),inference(cn,[status(thm)],[1749,theory(equality)])).
% cnf(1756,plain,(public(enc(xor(km,data),pp))),inference(spm,[status(thm)],[1750,66,theory(equality)])).
% cnf(1759,plain,(public(enc(pp,X1))|~public(X1)),inference(spm,[status(thm)],[154,1756,theory(equality)])).
% cnf(1764,negated_conjecture,(~public(a)),inference(spm,[status(thm)],[65,1759,theory(equality)])).
% cnf(1766,negated_conjecture,($false),inference(rw,[status(thm)],[1764,28,theory(equality)])).
% cnf(1767,negated_conjecture,($false),inference(cn,[status(thm)],[1766,theory(equality)])).
% cnf(1768,negated_conjecture,($false),1767,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 349
% # ...of these trivial : 24
% # ...subsumed : 219
% # ...remaining for further processing: 106
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 1070
% # ...of the previous two non-trivial : 875
% # Contextual simplify-reflections : 15
% # Paramodulations : 1070
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 79
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 7
% # Non-unit-clauses : 47
% # Current number of unprocessed clauses: 554
% # ...number of literals in the above : 1690
% # Clause-clause subsumption calls (NU) : 922
% # Rec. Clause-clause subsumption calls : 849
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 66
% # Indexed BW rewrite successes : 51
% # Backwards rewriting index: 98 leaves, 1.54+/-1.379 terms/leaf
% # Paramod-from index: 28 leaves, 1.46+/-1.210 terms/leaf
% # Paramod-into index: 93 leaves, 1.45+/-1.150 terms/leaf
% # -------------------------------------------------
% # User time : 0.042 s
% # System time : 0.005 s
% # Total time : 0.047 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.23 WC
% FINAL PrfWatch: 0.16 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP6863/SWV234+2.tptp
%
%------------------------------------------------------------------------------