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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP297-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 : 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 229.0s
% Output   : Assurance 229.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/GRP/GRP297-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(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Y),sk_c7) | -equal(multiply(Y,sk_c6),sk_c7) | -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c7),sk_c6).
% was split for some strategies as: 
% -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c7),sk_c6).
% -equal(inverse(Y),sk_c7) | -equal(multiply(Y,sk_c6),sk_c7).
% -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% -equal(multiply(sk_c7,sk_c6),sk_c5).
% -equal(multiply(sk_c7,sk_c5),sk_c6).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(29,40,1,62,0,1,689,50,5,722,0,5,1958,50,17,1991,0,17,3508,50,36,3541,0,36,5227,50,54,5260,0,54,7115,50,74,7148,0,74,9227,50,105,9260,0,105,11564,50,153,11597,0,153,14181,50,241,14214,0,241,17079,50,412,17112,0,412,20313,50,668,20346,0,668,23884,50,1139,23884,40,1139,23917,0,1139,33419,3,1443,34250,4,1590,35050,1,1740,35050,50,1740,35050,40,1740,35083,0,1740,35335,3,2051,35344,4,2193,35354,5,2341,35354,1,2341,35354,50,2341,35354,40,2341,35387,0,2341,64475,3,3843,65454,4,4592,66446,5,5342,66447,1,5342,66447,50,5343,66447,40,5343,66480,0,5343,85571,3,6094,86498,4,6469,87344,5,6844,87345,1,6844,87345,50,6844,87345,40,6844,87378,0,6844,97237,3,7595,98932,4,7970,100675,1,8345,100675,50,8345,100675,40,8345,100708,0,8345,181456,3,12254,182292,4,14197,183054,5,16146,183055,1,16146,183055,50,16149,183055,40,16149,183088,0,16149,252835,3,18703,253480,4,19975,253987,5,21251,253988,1,21251,253988,50,21254,253988,40,21254,254021,0,21254,281242,3,22755)
% 
% 
% START OF PROOF
% 184932 [?] ?
% 253989 [] equal(X,X).
% 253990 [] equal(multiply(identity,X),X).
% 253991 [] equal(multiply(inverse(X),X),identity).
% 253992 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 253997 [] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 253998 [] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 254001 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c4).
% 254002 [] equal(multiply(sk_c3,sk_c4),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 254003 [] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 254004 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c2),sk_c7).
% 254007 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c4).
% 254008 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c4),sk_c6).
% 254009 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 254010 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 254015 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 254016 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c2),sk_c7).
% 254017 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c6,sk_c7),sk_c5).
% 254018 [] -equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(multiply(sk_c7,sk_c6),sk_c5) | $spltprd0($spltcnst25) | -equal(multiply(X,sk_c7),sk_c6) | -equal(multiply(Y,X),sk_c6) | -equal(inverse(Y),X).
% 254019 [] $spltprd0($spltcnst26) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 254020 [] $spltprd0($spltcnst27) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 254021 [] -$spltprd0($spltcnst26) | -$spltprd0($spltcnst25) | -$spltprd0($spltcnst27).
% 254103 [para:254003.1.1,254019.2.1,cut:253989] -equal(inverse(sk_c2),sk_c7) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst26).
% 254106 [para:253997.2.1,254019.2.1,cut:253989] equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst26).
% 254107 [para:254009.2.1,254019.2.1,cut:253989] equal(multiply(sk_c1,sk_c7),sk_c6) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst26).
% 254111 [para:254015.2.1,254019.2.1,cut:253989] equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst26).
% 254117 [para:253991.1.1,254020.2.1,cut:184932] -equal(inverse(inverse(sk_c7)),sk_c7) | $spltprd0($spltcnst27).
% 254142 [para:253991.1.1,253992.1.1.1,demod:253990] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 254152 [para:254010.1.1,253992.1.1.1] equal(inverse(sk_c2),sk_c7) | equal(multiply(sk_c6,X),multiply(sk_c1,multiply(sk_c7,X))).
% 254161 [para:253997.1.1,253992.1.1.1] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(multiply(sk_c6,X),multiply(sk_c7,multiply(sk_c5,X))).
% 254197 [para:253991.1.1,254142.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 254259 [para:254142.1.2,254142.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 254272 [para:254197.1.2,254142.1.2.2] equal(identity,multiply(inverse(inverse(inverse(X))),X)).
% 254302 [para:254272.1.2,254142.1.2.2,demod:254197] equal(X,inverse(inverse(X))).
% 254303 [para:254302.1.2,253991.1.1.1] equal(multiply(X,inverse(X)),identity).
% 254312 [para:254003.2.1,254302.1.2.1] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(sk_c1,inverse(sk_c7)).
% 254324 [para:254302.1.2,254117.1.1,cut:253989] $spltprd0($spltcnst27).
% 254326 [para:254302.1.2,254197.1.2.1] equal(X,multiply(X,identity)).
% 254328 [para:254001.1.1,254303.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | equal(inverse(sk_c3),sk_c4).
% 254592 [para:254328.1.1,254007.1.1] equal(inverse(sk_c3),sk_c4) | equal(identity,sk_c6).
% 254612 [para:254592.1.1,254303.1.1.2] equal(multiply(sk_c3,sk_c4),identity) | equal(identity,sk_c6).
% 254905 [para:254612.1.1,254002.1.1] equal(inverse(sk_c1),sk_c7) | equal(identity,sk_c6).
% 254907 [para:254008.1.1,254612.2.1] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(identity,sk_c6).
% 254936 [para:254905.2.2,254003.1.1.2,demod:254326] equal(inverse(sk_c1),sk_c7) | equal(sk_c2,sk_c7).
% 254947 [para:254905.1.1,254303.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | equal(identity,sk_c6).
% 254978 [para:254004.2.1,254936.2.1.1] equal(inverse(sk_c7),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 255301 [para:254004.2.1,254103.1.1,cut:253989] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst26).
% 255308 [para:255301.1.1,254303.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | $spltprd0($spltcnst26).
% 255365 [para:253998.2.1,254106.2.1,cut:253989] equal(multiply(sk_c7,sk_c5),sk_c6) | $spltprd0($spltcnst26).
% 255370 [para:255365.1.1,254142.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),sk_c6)) | $spltprd0($spltcnst26).
% 255404 [para:254010.2.1,254107.2.1,cut:253989] equal(multiply(sk_c1,sk_c7),sk_c6) | $spltprd0($spltcnst26).
% 255420 [para:255404.1.1,255308.1.1] equal(sk_c6,identity) | $spltprd0($spltcnst26).
% 255434 [para:255420.1.2,254197.1.2.2,demod:254302] $spltprd0($spltcnst26) | equal(X,multiply(X,sk_c6)).
% 255491 [para:255434.2.2,254259.1.2,demod:254302] $spltprd0($spltcnst26) | equal(multiply(X,sk_c6),X).
% 255496 [para:254016.2.1,254111.2.1,cut:253989] equal(multiply(sk_c7,sk_c6),sk_c5) | $spltprd0($spltcnst26).
% 255541 [para:255496.1.1,255491.2.1] equal(sk_c5,sk_c7) | $spltprd0($spltcnst26).
% 255848 [para:255370.1.2,254019.2.1,demod:254302,cut:253989,binarycut:255541] $spltprd0($spltcnst26).
% 255849 [binary:254021,255848,cut:254324] -$spltprd0($spltcnst25).
% 256534 [para:254947.1.1,254907.1.1] equal(identity,sk_c6).
% 256559 [para:256534.1.1,253990.1.1.1] equal(multiply(sk_c6,X),X).
% 256565 [para:256534.1.2,254017.1.1.2,demod:256559,254326] equal(sk_c7,sk_c5).
% 256568 [para:256534.1.1,254197.1.2.2,demod:254302] equal(X,multiply(X,sk_c6)).
% 256628 [para:254312.1.1,256565.2.2.1,demod:256568] equal(sk_c1,inverse(sk_c5)) | equal(sk_c2,sk_c7).
% 256675 [para:253998.1.1,254152.2.2.2,demod:256568,256559] equal(inverse(sk_c2),sk_c7) | equal(sk_c5,sk_c1).
% 256727 [para:256628.1.2,254197.1.2.1.1,demod:254326] equal(sk_c5,inverse(sk_c1)) | equal(sk_c2,sk_c7).
% 256867 [para:254003.1.2,256727.2.1,demod:256568] equal(sk_c5,sk_c7) | equal(sk_c2,sk_c7).
% 256960 [para:256867.2.2,256565.1.1] equal(sk_c2,sk_c5) | equal(sk_c5,sk_c7).
% 257013 [para:256867.1.1,256960.2.1] equal(sk_c5,sk_c7).
% 257014 [para:256675.2.1,257013.1.1] equal(inverse(sk_c2),sk_c7) | equal(sk_c1,sk_c7).
% 257921 [para:254303.1.1,254161.2.2.2,demod:256568,254326,256559] equal(inverse(sk_c5),sk_c7) | equal(sk_c2,sk_c7).
% 258011 [para:257921.1.1,256628.1.2] equal(sk_c1,sk_c7) | equal(sk_c2,sk_c7).
% 258129 [para:258011.2.1,257014.1.1.1] equal(inverse(sk_c7),sk_c7) | equal(sk_c1,sk_c7).
% 259311 [para:254978.2.1,258129.2.1.1] equal(inverse(sk_c7),sk_c7).
% 259312 [para:259311.1.1,253991.1.1.1] equal(multiply(sk_c7,sk_c7),identity).
% 282152 [para:256565.1.2,254018.1.1.2,demod:256568,256559,cut:256565,cut:255849,factor:factor:cut:259311] -equal(multiply(sk_c7,sk_c7),sk_c6).
% 282153 [para:256534.1.2,282152.1.2,demod:259312,cut:253989] 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
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    21345
%  derived clauses:   4884339
%  kept clauses:      233891
%  kept size sum:     0
%  kept mid-nuclei:   14058
%  kept new demods:   1263
%  forw unit-subs:    1948094
%  forw double-subs: 2272439
%  forw overdouble-subs: 384251
%  backward subs:     4485
%  fast unit cutoff:  13227
%  full unit cutoff:  0
%  dbl  unit cutoff:  10995
%  real runtime  :  231.99
%  process. runtime:  230.78
% specific non-discr-tree subsumption statistics: 
%  tried:           25958004
%  length fails:    2257381
%  strength fails:  6438792
%  predlist fails:  1428764
%  aux str. fails:  6023039
%  by-lit fails:    4948409
%  full subs tried: 830324
%  full subs fail:  735832
% 
% ; 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/GRP297-1+eq_r.in")
% 
%------------------------------------------------------------------------------