%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC038-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 : art03.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/SWC038-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,51437,4,2181,55201,5,2806,55202,1,2808,55202,50,2810,55202,40,2810,55400,0,2811)
% 
% 
% START OF PROOF
% 54899 [?] ?
% 55393 [] equal(nil,sk2).
% 55394 [] equal(sk2,sk4).
% 55395 [] equal(sk1,sk3).
% 55396 [] -equal(nil,sk1).
% 55400 [] frontseg^p(sk4,sk3) | equal(nil,sk3).
% 56183 [para:55395.1.2,55400.2.2,cut:55396] frontseg^p(sk4,sk3).
% 56184 [para:55394.1.2,56183.1.1] frontseg^p(sk2,sk3).
% 56186 [para:55393.1.2,56184.1.1] frontseg^p(nil,sk3).
% 56188 [para:55395.1.2,56186.1.2,cut:54899] 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:    136
%  derived clauses:   82822
%  kept clauses:      40420
%  kept size sum:     584615
%  kept mid-nuclei:   14588
%  kept new demods:   30802
%  forw unit-subs:    4126
%  forw double-subs: 1843
%  forw overdouble-subs: 439
%  backward subs:     8
%  fast unit cutoff:  1591
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.13
%  process. runtime:  28.13
% specific non-discr-tree subsumption statistics: 
%  tried:           43277
%  length fails:    224
%  strength fails:  15998
%  predlist fails:  3814
%  aux str. fails:  1872
%  by-lit fails:    866
%  full subs tried: 19668
%  full subs fail:  18907
% 
% ; 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/SWC038-1+eq_r.in")
% 
%------------------------------------------------------------------------------