%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN695-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 : art05.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 20.0s
% Output   : Assurance 20.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/SYN695-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 6 9)
% (binary-unit 10 #f 6 9)
% (binary-double 16 #f 6 9)
% (binary 54 #t 6 9)
% (binary-order 27 #f 6 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(73,40,2,146,0,2,1062845,4,2031,1062967,50,2119,1062967,40,2119,1063040,0,2119)
% 
% 
% START OF PROOF
% 1062979 [] p2(f11(X,Y),f11(Z,U)) | -p3(X,Z) | -p10(Y,U).
% 1062984 [] p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)).
% 1062997 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 1063008 [] p3(f4(X),f4(Y)) | -p2(X,Y).
% 1063020 [] p2(c44,c45).
% 1063026 [] p2(X,X).
% 1063031 [] p10(X,X).
% 1063038 [] -p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)).
% 1063186 [binary:1063020,1063008.2] p3(f4(c44),f4(c45)).
% 1063216 [binary:1063031,1062979.3] p2(f11(X,Y),f11(Z,Y)) | -p3(X,Z).
% 1063366 [binary:1063038,1062997.3] -p2(X,f11(f4(f23(c44,f9(f20(c37)))),c43)) | -p2(X,f11(f4(c45),c43)).
% 1063367 [binary:1063026,1062997.2] -p2(X,Y) | p2(Y,X).
% 1063452 [binary:1063367,1062984] p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)).
% 1066882 [binary:1063186,1063216.2] p2(f11(f4(c44),X),f11(f4(c45),X)).
% 1077364 [binary:1063366.2,1066882,cut:1063452] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 9
% clause depth limited to 6
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1380
%  derived clauses:   1176213
%  kept clauses:      91024
%  kept size sum:     204868
%  kept mid-nuclei:   13876
%  kept new demods:   0
%  forw unit-subs:    94757
%  forw double-subs: 55
%  forw overdouble-subs: 25
%  backward subs:     6
%  fast unit cutoff:  24
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  21.88
%  process. runtime:  21.87
% specific non-discr-tree subsumption statistics: 
%  tried:           5227
%  length fails:    0
%  strength fails:  364
%  predlist fails:  4012
%  aux str. fails:  0
%  by-lit fails:    3
%  full subs tried: 847
%  full subs fail:  823
% 
% ; 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/SYN695-1+noeq.in")
% 
%------------------------------------------------------------------------------