%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN012-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 : art01.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/SYN012-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 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f)
% (binary 16 #t 2 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(7,40,0,14,0,0,71,50,0,78,0,0)
% 
% 
% START OF PROOF
% 72 [] big_g(g(X,Y),g(X,Y)) | big_g(X,Y).
% 73 [] -big_g(g(X,Y),g(X,Y)) | big_f(X,Y).
% 75 [] -big_f(g(X,Y),g(X,Y)) | big_g(g(X,Y),g(X,Y)) | -big_f(X,Y).
% 76 [] -big_g(X,g(Y,X)) | big_f(Y,g(Y,X)) | -big_f(Y,X).
% 77 [] -big_f(X,g(X,Y)) | big_g(Y,g(X,Y)) | -big_f(X,Y).
% 78 [] -big_g(g(X,Y),g(X,Y)) | -big_g(X,Y).
% 83 [hyper:73,72] big_g(X,Y) | big_f(X,Y).
% 94 [hyper:76,83,83,factor] big_f(X,g(X,X)) | big_g(X,X).
% 99 [hyper:77,83,83,factor] big_g(X,g(X,X)) | big_g(X,X).
% 110 [hyper:75,94,83] big_g(g(X,g(X,X)),g(X,g(X,X))) | big_g(X,X).
% 119 [hyper:78,99,binarycut:110] big_g(X,X).
% 123 [input:73,cut:119] big_f(X,Y).
% 129 [hyper:77,123,123] big_g(X,g(Y,X)).
% 131 [hyper:78,119,slowcut:129] 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 5
% clause depth limited to 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    23
%  derived clauses:   438
%  kept clauses:      31
%  kept size sum:     373
%  kept mid-nuclei:   52
%  kept new demods:   0
%  forw unit-subs:    6
%  forw double-subs: 90
%  forw overdouble-subs: 16
%  backward subs:     6
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  1
%  real runtime:  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           55
%  length fails:    0
%  strength fails:  0
%  predlist fails:  22
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 33
%  full subs fail:  17
% 
% ; 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/SYN012-1+noeq.in")
% 
%------------------------------------------------------------------------------