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

View Problem - Process Solution

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

% Computer : art01.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/ALG/ALG007-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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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,28,50,2,33,0,2)
% 
% 
% START OF PROOF
% 30 [] equal(difference(X,difference(Y,X)),X).
% 31 [] equal(difference(X,difference(X,Y)),difference(Y,difference(Y,X))).
% 32 [] equal(difference(difference(X,Y),Z),difference(difference(X,Z),Y)).
% 33 [] -equal(difference(difference(a,b),c),difference(difference(a,c),difference(b,c))).
% 34 [para:30.1.1,30.1.1.2] equal(difference(difference(X,Y),Y),difference(X,Y)).
% 36 [para:30.1.1,31.1.1.2,demod:34] equal(difference(X,X),difference(difference(Y,X),difference(Y,X))).
% 37 [para:31.1.1,34.1.1.1] equal(difference(difference(X,difference(X,Y)),difference(Y,X)),difference(Y,difference(Y,X))).
% 38 [para:31.1.1,31.1.1.2] equal(difference(X,difference(Y,difference(Y,X))),difference(difference(X,Y),difference(difference(X,Y),X))).
% 39 [para:32.1.1,30.1.1.2] equal(difference(X,difference(difference(Y,X),Z)),X).
% 40 [para:30.1.1,32.1.1.1] equal(difference(X,Y),difference(difference(X,Y),difference(Z,X))).
% 42 [para:32.1.1,31.1.1.2] equal(difference(difference(X,Y),difference(difference(X,Z),Y)),difference(Z,difference(Z,difference(X,Y)))).
% 46 [para:32.1.1,32.1.1.1] equal(difference(difference(difference(X,Y),Z),U),difference(difference(difference(X,Z),U),Y)).
% 50 [para:30.1.1,39.1.1.2.1] equal(difference(difference(X,Y),difference(Y,Z)),difference(X,Y)).
% 54 [para:31.1.1,36.1.2.1,demod:36] equal(difference(X,X),difference(difference(X,difference(X,Y)),difference(Y,difference(Y,X)))).
% 55 [para:31.1.1,36.1.2.2,demod:54,36] equal(difference(X,X),difference(Y,Y)).
% 59 [para:55.1.1,30.1.1.2] equal(difference(X,difference(Y,Y)),X).
% 60 [para:55.1.1,34.1.1.1] equal(difference(difference(X,X),Y),difference(Y,Y)).
% 64 [para:59.1.1,30.1.1.2] equal(difference(difference(X,X),Y),difference(X,X)).
% 67 [para:60.1.2,32.1.1.1,demod:64] equal(difference(X,X),difference(difference(Y,Z),Y)).
% 72 [para:67.1.2,31.1.1.2,demod:59] equal(difference(X,Y),difference(X,difference(X,difference(X,Y)))).
% 81 [para:31.1.1,37.1.1.2,demod:72,34,38] equal(difference(X,difference(Y,difference(Y,X))),difference(X,Y)).
% 84 [para:31.1.1,40.1.2.1] equal(difference(X,difference(X,Y)),difference(difference(Y,difference(Y,X)),difference(Z,X))).
% 89 [para:50.1.1,32.1.1] equal(difference(X,Y),difference(difference(X,difference(Y,Z)),Y)).
% 91 [para:72.1.2,32.1.1.1] equal(difference(difference(X,Y),Z),difference(difference(X,Z),difference(X,difference(X,Y)))).
% 104 [para:42.1.1,89.1.2.1,demod:40] equal(difference(difference(X,Y),difference(X,Z)),difference(Z,difference(Z,difference(X,Y)))).
% 169 [para:84.1.2,46.1.2.1] equal(difference(difference(difference(X,Y),difference(X,Z)),difference(U,Z)),difference(difference(Z,difference(Z,X)),Y)).
% 194 [para:104.1.2,40.1.2.1,demod:169] equal(difference(X,difference(X,difference(Y,Z))),difference(difference(X,difference(X,Y)),Z)).
% 197 [para:104.1.1,42.1.2.2,demod:81,91,194] equal(difference(difference(X,difference(Y,Z)),Z),difference(difference(X,Y),Z)).
% 207 [para:197.1.1,32.1.1,slowcut:33] 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 4
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    90
%  derived clauses:   22229
%  kept clauses:      190
%  kept size sum:     2910
%  kept mid-nuclei:   0
%  kept new demods:   68
%  forw unit-subs:    14700
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     11
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.25
%  process. runtime:  0.22
% 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/ALG/ALG007-1+eq_r.in")
% 
%------------------------------------------------------------------------------