%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL101-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 : art02.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 4.9s
% Output   : Assurance 4.9s
% 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/SystemOnTPTP19561/COL/COL101-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 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(1385,40,6,2770,0,13)
% 
% 
% START OF PROOF
% 1729 [] c_in(c_^pair(X,X,Y,Y),c_^transitive__^closure_^ortrancl(Z,Y),tc_prod(Y,Y)).
% 2770 [] -c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_x,v_z),c_^comb_^ocomb_^oop_^a_^d_^d(v_x,v_z),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^transitive__^closure_^ortrancl(c_^comb_^ocontract,tc_^comb_^ocomb),tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 192472 [hyper:2770,1729] 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 9
% clause depth limited to 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1721
%  derived clauses:   240254
%  kept clauses:      77309
%  kept size sum:     0
%  kept mid-nuclei:   4648
%  kept new demods:   23
%  forw unit-subs:    8866
%  forw double-subs: 2216
%  forw overdouble-subs: 854
%  backward subs:     19
%  fast unit cutoff:  109
%  full unit cutoff:  78
%  dbl  unit cutoff:  1
%  real runtime  :  8.29
%  process. runtime:  8.12
% specific non-discr-tree subsumption statistics: 
%  tried:           85452
%  length fails:    6421
%  strength fails:  20
%  predlist fails:  232
%  aux str. fails:  2
%  by-lit fails:    9
%  full subs tried: 78564
%  full subs fail:  77708
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP19561/COL/COL101-1+eq_r.in")
% WARNING: TreeLimitedRun lost 4.87s, total lost is 4.87s
% 
%------------------------------------------------------------------------------