TSTP Solution File: COL006-5 by Gandalf---c-2.6

View Problem - Process Solution

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

% Computer : art05.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 388.7s
% Output   : Assurance 388.7s
% 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/COL006-5+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: ueq
% 
% strategies selected: 
% (binary-posweight-kb-big-order 60 #f 8 1)
% (binary-posweight-lex-big-order 30 #f 8 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(5,40,1,10,0,1,23645,3,3003,31654,4,4509,37077,5,6002,37077,1,6002,37077,50,6004,37077,40,6004,37082,0,6004,68495,3,7515,74138,4,8268,79258,5,9012,79258,1,9012,79258,50,9014,79258,40,9014,79263,0,9014,79263,50,9014,79263,40,9014,79268,0,9031,186118,3,18334,219851,4,22585,255671,5,27034,255671,1,27034,255671,50,27038,255671,40,27038,255676,0,27038,371465,3,33082,425810,4,36109,459131,5,39041,459144,1,39042,459144,50,39045,459144,40,39045,459149,0,39045)
% 
% 
% START OF PROOF
% 459146 [] equal(apply(apply(apply(s,X),Y),Z),apply(apply(X,Z),apply(Y,Z))).
% 459147 [] equal(apply(apply(k,X),Y),X).
% 459148 [] equal(strong_fixed_point,apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(k,apply(apply(s,s),apply(s,k)))),apply(apply(s,apply(k,s)),k)))).
% 459149 [] -equal(apply(strong_fixed_point,fixed_pt),apply(fixed_pt,apply(strong_fixed_point,fixed_pt))).
% 459150 [para:459148.1.2,459146.1.1.1,demod:459147] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),apply(apply(apply(s,apply(k,apply(apply(s,s),apply(s,k)))),apply(apply(s,apply(k,s)),k)),X))).
% 459152 [para:459146.1.1,459150.1.2.2,demod:459147] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(apply(apply(s,apply(k,s)),k),X)))).
% 459155 [para:459146.1.1,459152.1.2.2.2,demod:459147] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X))))).
% 459156 [para:459155.1.2,459146.1.1] equal(apply(strong_fixed_point,X),apply(apply(apply(apply(s,k),k),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X)))),apply(apply(apply(s,k),k),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X)))))).
% 459168 [para:459146.1.1,459156.1.2.1,demod:459147] equal(apply(strong_fixed_point,X),apply(apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X))),apply(apply(apply(s,k),k),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X)))))).
% 459173 [para:459146.1.1,459168.1.2.2,demod:459147] equal(apply(strong_fixed_point,X),apply(apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X))),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X))))).
% 459175 [para:459146.1.1,459173.1.2.1] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(s,apply(k,X))),apply(apply(s,k),apply(s,apply(k,X)))),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X))))).
% 459177 [para:459175.1.2,459146.1.1] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(k,X)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X)))),apply(apply(apply(s,k),apply(s,apply(k,X))),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X)))))).
% 459265 [para:459146.1.1,459177.1.2.2,demod:459147] equal(apply(strong_fixed_point,X),apply(apply(apply(s,apply(k,X)),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X)))),apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X))))).
% 459268 [para:459265.1.2,459146.1.1,demod:459173,459147,slowcut:459149] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using first arg depth ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1788
%  derived clauses:   1765939
%  kept clauses:      165277
%  kept size sum:     5707
%  kept mid-nuclei:   0
%  kept new demods:   40677
%  forw unit-subs:    1047286
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     116
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  392.11
%  process. runtime:  390.45
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/COL006-5+eq_r.in")
% 
%------------------------------------------------------------------------------