TSTP Solution File: COL042-7 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL042-7 : 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 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/COL042-7+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 6 1)
% (binary-posweight-lex-big-order 30 #f 6 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,0,10,0,0)
% 
% 
% START OF PROOF
% 7 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 8 [] equal(apply(apply(w1,X),Y),apply(apply(Y,X),X)).
% 9 [] equal(strong_fixed_point,apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b))).
% 10 [] -equal(apply(strong_fixed_point,fixed_pt),apply(fixed_pt,apply(strong_fixed_point,fixed_pt))).
% 11 [para:8.1.2,8.1.1] equal(apply(apply(w1,X),w1),apply(apply(X,X),X)).
% 97 [para:9.1.2,7.1.1.1,demod:7] equal(apply(strong_fixed_point,X),apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,X))))).
% 1200 [para:97.1.2,8.1.1,demod:7] equal(apply(strong_fixed_point,X),apply(apply(w1,apply(apply(b,apply(b,X)),w1)),w1)).
% 1213 [para:1200.1.2,8.1.1] equal(apply(strong_fixed_point,X),apply(apply(w1,apply(apply(b,apply(b,X)),w1)),apply(apply(b,apply(b,X)),w1))).
% 1215 [para:1200.1.2,11.1.1,demod:1213,7,slowcut:10] 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
% clause length limited to 1
% clause depth limited to 6
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    72
%  derived clauses:   8950
%  kept clauses:      1203
%  kept size sum:     31001
%  kept mid-nuclei:   0
%  kept new demods:   385
%  forw unit-subs:    6992
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     4
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.24
%  process. runtime:  0.25
% 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/COL042-7+eq_r.in")
% 
%------------------------------------------------------------------------------