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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : BOO067-1 : TPTP v3.4.2. Released v2.6.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 79.5s
% Output   : Assurance 79.5s
% 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/BOO067-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(3,40,0,6,0,0,11,50,1,14,0,1,561,3,2976,695,4,4461,707,5,5902,707,1,5902,707,50,5902,707,40,5902,710,0,5902,715,50,5902,718,0,5903,1152,3,7404,1249,4,8172,1266,5,8904,1266,1,8904,1266,50,8904,1266,40,8904,1269,0,8904,1269,50,8904,1269,40,8904,1272,0,8905)
% 
% 
% START OF PROOF
% 1271 [] equal(multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,V),W,multiply(Z,U,X1))),multiply(U,multiply(X1,W,V),Z)),Y).
% 1272 [] -equal(multiply(multiply(d,e,a),b,multiply(d,e,c)),multiply(d,e,multiply(a,b,c))).
% 1273 [para:1271.1.1,1271.1.1.1] equal(multiply(multiply(X,Y,Z),inverse(multiply(multiply(U,V,W),X1,multiply(U,V,X2))),multiply(V,multiply(X2,X1,W),U)),multiply(Y,multiply(Z,inverse(multiply(X,Y,X3)),X3),X)).
% 1276 [para:1271.1.1,1271.1.1.3.2] equal(multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,multiply(V,multiply(W,X1,X2),X3)),inverse(multiply(multiply(X3,V,X2),X1,multiply(X3,V,W))),multiply(Z,U,multiply(X4,inverse(X4),X5)))),multiply(U,X5,Z)),Y).
% 1277 [para:1273.1.1,1271.1.1] equal(multiply(inverse(X),multiply(Y,inverse(multiply(X,inverse(X),Z)),Z),X),Y).
% 1278 [para:1273.1.1,1271.1.1.1] equal(multiply(multiply(X,multiply(multiply(Y,Z,U),inverse(multiply(multiply(Y,Z,V),X,W)),W),multiply(Y,Z,V)),inverse(multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5))),multiply(X2,multiply(X5,X4,X3),X1)),multiply(Z,multiply(U,X,V),Y)).
% 1293 [para:1273.1.1,1273.1.1] equal(multiply(X,multiply(Y,inverse(multiply(Z,X,U)),U),Z),multiply(X,multiply(Y,inverse(multiply(Z,X,V)),V),Z)).
% 1310 [para:1277.1.1,1271.1.1.3] equal(multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,inverse(Z),U),inverse(multiply(Z,inverse(Z),U)),multiply(Z,inverse(Z),V))),V),Y).
% 1311 [para:1277.1.1,1271.1.1.3.2] equal(multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,V),multiply(W,inverse(multiply(V,inverse(V),X1)),X1),multiply(Z,U,inverse(V)))),multiply(U,W,Z)),Y).
% 1382 [para:1273.1.2,1293.1.2] equal(multiply(X,multiply(Y,inverse(multiply(Z,X,U)),U),Z),multiply(multiply(Z,X,Y),inverse(multiply(multiply(V,W,X1),X2,multiply(V,W,X3))),multiply(W,multiply(X3,X2,X1),V))).
% 1425 [para:1310.1.1,1310.1.1.2.1] equal(multiply(multiply(X,inverse(X),Y),inverse(multiply(Z,inverse(Z),multiply(multiply(Z,inverse(Z),U),inverse(multiply(Z,inverse(Z),U)),V))),V),Y).
% 2117 [para:1310.1.1,1276.1.1.2.1,demod:1277] equal(multiply(multiply(X,inverse(X),Y),inverse(multiply(Z,inverse(Z),multiply(U,inverse(U),V))),multiply(inverse(Z),V,Z)),Y).
% 2210 [para:2117.1.1,1271.1.1.1,demod:1271] equal(X,multiply(inverse(Y),X,Y)).
% 2285 [para:2210.1.2,1277.1.1.2,demod:2210] equal(inverse(multiply(X,inverse(X),Y)),inverse(Y)).
% 2287 [para:1277.1.1,2210.1.2,demod:2285] equal(multiply(X,inverse(Y),Y),X).
% 2299 [para:2210.1.2,1310.1.1.2.1.1,demod:2287,2285,2210] equal(multiply(X,inverse(X),Y),Y).
% 2300 [para:2210.1.2,1425.1.1.1,demod:2287,2299] equal(inverse(inverse(X)),X).
% 2302 [para:2210.1.2,1311.1.1.1,demod:2287,2299,2300] equal(multiply(X,inverse(multiply(multiply(Y,Z,U),V,multiply(Y,Z,inverse(U)))),multiply(Z,V,Y)),X).
% 2317 [para:2210.1.2,1382.1.1,demod:2287,2299] equal(X,multiply(X,inverse(multiply(multiply(Y,Z,U),V,multiply(Y,Z,W))),multiply(Z,multiply(W,V,U),Y))).
% 2323 [para:2210.1.2,1382.1.2.3.2,demod:2302] equal(multiply(X,multiply(Y,inverse(multiply(Z,X,U)),U),Z),multiply(Z,X,Y)).
% 2333 [para:2300.1.1,1271.1.1.1.2,demod:2317] equal(multiply(inverse(X),X,Y),Y).
% 2369 [para:2299.1.1,1273.1.1,demod:2323] equal(multiply(X,multiply(Y,Z,U),V),multiply(multiply(V,X,U),Z,multiply(V,X,Y))).
% 2370 [para:2299.1.1,1273.1.2.2,demod:2287,2369] equal(multiply(X,Y,multiply(X,Y,Z)),multiply(Y,Z,X)).
% 2402 [para:2299.1.1,1278.1.1.1.2.1,demod:2210,2287,2369,2323,2299] equal(multiply(X,Y,Z),multiply(Z,Y,X)).
% 2489 [para:2402.1.1,1272.1.2.3,demod:2369] -equal(multiply(e,multiply(c,b,a),d),multiply(d,e,multiply(c,b,a))).
% 2603 [para:1271.1.1,2370.1.1.3,demod:2333,2369,2299] equal(multiply(X,inverse(multiply(Y,multiply(Z,U,V),W)),X),X).
% 2606 [para:1273.1.1,2370.1.1.3,demod:2333,2603,2323,2369,slowcut:2489] 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:    547
%  derived clauses:   2677024
%  kept clauses:      2583
%  kept size sum:     214160
%  kept mid-nuclei:   0
%  kept new demods:   1008
%  forw unit-subs:    74970
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     179
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  89.89
%  process. runtime:  89.28
% 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/BOO067-1+eq_r.in")
% 
%------------------------------------------------------------------------------