%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN636-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 : 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 20.0s
% Output   : Assurance 20.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/SYN636-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 4 7)
% (binary-unit 10 #f 4 7)
% (binary-double 16 #f 4 7)
% (binary 54 #t 4 7)
% (binary-order 27 #f 4 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(40,40,1,80,0,1,134210,4,2064,134254,50,2085,134254,40,2085,134294,0,2085,134497,50,2086,134537,0,2090,134914,50,2092,134954,0,2092)
% 
% 
% START OF PROOF
% 134918 [] -p21(f12(f13(X,Y)),f12(f13(X,f20(Z,X,Y)))) | p10(f11(Z,c27,X),f11(Z,c27,Y)) | p3(f4(Z),f8(c24)).
% 134921 [] p10(f11(X,c27,Y),f11(X,c27,Z)) | p22(f20(X,Y,Z),f15(X)) | p3(f4(X),f8(c24)).
% 134928 [] -p22(X,f15(f6(c25,f7(c23,c26)))) | p21(f12(f13(c28,c29)),f12(f13(c28,X))).
% 134937 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 134946 [] p3(f4(f6(X,f7(Y,Z))),Y).
% 134953 [] -p3(c23,f8(c24)).
% 134954 [] -p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)).
% 134978 [binary:134953,134937.3] -p3(X,f8(c24)) | -p3(X,c23).
% 134984 [binary:134946,134978.2] -p3(f4(f6(X,f7(c23,Y))),f8(c24)).
% 134997 [binary:134954,134918.2,cut:134984] -p21(f12(f13(c28,c29)),f12(f13(c28,f20(f6(c25,f7(c23,c26)),c28,c29)))).
% 135021 [binary:134954,134921,cut:134984] p22(f20(f6(c25,f7(c23,c26)),c28,c29),f15(f6(c25,f7(c23,c26)))).
% 135240 [binary:134928,135021,cut:134997] 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 7
% clause depth limited to 6
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    601
%  derived clauses:   197408
%  kept clauses:      38575
%  kept size sum:     7386
%  kept mid-nuclei:   8840
%  kept new demods:   0
%  forw unit-subs:    4225
%  forw double-subs: 74
%  forw overdouble-subs: 42263
%  backward subs:     22
%  fast unit cutoff:  17
%  full unit cutoff:  4
%  dbl  unit cutoff:  0
%  real runtime:  20.93
%  process. runtime:  20.92
% specific non-discr-tree subsumption statistics: 
%  tried:           1758520
%  length fails:    19438
%  strength fails:  288241
%  predlist fails:  278235
%  aux str. fails:  5981
%  by-lit fails:    7401
%  full subs tried: 1158304
%  full subs fail:  1106458
% 
% ; 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/SYN636-1+noeq.in")
% 
%------------------------------------------------------------------------------