TSTP Solution File: SWV350-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV350-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 : art01.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/SystemOnTPTP3145/SWV/SWV350-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 5 1)
% (binary-unit 11 #f 5 1)
% (binary-double 17 #f 5 1)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 1)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(2,40,0,4,0,0)
%
%
% START OF PROOF
% 3 [] c_in(c_^event_^oevent_^o^notes(c_^message_^oagent_^o^spy,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^b),v_k))),c_^list_^oset(v_evso,tc_^event_^oevent),tc_^event_^oevent).
% 4 [] -c_in(c_^event_^oevent_^o^notes(c_^message_^oagent_^o^spy,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^b),X))),c_^list_^oset(v_evso,tc_^event_^oevent),tc_^event_^oevent).
% 5 [hyper:4,3] 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 1
% clause depth limited to 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2
% derived clauses: 1
% kept clauses: 0
% kept size sum: 0
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 0
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% 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/SystemOnTPTP3145/SWV/SWV350-2+noeq.in")
%
%------------------------------------------------------------------------------