%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN084-2 : TPTP v3.4.2. Released v1.2.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/SYN084-2+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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f)
% (binary 16 #t 3 7)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 3 7)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% SOS clause 
% -big_p(f(f(sk1))) | -big_p(f(f(sk2))).
% was split for some strategies as: 
% -big_p(f(f(sk1))).
% -big_p(f(f(sk2))).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(7,40,0,14,0,1)
% 
% 
% START OF PROOF
% 8 [] -big_p(f(f(sk1))) | big_p(f(sk2)) | -big_p(sk2).
% 9 [] -big_p(f(f(sk2))) | big_p(f(sk1)) | -big_p(sk1).
% 10 [] big_p(f(sk1)) | big_p(f(sk2)) | -big_p(sk1) | -big_p(sk2).
% 11 [] -big_p(a) | big_p(f(f(X))) | -big_p(f(X)).
% 12 [] -big_p(a) | big_p(f(f(X))) | big_p(X).
% 13 [] big_p(a).
% 14 [] -big_p(f(f(sk1))) | -big_p(f(f(sk2))).
% 16 [hyper:12,13] big_p(f(f(X))) | big_p(X).
% 19 [hyper:14,16,16] big_p(sk1) | big_p(sk2).
% 25 [hyper:9,16,binarycut:19] big_p(f(sk1)) | big_p(sk2).
% 33 [hyper:8,19,binarycut:16] big_p(f(sk2)) | big_p(sk1).
% 38 [hyper:11,25,cut:13] big_p(f(f(sk1))) | big_p(sk2).
% 43 [hyper:10,33,25] big_p(f(sk2)) | big_p(f(sk1)).
% 44 [?] ?
% 47 [hyper:14,16,binarycut:44] big_p(sk1).
% 51 [hyper:14,38,binarycut:16] big_p(sk2).
% 55 [hyper:11,43,cut:13] big_p(f(f(sk1))) | big_p(f(sk2)).
% 57 [input:8,cut:51,binarycut:55] big_p(f(sk2)).
% 58 [hyper:11,57,cut:13] big_p(f(f(sk2))).
% 60 [hyper:9,58,cut:47] big_p(f(sk1)).
% 62 [hyper:11,60,cut:13] big_p(f(f(sk1))).
% 63 [hyper:14,62,cut:58] 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 3
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    14
%  derived clauses:   83
%  kept clauses:      18
%  kept size sum:     110
%  kept mid-nuclei:   17
%  kept new demods:   0
%  forw unit-subs:    4
%  forw double-subs: 8
%  forw overdouble-subs: 2
%  backward subs:     9
%  fast unit cutoff:  9
%  full unit cutoff:  0
%  dbl  unit cutoff:  5
%  real runtime:  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           21
%  length fails:    0
%  strength fails:  2
%  predlist fails:  5
%  aux str. fails:  2
%  by-lit fails:    2
%  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/SYN084-2+noeq.in")
% 
%------------------------------------------------------------------------------