%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL110-1 : TPTP v3.4.2. Released v3.2.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 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP4507/COL/COL110-1+eq_r.in
% 
% Some predicates or functions were curried and renamed.
% 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 9)
% (binary-unit 28 #f 5 9)
% (binary-double 11 #f 5 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 9)
% (binary-order 28 #f 5 9)
% (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(1413,40,6,2826,0,12,472424,4,2113)
% 
% 
% START OF PROOF
% 2822 [?] ?
% 4072 [?] ?
% 4139 [?] ?
% 472425 [binary:4139,2822,cut:4072] 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 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1935
%  derived clauses:   637107
%  kept clauses:      77011
%  kept size sum:     0
%  kept mid-nuclei:   15025
%  kept new demods:   30
%  forw unit-subs:    83653
%  forw double-subs: 3464
%  forw overdouble-subs: 217
%  backward subs:     24
%  fast unit cutoff:  162
%  full unit cutoff:  113
%  dbl  unit cutoff:  1
%  real runtime  :  21.13
%  process. runtime:  21.10
% specific non-discr-tree subsumption statistics: 
%  tried:           545
%  length fails:    28
%  strength fails:  20
%  predlist fails:  9
%  aux str. fails:  8
%  by-lit fails:    4
%  full subs tried: 442
%  full subs fail:  225
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP4507/COL/COL110-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.97s, total lost is 19.97s
% 
%------------------------------------------------------------------------------