%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN220-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art05.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/SYN/SYN220-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: big
% detected subclass: long
% 
% strategies selected: 
% (hyper 25 #t 1 9)
% (binary-unit 25 #f 1 9)
% (binary-double 25 #f 1 9)
% (binary-posweight-order 25 #f 1 9)
% (binary 50 #t 1 9)
% (hyper 25 #t)
% (hyper 116 #f)
% (binary-posweight-order 76 #f)
% (binary-order 25 #f)
% (binary-weightorder 25 #f)
% (binary-posweight-order-sos 76 #t)
% (binary-unit-sos 40 #t)
% (binary 67 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
% 
% 
% timer checkpoints: c(369,40,2,738,0,2,738,50,2,1107,0,3,1107,50,3,1476,0,3,1476,50,3,1845,0,4,1845,50,4,2214,0,5,2214,50,5,2583,0,5,2583,50,5,2952,0,6,2952,50,6,3321,0,6,3321,50,6,3690,0,7,3690,50,7,4059,0,8,4059,50,8,4428,0,8,4428,50,8,4797,0,9,4797,50,9,5166,0,9,5166,50,9,5535,0,9,5535,50,9,5904,0,10,5904,50,10,6273,0,10,6273,50,10,6642,0,11,6642,50,11,7011,0,11,7011,50,11,7380,0,12,7380,50,12,7749,0,12,7749,50,12,8118,0,13,8118,50,13,8118,40,13,8487,0,13)
% 
% 
% START OF PROOF
% 8125 [] n0(d,b).
% 8132 [] p0(b,X).
% 8157 [] -n0(X,Y) | k1(Y).
% 8241 [?] ?
% 8292 [] -k1(b) | m2(b).
% 8293 [] -p1(X,Y,Z) | n2(Z).
% 8373 [] -m2(b) | l3('X,'X) | -n2(X).
% 8487 [] -l3(X,b).
% 8505 [binary:8125,8157] k1(b).
% 8509 [binary:8292,8505] m2(b).
% 8852 [input:8241,slowcut:8132] p1(X,X,X).
% 8853 [binary:8293,8852] n2(X).
% 9126 [input:8373,cut:8509,cut:8853,slowcut:8487] 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
% clause length limited to 9
% clause depth limited to 1
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    413
%  derived clauses:   1097
%  kept clauses:      424
%  kept size sum:     2522
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    406
%  forw double-subs: 66
%  forw overdouble-subs: 19
%  backward subs:     157
%  fast unit cutoff:  93
%  full unit cutoff:  35
%  dbl  unit cutoff:  6
%  real runtime:  0.19
%  process. runtime:  0.18
% specific non-discr-tree subsumption statistics: 
%  tried:           93
%  length fails:    11
%  strength fails:  39
%  predlist fails:  0
%  aux str. fails:  2
%  by-lit fails:    5
%  full subs tried: 30
%  full subs fail:  8
% 
% ; 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/SYN/SYN220-1+noeq.in")
% 
%------------------------------------------------------------------------------