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

% Computer : art09.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/LDA/LDA007-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 3)
% (binary-unit 9 #f 3 3)
% (binary-double 9 #f 3 3)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 3)
% (binary-order 25 #f 3 3)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(21,40,0,42,0,0)
% 
% 
% START OF PROOF
% 23 [] equal(f(X,f(Y,Z)),f(f(X,Y),f(X,Z))).
% 32 [] equal(tt,f(t,t)).
% 34 [] equal(ts,f(t,s)).
% 35 [] equal(tt_ts,f(tt,ts)).
% 38 [] equal(tk,f(t,k)).
% 40 [] equal(tsk,f(ts,k)).
% 42 [] -equal(f(t,tsk),f(tt_ts,tk)).
% 43 [para:32.1.2,23.1.2.1] equal(f(t,f(t,X)),f(tt,f(t,X))).
% 54 [para:38.1.2,23.1.2.2] equal(f(t,f(X,k)),f(f(t,X),tk)).
% 101 [para:34.1.2,43.1.1.2,demod:35,34] equal(f(t,ts),tt_ts).
% 163 [para:101.1.1,54.1.2.1,demod:40,cut:42] 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 3
% clause depth limited to 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    72
%  derived clauses:   383
%  kept clauses:      114
%  kept size sum:     1174
%  kept mid-nuclei:   0
%  kept new demods:   114
%  forw unit-subs:    140
%  forw double-subs: 6
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  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/LDA/LDA007-2+eq_r.in")
% 
%------------------------------------------------------------------------------