%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC044-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 : art01.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/SWC044-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(195,40,1,390,0,1,50909,4,2194,54465,5,2805,54466,1,2805,54466,50,2807,54466,40,2807,54661,0,2807)
% 
% 
% START OF PROOF
% 54282 [?] ?
% 54657 [] equal(nil,sk2).
% 54658 [] equal(sk2,sk4).
% 54659 [] equal(sk1,sk3).
% 54660 [] rearseg^p(sk4,sk3).
% 55428 [para:54658.1.2,54660.1.1] rearseg^p(sk2,sk3).
% 55430 [para:54657.1.2,55428.1.1] rearseg^p(nil,sk3).
% 55432 [para:54659.1.2,55430.1.2,cut:54282] 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:    120
%  derived clauses:   81865
%  kept clauses:      39996
%  kept size sum:     580868
%  kept mid-nuclei:   14273
%  kept new demods:   30803
%  forw unit-subs:    4070
%  forw double-subs: 1689
%  forw overdouble-subs: 439
%  backward subs:     0
%  fast unit cutoff:  1376
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.26
%  process. runtime:  28.24
% specific non-discr-tree subsumption statistics: 
%  tried:           43098
%  length fails:    224
%  strength fails:  15988
%  predlist fails:  3651
%  aux str. fails:  1866
%  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/SWC044-1+eq_r.in")
% 
%------------------------------------------------------------------------------