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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP292-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 : art02.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 229.7s
% Output   : Assurance 229.7s
% 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/GRP292-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 17)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 17)
% (binary-posweight-lex-big-order 30 #f 3 17)
% (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(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c5),sk_c6) | -equal(inverse(Y),sk_c5) | -equal(multiply(sk_c5,sk_c6),sk_c7) | -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c5),sk_c6).
% was split for some strategies as: 
% -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c5),sk_c6).
% -equal(multiply(Y,sk_c5),sk_c6) | -equal(inverse(Y),sk_c5).
% -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% -equal(multiply(sk_c7,sk_c6),sk_c5).
% -equal(multiply(sk_c5,sk_c6),sk_c7).
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(25,40,0,54,0,1,490,50,4,519,0,4,1344,50,12,1373,0,12,2309,50,25,2338,0,25,3416,50,40,3445,0,40,4632,50,57,4661,0,57,6026,50,83,6055,0,83,7564,50,126,7593,0,126,9316,50,204,9345,0,204,11248,50,354,11277,0,354,13430,50,600,13459,0,600,15828,50,1038,15828,40,1038,15857,0,1038,25523,3,1339,26317,4,1489,27083,1,1639,27083,50,1639,27083,40,1639,27112,0,1639,27303,3,1947,27312,4,2099,27319,5,2240,27319,1,2240,27319,50,2240,27319,40,2240,27348,0,2240,45284,3,3747,47098,4,4491,48630,5,5241,48631,1,5241,48631,50,5242,48631,40,5242,48660,0,5242,59963,3,5993,61335,4,6368,62503,1,6743,62503,50,6743,62503,40,6743,62532,0,6743,73868,3,7511,75107,4,7869,76686,1,8244,76686,50,8244,76686,40,8244,76715,0,8244,115396,3,12147,117333,4,14095,119083,5,16045,119084,1,16045,119084,50,16047,119084,40,16047,119113,0,16047,157949,3,18599,159210,4,19873,160435,5,21148,160436,1,21148,160436,50,21150,160436,40,21150,160465,0,21150,187417,3,22651,188604,4,23401)
% 
% 
% START OF PROOF
% 120286 [?] ?
% 160437 [] equal(X,X).
% 160438 [] equal(multiply(identity,X),X).
% 160439 [] equal(multiply(inverse(X),X),identity).
% 160440 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 160443 [] equal(inverse(sk_c2),sk_c5) | equal(inverse(sk_c3),sk_c4).
% 160444 [] equal(multiply(sk_c3,sk_c4),sk_c6) | equal(inverse(sk_c2),sk_c5).
% 160445 [] equal(multiply(sk_c5,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c5).
% 160447 [] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(inverse(sk_c3),sk_c4).
% 160448 [] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(multiply(sk_c3,sk_c4),sk_c6).
% 160461 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 160462 [] -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(sk_c5,sk_c6),sk_c7) | $spltprd0($spltcnst25) | -equal(multiply(X,sk_c5),sk_c6) | -equal(multiply(Y,X),sk_c6) | -equal(inverse(Y),X).
% 160463 [] $spltprd0($spltcnst26) | -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c5).
% 160464 [] $spltprd0($spltcnst27) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 160465 [] -$spltprd0($spltcnst26) | -$spltprd0($spltcnst25) | -$spltprd0($spltcnst27).
% 160523 [para:160439.1.1,160463.2.1,cut:120286] -equal(inverse(inverse(sk_c5)),sk_c5) | $spltprd0($spltcnst26).
% 160545 [para:160439.1.1,160464.2.1,cut:120286] -equal(inverse(inverse(sk_c7)),sk_c7) | $spltprd0($spltcnst27).
% 160553 [para:160439.1.1,160440.1.1.1,demod:160438] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 160602 [para:160438.1.1,160553.1.2.2] equal(X,multiply(inverse(identity),X)).
% 160603 [para:160439.1.1,160553.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 160654 [para:160553.1.2,160440.1.1.1] equal(multiply(X,Y),multiply(inverse(Z),multiply(multiply(Z,X),Y))).
% 160660 [para:160602.1.2,160553.1.2.2] equal(X,multiply(inverse(inverse(identity)),X)).
% 160669 [para:160603.1.2,160553.1.2.2] equal(identity,multiply(inverse(inverse(inverse(X))),X)).
% 160671 [para:160660.1.2,160439.1.1] equal(inverse(identity),identity).
% 160696 [para:160669.1.2,160553.1.2.2,demod:160603] equal(X,inverse(inverse(X))).
% 160697 [para:160696.1.2,160439.1.1.1] equal(multiply(X,inverse(X)),identity).
% 160703 [para:160444.2.1,160696.1.2.1] equal(multiply(sk_c3,sk_c4),sk_c6) | equal(sk_c2,inverse(sk_c5)).
% 160704 [para:160445.2.1,160696.1.2.1] equal(multiply(sk_c5,sk_c6),sk_c7) | equal(sk_c2,inverse(sk_c5)).
% 160716 [para:160696.1.2,160523.1.1,cut:160437] $spltprd0($spltcnst26).
% 160718 [para:160696.1.2,160545.1.1,cut:160437] $spltprd0($spltcnst27).
% 160719 [para:160696.1.2,160553.1.2.1] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 160720 [para:160696.1.2,160603.1.2.1] equal(X,multiply(X,identity)).
% 160721 [binary:160465,160716,cut:160718] -$spltprd0($spltcnst25).
% 160725 [para:160443.1.1,160697.1.1.2] equal(multiply(sk_c2,sk_c5),identity) | equal(inverse(sk_c3),sk_c4).
% 160968 [para:160725.1.1,160447.1.1] equal(inverse(sk_c3),sk_c4) | equal(identity,sk_c6).
% 160989 [para:160968.1.1,160697.1.1.2] equal(multiply(sk_c3,sk_c4),identity) | equal(identity,sk_c6).
% 161316 [para:160989.1.1,160444.1.1] equal(inverse(sk_c2),sk_c5) | equal(identity,sk_c6).
% 161318 [para:160448.1.1,160989.2.1] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(identity,sk_c6).
% 161327 [para:160989.1.1,160703.1.1] equal(sk_c2,inverse(sk_c5)) | equal(identity,sk_c6).
% 161342 [para:161316.1.1,160697.1.1.2] equal(multiply(sk_c2,sk_c5),identity) | equal(identity,sk_c6).
% 161375 [para:161327.2.2,160704.1.1.2,demod:160720] equal(sk_c2,inverse(sk_c5)) | equal(sk_c5,sk_c7).
% 161446 [para:161375.1.2,160603.1.2.1.1,demod:160720] equal(sk_c5,inverse(sk_c2)) | equal(sk_c5,sk_c7).
% 161933 [para:161342.1.1,161318.1.1] equal(identity,sk_c6).
% 161934 [para:161933.1.1,160438.1.1.1] equal(multiply(sk_c6,X),X).
% 161941 [para:161933.1.1,160603.1.2.2,demod:160696] equal(X,multiply(X,sk_c6)).
% 161942 [para:161933.1.1,160671.1.1.1] equal(inverse(sk_c6),identity).
% 161967 [para:161942.1.1,160439.1.1.1,demod:160438] equal(sk_c6,identity).
% 161969 [para:161967.1.1,160461.1.1.2,demod:161941,160720] equal(sk_c7,sk_c5) | equal(sk_c5,sk_c7).
% 162000 [para:160704.1.2,161969.2.2.1,demod:161941] equal(sk_c2,inverse(sk_c7)) | equal(sk_c5,sk_c7).
% 162049 [para:162000.1.2,160603.1.2.1.1,demod:160720] equal(sk_c7,inverse(sk_c2)) | equal(sk_c5,sk_c7).
% 162238 [para:162049.1.2,161446.1.2] equal(sk_c5,sk_c7).
% 162250 [para:162238.1.2,160462.1.1.1,demod:161941,cut:160437,cut:162238,cut:160721] -equal(multiply(X,sk_c5),sk_c6) | -equal(multiply(Y,X),sk_c6) | -equal(inverse(Y),X).
% 167907 [para:160697.1.1,160654.1.2.2,demod:160720] equal(multiply(X,inverse(multiply(Y,X))),inverse(Y)).
% 168282 [para:160553.1.2,167907.1.1.2.1,demod:160696] equal(multiply(multiply(X,Y),inverse(Y)),X).
% 168286 [para:167907.1.1,160719.1.2.2] equal(inverse(multiply(X,inverse(Y))),multiply(Y,inverse(X))).
% 168893 [para:160696.1.2,168282.1.1.2] equal(multiply(multiply(X,inverse(Y)),Y),X).
% 187567 [para:168286.1.1,168282.1.1.2] equal(multiply(multiply(X,multiply(Y,inverse(Z))),multiply(Z,inverse(Y))),X).
% 188609 [binary:187567,162250.2,demod:161934,cut:168286,slowcut:168893] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using first arg depth 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:    30274
%  derived clauses:   4789720
%  kept clauses:      140009
%  kept size sum:     876630
%  kept mid-nuclei:   13207
%  kept new demods:   970
%  forw unit-subs:    1991812
%  forw double-subs: 2496422
%  forw overdouble-subs: 104399
%  backward subs:     6285
%  fast unit cutoff:  12986
%  full unit cutoff:  0
%  dbl  unit cutoff:  4378
%  real runtime  :  234.74
%  process. runtime:  234.20
% specific non-discr-tree subsumption statistics: 
%  tried:           17130865
%  length fails:    1581743
%  strength fails:  5106374
%  predlist fails:  2762156
%  aux str. fails:  1966472
%  by-lit fails:    3429976
%  full subs tried: 646491
%  full subs fail:  601564
% 
% ; 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/GRP292-1+eq_r.in")
% 
%------------------------------------------------------------------------------