%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ036-1.005 : TPTP v3.4.2. Released v2.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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/PUZ036-1.005+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 1 3)
% (binary-unit 11 #f 1 3)
% (binary-double 17 #f 1 3)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 1 3)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] -state(X,Y,Z,U,V,W,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14) | state(Y,Z,U,V,W,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14,X).
% 7 [] -state(X,Y,Z,U,V,W,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14) | state(X14,X,Y,Z,U,V,W,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13).
% 8 [] -state(X,Y,Z,U,V,W,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14) | state(U,Z,Y,X,V,W,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14).
% 9 [] -state(p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20).
% 10 [] state(p_5,p_4,p_3,p_2,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20).
% 13 [hyper:8,10] state(p_2,p_3,p_4,p_5,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20).
% 18 [hyper:6,13] state(p_3,p_4,p_5,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_2).
% 30 [hyper:8,18] state(p_1,p_5,p_4,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_2).
% 54 [hyper:7,30] state(p_2,p_1,p_5,p_4,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20).
% 98 [hyper:8,54] state(p_4,p_5,p_1,p_2,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20).
% 185 [hyper:6,98] state(p_5,p_1,p_2,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_4).
% 360 [hyper:8,185] state(p_3,p_2,p_1,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_4).
% 710 [hyper:7,360] state(p_4,p_3,p_2,p_1,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20).
% 1408 [hyper:8,710,cut:9] 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 3
% clause depth limited to 1
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 702
% derived clauses: 4188
% kept clauses: 1394
% kept size sum: 29274
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 2790
% 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.12
% process. runtime: 0.11
% 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/PUZ036-1.005+noeq.in")
%
%------------------------------------------------------------------------------