↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL044-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 : art02.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 89.6s
% Output   : Assurance 89.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/COL044-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,16,50,1,20,0,1,723,3,2952,747,50,4122,747,40,4122,751,0,4122,759,50,4122,763,0,4123,1269,3,5626,1349,4,6387,1356,50,6659,1356,40,6659,1360,0,6659,50044,3,8160,84260,4,8910,113253,1,9660,113253,50,9662,113253,40,9662,113257,0,9662)
% 
% 
% START OF PROOF
% 113255 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 113256 [] equal(apply(apply(apply(n,X),Y),Z),apply(apply(apply(X,Z),Y),Z)).
% 113257 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 113259 [para:113256.1.1,113257.1.1] -equal(apply(apply(apply(X,f(apply(apply(n,X),Y))),Y),f(apply(apply(n,X),Y))),apply(f(apply(apply(n,X),Y)),apply(apply(apply(n,X),Y),f(apply(apply(n,X),Y))))).
% 113261 [para:113256.1.2,113255.1.1] equal(apply(apply(apply(n,b),X),Y),apply(Y,apply(X,Y))).
% 113262 [para:113255.1.1,113256.1.2.1] equal(apply(apply(apply(n,apply(b,X)),Y),Z),apply(apply(X,apply(Z,Y)),Z)).
% 113263 [para:113255.1.1,113256.1.2.1.1] equal(apply(apply(apply(n,apply(apply(b,X),Y)),Z),U),apply(apply(apply(X,apply(Y,U)),Z),U)).
% 113391 [para:113262.1.2,113255.1.1] equal(apply(apply(apply(n,apply(b,apply(b,X))),Y),Z),apply(X,apply(apply(Z,Y),Z))).
% 113730 [para:113263.1.1,113259.1.2.2,demod:113255] -equal(apply(apply(apply(X,apply(Y,f(apply(apply(n,apply(apply(b,X),Y)),Z)))),Z),f(apply(apply(n,apply(apply(b,X),Y)),Z))),apply(f(apply(apply(n,apply(apply(b,X),Y)),Z)),apply(apply(apply(X,apply(Y,f(apply(apply(n,apply(apply(b,X),Y)),Z)))),Z),f(apply(apply(n,apply(apply(b,X),Y)),Z))))).
% 115438 [para:113391.1.2,113261.1.1.1,slowcut:113730] 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:    5457
%  derived clauses:   2931919
%  kept clauses:      25953
%  kept size sum:     96805
%  kept mid-nuclei:   0
%  kept new demods:   517
%  forw unit-subs:    176955
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     299
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  98.26
%  process. runtime:  97.81
% 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/COL044-1+eq_r.in")
% 
%------------------------------------------------------------------------------