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

% Computer : art08.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/SYN069-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f)
% (binary 16 #t 2 9)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 9)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(9,40,0,18,0,0)
% 
% 
% START OF PROOF
% 10 [] big_g(f(X)) | -big_h(X,Y) | -big_g(Y) | -big_f(X) | big_k(Y).
% 11 [] big_h(X,f(X)) | -big_h(X,Y) | -big_g(Y) | -big_f(X) | big_k(Y).
% 12 [] -big_j(X,f(X)) | -big_h(X,Y) | -big_g(Y) | -big_f(X) | big_k(Y).
% 13 [] -big_l(X) | -big_k(X).
% 14 [] big_f(a).
% 15 [] -big_h(a,X) | big_l(X).
% 16 [] -big_h(a,X) | big_j(a,X) | -big_g(X).
% 17 [] big_g(g(X)) | -big_f(X).
% 18 [] big_h(X,g(X)) | -big_f(X).
% 19 [hyper:17,14] big_g(g(a)).
% 20 [hyper:18,14] big_h(a,g(a)).
% 29 [hyper:10,20,cut:19,cut:14] big_k(g(a)) | big_g(f(a)).
% 30 [hyper:11,20,cut:19,cut:14] big_h(a,f(a)) | big_k(g(a)).
% 32 [hyper:15,20] big_l(g(a)).
% 42 [hyper:13,29,cut:32] big_g(f(a)).
% 53 [hyper:13,30,cut:32] big_h(a,f(a)).
% 57 [hyper:16,53,cut:42] big_j(a,f(a)).
% 61 [hyper:12,57,20,cut:14,cut:19] big_k(g(a)).
% 63 [hyper:13,61,cut:32] 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 9
% clause depth limited to 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    17
%  derived clauses:   59
%  kept clauses:      15
%  kept size sum:     66
%  kept mid-nuclei:   20
%  kept new demods:   0
%  forw unit-subs:    9
%  forw double-subs: 3
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  2
%  real runtime:  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           13
%  length fails:    0
%  strength fails:  3
%  predlist fails:  10
%  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/SYN/SYN069-1+noeq.in")
% 
%------------------------------------------------------------------------------