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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ROB005-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 : art04.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/ROB/ROB005-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 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(6,40,1,12,0,1,913,3,3011,913,4,4506,913,5,6002,913,1,6002,913,50,6002,913,40,6002,919,0,6002,1817,3,7504,1817,4,8261,1817,5,9003,1817,1,9003,1817,50,9003,1817,40,9003,1823,0,9003)
% 
% 
% START OF PROOF
% 1818 [] equal(X,X).
% 1819 [] equal(add(X,Y),add(Y,X)).
% 1820 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 1821 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 1822 [] equal(add(c,c),c).
% 1823 [] -equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b).
% 1824 [para:1822.1.1,1820.1.1.1] equal(add(c,X),add(c,add(c,X))).
% 1825 [para:1822.1.1,1821.1.1.1.1.1] equal(negate(add(negate(c),negate(add(c,negate(c))))),c).
% 1826 [para:1824.1.2,1819.1.1,demod:1820] equal(add(c,X),add(c,add(X,c))).
% 1827 [para:1824.1.2,1821.1.1.1.1.1] equal(negate(add(negate(add(c,X)),negate(add(c,negate(add(c,X)))))),c).
% 1828 [para:1826.1.2,1820.1.1.1,demod:1820] equal(add(c,add(X,Y)),add(c,add(X,add(c,Y)))).
% 1831 [para:1819.1.1,1825.1.1.1] equal(negate(add(negate(add(c,negate(c))),negate(c))),c).
% 1834 [para:1825.1.1,1821.1.1.1.2] equal(negate(add(negate(add(negate(c),add(c,negate(c)))),c)),negate(c)).
% 1835 [para:1825.1.1,1821.1.1.1.2.1.2] equal(negate(add(negate(add(X,add(negate(c),negate(add(c,negate(c)))))),negate(add(X,c)))),X).
% 1839 [para:1831.1.1,1821.1.1.1.2.1.2] equal(negate(add(negate(add(X,add(negate(add(c,negate(c))),negate(c)))),negate(add(X,c)))),X).
% 1841 [para:1819.1.1,1823.1.1.1.1] -equal(add(negate(add(negate(b),a)),negate(add(negate(a),negate(b)))),b).
% 1849 [para:1828.1.2,1819.1.1,demod:1826,1820] equal(add(c,add(X,Y)),add(X,add(c,Y))).
% 1851 [para:1819.1.1,1828.1.2.2,demod:1824,1820] equal(add(c,add(X,Y)),add(c,add(Y,X))).
% 1860 [para:1849.1.2,1821.1.1.1.1.1] equal(negate(add(negate(add(c,add(X,Y))),negate(add(X,negate(add(c,Y)))))),X).
% 1865 [para:1819.1.1,1827.1.1.1.1.1] equal(negate(add(negate(add(X,c)),negate(add(c,negate(add(c,X)))))),c).
% 1867 [para:1827.1.1,1821.1.1.1.1] equal(negate(add(c,negate(add(negate(add(c,X)),negate(negate(add(c,negate(add(c,X))))))))),negate(add(c,X))).
% 1977 [para:1819.1.1,1834.1.1.1] equal(negate(add(c,negate(add(negate(c),add(c,negate(c)))))),negate(c)).
% 1978 [para:1819.1.1,1834.1.1.1.1.1,demod:1820] equal(negate(add(negate(add(c,add(negate(c),negate(c)))),c)),negate(c)).
% 1994 [para:1977.1.1,1821.1.1.1.2,demod:1828] equal(negate(add(negate(add(c,add(negate(c),negate(c)))),negate(c))),c).
% 1996 [para:1978.1.1,1821.1.1.1.1,demod:1994] equal(negate(add(negate(c),c)),negate(add(c,add(negate(c),negate(c))))).
% 1998 [para:1851.1.1,1978.1.1.1.1.1,demod:1996] equal(negate(add(negate(add(negate(c),c)),c)),negate(c)).
% 2000 [para:1819.1.1,1835.1.1.1.1.1,demod:1820] equal(negate(add(negate(add(negate(c),add(negate(add(c,negate(c))),X))),negate(add(X,c)))),X).
% 2003 [para:1835.1.1,1821.1.1.1.1] equal(negate(add(X,negate(add(negate(add(X,add(negate(c),negate(add(c,negate(c)))))),negate(negate(add(X,c))))))),negate(add(X,add(negate(c),negate(add(c,negate(c))))))).
% 2005 [para:1835.1.1,1821.1.1.1.2.1.2] equal(negate(add(negate(add(X,add(negate(add(Y,add(negate(c),negate(add(c,negate(c)))))),negate(add(Y,c))))),negate(add(X,Y)))),X).
% 2016 [para:1819.1.1,1998.1.1.1.1.1] equal(negate(add(negate(add(c,negate(c))),c)),negate(c)).
% 2020 [para:2016.1.1,1821.1.1.1.1,demod:1831] equal(negate(add(negate(c),c)),negate(add(c,negate(c)))).
% 2038 [para:1839.1.1,1821.1.1.1.1] equal(negate(add(X,negate(add(negate(add(X,add(negate(add(c,negate(c))),negate(c)))),negate(negate(add(X,c))))))),negate(add(X,add(negate(add(c,negate(c))),negate(c))))).
% 2049 [para:1849.1.1,1996.1.2.1,demod:2020] equal(negate(add(c,negate(c))),negate(add(negate(c),add(c,negate(c))))).
% 2794 [para:1822.1.1,1860.1.1.1.2.1.2.1,demod:1826] equal(negate(add(negate(add(c,X)),negate(add(X,negate(c))))),X).
% 2832 [para:1819.1.1,2794.1.1.1] equal(negate(add(negate(add(X,negate(c))),negate(add(c,X)))),X).
% 2838 [para:1824.1.2,2794.1.1.1.1.1,demod:1820] equal(negate(add(negate(add(c,X)),negate(add(c,add(X,negate(c)))))),add(c,X)).
% 2873 [para:1819.1.1,2832.1.1.1.1.1] equal(negate(add(negate(add(negate(c),X)),negate(add(c,X)))),X).
% 2874 [para:1819.1.1,2832.1.1.1.2.1] equal(negate(add(negate(add(X,negate(c))),negate(add(X,c)))),X).
% 3118 [para:1865.1.1,1821.1.1.1.1] equal(negate(add(c,negate(add(negate(add(X,c)),negate(negate(add(c,negate(add(c,X))))))))),negate(add(X,c))).
% 3393 [para:1819.1.1,1867.1.1.1.2.1.1.1,demod:3118] equal(negate(add(X,c)),negate(add(c,X))).
% 3452 [para:3393.1.2,1821.1.1.1.2] equal(negate(add(negate(add(c,X)),negate(add(negate(X),c)))),c).
% 3901 [para:1819.1.1,3452.1.1.1] equal(negate(add(negate(add(negate(X),c)),negate(add(c,X)))),c).
% 4063 [para:1825.1.1,3901.1.1.1.1.1.1,demod:1822] equal(negate(add(negate(c),negate(add(c,add(negate(c),negate(add(c,negate(c)))))))),c).
% 7963 [para:1819.1.1,2000.1.1.1.2.1] equal(negate(add(negate(add(negate(c),add(negate(add(c,negate(c))),X))),negate(add(c,X)))),X).
% 8523 [para:1819.1.1,2003.1.1.1.2.1.1.1.2,demod:2038] equal(negate(add(X,add(negate(add(c,negate(c))),negate(c)))),negate(add(X,add(negate(c),negate(add(c,negate(c))))))).
% 12752 [para:1977.1.1,2838.1.1.1.1,demod:4063,8523,2049] equal(c,add(c,negate(add(c,negate(c))))).
% 12820 [para:12752.1.2,1820.1.1.1] equal(add(c,X),add(c,add(negate(add(c,negate(c))),X))).
% 12853 [para:12820.1.2,2873.1.1.1.2.1,demod:7963] equal(X,add(negate(add(c,negate(c))),X)).
% 12870 [para:12853.1.2,1819.1.1] equal(X,add(X,negate(add(c,negate(c))))).
% 12878 [para:12853.1.2,2005.1.1.1.1.1,demod:12853,2874,12870] equal(negate(add(X,negate(X))),negate(add(c,negate(c)))).
% 12888 [para:12853.1.2,2838.1.1.1,demod:2020,1996] equal(negate(negate(add(c,negate(c)))),add(c,negate(c))).
% 12894 [para:12878.1.1,1821.1.1.1.1,demod:12853] equal(negate(negate(add(X,negate(negate(X))))),X).
% 12896 [para:12878.1.1,1821.1.1.1.2,demod:12870] equal(negate(negate(add(X,X))),X).
% 13213 [para:12878.1.2,12853.1.2.1] equal(X,add(negate(add(Y,negate(Y))),X)).
% 13214 [para:12878.1.2,12870.1.2.2] equal(X,add(X,negate(add(Y,negate(Y))))).
% 13244 [para:1819.1.1,12894.1.1.1.1] equal(negate(negate(add(negate(negate(X)),X))),X).
% 13493 [para:1819.1.1,13214.1.2.2.1] equal(X,add(X,negate(add(negate(Y),Y)))).
% 13992 [para:13493.1.2,1821.1.1.1,demod:13244] equal(X,negate(negate(X))).
% 14258 [para:1821.1.1,13992.1.2.1] equal(add(negate(add(X,Y)),negate(add(X,negate(Y)))),negate(X)).
% 14376 [para:12878.1.1,13992.1.2.1,demod:12888] equal(add(X,negate(X)),add(c,negate(c))).
% 14377 [para:13992.1.2,12896.1.1] equal(add(X,X),X).
% 14379 [para:14377.1.1,1820.1.1.1] equal(add(X,Y),add(X,add(X,Y))).
% 14402 [para:14379.1.2,1819.1.1,demod:1820] equal(add(X,Y),add(X,add(Y,X))).
% 14810 [para:14376.1.2,14376.1.2] equal(add(X,negate(X)),add(Y,negate(Y))).
% 14814 [para:14810.1.1,14379.1.2.2] equal(add(X,negate(X)),add(X,add(Y,negate(Y)))).
% 17411 [para:14814.1.2,1819.1.1,demod:1820] equal(add(X,negate(X)),add(Y,add(negate(Y),X))).
% 17903 [para:17411.1.2,1821.1.1.1.1.1,demod:13992,13213] equal(add(X,negate(add(negate(X),Y))),X).
% 18095 [para:17903.1.1,1819.1.1] equal(X,add(negate(add(negate(X),Y)),X)).
% 18096 [para:1819.1.1,17903.1.1.2.1] equal(add(X,negate(add(Y,negate(X)))),X).
% 18285 [para:1819.1.1,18095.1.2.1.1] equal(X,add(negate(add(Y,negate(X))),X)).
% 18572 [para:1821.1.1,18096.1.1.2.1.2,demod:14258] equal(add(negate(X),negate(add(Y,X))),negate(X)).
% 18745 [para:1821.1.1,18285.1.2.1.1.2,demod:14258] equal(negate(X),add(negate(add(Y,X)),negate(X))).
% 19514 [para:14402.1.2,18572.1.1.2.1] equal(add(negate(add(X,Y)),negate(add(Y,X))),negate(add(X,Y))).
% 19667 [para:14402.1.2,18745.1.2.1.1,demod:19514] equal(negate(add(X,Y)),negate(add(Y,X))).
% 19673 [para:19667.1.1,1841.1.1.2,demod:13992,14258,cut:1818] 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:    1540
%  derived clauses:   9719326
%  kept clauses:      19648
%  kept size sum:     463165
%  kept mid-nuclei:   0
%  kept new demods:   12085
%  forw unit-subs:    3118510
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     71
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  98.12
%  process. runtime:  97.62
% 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/ROB/ROB005-1+eq_r.in")
% 
%------------------------------------------------------------------------------