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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL033-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 : art03.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 79.6s
% Output   : Assurance 79.6s
% 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/COL033-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(5,40,1,10,0,2,200,50,340,205,0,340,6008,3,3148,7408,4,4550,7408,5,5941,7408,1,5941,7408,50,5941,7408,40,5941,7413,0,5941,7584,50,6334,7589,0,6334,10173,3,7638,11457,4,8295,12849,5,8935,12849,1,8935,12849,50,8935,12849,40,8935,12854,0,8935)
% 
% 
% START OF PROOF
% 7601 [?] ?
% 12851 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 12852 [] equal(apply(apply(l,X),Y),apply(X,apply(Y,Y))).
% 12853 [] equal(apply(m,X),apply(X,X)).
% 12854 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 12855 [para:12851.1.1,12854.1.1,demod:12851] -equal(apply(X,apply(Y,f(apply(apply(b,X),Y)))),apply(f(apply(apply(b,X),Y)),apply(X,apply(Y,f(apply(apply(b,X),Y)))))).
% 12875 [para:12853.1.1,12855.1.1] -equal(apply(apply(X,f(apply(apply(b,m),X))),apply(X,f(apply(apply(b,m),X)))),apply(f(apply(apply(b,m),X)),apply(m,apply(X,f(apply(apply(b,m),X)))))).
% 13422 [para:12852.1.1,12875.1.1,cut:7601] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% 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: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1339
%  derived clauses:   4055958
%  kept clauses:      13391
%  kept size sum:     488429
%  kept mid-nuclei:   0
%  kept new demods:   617
%  forw unit-subs:    1208689
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     183
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  89.85
%  process. runtime:  89.36
% 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/COL033-1+eq_r.in")
% 
%------------------------------------------------------------------------------