TSTP Solution File: SWV339-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV339-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 : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% 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/SystemOnTPTP12635/SWV/SWV339-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 3 3)
% (binary-unit 10 #f 3 3)
% (binary-double 10 #f 3 3)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 3)
% (binary-order 27 #f 3 3)
% (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
% equal(v_^k,c_^public_^oshr^k(v_^b)) | equal(v_^k,c_^public_^oshr^k(v_^a)).
% was split for some strategies as:
% equal(v_^k,c_^public_^oshr^k(v_^b)).
% equal(v_^k,c_^public_^oshr^k(v_^a)).
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(4,40,0,8,0,0,9,50,0,13,0,0,14,50,0,18,0,0,19,50,0,23,0,0,24,50,0,28,0,0,29,50,0,33,0,0,34,50,0,38,0,0,39,50,0,43,0,0,44,50,0,48,0,0,49,50,0,53,0,0,54,50,0,58,0,0,59,50,0,63,0,0,64,50,0,68,0,1,69,50,1,73,0,1,74,50,1,78,0,1,79,50,1,83,0,1,84,50,1,88,0,1,89,50,1,93,0,1,94,50,1,98,0,1,99,50,1,99,40,1,103,0,1)
%
%
% START OF PROOF
% 101 [] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(X)),c_^event_^oused(Y),tc_^message_^omsg).
% 102 [] -c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evs3),tc_^message_^omsg).
% 103 [] equal(v_^k,c_^public_^oshr^k(v_^b)) | equal(v_^k,c_^public_^oshr^k(v_^a)).
% 106 [para:103.1.2,101.1.1.1,slowcut:102] equal(v_^k,c_^public_^oshr^k(v_^a)).
% 110 [para:106.1.2,101.1.1.1,slowcut:102] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 3
% clause depth limited to 3
% seconds given: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 81
% derived clauses: 23
% kept clauses: 2
% kept size sum: 8
% kept mid-nuclei: 0
% kept new demods: 2
% forw unit-subs: 0
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 0
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% 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/SystemOnTPTP12635/SWV/SWV339-2+eq_r.in")
%
%------------------------------------------------------------------------------