TSTP Solution File: SWV321-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV321-2 : TPTP v3.4.2. Released v3.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /tmp/SystemOnTPTP11465/SWV/SWV321-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f 4 5)
% (binary 54 #t 4 5)
% (binary-order 27 #f 4 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% SOS clause
% c_in(v_^a,c_^event_^obad,tc_^message_^oagent) | -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% was split for some strategies as:
% c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,0,22,0,0,58,50,0,69,0,0)
%
%
% START OF PROOF
% 59 [] c_in(X,c_union(c_^message_^osynth(c_^message_^oanalz(Y)),c_^message_^oparts(Y),tc_^message_^omsg),tc_^message_^omsg) | -c_in(X,c_^message_^oparts(c_insert(Z,Y,tc_^message_^omsg)),tc_^message_^omsg) | -c_in(Z,c_^message_^osynth(c_^message_^oanalz(Y)),tc_^message_^omsg).
% 60 [] -c_in(c_^message_^omsg_^o^key(X),c_^message_^osynth(Y),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^key(X),Y,tc_^message_^omsg).
% 61 [] -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Y),tc_^message_^omsg).
% 62 [] c_in(X,c_^message_^oparts(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 63 [] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(X)),c_^event_^oknows(c_^message_^oagent_^o^spy,Y),tc_^message_^omsg) | -c_in(X,c_^event_^obad,tc_^message_^oagent).
% 64 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 65 [] c_in(X,c_insert(Y,Z,U),U) | -c_in(X,Z,U).
% 66 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 67 [] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 68 [] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg)),tc_^message_^omsg) | -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 69 [] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg)),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 82 [hyper:59,69,cut:66] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_union(c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 84 [hyper:63,69] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg)),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^event_^oknows(c_^message_^oagent_^o^spy,X),tc_^message_^omsg).
% 103 [hyper:64,82,binarycut:67] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 111 [hyper:60,103] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 121 [hyper:61,111,binarycut:67] c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 125 [hyper:68,121,84] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^event_^oknows(c_^message_^oagent_^o^spy,X),tc_^message_^omsg).
% 129 [hyper:65,125] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_insert(X,c_^event_^oknows(c_^message_^oagent_^o^spy,Y),tc_^message_^omsg),tc_^message_^omsg).
% 135 [hyper:62,129] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_insert(X,c_^event_^oknows(c_^message_^oagent_^o^spy,Y),tc_^message_^omsg)),tc_^message_^omsg).
% 139 [hyper:68,135,cut:121] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 5
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 48
% derived clauses: 299
% kept clauses: 49
% kept size sum: 815
% kept mid-nuclei: 21
% kept new demods: 0
% forw unit-subs: 26
% forw double-subs: 80
% forw overdouble-subs: 0
% backward subs: 19
% fast unit cutoff: 7
% full unit cutoff: 0
% dbl unit cutoff: 2
% real runtime : 0.2
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 2
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 2
% full subs fail: 2
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP11465/SWV/SWV321-2+noeq.in")
%
%------------------------------------------------------------------------------