TSTP Solution File: SWV338-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV338-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 : art08.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/SystemOnTPTP23730/SWV/SWV338-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 5 7)
% (binary-unit 10 #f 5 7)
% (binary-double 10 #f 5 7)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 5 7)
% (binary-order 27 #f 5 7)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
%
%
% SOS clause
% -c_in(v_^k,c_^message_^okeys^for(c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_nat) | c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evsf),tc_^message_^omsg).
% was split for some strategies as:
% -c_in(v_^k,c_^message_^okeys^for(c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_nat).
% c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evsf),tc_^message_^omsg).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,0,20,0,0)
%
%
% START OF PROOF
% 12 [] -c_in(X,c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | c_in(X,c_^event_^oused(Y),tc_^message_^omsg).
% 13 [] -c_in(X,c_^message_^okeys^for(c_^message_^oparts(c_insert(Y,Z,tc_^message_^omsg))),tc_nat) | c_in(X,c_^message_^okeys^for(c_^message_^oparts(c_union(Z,U,tc_^message_^omsg))),tc_nat) | c_in(c_^message_^omsg_^o^key(c_^message_^oinv^key(X)),c_^message_^oparts(U),tc_^message_^omsg) | -c_in(Y,c_^message_^osynth(c_^message_^oanalz(U)),tc_^message_^omsg).
% 14 [] equal(c_^message_^oinv^key(X),X) | -c_in(X,c_^message_^osym^keys,tc_nat).
% 15 [] equal(c_union(X,X,Y),X).
% 16 [] c_in(v_^k,c_^message_^osym^keys,tc_nat).
% 17 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 18 [] -c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evsf),tc_^message_^omsg).
% 19 [] c_in(v_^k,c_^message_^okeys^for(c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg))),tc_nat).
% 20 [] -c_in(v_^k,c_^message_^okeys^for(c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_nat) | c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evsf),tc_^message_^omsg).
% 21 [hyper:14,16] equal(c_^message_^oinv^key(v_^k),v_^k).
% 25 [hyper:13,19,17,demod:21,demod:15] c_in(v_^k,c_^message_^okeys^for(c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_nat) | c_in(c_^message_^omsg_^o^key(v_^k),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 29 [hyper:20,25,cut:18] c_in(c_^message_^omsg_^o^key(v_^k),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 34 [hyper:12,29,cut:18] 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 7
% clause depth limited to 5
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13
% derived clauses: 22
% kept clauses: 4
% kept size sum: 36
% kept mid-nuclei: 4
% kept new demods: 2
% forw unit-subs: 8
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% 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: 2
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP23730/SWV/SWV338-2+eq_r.in")
%
%------------------------------------------------------------------------------