%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN111-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 : art09.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/SYN111-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 *********
% 
% 
% timer checkpoints: c(369,40,4,738,0,4,738,50,4,1107,0,5,1107,50,5,1476,0,5,1476,50,5,1845,0,5,1845,50,5,2214,0,6,2214,50,6,2583,0,7,2583,50,7,2952,0,7,2952,50,7,3321,0,8,3321,50,8,3690,0,8,3690,50,8,4059,0,9,4059,50,9,4428,0,9,4428,50,9,4797,0,10,4797,50,10,5166,0,10,5166,50,10,5535,0,11,5535,50,11,5904,0,12,5904,50,12,6273,0,12,6273,50,12,6642,0,12,6642,50,12,7011,0,13,7011,50,13,7380,0,13,7380,50,13,7749,0,14,7749,50,14,8118,0,15,8118,50,15,8118,40,15,8487,0,15)
% 
% 
% START OF PROOF
% 8123 [] s0(b).
% 8125 [] n0(d,b).
% 8142 [] l0(c).
% 8150 [] k0(b).
% 8157 [] -n0(X,Y) | k1(Y).
% 8177 [] m1(X,Y,X) | -k0(Y) | -l0(X).
% 8275 [?] ?
% 8283 [] -m1(X,Y,Z) | -k2(U,Y) | k2(Z,Y) | -k1(U).
% 8285 [] -q1(X,Y,Y) | k2(Y,Y).
% 8487 [] -k2(c,b).
% 8498 [input:8275,factor:cut:8123] q1(b,b,b).
% 8505 [binary:8125,8157] k1(b).
% 8614 [binary:8150,8177.2] m1(X,b,X) | -l0(X).
% 8712 [binary:8142,8614.2] m1(c,b,c).
% 8926 [binary:8498,8285] k2(b,b).
% 9072 [binary:8487,8283.3,slowcut:8712] -k2(X,b) | -k1(X).
% 9100 [binary:8505,9072.2,cut:8926] 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:    397
%  derived clauses:   1058
%  kept clauses:      406
%  kept size sum:     2406
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    392
%  forw double-subs: 71
%  forw overdouble-subs: 15
%  backward subs:     140
%  fast unit cutoff:  84
%  full unit cutoff:  33
%  dbl  unit cutoff:  6
%  real runtime:  0.17
%  process. runtime:  0.17
% specific non-discr-tree subsumption statistics: 
%  tried:           84
%  length fails:    11
%  strength fails:  34
%  predlist fails:  0
%  aux str. fails:  2
%  by-lit fails:    5
%  full subs tried: 26
%  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/SYN111-1+noeq.in")
% 
%------------------------------------------------------------------------------