%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN077-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 : art10.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/SYN077-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 10 #f 2 7)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 2 7)
% (binary-order 27 #f 2 7)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,0,16,0,0,55,50,0,63,0,0,942,50,10,950,0,10)
% 
% 
% START OF PROOF
% 943 [] equal(X,X).
% 944 [] -big_f(X,f(Y)) | equal(X,Y).
% 945 [] big_f(X,f(Y)) | -equal(X,Y).
% 946 [] big_f(g(X,Y),Y) | -big_f(X,a) | -big_f(X,Y).
% 947 [] -big_f(X,g(Y,Z)) | -big_f(Y,a) | -big_f(X,Z) | -big_f(Y,Z).
% 948 [] big_f(X,h(X)) | big_f(X,a).
% 949 [] big_f(i(X,Y),Y) | -big_f(Y,h(X)) | big_f(X,a).
% 950 [] big_f(i(X,Y),h(X)) | -big_f(Y,h(X)) | big_f(X,a).
% 951 [hyper:945,943] big_f(X,f(X)).
% 965 [hyper:949,948] big_f(i(X,X),X) | big_f(X,a).
% 966 [hyper:950,948] big_f(i(X,X),h(X)) | big_f(X,a).
% 1005 [hyper:946,966,965] big_f(g(i(a,a),h(a)),h(a)) | big_f(a,a).
% 2025 [hyper:949,1005] big_f(i(a,g(i(a,a),h(a))),g(i(a,a),h(a))) | big_f(a,a).
% 2026 [hyper:950,1005] big_f(i(a,g(i(a,a),h(a))),h(a)) | big_f(a,a).
% 4326 [hyper:947,2025,binarycut:2026,binarycut:966,binarycut:965] big_f(a,a).
% 4405 [hyper:946,4326,951] big_f(g(a,f(a)),f(a)).
% 4528 [hyper:944,4405] equal(g(a,f(a)),a).
% 4531 [hyper:947,4405,951,demod:4528,cut:4326,cut:4326] 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 4
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    147
%  derived clauses:   24049
%  kept clauses:      668
%  kept size sum:     20950
%  kept mid-nuclei:   3670
%  kept new demods:   1
%  forw unit-subs:    87
%  forw double-subs: 3720
%  forw overdouble-subs: 2795
%  backward subs:     24
%  fast unit cutoff:  77
%  full unit cutoff:  0
%  dbl  unit cutoff:  22
%  real runtime:  0.55
%  process. runtime:  0.54
% specific non-discr-tree subsumption statistics: 
%  tried:           26454
%  length fails:    769
%  strength fails:  847
%  predlist fails:  2994
%  aux str. fails:  1098
%  by-lit fails:    2244
%  full subs tried: 17120
%  full subs fail:  15115
% 
% ; 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/SYN077-1+eq_r.in")
% 
%------------------------------------------------------------------------------