%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN621-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 : 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 19.5s
% Output   : Assurance 19.5s
% 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/SYN621-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(34,40,0,68,0,0,8483,4,2512)
% 
% 
% START OF PROOF
% 35 [] p21(f5(f6(X,f20(Y,Z,U,X))),f15(f19(f11(Y,f12(Z,U)),X),f16(f3(f17(f18(c24)))))) | p2(Z,f3(c24)).
% 37 [] p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,X))) | -p22(X,f14(f11(c25,f12(c23,c26)))).
% 40 [] p22(f20(X,Y,Z,U),f14(f11(X,f12(Y,Z)))) | p2(Y,f3(c24)).
% 50 [] -p21(Z,X) | -p21(X,Y) | p21(Z,Y).
% 67 [] -p2(c23,f3(c24)).
% 68 [] -p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))).
% 120 [hyper:67,35] p21(f5(f6(X,f20(Y,c23,Z,X))),f15(f19(f11(Y,f12(c23,Z)),X),f16(f3(f17(f18(c24)))))).
% 425 [hyper:37,40,cut:67] p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,f20(c25,c23,c26,X)))).
% 8519 [binary:50.3,68] -p21(X,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))) | -p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),X).
% 8520 [binary:120,8519,cut:425] 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 6
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    49
%  derived clauses:   19052
%  kept clauses:      4036
%  kept size sum:     290008
%  kept mid-nuclei:   3884
%  kept new demods:   0
%  forw unit-subs:    150
%  forw double-subs: 345
%  forw overdouble-subs: 8517
%  backward subs:     0
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  25.61
%  process. runtime:  25.14
% specific non-discr-tree subsumption statistics: 
%  tried:           4546247
%  length fails:    429227
%  strength fails:  828619
%  predlist fails:  319839
%  aux str. fails:  45223
%  by-lit fails:    293045
%  full subs tried: 2478310
%  full subs fail:  2467721
% 
% ; 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/SYN621-1+noeq.in")
% 
%------------------------------------------------------------------------------