%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL091-1 : TPTP v3.4.2. Released v2.7.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art04.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 0.0s
% Output   : Assurance 0.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/COL/COL091-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 5 9)
% (binary-unit 9 #f 5 9)
% (binary-double 9 #f 5 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 5 9)
% (binary-order 25 #f 5 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(34,40,0,68,0,0)
% 
% 
% START OF PROOF
% 35 [] equal(X,X).
% 37 [] -equal(comb^k,comb_app(X,Y)).
% 50 [] -member(pair(comb_app(X,Y),Z),contract) | ap_contract^e_c4(X,Y,Z) | ap_contract^e_c3(X,Y,Z) | ap_contract^e_c2(X,Y,Z) | ap_contract^e_c1(X,Y,Z).
% 53 [] equal(X,comb_app(comb^k,Y)) | -ap_contract^e_c1(X,Z,Y).
% 58 [] equal(X,comb_app(comb_app(comb^s,ap_contract^e_sk1p(X,Y,Z)),ap_contract^e_sk1q(X,Y,Z))) | -ap_contract^e_c2(X,Y,Z).
% 59 [] member(pair(X,ap_contract^e_sk2q(X,Y,Z)),contract) | -ap_contract^e_c3(X,Y,Z).
% 62 [] member(pair(X,ap_contract^e_sk3q(Y,X,Z)),contract) | -ap_contract^e_c4(Y,X,Z).
% 64 [] equal(X,comb_app(Y,ap_contract^e_sk3q(Y,Z,X))) | -ap_contract^e_c4(Y,Z,X).
% 65 [] -member(pair(comb^k,X),contract).
% 67 [] member(pair(comb_app(comb^k,p),r),contract).
% 68 [] -member(pair(p,X),contract) | -equal(r,comb_app(comb^k,X)).
% 121 [hyper:50,67] ap_contract^e_c4(comb^k,p,r) | ap_contract^e_c3(comb^k,p,r) | ap_contract^e_c2(comb^k,p,r) | ap_contract^e_c1(comb^k,p,r).
% 330 [hyper:53,121,cut:37] ap_contract^e_c4(comb^k,p,r) | ap_contract^e_c3(comb^k,p,r) | ap_contract^e_c2(comb^k,p,r).
% 3486 [hyper:58,330,cut:37] ap_contract^e_c4(comb^k,p,r) | ap_contract^e_c3(comb^k,p,r).
% 4194 [hyper:59,3486,cut:65] ap_contract^e_c4(comb^k,p,r).
% 4197 [hyper:62,4194] member(pair(p,ap_contract^e_sk3q(comb^k,p,r)),contract).
% 4198 [hyper:64,4194] equal(r,comb_app(comb^k,ap_contract^e_sk3q(comb^k,p,r))).
% 4999 [hyper:68,4197,demod:4198,cut:35] 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: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    97
%  derived clauses:   19195
%  kept clauses:      4010
%  kept size sum:     57951
%  kept mid-nuclei:   888
%  kept new demods:   1
%  forw unit-subs:    4678
%  forw double-subs: 479
%  forw overdouble-subs: 7
%  backward subs:     7
%  fast unit cutoff:  7
%  full unit cutoff:  0
%  dbl  unit cutoff:  2
%  real runtime  :  0.17
%  process. runtime:  0.16
% specific non-discr-tree subsumption statistics: 
%  tried:           124
%  length fails:    2
%  strength fails:  32
%  predlist fails:  43
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 39
%  full subs fail:  39
% 
% ; 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/COL/COL091-1+eq_r.in")
% 
%------------------------------------------------------------------------------