%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC095-1 : TPTP v3.4.2. Released v2.4.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 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/SWC/SWC095-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(198,40,3,396,0,3,53972,4,2328,55973,5,2804,55974,1,2805,55974,50,2808,55974,40,2808,56172,0,2808)
% 
% 
% START OF PROOF
% 55975 [] equal(X,X).
% 56165 [] equal(sk2,sk4).
% 56166 [] equal(sk1,sk3).
% 56167 [] -equal(app(app(X,Y),Z),sk1) | -equal(app(X,Z),sk2) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 56168 [] ss^list(sk5).
% 56169 [] ss^list(sk6).
% 56170 [] ss^list(sk7).
% 56171 [] equal(app(app(sk5,sk6),sk7),sk3).
% 56172 [] equal(app(sk5,sk7),sk4).
% 56968 [para:56171.1.1,56167.1.1,demod:56172,cut:56170,cut:56168,cut:56169] -equal(sk3,sk1) | -equal(sk4,sk2).
% 56992 [para:56165.1.2,56968.2.1,cut:55975] -equal(sk3,sk1).
% 57015 [para:56166.1.2,56992.1.1,cut:55975] 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 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    110
%  derived clauses:   80715
%  kept clauses:      41611
%  kept size sum:     584867
%  kept mid-nuclei:   14225
%  kept new demods:   32988
%  forw unit-subs:    3907
%  forw double-subs: 2065
%  forw overdouble-subs: 434
%  backward subs:     1
%  fast unit cutoff:  956
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.26
%  process. runtime:  28.22
% specific non-discr-tree subsumption statistics: 
%  tried:           43466
%  length fails:    221
%  strength fails:  16272
%  predlist fails:  3481
%  aux str. fails:  1976
%  by-lit fails:    826
%  full subs tried: 19844
%  full subs fail:  19093
% 
% ; 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/SWC/SWC095-1+eq_r.in")
% 
%------------------------------------------------------------------------------