TSTP Solution File: SWV253-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV253-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 : art04.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/SystemOnTPTP10576/SWV/SWV253-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 3)
% (binary-posweight-lex-big-order 30 #f 3 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(v_^k,v_^k_^h) | -equal(c_^message_^oinv^key(v_^k),c_^message_^oinv^key(v_^k_^h)).
% was split for some strategies as:
% -equal(v_^k,v_^k_^h).
% -equal(c_^message_^oinv^key(v_^k),c_^message_^oinv^key(v_^k_^h)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(4,40,0,8,0,0,10,50,0,14,0,0,16,50,0,20,0,0,22,50,0,26,0,0,28,50,0,32,0,0,34,50,0,38,0,0,40,50,0,44,0,0,46,50,0,50,0,0,52,50,0,56,0,0,58,50,0,62,0,0,64,50,0,68,0,0,70,50,0,74,0,0,76,50,0,80,0,0,82,50,0,86,0,0,88,50,0,92,0,0,94,50,0,98,0,0,100,50,0,104,0,0,106,50,0,110,0,0,112,50,0,116,0,0,118,50,0,118,40,0,122,0,0)
%
%
% START OF PROOF
% 119 [] equal(X,X).
% 120 [] equal(c_^message_^oinv^key(c_^message_^oinv^key(X)),X).
% 121 [] -equal(c_^message_^oinv^key(v_^k),c_^message_^oinv^key(v_^k_^h)) | -equal(v_^k,v_^k_^h).
% 122 [] equal(c_^message_^oinv^key(v_^k),c_^message_^oinv^key(v_^k_^h)) | equal(v_^k,v_^k_^h).
% 125 [para:122.1.2,120.1.1.1,demod:120] equal(v_^k,v_^k_^h).
% 126 [para:125.1.2,121.1.2.1,cut:119,cut:125] 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
% seconds given: 6
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 81
% derived clauses: 198
% kept clauses: 1
% kept size sum: 3
% kept mid-nuclei: 0
% kept new demods: 21
% forw unit-subs: 80
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% 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/SystemOnTPTP10576/SWV/SWV253-2+eq_r.in")
%
%------------------------------------------------------------------------------