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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : BOO026-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/BOO/BOO026-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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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(12,40,0,24,0,0)
% 
% 
% START OF PROOF
% 13 [] equal(X,X).
% 14 [] equal(multiply(X,add(Y,Z)),add(multiply(Y,X),multiply(Z,X))).
% 15 [] equal(add(X,inverse(X)),n1).
% 16 [] equal(add(X,multiply(Y,Z)),multiply(add(Y,X),add(Z,X))).
% 17 [] equal(multiply(X,inverse(X)),n0).
% 18 [] equal(add(n0,multiply(X,n1)),X).
% 19 [] equal(add(multiply(X,inverse(Y)),multiply(Y,add(X,inverse(Y)))),X).
% 20 [] equal(add(multiply(X,inverse(Y)),multiply(X,add(X,inverse(Y)))),X).
% 21 [] equal(multiply(n1,add(X,n0)),X).
% 22 [] equal(multiply(add(X,inverse(Y)),add(Y,multiply(X,inverse(Y)))),X).
% 23 [] equal(multiply(add(X,inverse(Y)),add(X,multiply(X,inverse(Y)))),X).
% 24 [] -equal(multiply(add(a,b),b),b).
% 25 [para:17.1.1,14.1.2.1] equal(multiply(inverse(X),add(X,Y)),add(n0,multiply(Y,inverse(X)))).
% 26 [para:17.1.1,14.1.2.2] equal(multiply(inverse(X),add(Y,X)),add(multiply(Y,inverse(X)),n0)).
% 27 [para:21.1.1,14.1.2.1] equal(multiply(add(X,n0),add(n1,Y)),add(X,multiply(Y,add(X,n0)))).
% 28 [para:21.1.1,14.1.2.2] equal(multiply(add(X,n0),add(Y,n1)),add(multiply(Y,add(X,n0)),X)).
% 29 [para:15.1.1,16.1.2.1] equal(add(inverse(X),multiply(X,Y)),multiply(n1,add(Y,inverse(X)))).
% 30 [para:15.1.1,16.1.2.2] equal(add(inverse(X),multiply(Y,X)),multiply(add(Y,inverse(X)),n1)).
% 31 [para:18.1.1,16.1.2.1] equal(add(multiply(X,n1),multiply(n0,Y)),multiply(X,add(Y,multiply(X,n1)))).
% 32 [para:18.1.1,16.1.2.2] equal(add(multiply(X,n1),multiply(Y,n0)),multiply(add(Y,multiply(X,n1)),X)).
% 37 [para:15.1.1,25.1.1.2] equal(multiply(inverse(X),n1),add(n0,multiply(inverse(X),inverse(X)))).
% 38 [para:17.1.1,25.1.2.2] equal(multiply(inverse(X),add(X,X)),add(n0,n0)).
% 40 [para:25.1.1,14.1.2.1] equal(multiply(add(X,Y),add(inverse(X),Z)),add(add(n0,multiply(Y,inverse(X))),multiply(Z,add(X,Y)))).
% 44 [para:25.1.2,23.1.1.2] equal(multiply(add(n0,inverse(X)),multiply(inverse(X),add(X,n0))),n0).
% 46 [para:38.1.1,14.1.2.1] equal(multiply(add(X,X),add(inverse(X),Y)),add(add(n0,n0),multiply(Y,add(X,X)))).
% 47 [para:38.1.1,14.1.2.2] equal(multiply(add(X,X),add(Y,inverse(X))),add(multiply(Y,add(X,X)),add(n0,n0))).
% 48 [para:14.1.2,38.1.1.2] equal(multiply(inverse(multiply(X,Y)),multiply(Y,add(X,X))),add(n0,n0)).
% 49 [para:37.1.2,16.1.2.1] equal(add(multiply(inverse(X),inverse(X)),multiply(n0,Y)),multiply(multiply(inverse(X),n1),add(Y,multiply(inverse(X),inverse(X))))).
% 53 [para:15.1.1,26.1.1.2] equal(multiply(inverse(inverse(X)),n1),add(multiply(X,inverse(inverse(X))),n0)).
% 55 [para:26.1.2,21.1.1.2] equal(multiply(n1,multiply(inverse(X),add(Y,X))),multiply(Y,inverse(X))).
% 62 [para:15.1.1,29.1.2.2] equal(add(inverse(X),multiply(X,X)),multiply(n1,n1)).
% 65 [para:29.1.1,16.1.2.1] equal(add(multiply(X,Y),multiply(inverse(X),Z)),multiply(multiply(n1,add(Y,inverse(X))),add(Z,multiply(X,Y)))).
% 66 [para:29.1.1,16.1.2.2] equal(add(multiply(X,Y),multiply(Z,inverse(X))),multiply(add(Z,multiply(X,Y)),multiply(n1,add(Y,inverse(X))))).
% 68 [para:29.1.2,19.1.1.2] equal(add(multiply(X,inverse(n1)),add(inverse(n1),multiply(n1,X))),X).
% 77 [para:21.1.1,27.1.2.2] equal(multiply(add(X,n0),add(n1,n1)),add(X,X)).
% 80 [para:27.1.1,16.1.2,demod:18] equal(X,add(X,multiply(n0,add(X,n0)))).
% 87 [para:27.1.2,29.1.1] equal(multiply(add(inverse(X),n0),add(n1,X)),multiply(n1,add(add(inverse(X),n0),inverse(X)))).
% 90 [para:27.1.1,27.1.2.2,demod:80] equal(multiply(add(n1,n0),add(n1,add(X,n0))),add(n1,X)).
% 91 [para:80.1.2,16.1.2.1] equal(add(multiply(n0,add(X,n0)),multiply(X,Y)),multiply(X,add(Y,multiply(n0,add(X,n0))))).
% 96 [para:16.1.2,62.1.1.2] equal(add(inverse(add(X,Y)),add(Y,multiply(X,X))),multiply(n1,n1)).
% 99 [para:27.1.1,62.1.1.2,demod:80] equal(add(inverse(add(n1,n0)),n1),multiply(n1,n1)).
% 104 [para:77.1.2,14.1.2] equal(multiply(X,add(Y,Y)),multiply(add(multiply(Y,X),n0),add(n1,n1))).
% 117 [para:77.1.2,27.1.1.2,demod:21] equal(multiply(add(X,n0),multiply(add(n1,n0),add(n1,n1))),add(X,X)).
% 123 [para:28.1.2,21.1.1.2] equal(multiply(n1,multiply(add(n0,n0),add(X,n1))),multiply(X,add(n0,n0))).
% 172 [para:99.1.1,55.1.1.2.2] equal(multiply(n1,multiply(inverse(n1),multiply(n1,n1))),multiply(inverse(add(n1,n0)),inverse(n1))).
% 183 [para:53.1.2,77.1.1.1,demod:14] equal(multiply(multiply(inverse(inverse(X)),n1),add(n1,n1)),multiply(inverse(inverse(X)),add(X,X))).
% 185 [para:18.1.1,31.1.2.2] equal(add(multiply(X,n1),multiply(n0,n0)),multiply(X,X)).
% 186 [para:31.1.1,14.1.2,demod:21] equal(X,multiply(X,add(n1,multiply(X,n1)))).
% 203 [para:31.1.1,31.1.2.2,demod:186] equal(add(multiply(n0,n1),multiply(n0,multiply(X,n1))),multiply(n0,X)).
% 212 [para:185.1.2,18.1.1.2] equal(add(n0,add(multiply(n1,n1),multiply(n0,n0))),n1).
% 213 [para:185.1.2,14.1.2.1] equal(multiply(X,add(X,Y)),add(add(multiply(X,n1),multiply(n0,n0)),multiply(Y,X))).
% 215 [para:185.1.2,16.1.2] equal(add(X,multiply(Y,Y)),add(multiply(add(Y,X),n1),multiply(n0,n0))).
% 230 [para:185.1.2,31.1.1.1] equal(add(add(multiply(n1,n1),multiply(n0,n0)),multiply(n0,X)),multiply(n1,add(X,multiply(n1,n1)))).
% 231 [para:185.1.2,31.1.1.2,demod:18] equal(add(multiply(X,n1),add(multiply(n0,n1),multiply(n0,n0))),multiply(X,X)).
% 232 [para:185.1.2,31.1.2.2.2] equal(add(multiply(n1,n1),multiply(n0,X)),multiply(n1,add(X,add(multiply(n1,n1),multiply(n0,n0))))).
% 238 [para:212.1.1,16.1.2.1,demod:232,230] equal(multiply(n1,add(X,multiply(n1,n1))),add(multiply(n1,n1),multiply(n0,X))).
% 254 [para:31.1.1,32.1.2.1,demod:186] equal(add(multiply(n0,n1),multiply(multiply(X,n1),n0)),multiply(X,n0)).
% 336 [para:21.1.1,68.1.1.2.2] equal(add(multiply(add(X,n0),inverse(n1)),add(inverse(n1),X)),add(X,n0)).
% 461 [para:16.1.2,48.1.1.2] equal(multiply(inverse(multiply(X,add(Y,X))),add(X,multiply(Y,X))),add(n0,n0)).
% 479 [para:14.1.2,96.1.1.2] equal(add(inverse(add(X,multiply(Y,X))),multiply(X,add(Y,X))),multiply(n1,n1)).
% 566 [?] ?
% 572 [para:104.1.1,16.1.2] equal(add(X,multiply(Y,X)),multiply(add(multiply(X,add(Y,X)),n0),add(n1,n1))).
% 673 [para:27.1.1,215.1.1.2,demod:80] equal(add(X,n1),add(multiply(add(add(n1,n0),X),n1),multiply(n0,n0))).
% 683 [para:185.1.2,215.1.1.2] equal(add(X,add(multiply(Y,n1),multiply(n0,n0))),add(multiply(add(Y,X),n1),multiply(n0,n0))).
% 1638 [para:90.1.1,572.1.2.1.1,demod:21] equal(add(add(n1,n0),n1),multiply(add(add(n1,n1),n0),add(n1,n1))).
% 1644 [para:1638.1.2,27.1.1,demod:21] equal(add(add(n1,n0),n1),add(add(n1,n1),add(n1,n1))).
% 1667 [para:1644.1.2,215.1.2.1.1,demod:673,16] equal(add(add(n1,n1),add(n1,multiply(n1,n1))),add(n1,n1)).
% 1673 [para:1644.1.2,572.1.2.1.1.2,demod:1638,21,1667,16] equal(add(n1,n1),add(add(n1,n0),n1)).
% 1683 [para:1673.1.2,215.1.2.1.1,demod:238,683,18,16] equal(add(n1,n1),add(n1,multiply(n1,n1))).
% 1685 [para:1673.1.2,123.1.1.2.2,demod:16,21,566] equal(n0,add(n0,multiply(n1,n0))).
% 1735 [para:1683.1.2,186.1.2.2] equal(n1,multiply(n1,add(n1,n1))).
% 1747 [para:1683.1.2,215.1.2.1.1,demod:1683,18,238,683,1735,14] equal(n1,add(n1,n1)).
% 1748 [para:215.1.1,1683.1.2,demod:18,238,1747] equal(n1,multiply(n1,n1)).
% 1759 [para:1683.1.2,66.1.2.1,demod:15,1747,17,1748] equal(add(n1,n0),n1).
% 1763 [para:1683.1.2,461.1.1.1.1.2,demod:1747,1748] equal(multiply(inverse(n1),n1),add(n0,n0)).
% 1768 [para:1747.1.2,16.1.2.2] equal(add(n1,multiply(X,n1)),multiply(add(X,n1),n1)).
% 1802 [para:1748.1.2,14.1.2.1,demod:1768] equal(multiply(n1,add(n1,X)),multiply(add(X,n1),n1)).
% 1811 [para:1748.1.2,203.1.1.2.2,demod:21,14] equal(n0,multiply(n0,n1)).
% 1812 [para:1748.1.2,254.1.1.2.1,demod:1685,1811] equal(n0,multiply(n1,n0)).
% 1818 [?] ?
% 1827 [para:1748.1.2,172.1.1.2.2,demod:1759,21,1763] equal(n0,multiply(inverse(n1),inverse(n1))).
% 1831 [para:1759.1.1,16.1.2.2,demod:18] equal(X,multiply(add(X,n0),n1)).
% 1843 [para:1759.1.1,117.1.1.2.1,demod:1831,1748,1747] equal(X,add(X,X)).
% 1851 [para:1843.1.2,14.1.2,demod:1843] equal(multiply(X,Y),multiply(Y,X)).
% 1855 [para:1843.1.2,20.1.1.2.2,demod:1843,14] equal(multiply(inverse(X),inverse(X)),inverse(X)).
% 1856 [para:1843.1.2,22.1.1.1,demod:15,1855] equal(multiply(inverse(X),n1),inverse(X)).
% 1857 [para:1843.1.2,25.1.1.2,demod:1843,17] equal(multiply(inverse(X),X),n0).
% 1858 [para:1843.1.2,29.1.2.2,demod:17] equal(add(inverse(X),n0),multiply(n1,inverse(X))).
% 1860 [?] ?
% 1862 [para:1843.1.2,30.1.2.1,demod:1856,1858,1857] equal(multiply(n1,inverse(X)),inverse(X)).
% 1885 [para:1843.1.2,336.1.1.1.1,demod:1843,1862,1858,1818] equal(add(n0,inverse(n1)),n0).
% 1886 [para:1843.1.2,336.1.1.2,demod:1885,1827,1862,1858] equal(n0,inverse(n1)).
% 1906 [para:87.1.2,29.1.2,demod:17,1862,1858] equal(inverse(X),multiply(inverse(X),add(n1,X))).
% 1919 [para:87.1.2,65.1.2.2.2,demod:1906,1886,1843,1862,1858] equal(add(inverse(X),multiply(n0,Y)),multiply(inverse(X),add(Y,inverse(X)))).
% 1922 [para:87.1.2,479.1.1.1.1.2,demod:1748,1811,1919,1906,1843,1862,1858] equal(add(inverse(inverse(X)),inverse(X)),n1).
% 1932 [para:1886.1.2,47.1.1.2.2,demod:1843,21,1747] equal(X,add(multiply(X,n1),n0)).
% 1971 [para:1811.1.2,231.1.1.2.1,demod:1932,1843,1860] equal(X,multiply(X,X)).
% 1976 [para:1971.1.2,14.1.2.2] equal(multiply(X,add(Y,X)),add(multiply(Y,X),X)).
% 1979 [para:1971.1.2,29.1.1.2,demod:1748,15] equal(add(inverse(X),X),n1).
% 1998 [para:1971.1.2,46.1.2.2,demod:1979,1843] equal(multiply(X,n1),add(n0,X)).
% 1999 [para:1971.1.2,47.1.2.1,demod:1811,1998,15,1843] equal(multiply(X,n1),add(X,n0)).
% 2035 [para:1812.1.2,14.1.2.1,demod:1998] equal(multiply(n0,add(n1,X)),multiply(multiply(X,n0),n1)).
% 2044 [para:1812.1.2,65.1.2.2.2,demod:1999,1811,1998,1886,1812] equal(multiply(multiply(n0,X),n1),multiply(n0,multiply(X,n1))).
% 2045 [para:1812.1.2,66.1.2.1.2,demod:1811,1999,2035,1998,1886,1812] equal(multiply(n0,add(n1,X)),multiply(multiply(X,n1),n0)).
% 2046 [para:1857.1.1,19.1.1.1,demod:18,1922] equal(X,inverse(inverse(X))).
% 2064 [para:1857.1.1,213.1.2.1.1,demod:2035,1811,1860,1998,1886] equal(multiply(n0,multiply(X,n1)),multiply(n0,add(n1,X))).
% 2070 [para:2046.1.2,44.1.1.1.2,demod:2064,2045,17,1862,1858,2046,1998] equal(multiply(n0,multiply(X,n1)),n0).
% 2091 [para:2046.1.2,183.1.1.1.1,demod:1971,1843,2046,1747] equal(multiply(multiply(X,n1),n1),X).
% 2094 [para:1979.1.1,28.1.1.2,demod:1998,2070,1886,2091,1999] equal(X,multiply(X,n1)).
% 2100 [para:1979.1.1,40.1.2.2.2,demod:2094,1998,1971,2046,1979] equal(multiply(n1,add(X,Y)),add(X,Y)).
% 2103 [para:1979.1.1,49.1.2.2,demod:1856,2046,1855] equal(add(inverse(X),multiply(n0,X)),inverse(X)).
% 2173 [para:2094.1.2,29.1.1.2,demod:2100,1979] equal(n1,add(n1,inverse(X))).
% 2221 [para:2046.1.2,2173.1.2.2] equal(n1,add(n1,X)).
% 2222 [para:17.1.1,91.1.1.2,demod:17,2103,2044,2094,1999] equal(multiply(n0,X),n0).
% 2227 [para:28.1.1,91.1.1.2,demod:1748,2221,1802,1998,1976,2222,2094,1999] equal(multiply(X,add(Y,X)),X).
% 2286 [para:1851.1.1,24.1.1,demod:2227,cut:13] 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 5
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    245
%  derived clauses:   21049
%  kept clauses:      2261
%  kept size sum:     45738
%  kept mid-nuclei:   0
%  kept new demods:   1503
%  forw unit-subs:    9884
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     20
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.50
%  process. runtime:  0.50
% 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/BOO/BOO026-1+eq_r.in")
% 
%------------------------------------------------------------------------------