%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN075-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 : art03.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/SYN075-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 2 7)
% (binary-unit 9 #f 2 7)
% (binary-double 9 #f 2 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 7)
% (binary-order 25 #f 2 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(11,40,0,27,0,0)
% 
% 
% START OF PROOF
% 12 [] equal(X,X).
% 13 [] equal(X,a) | -big_f(X,Y).
% 15 [] -equal(Y,b) | -equal(X,a) | big_f(X,Y).
% 17 [] big_f(h(X,Y),f(X)) | equal(h(X,Y),Y) | -equal(f(X),X).
% 22 [] -big_f(X,f(Y)) | -equal(X,g(Y)) | equal(f(Y),Y).
% 27 [] -big_f(h(X,Y),f(X)) | -equal(h(X,Y),Y) | -equal(f(X),X).
% 30 [?] ?
% 32 [hyper:22,12,binarycut:30] equal(f(X),X).
% 35 [hyper:15,12,12] big_f(a,b).
% 38 [hyper:17,32,demod:32] big_f(h(X,Y),X) | equal(h(X,Y),Y).
% 82 [hyper:13,38,factor] equal(h(X,a),a).
% 100 [hyper:27,82,demod:32,82,cut:12,slowcut:35] 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 7
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    14
%  derived clauses:   137
%  kept clauses:      19
%  kept size sum:     145
%  kept mid-nuclei:   40
%  kept new demods:   2
%  forw unit-subs:    24
%  forw double-subs: 31
%  forw overdouble-subs: 4
%  backward subs:     5
%  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:           15
%  length fails:    0
%  strength fails:  2
%  predlist fails:  8
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 5
%  full subs fail:  1
% 
% ; 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/SYN075-1+eq_r.in")
% 
%------------------------------------------------------------------------------