%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV237+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 : Sun Dec 26 12:26:24 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 64 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 33 ~; 28 |; 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 : 40 ( 4 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,conjecture,
p(enc(pp,a)),
file('/tmp/tmpTXzm4i/sel_SWV237+1.p_1',co1) ).
fof(9,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(tc,X1)) ),
file('/tmp/tmpTXzm4i/sel_SWV237+1.p_1',encrypt_clear_key_as_Tcomms_key) ).
fof(19,axiom,
p(enc(tmk,pp)),
file('/tmp/tmpTXzm4i/sel_SWV237+1.p_1',intruder_knows_1) ).
fof(22,axiom,
! [X1,X2] : enc(i(X1),enc(X1,X2)) = X2,
file('/tmp/tmpTXzm4i/sel_SWV237+1.p_1',enc_dec_cancel) ).
fof(24,axiom,
p(a),
file('/tmp/tmpTXzm4i/sel_SWV237+1.p_1',intruder_knows_8) ).
fof(25,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(enc(i(tmk),X2),enc(i(tc),X1))) ),
file('/tmp/tmpTXzm4i/sel_SWV237+1.p_1',encrypt_a_stored_comms_key) ).
fof(26,negated_conjecture,
~ p(enc(pp,a)),
inference(assume_negation,[status(cth)],[5]) ).
fof(27,negated_conjecture,
~ p(enc(pp,a)),
inference(fof_simplification,[status(thm)],[26,theory(equality)]) ).
cnf(39,negated_conjecture,
~ p(enc(pp,a)),
inference(split_conjunct,[status(thm)],[27]) ).
fof(49,plain,
! [X1,X2,X3] :
( ~ p(X1)
| ~ p(X2)
| ~ p(X3)
| p(enc(tc,X1)) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(50,plain,
! [X4,X5,X6] :
( ~ p(X4)
| ~ p(X5)
| ~ p(X6)
| p(enc(tc,X4)) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( p(enc(tc,X1))
| ~ p(X2)
| ~ p(X3)
| ~ p(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(70,plain,
p(enc(tmk,pp)),
inference(split_conjunct,[status(thm)],[19]) ).
fof(73,plain,
! [X3,X4] : enc(i(X3),enc(X3,X4)) = X4,
inference(variable_rename,[status(thm)],[22]) ).
cnf(74,plain,
enc(i(X1),enc(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[73]) ).
cnf(78,plain,
p(a),
inference(split_conjunct,[status(thm)],[24]) ).
fof(79,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)],[25]) ).
fof(80,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)],[79]) ).
cnf(81,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
| ~ p(X3)
| ~ p(X1)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(95,plain,
( p(enc(tc,X1))
| ~ p(X2)
| ~ p(X1) ),
inference(spm,[status(thm)],[51,78,theory(equality)]) ).
cnf(144,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
| ~ p(X2)
| ~ p(X1) ),
inference(spm,[status(thm)],[81,78,theory(equality)]) ).
cnf(237,plain,
( p(enc(tc,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[95,78,theory(equality)]) ).
cnf(413,plain,
( p(enc(X1,enc(i(tc),X2)))
| ~ p(X2)
| ~ p(enc(tmk,X1)) ),
inference(spm,[status(thm)],[144,74,theory(equality)]) ).
cnf(749,plain,
( p(enc(X1,X2))
| ~ p(enc(tmk,X1))
| ~ p(enc(tc,X2)) ),
inference(spm,[status(thm)],[413,74,theory(equality)]) ).
cnf(808,plain,
( p(enc(pp,X1))
| ~ p(enc(tc,X1)) ),
inference(spm,[status(thm)],[749,70,theory(equality)]) ).
cnf(817,negated_conjecture,
~ p(enc(tc,a)),
inference(spm,[status(thm)],[39,808,theory(equality)]) ).
cnf(821,negated_conjecture,
~ p(a),
inference(spm,[status(thm)],[817,237,theory(equality)]) ).
cnf(824,negated_conjecture,
$false,
inference(rw,[status(thm)],[821,78,theory(equality)]) ).
cnf(825,negated_conjecture,
$false,
inference(cn,[status(thm)],[824,theory(equality)]) ).
cnf(826,negated_conjecture,
$false,
825,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV237+1.p
% --creating new selector for []
% -running prover on /tmp/tmpTXzm4i/sel_SWV237+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV237+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV237+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV237+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------