%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV024-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/HWV/HWV024-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 13)
% (binary-unit 9 #f 3 13)
% (binary-double 9 #f 3 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 13)
% (binary-order 25 #f 3 13)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% SOS clause
% -p_^data_out(x_139,x_140) | -p_^data_out(x_139,plus(x_140,n1)).
% was split for some strategies as:
% -p_^data_out(x_139,x_140).
% -p_^data_out(x_139,plus(x_140,n1)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(95,40,2,190,0,2)
%
%
% START OF PROOF
% 143 [] -p_^data_out(X,plus(Y,n1)) | p_^data_out(X,Y) | -p_^wr(Y) | p_^rd(Y) | p_^reset(Y).
% 144 [] p_^data_out(X,plus(Y,n1)) | -p_^data_out(X,Y) | -p_^wr(Y) | p_^rd(Y) | p_^reset(Y).
% 179 [] -p_^data_out(X,plus(Y,n1)) | p_^data_out(X,Y) | p_^rd(Y) | p_^wr(Y) | p_^reset(Y).
% 187 [] -p_^rd(x_140).
% 188 [] -p_^reset(x_140).
% 189 [] -p_^data_out(x_139,plus(x_140,n1)) | -p_^data_out(x_139,x_140).
% 190 [] p_^data_out(x_139,plus(x_140,n1)) | p_^data_out(x_139,x_140).
% 212 [hyper:179,190,cut:187,cut:188] p_^data_out(x_139,x_140) | p_^wr(x_140).
% 214 [?] ?
% 223 [hyper:189,212,binarycut:214] p_^wr(x_140).
% 239 [hyper:143,212,190,cut:188,cut:187] p_^data_out(x_139,x_140).
% 970 [hyper:144,239,cut:223,cut:187,cut:188] p_^data_out(x_139,plus(x_140,n1)).
% 971 [hyper:189,970,cut:239] 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 13
% clause depth limited to 3
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 68
% derived clauses: 2045
% kept clauses: 282
% kept size sum: 4091
% kept mid-nuclei: 422
% kept new demods: 6
% forw unit-subs: 738
% forw double-subs: 229
% forw overdouble-subs: 285
% backward subs: 7
% fast unit cutoff: 114
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.6
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 3656
% length fails: 102
% strength fails: 493
% predlist fails: 434
% aux str. fails: 420
% by-lit fails: 19
% full subs tried: 2096
% full subs fail: 1853
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/HWV/HWV024-1+eq_r.in")
%
%------------------------------------------------------------------------------