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

% Computer : art02.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 40.0s
% Output   : Assurance 40.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/SYN603-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 4 9)
% (binary-unit 28 #f 4 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 4 9)
% (binary 28 #t 4 9)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(30,40,0,60,0,0,110093,4,4276)
% 
% 
% START OF PROOF
% 37 [] p2(f8(X,Y),f8(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 38 [] p2(f7(X,Y),f7(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 39 [] p2(f6(X,Y),f6(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 41 [] p2(f7(f8(c21,c22),c20),f6(f5(f4(c16)),f3(f4(c16)))).
% 42 [] -p15(X,Y) | -p2(Y,U) | -p2(X,Z) | p15(Z,U).
% 46 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 54 [] p2(f3(f4(c16)),c17).
% 55 [] p2(c22,f9(c20,c23)).
% 57 [] p15(c22,c21).
% 58 [] p2(X,X).
% 60 [] -p2(f7(f8(c21,X),c20),f6(f5(f4(c16)),c17)) | -p2(X,f9(c20,Y)) | -p15(X,c21).
% 201 [hyper:39,54,58] p2(f6(X,f3(f4(c16))),f6(X,c17)).
% 300 [hyper:37,55,58] p2(f8(X,c22),f8(X,f9(c20,c23))).
% 348 [hyper:42,55,57,58] p15(f9(c20,c23),c21).
% 16857 [hyper:38,300,58] p2(f7(f8(X,c22),Y),f7(f8(X,f9(c20,c23)),Y)).
% 99122 [hyper:46,16857,41] p2(f6(f5(f4(c16)),f3(f4(c16))),f7(f8(c21,f9(c20,c23)),c20)).
% 110097 [binary:46.3,60] -p2(X,f6(f5(f4(c16)),c17)) | -p2(X,f7(f8(c21,Y),c20)) | -p2(Y,f9(c20,Z)) | -p15(Y,c21).
% 110101 [binary:99122,110097.2,cut:201,cut:348,slowcut:58] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 4
% seconds given: 57
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2383
%  derived clauses:   647834
%  kept clauses:      61132
%  kept size sum:     0
%  kept mid-nuclei:   48872
%  kept new demods:   0
%  forw unit-subs:    153125
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  8
%  full unit cutoff:  11
%  dbl  unit cutoff:  0
%  real runtime:  43.21
%  process. runtime:  43.17
% specific non-discr-tree subsumption statistics: 
%  tried:           23412
%  length fails:    0
%  strength fails:  20
%  predlist fails:  9334
%  aux str. fails:  18
%  by-lit fails:    0
%  full subs tried: 14040
%  full subs fail:  14040
% 
% ; 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/SYN603-1+noeq.in")
% 
%------------------------------------------------------------------------------