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

View Problem - Process Solution

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

% Computer : art10.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 119.1s
% Output   : Assurance 119.1s
% 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-1+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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(4,40,0,8,0,1,11,50,1,15,0,1,836,3,2964,873,4,4427,928,5,5902,928,1,5902,928,50,5902,928,40,5902,932,0,5902,935,50,5902,939,0,5902,3064,3,7403,3256,4,8154,3299,5,8903,3299,1,8903,3299,50,8903,3299,40,8903,3303,0,8903,25104,3,10404,28328,4,11165,31446,5,11904,31448,1,11904,31448,50,11906,31448,40,11906,31452,0,11906)
% 
% 
% START OF PROOF
% 31450 [] equal(apply(apply(apply(s,X),Y),Z),apply(apply(X,Z),apply(Y,Z))).
% 31451 [] equal(apply(apply(k,X),Y),X).
% 31452 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 31454 [para:31450.1.2,31451.1.1] equal(apply(apply(apply(s,k),X),Y),Y).
% 31455 [para:31451.1.1,31450.1.2.1] equal(apply(apply(apply(s,apply(k,X)),Y),Z),apply(X,apply(Y,Z))).
% 31456 [para:31451.1.1,31450.1.2.2] equal(apply(apply(apply(s,X),apply(k,Y)),Z),apply(apply(X,Z),Y)).
% 31459 [para:31450.1.2,31450.1.1] equal(apply(apply(apply(s,apply(s,X)),Y),Z),apply(apply(X,apply(Y,Z)),apply(Z,apply(Y,Z)))).
% 31461 [para:31450.1.1,31450.1.2.1] equal(apply(apply(apply(s,apply(apply(s,X),Y)),Z),U),apply(apply(apply(X,U),apply(Y,U)),apply(Z,U))).
% 31466 [para:31454.1.1,31450.1.2] equal(apply(apply(apply(s,apply(s,k)),X),Y),apply(X,Y)).
% 31467 [para:31454.1.1,31450.1.2.1] equal(apply(apply(apply(s,apply(apply(s,k),X)),Y),Z),apply(Z,apply(Y,Z))).
% 31476 [para:31466.1.1,31450.1.2] equal(apply(apply(apply(s,apply(s,apply(s,k))),X),Y),apply(Y,apply(X,Y))).
% 31486 [para:31455.1.1,31450.1.2] equal(apply(apply(apply(s,apply(s,apply(k,X))),Y),Z),apply(X,apply(Z,apply(Y,Z)))).
% 31551 [para:31467.1.2,31452.1.2] -equal(apply(X,f(X)),apply(apply(apply(s,apply(apply(s,k),Y)),X),f(X))).
% 32265 [para:31459.1.2,31476.1.1.1,demod:31454] equal(apply(apply(apply(apply(s,apply(s,s)),s),apply(s,k)),X),apply(X,X)).
% 32742 [para:31461.1.1,31456.1.1,demod:31451] equal(apply(apply(apply(X,Y),apply(Z,Y)),U),apply(apply(apply(apply(s,X),Z),Y),U)).
% 35765 [para:32265.1.2,32742.1.1.1] equal(apply(apply(apply(apply(apply(s,apply(s,s)),s),apply(s,k)),apply(X,Y)),Z),apply(apply(apply(apply(s,X),X),Y),Z)).
% 37355 [para:31486.1.2,31551.1.2.1,slowcut:35765] 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 kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 180
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    6559
%  derived clauses:   3271561
%  kept clauses:      34015
%  kept size sum:     210447
%  kept mid-nuclei:   0
%  kept new demods:   2184
%  forw unit-subs:    242773
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     349
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  125.44
%  process. runtime:  124.46
% 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-1+eq_r.in")
% 
%------------------------------------------------------------------------------