%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN696-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 : art07.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/SYN696-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,1,146,0,1,1196295,4,2030,1196393,50,2104,1196393,40,2104,1196466,0,2104)
% 
% 
% START OF PROOF
% 1196405 [] p2(f11(X,Y),f11(Z,U)) | -p3(X,Z) | -p10(Y,U).
% 1196410 [] p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)).
% 1196423 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 1196429 [] p3(f4(X),f4(Y)) | -p2(X,Y).
% 1196449 [] p2(c44,c45).
% 1196453 [] p2(X,X).
% 1196458 [] p10(X,X).
% 1196465 [] -p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)).
% 1196508 [binary:1196449,1196429.2] p3(f4(c44),f4(c45)).
% 1196597 [binary:1196458,1196405.3] p2(f11(X,Y),f11(Z,Y)) | -p3(X,Z).
% 1197217 [binary:1196465,1196423.3] -p2(X,f11(f4(f23(c44,f9(f20(c37)))),c43)) | -p2(X,f11(f4(c45),c43)).
% 1197218 [binary:1196453,1196423.2] -p2(X,Y) | p2(Y,X).
% 1197340 [binary:1196410,1197218] p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)).
% 1200344 [binary:1196508,1196597.2] p2(f11(f4(c44),X),f11(f4(c45),X)).
% 1222154 [binary:1197217.2,1200344,cut:1197340] 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:    1531
%  derived clauses:   1316699
%  kept clauses:      102281
%  kept size sum:     369421
%  kept mid-nuclei:   14577
%  kept new demods:   0
%  forw unit-subs:    90046
%  forw double-subs: 46
%  forw overdouble-subs: 69
%  backward subs:     5
%  fast unit cutoff:  21
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  22.60
%  process. runtime:  22.59
% specific non-discr-tree subsumption statistics: 
%  tried:           7102
%  length fails:    0
%  strength fails:  432
%  predlist fails:  5535
%  aux str. fails:  0
%  by-lit fails:    3
%  full subs tried: 1129
%  full subs fail:  1063
% 
% ; 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/SYN696-1+noeq.in")
% 
%------------------------------------------------------------------------------