%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ039-1 : TPTP v3.4.2. Bugfixed v2.6.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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/PUZ/PUZ039-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (hyper 12 #t 6 3)
% (binary-unit 30 #f 6 3)
% (binary-posweight-order 90 #f 6 3)
% (binary-double 30 #f)
% (binary 48 #t 6 3)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(43,40,3,86,0,3)
%
%
% START OF PROOF
% 50 [] -state(X,Y,Z,U,V,W,X1,s2(X2,X3),X4,X5,e1(s(X2),X3),X6) | state(X,Y,Z,U,V,W,X1,s2(s(X2),X3),X4,X5,e1(X2,X3),X6).
% 56 [] -state(X,Y,Z,U,V,W,X1,X2,X3,s4(X4,X5),e1(X4,s(X5)),X6) | state(X,Y,Z,U,V,W,X1,X2,X3,s4(X4,s(X5)),e1(X4,X5),X6).
% 70 [] -state(X,Y,Z,v3(U,V),W,X1,X2,X3,X4,X5,e1(s(s(U)),V),X6) | state(X,Y,Z,v3(s(U),V),W,X1,X2,X3,X4,X5,e1(U,V),X6).
% 73 [] state(X,Y,Z,U,v4(V,W),X1,X2,X3,X4,X5,e1(V,s(W)),e2(s(V),s(W))) | -state(X,Y,Z,U,v4(V,s(W)),X1,X2,X3,X4,X5,e1(V,W),e2(s(V),W)).
% 77 [] state(X,Y,Z,U,V,h(W,X1),X2,X3,X4,X5,e1(W,s(s(X1))),X6) | -state(X,Y,Z,U,V,h(W,s(X1)),X2,X3,X4,X5,e1(W,X1),X6).
% 84 [] -state(X,Y,Z,U,V,W,X1,X2,X3,X4,e1(X5,X6),e2(X7,X8)) | state(X,Y,Z,U,V,W,X1,X2,X3,X4,e1(X7,X8),e2(X5,X6)).
% 85 [] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))).
% 86 [] -state(X,Y,Z,U,v4(s(s(o)),s(s(o))),V,W,X1,X2,X3,X4,X5).
% 88 [hyper:70,85] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o))))).
% 94 [hyper:77,88] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),o),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),s(s(o))),e2(s(s(s(s(o)))),s(s(s(o))))).
% 106 [hyper:84,94] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),o),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),s(s(s(o)))),e2(s(s(o)),s(s(o)))).
% 132 [hyper:56,106] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),o),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(s(o)))),s(s(o))),e2(s(s(o)),s(s(o)))).
% 181 [hyper:50,132] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),o),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(o))),s(s(o))),e2(s(s(o)),s(s(o)))).
% 252 [hyper:84,181] state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),o),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(o)),s(s(o))),e2(s(s(s(o))),s(s(o)))).
% 348 [hyper:73,252,cut:86] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% 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 3
% clause depth limited to 6
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 168
% derived clauses: 514
% kept clauses: 261
% kept size sum: 21401
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 252
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.4
% 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" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ039-1+noeq.in")
%
%------------------------------------------------------------------------------