%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL092-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 : art06.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/COL092-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(56,40,0,112,0,0)
%
%
% START OF PROOF
% 59 [] -equal(comb^k,comb_app(X,Y)).
% 65 [] -member(comb_app(X,Y),comb) | member(Y,comb).
% 89 [] member(pair(X,X),parcontract) | -member(X,comb).
% 94 [] -member(pair(comb^k,X),parcontract) | equal(X,comb^k).
% 97 [] -member(pair(comb_app(X,Y),Z),parcontract) | ap_parcontract^e_c4(X,Y,Z) | ap_parcontract^e_c3(X,Y,Z) | ap_parcontract^e_c2(X,Y,Z) | ap_parcontract^e_c1(X,Y,Z).
% 98 [] member(comb_app(X,Y),comb) | -ap_parcontract^e_c1(X,Y,Z).
% 99 [] equal(X,comb_app(Y,Z)) | -ap_parcontract^e_c1(Y,Z,X).
% 101 [] -ap_parcontract^e_c2(X,Y,Z) | member(Y,comb).
% 102 [] equal(X,comb_app(comb^k,Y)) | -ap_parcontract^e_c2(X,Z,Y).
% 105 [] -ap_parcontract^e_c3(X,Y,Z) | member(Y,comb).
% 107 [] equal(X,comb_app(comb_app(comb^s,ap_parcontract^e_sk1p(X,Y,Z)),ap_parcontract^e_sk1q(X,Y,Z))) | -ap_parcontract^e_c3(X,Y,Z).
% 108 [] member(pair(X,ap_parcontract^e_sk2q(X,Y,Z)),parcontract) | -ap_parcontract^e_c4(X,Y,Z).
% 109 [] member(pair(X,ap_parcontract^e_sk2s(Y,X,Z)),parcontract) | -ap_parcontract^e_c4(Y,X,Z).
% 110 [] equal(X,comb_app(ap_parcontract^e_sk2q(Y,Z,X),ap_parcontract^e_sk2s(Y,Z,X))) | -ap_parcontract^e_c4(Y,Z,X).
% 111 [] member(pair(comb_app(comb^k,p),r),parcontract).
% 112 [] -member(pair(p,X),parcontract) | -equal(r,comb_app(comb^k,X)).
% 210 [hyper:97,111] ap_parcontract^e_c4(comb^k,p,r) | ap_parcontract^e_c3(comb^k,p,r) | ap_parcontract^e_c2(comb^k,p,r) | ap_parcontract^e_c1(comb^k,p,r).
% 584 [hyper:101,210,binarycut:105] ap_parcontract^e_c4(comb^k,p,r) | ap_parcontract^e_c1(comb^k,p,r) | member(p,comb).
% 585 [hyper:102,210,cut:59] ap_parcontract^e_c4(comb^k,p,r) | ap_parcontract^e_c3(comb^k,p,r) | ap_parcontract^e_c1(comb^k,p,r).
% 904 [hyper:98,584,binarycut:65] ap_parcontract^e_c4(comb^k,p,r) | member(p,comb).
% 1376 [hyper:89,904] member(pair(p,p),parcontract) | ap_parcontract^e_c4(comb^k,p,r).
% 6470 [hyper:107,585,cut:59] ap_parcontract^e_c4(comb^k,p,r) | ap_parcontract^e_c1(comb^k,p,r).
% 6506 [hyper:99,6470] equal(r,comb_app(comb^k,p)) | ap_parcontract^e_c4(comb^k,p,r).
% 7332 [hyper:112,6506,binarycut:1376] ap_parcontract^e_c4(comb^k,p,r).
% 7336 [hyper:108,7332] member(pair(comb^k,ap_parcontract^e_sk2q(comb^k,p,r)),parcontract).
% 7337 [hyper:109,7332] member(pair(p,ap_parcontract^e_sk2s(comb^k,p,r)),parcontract).
% 7338 [hyper:110,7332] equal(r,comb_app(ap_parcontract^e_sk2q(comb^k,p,r),ap_parcontract^e_sk2s(comb^k,p,r))).
% 7367 [hyper:94,7336] equal(ap_parcontract^e_sk2q(comb^k,p,r),comb^k).
% 7891 [para:7367.1.1,7338.1.2.1] equal(r,comb_app(comb^k,ap_parcontract^e_sk2s(comb^k,p,r))).
% 7892 [hyper:112,7891,cut:7337] 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: 140
% derived clauses: 37598
% kept clauses: 6098
% kept size sum: 106038
% kept mid-nuclei: 1626
% kept new demods: 6
% forw unit-subs: 5400
% forw double-subs: 4324
% forw overdouble-subs: 91
% backward subs: 13
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 3
% real runtime : 0.41
% process. runtime: 0.40
% specific non-discr-tree subsumption statistics:
% tried: 794
% length fails: 5
% strength fails: 50
% predlist fails: 166
% aux str. fails: 0
% by-lit fails: 74
% full subs tried: 133
% full subs fail: 133
%
% ; 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/COL092-1+eq_r.in")
%
%------------------------------------------------------------------------------