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

View Problem - Process Solution

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

% Computer : art08.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.8s
% Output   : Assurance 89.8s
% 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/GRP/GRP268-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 3 19)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 19)
% (binary-posweight-lex-big-order 30 #f 3 19)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% SOS clause 
% -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,sk_c6),sk_c7) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,Z),sk_c7) | -equal(multiply(U,sk_c6),Z) | -equal(inverse(U),sk_c6) | -equal(multiply(V,sk_c8),sk_c7) | -equal(inverse(V),sk_c8) | -equal(inverse(sk_c6),sk_c7).
% was split for some strategies as: 
% -equal(multiply(V,sk_c8),sk_c7) | -equal(inverse(V),sk_c8).
% -equal(multiply(sk_c6,Z),sk_c7) | -equal(multiply(U,sk_c6),Z) | -equal(inverse(U),sk_c6).
% -equal(multiply(Y,sk_c6),sk_c7) | -equal(inverse(Y),sk_c6).
% -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% -equal(inverse(sk_c6),sk_c7).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(26,40,0,57,0,0,88836,4,1462,90742,5,1501,90743,5,1501,90744,1,1501,90744,50,1501,90744,40,1501,90775,0,1501,102809,3,1802,103455,4,1952,104114,5,2102,104115,1,2102,104115,50,2102,104115,40,2102,104146,0,2102,104346,3,2412,104354,4,2555,104362,5,2703,104362,1,2703,104362,50,2703,104362,40,2703,104393,0,2703,126251,3,4204,126972,4,4954,127406,1,5704,127406,50,5704,127406,40,5704,127437,0,5704,142903,3,6457,143362,4,6830,143633,1,7205,143633,50,7205,143633,40,7205,143664,0,7205,160561,3,7956,161284,4,8331,161937,1,8706,161937,50,8706,161937,40,8706,161968,0,8706)
% 
% 
% START OF PROOF
% 161938 [] equal(X,X).
% 161939 [] equal(multiply(identity,X),X).
% 161940 [] equal(multiply(inverse(X),X),identity).
% 161941 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 161943 [] equal(inverse(sk_c3),sk_c6) | equal(inverse(sk_c6),sk_c7).
% 161944 [] equal(inverse(sk_c3),sk_c6) | equal(inverse(sk_c5),sk_c8).
% 161945 [] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(inverse(sk_c3),sk_c6).
% 161946 [] equal(multiply(sk_c3,sk_c6),sk_c4) | equal(inverse(sk_c6),sk_c7).
% 161947 [] equal(multiply(sk_c3,sk_c6),sk_c4) | equal(inverse(sk_c5),sk_c8).
% 161949 [] equal(multiply(sk_c6,sk_c4),sk_c7) | equal(inverse(sk_c6),sk_c7).
% 161950 [] equal(multiply(sk_c6,sk_c4),sk_c7) | equal(inverse(sk_c5),sk_c8).
% 161952 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c6),sk_c7).
% 161953 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c5),sk_c8).
% 161954 [] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 161955 [] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(inverse(sk_c6),sk_c7).
% 161956 [] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(inverse(sk_c5),sk_c8).
% 161957 [] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c7).
% 161959 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c8).
% 161960 [] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(inverse(sk_c1),sk_c8).
% 161962 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(inverse(sk_c5),sk_c8).
% 161963 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c7).
% 161964 [] -equal(inverse(sk_c6),sk_c7) | $spltprd0($spltcnst25) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 161965 [] $spltprd0($spltcnst26) | -equal(multiply(sk_c6,X),sk_c7) | -equal(multiply(Y,sk_c6),X) | -equal(inverse(Y),sk_c6).
% 161966 [] $spltprd0($spltcnst27) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c6).
% 161967 [] $spltprd0($spltcnst28) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 161968 [] -$spltprd0($spltcnst26) | -$spltprd0($spltcnst25) | -$spltprd0($spltcnst28) | -$spltprd0($spltcnst27).
% 161970 [para:161943.1.1,161940.1.1.1] equal(multiply(sk_c6,sk_c3),identity) | equal(inverse(sk_c6),sk_c7).
% 161971 [para:161943.2.1,161940.1.1.1] equal(multiply(sk_c7,sk_c6),identity) | equal(inverse(sk_c3),sk_c6).
% 162075 [para:161940.1.1,161966.2.1] -equal(inverse(inverse(sk_c6)),sk_c6) | -equal(identity,sk_c7) | $spltprd0($spltcnst27).
% 162084 [para:161956.1.1,161966.2.1,cut:161938,binarycut:161953] equal(inverse(sk_c5),sk_c8) | $spltprd0($spltcnst27).
% 162086 [para:161957.1.1,161966.2.1,cut:161938] equal(multiply(sk_c5,sk_c8),sk_c7) | -equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst27).
% 162114 [para:161962.1.1,161967.2.1,cut:161938,binarycut:161959] equal(inverse(sk_c5),sk_c8) | $spltprd0($spltcnst28).
% 162121 [para:161963.2.1,161967.2.1,cut:161938,binarycut:162114] equal(multiply(sk_c1,sk_c8),sk_c7) | $spltprd0($spltcnst28).
% 162135 [para:162121.1.1,161967.2.1,cut:161938] -equal(inverse(sk_c1),sk_c8) | $spltprd0($spltcnst28).
% 162136 [para:161940.1.1,161941.1.1.1,demod:161939] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 162190 [para:161960.2.1,162135.1.1,cut:161938] equal(multiply(sk_c5,sk_c8),sk_c7) | $spltprd0($spltcnst28).
% 162209 [para:162190.1.1,161967.2.1,cut:161938,binarycut:162114] $spltprd0($spltcnst28).
% 162211 [para:161940.1.1,162136.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 162275 [para:161941.1.1,162136.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 162276 [para:162136.1.2,162136.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 162319 [para:162276.1.2,161940.1.1] equal(multiply(X,inverse(X)),identity).
% 162359 [para:162276.1.2,162136.1.2] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 162360 [para:162276.1.2,162211.1.2] equal(X,multiply(X,identity)).
% 162378 [para:162360.1.2,161940.1.1] equal(inverse(identity),identity).
% 162380 [para:162360.1.2,162211.1.2] equal(X,inverse(inverse(X))).
% 162386 [para:161943.1.1,162380.1.2.1] equal(sk_c3,inverse(sk_c6)) | equal(inverse(sk_c6),sk_c7).
% 162388 [para:161944.1.1,162380.1.2.1] equal(sk_c3,inverse(sk_c6)) | equal(inverse(sk_c5),sk_c8).
% 162390 [para:161952.1.1,162380.1.2.1] equal(sk_c2,inverse(sk_c6)) | equal(inverse(sk_c6),sk_c7).
% 162392 [para:161953.1.1,162380.1.2.1] equal(sk_c2,inverse(sk_c6)) | equal(inverse(sk_c5),sk_c8).
% 162398 [para:161945.2.1,162380.1.2.1] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(sk_c3,inverse(sk_c6)).
% 162403 [para:161954.2.1,162380.1.2.1] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(sk_c2,inverse(sk_c6)).
% 162404 [para:161955.2.1,162380.1.2.1] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(sk_c6,inverse(sk_c7)).
% 162426 [para:161943.1.1,162319.1.1.2] equal(multiply(sk_c3,sk_c6),identity) | equal(inverse(sk_c6),sk_c7).
% 162428 [para:161944.1.1,162319.1.1.2] equal(multiply(sk_c3,sk_c6),identity) | equal(inverse(sk_c5),sk_c8).
% 162429 [para:161944.2.1,162319.1.1.2] equal(multiply(sk_c5,sk_c8),identity) | equal(inverse(sk_c3),sk_c6).
% 162463 [para:162084.1.1,162319.1.1.2] equal(multiply(sk_c5,sk_c8),identity) | $spltprd0($spltcnst27).
% 162548 [para:162386.1.2,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c3)) | equal(inverse(sk_c6),sk_c7).
% 162549 [para:162386.2.1,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c7)) | equal(sk_c3,inverse(sk_c6)).
% 162584 [para:162390.1.2,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c2)) | equal(inverse(sk_c6),sk_c7).
% 162590 [para:162390.1.2,162386.1.2] equal(inverse(sk_c6),sk_c7) | equal(sk_c3,sk_c2).
% 162603 [para:162590.1.1,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c7)) | equal(sk_c3,sk_c2).
% 162656 [para:162392.1.2,162388.1.2] equal(inverse(sk_c5),sk_c8) | equal(sk_c3,sk_c2).
% 162664 [para:162656.1.1,162319.1.1.2] equal(multiply(sk_c5,sk_c8),identity) | equal(sk_c3,sk_c2).
% 162742 [para:162548.2.1,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c7)) | equal(sk_c6,inverse(sk_c3)).
% 162787 [para:162584.2.1,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c7)) | equal(sk_c6,inverse(sk_c2)).
% 163136 [para:162398.2.2,162403.2.2] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(sk_c3,sk_c2).
% 163144 [para:163136.1.1,162664.1.1] equal(sk_c7,identity) | equal(sk_c3,sk_c2).
% 163145 [para:162664.1.1,163136.1.1] equal(identity,sk_c7) | equal(sk_c3,sk_c2).
% 163169 [para:163144.1.1,162603.1.2.1,demod:162378] equal(sk_c6,identity) | equal(sk_c3,sk_c2).
% 163571 [para:162380.1.2,162075.1.1,cut:161938] -equal(identity,sk_c7) | $spltprd0($spltcnst27).
% 163581 [para:162426.1.1,161946.1.1] equal(inverse(sk_c6),sk_c7) | equal(identity,sk_c4).
% 163593 [para:163581.2.2,161949.1.1.2,demod:162360] equal(inverse(sk_c6),sk_c7) | equal(sk_c6,sk_c7).
% 163645 [para:163593.1.1,162211.1.2.1.1,demod:162360] equal(sk_c6,inverse(sk_c7)) | equal(sk_c6,sk_c7).
% 163649 [para:163593.2.1,162386.1.2.1] equal(sk_c3,inverse(sk_c7)) | equal(inverse(sk_c6),sk_c7).
% 163694 [para:162549.2.1,163645.2.2.1] equal(sk_c3,inverse(sk_c7)) | equal(sk_c6,inverse(sk_c7)).
% 163793 [para:161954.2.1,162086.2.1,cut:161938] equal(multiply(sk_c5,sk_c8),sk_c7) | $spltprd0($spltcnst27).
% 163799 [para:162463.1.1,163793.1.1,binarycut:163571] $spltprd0($spltcnst27).
% 164028 [para:162428.1.1,161947.1.1] equal(inverse(sk_c5),sk_c8) | equal(identity,sk_c4).
% 164038 [para:164028.2.2,161950.1.1.2,demod:162360] equal(inverse(sk_c5),sk_c8) | equal(sk_c6,sk_c7).
% 164065 [para:164038.2.1,162388.1.2.1] equal(sk_c3,inverse(sk_c7)) | equal(inverse(sk_c5),sk_c8).
% 164144 [para:164065.1.2,162211.1.2.1.1,demod:162360] equal(sk_c7,inverse(sk_c3)) | equal(inverse(sk_c5),sk_c8).
% 164214 [para:164144.1.2,161944.1.1] equal(inverse(sk_c5),sk_c8) | equal(sk_c7,sk_c6).
% 164225 [para:164214.1.1,162319.1.1.2] equal(multiply(sk_c5,sk_c8),identity) | equal(sk_c7,sk_c6).
% 164386 [para:162429.1.1,161945.1.1] equal(inverse(sk_c3),sk_c6) | equal(identity,sk_c7).
% 164393 [para:164386.2.2,161971.1.1.1,demod:161939] equal(inverse(sk_c3),sk_c6) | equal(sk_c6,identity).
% 164421 [para:163145.2.1,164386.1.1.1] equal(inverse(sk_c2),sk_c6) | equal(identity,sk_c7).
% 164476 [para:163169.2.1,164393.1.1.1] equal(inverse(sk_c2),sk_c6) | equal(sk_c6,identity).
% 164555 [para:164421.1.1,162319.1.1.2] equal(multiply(sk_c2,sk_c6),identity) | equal(identity,sk_c7).
% 164687 [para:164476.1.1,162211.1.2.1.1,demod:162360] equal(sk_c2,inverse(sk_c6)) | equal(sk_c6,identity).
% 165269 [para:164555.1.1,161955.1.1] equal(inverse(sk_c6),sk_c7) | equal(identity,sk_c7).
% 165270 [para:164555.1.1,161956.1.1] equal(inverse(sk_c5),sk_c8) | equal(identity,sk_c7).
% 165271 [para:164555.1.1,161957.1.1] equal(multiply(sk_c5,sk_c8),sk_c7) | equal(identity,sk_c7).
% 165296 [para:164555.1.1,162404.1.1] equal(sk_c6,inverse(sk_c7)) | equal(identity,sk_c7).
% 165314 [para:165269.2.2,163649.1.2.1,demod:162378] equal(inverse(sk_c6),sk_c7) | equal(sk_c3,identity).
% 165460 [para:165270.1.1,162319.1.1.2] equal(multiply(sk_c5,sk_c8),identity) | equal(identity,sk_c7).
% 165473 [para:165296.2.2,163694.1.2.1,demod:162378] equal(sk_c6,inverse(sk_c7)) | equal(sk_c3,identity).
% 165493 [para:165314.2.1,161970.1.1.2,demod:162360] equal(inverse(sk_c6),sk_c7) | equal(sk_c6,identity).
% 165701 [para:162742.2.1,165473.2.2.1,demod:162378] equal(sk_c6,inverse(sk_c7)) | equal(sk_c6,identity).
% 165892 [para:165493.1.1,164687.1.2] equal(sk_c2,sk_c7) | equal(sk_c6,identity).
% 166044 [para:165892.2.1,162404.1.1.2,demod:162360] equal(sk_c6,inverse(sk_c7)) | equal(sk_c2,sk_c7).
% 166619 [para:162787.2.1,166044.2.2.1] equal(sk_c6,inverse(sk_c7)).
% 166632 [para:166619.1.2,162136.1.2.1] equal(X,multiply(sk_c6,multiply(sk_c7,X))).
% 166633 [para:166619.1.2,162211.1.2.1.1,demod:162360] equal(sk_c7,inverse(sk_c6)).
% 167546 [para:164225.1.1,165271.1.1] equal(identity,sk_c7) | equal(sk_c7,sk_c6).
% 167652 [para:167546.1.2,166632.1.2.2.1,demod:161939] equal(sk_c7,sk_c6) | equal(X,multiply(sk_c6,X)).
% 167981 [para:162359.1.2,167652.2.2,demod:166633] equal(sk_c7,sk_c6) | equal(multiply(sk_c7,X),X).
% 168321 [para:165460.1.1,165271.1.1] equal(identity,sk_c7).
% 168338 [para:168321.1.2,165701.1.2.1,demod:162378] equal(sk_c6,identity).
% 168339 [para:168321.1.2,166632.1.2.2.1,demod:161939] equal(X,multiply(sk_c6,X)).
% 168355 [para:168338.1.1,166632.1.2.1,demod:161939] equal(X,multiply(sk_c7,X)).
% 169102 [para:161940.1.1,162275.1.2.2.2,demod:162360] equal(X,multiply(inverse(multiply(Y,inverse(X))),Y)).
% 169325 [para:168339.1.2,169102.1.2.1.1,demod:162380] equal(X,multiply(X,sk_c6)).
% 169370 [para:167981.1.2,169325.2.1] equal(sk_c7,sk_c6).
% 169371 [para:169325.1.2,168355.1.2] equal(sk_c6,sk_c7).
% 169384 [para:169370.1.2,161965.2.1.1,demod:169325,168355,factor:cut:161938,cut:161938] $spltprd0($spltcnst26).
% 169385 [binary:161968,169384,cut:162209,cut:163799] -$spltprd0($spltcnst25).
% 169389 [para:169371.1.1,161964.1.1.1,demod:166619,cut:169371,cut:169385] -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 169806 [para:161940.1.1,169389.1.1,demod:162380,cut:168321,cut:161938] 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: 78
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    11349
%  derived clauses:   1616987
%  kept clauses:      66362
%  kept size sum:     110410
%  kept mid-nuclei:   88379
%  kept new demods:   250
%  forw unit-subs:    582985
%  forw double-subs: 685760
%  forw overdouble-subs: 126410
%  backward subs:     9012
%  fast unit cutoff:  20121
%  full unit cutoff:  0
%  dbl  unit cutoff:  2187
%  real runtime  :  90.95
%  process. runtime:  90.60
% specific non-discr-tree subsumption statistics: 
%  tried:           2719006
%  length fails:    248981
%  strength fails:  832869
%  predlist fails:  111335
%  aux str. fails:  277643
%  by-lit fails:    416201
%  full subs tried: 506626
%  full subs fail:  408516
% 
% ; 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/GRP/GRP268-1+eq_r.in")
% 
%------------------------------------------------------------------------------