TSTP Solution File: GRP383-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP383-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 : art03.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 297.6s
% Output : Assurance 297.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/GRP/GRP383-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 23)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 23)
% (binary-posweight-lex-big-order 30 #f 3 23)
% (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(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% was split for some strategies as:
% -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8).
% -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7).
% -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8).
% -equal(inverse(sk_c8),sk_c7).
% -equal(multiply(sk_c7,sk_c6),sk_c8).
% -equal(multiply(sk_c7,sk_c8),sk_c6).
%
% Starting a split proof attempt with 7 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728)
%
%
% START OF PROOF
% 318153 [] equal(multiply(identity,X),X).
% 318154 [] equal(multiply(inverse(X),X),identity).
% 318155 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 318156 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 318157 [] equal(multiply(sk_c3,sk_c8),sk_c7) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 318158 [] equal(multiply(sk_c3,sk_c8),sk_c7) | equal(inverse(sk_c5),sk_c7).
% 318162 [?] ?
% 318163 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c5),sk_c7).
% 318167 [] equal(multiply(sk_c2,sk_c3),sk_c7) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 318168 [] equal(multiply(sk_c2,sk_c3),sk_c7) | equal(inverse(sk_c5),sk_c7).
% 318172 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 318173 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c5),sk_c7).
% 318177 [?] ?
% 318178 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c7).
% 318182 [] equal(multiply(sk_c7,sk_c6),sk_c8) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 318183 [] equal(multiply(sk_c7,sk_c6),sk_c8) | equal(inverse(sk_c5),sk_c7).
% 318187 [?] ?
% 318188 [] equal(inverse(sk_c8),sk_c7) | equal(inverse(sk_c5),sk_c7).
% 318194 [hyper:318156,318163,binarycut:318162] equal(inverse(sk_c2),sk_c3).
% 318195 [para:318194.1.1,318154.1.1.1] equal(multiply(sk_c3,sk_c2),identity).
% 318199 [hyper:318156,318178,binarycut:318177] equal(inverse(sk_c1),sk_c8).
% 318200 [para:318199.1.1,318154.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 318204 [hyper:318156,318188,binarycut:318187] equal(inverse(sk_c8),sk_c7).
% 318210 [para:318204.1.1,318154.1.1.1] equal(multiply(sk_c7,sk_c8),identity).
% 318214 [hyper:318156,318158,318157] equal(multiply(sk_c3,sk_c8),sk_c7).
% 318220 [hyper:318156,318168,318167] equal(multiply(sk_c2,sk_c3),sk_c7).
% 318226 [hyper:318156,318173,318172] equal(multiply(sk_c1,sk_c7),sk_c8).
% 318232 [hyper:318156,318183,318182] equal(multiply(sk_c7,sk_c6),sk_c8).
% 318234 [para:318195.1.1,318155.1.1.1,demod:318153] equal(X,multiply(sk_c3,multiply(sk_c2,X))).
% 318235 [para:318200.1.1,318155.1.1.1,demod:318153] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 318237 [para:318214.1.1,318155.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c3,multiply(sk_c8,X))).
% 318241 [para:318220.1.1,318234.1.2.2] equal(sk_c3,multiply(sk_c3,sk_c7)).
% 318243 [para:318226.1.1,318235.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 318266 [para:318243.1.2,318237.1.2.2,demod:318241,318210] equal(identity,sk_c3).
% 318268 [para:318266.1.2,318214.1.1.1,demod:318153] equal(sk_c8,sk_c7).
% 318276 [para:318268.1.1,318204.1.1.1] equal(inverse(sk_c7),sk_c7).
% 318316 [hyper:318156,318276,demod:318232,cut:318268] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728,318315,50,29728,318315,30,29728,318315,40,29729,318355,0,29729)
%
%
% START OF PROOF
% 318316 [] equal(X,X).
% 318320 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 318338 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 318339 [?] ?
% 318343 [?] ?
% 318344 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 318369 [hyper:318320,318344,binarycut:318339] equal(inverse(sk_c4),sk_c8).
% 318371 [hyper:318320,318344,binarycut:318343] equal(inverse(sk_c1),sk_c8).
% 318390 [hyper:318320,318338,demod:318371,cut:318316] equal(multiply(sk_c4,sk_c7),sk_c8).
% 318392 [hyper:318320,318390,demod:318369,cut:318316] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728,318315,50,29728,318315,30,29728,318315,40,29729,318355,0,29729,318391,50,29729,318391,30,29729,318391,40,29729,318431,0,29734)
%
%
% START OF PROOF
% 318392 [] equal(X,X).
% 318393 [] equal(multiply(identity,X),X).
% 318394 [] equal(multiply(inverse(X),X),identity).
% 318395 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 318396 [] -equal(multiply(X,sk_c8),sk_c7) | -equal(multiply(Y,X),sk_c7) | -equal(inverse(Y),X).
% 318397 [?] ?
% 318398 [?] ?
% 318399 [?] ?
% 318400 [?] ?
% 318401 [] equal(multiply(sk_c3,sk_c8),sk_c7) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 318402 [] equal(multiply(sk_c5,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c3).
% 318403 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c5),sk_c7).
% 318404 [] equal(multiply(sk_c4,sk_c7),sk_c8) | equal(inverse(sk_c2),sk_c3).
% 318405 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c4),sk_c8).
% 318406 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c3).
% 318407 [?] ?
% 318408 [?] ?
% 318409 [?] ?
% 318410 [?] ?
% 318411 [?] ?
% 318436 [hyper:318396,318403,binarycut:318408,binarycut:318398] equal(inverse(sk_c5),sk_c7).
% 318439 [para:318436.1.1,318394.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 318443 [hyper:318396,318405,binarycut:318410,binarycut:318400] equal(inverse(sk_c4),sk_c8).
% 318447 [para:318443.1.1,318394.1.1.1] equal(multiply(sk_c8,sk_c4),identity).
% 318452 [hyper:318396,318402,binarycut:318407,binarycut:318397] equal(multiply(sk_c5,sk_c6),sk_c7).
% 318458 [hyper:318396,318404,binarycut:318409,binarycut:318399] equal(multiply(sk_c4,sk_c7),sk_c8).
% 318466 [hyper:318396,318406,binarycut:318411,binarycut:318401] equal(multiply(sk_c7,sk_c8),sk_c6).
% 318467 [para:318394.1.1,318395.1.1.1,demod:318393] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 318476 [para:318439.1.1,318467.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),identity)).
% 318478 [para:318452.1.1,318467.1.2.2,demod:318436] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 318479 [para:318458.1.1,318467.1.2.2,demod:318443] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 318480 [para:318466.1.1,318467.1.2.2] equal(sk_c8,multiply(inverse(sk_c7),sk_c6)).
% 318482 [para:318478.1.2,318467.1.2.2,demod:318480] equal(sk_c7,sk_c8).
% 318483 [para:318482.1.2,318447.1.1.1] equal(multiply(sk_c7,sk_c4),identity).
% 318486 [para:318482.1.2,318479.1.2.1,demod:318466] equal(sk_c7,sk_c6).
% 318490 [para:318486.1.1,318466.1.1.1] equal(multiply(sk_c6,sk_c8),sk_c6).
% 318494 [para:318483.1.1,318467.1.2.2,demod:318476] equal(sk_c4,sk_c5).
% 318500 [para:318494.1.2,318436.1.1.1,demod:318443] equal(sk_c8,sk_c7).
% 318510 [para:318490.1.1,318467.1.2.2,demod:318394] equal(sk_c8,identity).
% 318511 [para:318510.1.1,318447.1.1.1,demod:318393] equal(sk_c4,identity).
% 318518 [para:318511.1.1,318443.1.1.1] equal(inverse(identity),sk_c8).
% 318529 [hyper:318396,318518,demod:318479,318393,cut:318500,cut:318392] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728,318315,50,29728,318315,30,29728,318315,40,29729,318355,0,29729,318391,50,29729,318391,30,29729,318391,40,29729,318431,0,29734,318528,50,29736,318528,30,29736,318528,40,29736,318568,0,29736)
%
%
% START OF PROOF
% 318529 [] equal(X,X).
% 318533 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 318551 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 318552 [?] ?
% 318556 [?] ?
% 318557 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 318582 [hyper:318533,318557,binarycut:318552] equal(inverse(sk_c4),sk_c8).
% 318584 [hyper:318533,318557,binarycut:318556] equal(inverse(sk_c1),sk_c8).
% 318603 [hyper:318533,318551,demod:318584,cut:318529] equal(multiply(sk_c4,sk_c7),sk_c8).
% 318605 [hyper:318533,318603,demod:318582,cut:318529] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(inverse(sk_c8),sk_c7).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 4
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 5
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 6
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 7
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 8
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 9
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 11
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728,318315,50,29728,318315,30,29728,318315,40,29729,318355,0,29729,318391,50,29729,318391,30,29729,318391,40,29729,318431,0,29734,318528,50,29736,318528,30,29736,318528,40,29736,318568,0,29736,318604,50,29736,318604,30,29736,318604,40,29736,318644,0,29736,318756,50,29736,318796,0,29741,318950,50,29744,318990,0,29744,319152,50,29748,319192,0,29752,319362,50,29758,319402,0,29758,319578,50,29767,319618,0,29767,319802,50,29782,319842,0,29787,320034,50,29816,320074,0,29816,320276,50,29878,320316,0,29878,320528,50,29994,320528,40,29994,320568,0,29994)
%
%
% START OF PROOF
% 320444 [?] ?
% 320530 [] equal(multiply(identity,X),X).
% 320531 [] equal(multiply(inverse(X),X),identity).
% 320532 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 320533 [] -equal(inverse(sk_c8),sk_c7).
% 320564 [?] ?
% 320565 [?] ?
% 320566 [?] ?
% 320567 [?] ?
% 320568 [?] ?
% 320582 [input:320565,cut:320533] equal(inverse(sk_c5),sk_c7).
% 320583 [para:320582.1.1,320531.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 320585 [input:320567,cut:320533] equal(inverse(sk_c4),sk_c8).
% 320586 [para:320585.1.1,320531.1.1.1] equal(multiply(sk_c8,sk_c4),identity).
% 320609 [input:320564,cut:320533] equal(multiply(sk_c5,sk_c6),sk_c7).
% 320610 [input:320566,cut:320533] equal(multiply(sk_c4,sk_c7),sk_c8).
% 320611 [input:320568,cut:320533] equal(multiply(sk_c7,sk_c8),sk_c6).
% 320628 [para:320531.1.1,320532.1.1.1,demod:320530] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 320631 [para:320583.1.1,320532.1.1.1,demod:320530] equal(X,multiply(sk_c7,multiply(sk_c5,X))).
% 320633 [para:320586.1.1,320532.1.1.1,demod:320530] equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 320676 [para:320609.1.1,320631.1.2.2] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 320681 [para:320610.1.1,320633.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 320713 [para:320611.1.1,320628.1.2.2] equal(sk_c8,multiply(inverse(sk_c7),sk_c6)).
% 320732 [para:320676.1.2,320628.1.2.2,demod:320713] equal(sk_c7,sk_c8).
% 320737 [para:320732.1.2,320533.1.1.1] -equal(inverse(sk_c7),sk_c7).
% 320747 [para:320732.1.2,320681.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c8)).
% 320769 [para:320747.1.2,320611.1.1] equal(sk_c7,sk_c6).
% 320786 [para:320769.1.1,320737.1.1.1,cut:320444] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% Split component 6 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(multiply(sk_c7,sk_c6),sk_c8).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 4
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 5
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 6
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 7
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 8
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 9
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 11
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728,318315,50,29728,318315,30,29728,318315,40,29729,318355,0,29729,318391,50,29729,318391,30,29729,318391,40,29729,318431,0,29734,318528,50,29736,318528,30,29736,318528,40,29736,318568,0,29736,318604,50,29736,318604,30,29736,318604,40,29736,318644,0,29736,318756,50,29736,318796,0,29741,318950,50,29744,318990,0,29744,319152,50,29748,319192,0,29752,319362,50,29758,319402,0,29758,319578,50,29767,319618,0,29767,319802,50,29782,319842,0,29787,320034,50,29816,320074,0,29816,320276,50,29878,320316,0,29878,320528,50,29994,320528,40,29994,320568,0,29994,320785,50,29995,320785,30,29995,320785,40,29995,320825,0,29995,320937,50,29996,320977,0,30000,321131,50,30003,321171,0,30003,321333,50,30007,321373,0,30007,321543,50,30012,321583,0,30017,321759,50,30026,321799,0,30026,321983,50,30041,322023,0,30046,322215,50,30075,322255,0,30075,322457,50,30137,322497,0,30137,322709,50,30253,322709,40,30253,322749,0,30253)
%
%
% START OF PROOF
% 322653 [?] ?
% 322711 [] equal(multiply(identity,X),X).
% 322712 [] equal(multiply(inverse(X),X),identity).
% 322713 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 322714 [] -equal(multiply(sk_c7,sk_c6),sk_c8).
% 322740 [?] ?
% 322741 [?] ?
% 322744 [?] ?
% 322795 [input:322741,cut:322714] equal(inverse(sk_c5),sk_c7).
% 322796 [para:322795.1.1,322712.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 322817 [input:322740,cut:322714] equal(multiply(sk_c5,sk_c6),sk_c7).
% 322819 [input:322744,cut:322714] equal(multiply(sk_c7,sk_c8),sk_c6).
% 322824 [para:322712.1.1,322713.1.1.1,demod:322711] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 322843 [para:322796.1.1,322713.1.1.1,demod:322711] equal(X,multiply(sk_c7,multiply(sk_c5,X))).
% 322875 [para:322817.1.1,322843.1.2.2] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 322949 [para:322819.1.1,322824.1.2.2] equal(sk_c8,multiply(inverse(sk_c7),sk_c6)).
% 322952 [para:322875.1.2,322824.1.2.2,demod:322949] equal(sk_c7,sk_c8).
% 322956 [para:322952.1.2,322714.1.2,cut:322653] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% Split component 7 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c6),sk_c8) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,Z),sk_c7) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% Split part used next: -equal(multiply(sk_c7,sk_c8),sk_c6).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 4
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 5
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 6
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 7
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 8
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 9
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 23
% clause depth limited to 11
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(40,40,1,85,0,1,1037,50,9,1082,0,9,2487,50,27,2532,0,27,4148,50,48,4193,0,48,5936,50,68,5981,0,68,7851,50,94,7896,0,94,9934,50,132,9979,0,132,12186,50,189,12231,0,189,14648,50,290,14693,0,290,17321,50,463,17366,0,463,20246,50,720,20291,0,720,23424,50,1194,23424,40,1194,23469,0,1194,34568,3,1495,35269,4,1645,35990,1,1795,35990,50,1795,35990,40,1795,36035,0,1795,36269,3,2100,36280,4,2263,36287,5,2396,36287,1,2396,36287,50,2396,36287,40,2396,36332,0,2396,55076,3,3902,56683,4,4647,58288,5,5397,58289,1,5397,58289,50,5398,58289,40,5398,58334,0,5398,70764,3,6149,72009,4,6524,73218,1,6899,73218,50,6899,73218,40,6899,73263,0,6899,85882,3,7650,86052,4,8025,86368,5,8400,86369,1,8400,86369,50,8400,86369,40,8400,86414,0,8400,156567,3,12302,157607,4,14251,158494,1,16201,158494,50,16203,158494,40,16203,158539,0,16203,208702,3,18754,209635,4,20029,210132,1,21304,210132,50,21306,210132,40,21306,210177,0,21306,248279,3,22808,249249,4,23557,250019,5,24307,250020,1,24307,250020,50,24309,250020,40,24309,250065,0,24313,263175,3,25066,264169,4,25439,265358,5,25814,265359,1,25814,265359,50,25814,265359,40,25814,265404,0,25814,294509,3,27016,295397,4,27615,296032,1,28215,296032,50,28226,296032,40,28226,296077,0,28226,316868,3,28977,317603,4,29352,318151,1,29727,318151,50,29728,318151,40,29728,318151,40,29728,318191,0,29728,318315,50,29728,318315,30,29728,318315,40,29729,318355,0,29729,318391,50,29729,318391,30,29729,318391,40,29729,318431,0,29734,318528,50,29736,318528,30,29736,318528,40,29736,318568,0,29736,318604,50,29736,318604,30,29736,318604,40,29736,318644,0,29736,318756,50,29736,318796,0,29741,318950,50,29744,318990,0,29744,319152,50,29748,319192,0,29752,319362,50,29758,319402,0,29758,319578,50,29767,319618,0,29767,319802,50,29782,319842,0,29787,320034,50,29816,320074,0,29816,320276,50,29878,320316,0,29878,320528,50,29994,320528,40,29994,320568,0,29994,320785,50,29995,320785,30,29995,320785,40,29995,320825,0,29995,320937,50,29996,320977,0,30000,321131,50,30003,321171,0,30003,321333,50,30007,321373,0,30007,321543,50,30012,321583,0,30017,321759,50,30026,321799,0,30026,321983,50,30041,322023,0,30046,322215,50,30075,322255,0,30075,322457,50,30137,322497,0,30137,322709,50,30253,322709,40,30253,322749,0,30253,322955,50,30254,322955,30,30254,322955,40,30254,322995,0,30254,323110,50,30255,323150,0,30260,323319,50,30263,323359,0,30263,323536,50,30267,323576,0,30267,323761,50,30272,323801,0,30277,323992,50,30286,324032,0,30286,324231,50,30303,324271,0,30307,324478,50,30337,324518,0,30337,324735,50,30400,324775,0,30400,325002,50,30518,325002,40,30518,325042,0,30518)
%
%
% START OF PROOF
% 324877 [?] ?
% 325005 [] equal(multiply(inverse(X),X),identity).
% 325007 [] -equal(multiply(sk_c7,sk_c8),sk_c6).
% 325042 [?] ?
% 325097 [input:325042,cut:325007] equal(inverse(sk_c8),sk_c7).
% 325098 [para:325097.1.1,325005.1.1.1] equal(multiply(sk_c7,sk_c8),identity).
% 325099 [para:325098.1.1,325007.1.1,cut:324877] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% Split attempt finished with SUCCESS.
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 38797
% derived clauses: 6565055
% kept clauses: 263720
% kept size sum: 991546
% kept mid-nuclei: 15305
% kept new demods: 5280
% forw unit-subs: 2988575
% forw double-subs: 3070157
% forw overdouble-subs: 179833
% backward subs: 11924
% fast unit cutoff: 17140
% full unit cutoff: 0
% dbl unit cutoff: 9788
% real runtime : 307.95
% process. runtime: 305.17
% specific non-discr-tree subsumption statistics:
% tried: 23631947
% length fails: 2739889
% strength fails: 7501444
% predlist fails: 918248
% aux str. fails: 3592101
% by-lit fails: 3591069
% full subs tried: 877287
% full subs fail: 802509
%
% ; 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/GRP383-1+eq_r.in")
%
%------------------------------------------------------------------------------