TSTP Solution File: GRP273-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP273-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 : art06.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 299.3s
% Output : Assurance 299.3s
% 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/GRP273-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 29)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 29)
% (binary-posweight-lex-big-order 30 #f 3 29)
% (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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% was split for some strategies as:
% -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X2),W) | -equal(inverse(X1),X2) | -equal(multiply(X1,W),X2).
% -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10).
% -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11).
% -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9).
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% -equal(multiply(sk_c11,sk_c9),sk_c10).
%
% Starting a split proof attempt with 6 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X2),W) | -equal(inverse(X1),X2) | -equal(multiply(X1,W),X2).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,71277,4,1499,71487,5,1502,71490,1,1502,71490,50,1502,71490,40,1502,71554,0,1502,80339,3,1806,81270,4,1953,82060,5,2103,82061,1,2103,82061,50,2103,82061,40,2103,82125,0,2103,83358,3,2418,83373,4,2554,83469,5,2704,83469,1,2704,83469,50,2704,83469,40,2704,83533,0,2704,110692,3,4206,111602,4,4955,112437,1,5705,112437,50,5706,112437,40,5706,112501,0,5706,130472,3,6459,131168,4,6832,131806,1,7207,131806,50,7207,131806,40,7207,131870,0,7207,148186,3,7963,149230,4,8333,150598,5,8708,150599,1,8708,150599,50,8708,150599,40,8708,150663,0,8708,200305,3,12612,201740,4,14559,202811,1,16509,202811,50,16510,202811,40,16510,202875,0,16510,247319,3,19061,248441,4,20336,249262,1,21611,249262,50,21612,249262,40,21612,249326,0,21612,282275,3,23113,283098,4,23863,283824,5,24613,283825,1,24613,283825,50,24614,283825,40,24614,283889,0,24614,300453,3,25369,301779,4,25740,303847,5,26115,303847,1,26115,303847,50,26115,303847,40,26115,303911,0,26115,331896,3,27316,332680,4,27916,333101,5,28516,333102,1,28516,333102,50,28517,333102,40,28517,333166,0,28517,352560,3,29268,352991,4,29643,353315,1,30018,353315,50,30018,353315,40,30018,353315,40,30018,353424,0,30018)
%
%
% START OF PROOF
% 353316 [] equal(X,X).
% 353317 [] equal(multiply(identity,X),X).
% 353318 [] equal(multiply(inverse(X),X),identity).
% 353319 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 353370 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,X),sk_c11) | -equal(multiply(Z,X),U) | -equal(inverse(Z),U) | -equal(inverse(U),X) | -equal(inverse(Y),X).
% 353371 [] -equal(multiply(X,Y),Z) | -equal(inverse(X),Z) | -equal(inverse(Z),Y) | $spltprd1($spltcnst97,Y).
% 353372 [] -equal(multiply(X,Y),sk_c11) | -equal(inverse(X),Y) | $spltprd1($spltcnst98,Y).
% 353373 [] -equal(multiply(X,sk_c10),sk_c11) | $spltprd1($spltcnst99,X).
% 353374 [] -$spltprd1($spltcnst98,X) | -$spltprd1($spltcnst97,X) | -$spltprd1($spltcnst99,X).
% 353375 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c9).
% 353376 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c6),sk_c8).
% 353377 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c7),sk_c6).
% 353378 [] equal(multiply(sk_c8,sk_c10),sk_c11) | equal(inverse(sk_c2),sk_c9).
% 353379 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c5),sk_c8).
% 353380 [?] ?
% 353385 [] equal(multiply(sk_c2,sk_c9),sk_c11) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 353386 [] equal(multiply(sk_c2,sk_c9),sk_c11) | equal(inverse(sk_c6),sk_c8).
% 353387 [] equal(multiply(sk_c2,sk_c9),sk_c11) | equal(inverse(sk_c7),sk_c6).
% 353388 [] equal(multiply(sk_c2,sk_c9),sk_c11) | equal(multiply(sk_c8,sk_c10),sk_c11).
% 353389 [] equal(multiply(sk_c2,sk_c9),sk_c11) | equal(inverse(sk_c5),sk_c8).
% 353390 [] equal(multiply(sk_c2,sk_c9),sk_c11) | equal(multiply(sk_c5,sk_c8),sk_c11).
% 353395 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 353396 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c6),sk_c8).
% 353397 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c7),sk_c6).
% 353398 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c8,sk_c10),sk_c11).
% 353399 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c5),sk_c8).
% 353400 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c5,sk_c8),sk_c11).
% 353405 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c1),sk_c11).
% 353406 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c6),sk_c8).
% 353407 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c7),sk_c6).
% 353408 [] equal(multiply(sk_c8,sk_c10),sk_c11) | equal(inverse(sk_c1),sk_c11).
% 353409 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c5),sk_c8).
% 353410 [?] ?
% 353415 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 353416 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c6),sk_c8).
% 353417 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c7),sk_c6).
% 353418 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c8,sk_c10),sk_c11).
% 353419 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c5),sk_c8).
% 353420 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c5,sk_c8),sk_c11).
% 353515 [hyper:353372,353379,binarycut:353380] equal(inverse(sk_c2),sk_c9) | $spltprd1($spltcnst98,sk_c8).
% 353630 [hyper:353372,353409,binarycut:353410] equal(inverse(sk_c1),sk_c11) | $spltprd1($spltcnst98,sk_c8).
% 353708 [hyper:353371,353375,353376,353377] equal(inverse(sk_c2),sk_c9) | $spltprd1($spltcnst97,sk_c8).
% 353756 [hyper:353373,353378] equal(inverse(sk_c2),sk_c9) | $spltprd1($spltcnst99,sk_c8).
% 353770 [hyper:353374,353756,353708,353515] equal(inverse(sk_c2),sk_c9).
% 353777 [para:353770.1.1,353318.1.1.1] equal(multiply(sk_c9,sk_c2),identity).
% 353967 [hyper:353371,353405,353406,353407] equal(inverse(sk_c1),sk_c11) | $spltprd1($spltcnst97,sk_c8).
% 353994 [hyper:353373,353408] equal(inverse(sk_c1),sk_c11) | $spltprd1($spltcnst99,sk_c8).
% 354005 [hyper:353374,353994,353967,353630] equal(inverse(sk_c1),sk_c11).
% 354020 [para:354005.1.1,353318.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 354346 [hyper:353370,353390,353388,353389,353386,353385,353387] equal(multiply(sk_c2,sk_c9),sk_c11).
% 354450 [hyper:353370,353400,353398,353399,353396,353395,353397] equal(multiply(sk_c11,sk_c9),sk_c10).
% 354524 [hyper:353370,353420,353418,353419,353416,353415,353417] equal(multiply(sk_c1,sk_c11),sk_c10).
% 354532 [para:353318.1.1,353319.1.1.1,demod:353317] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 354533 [para:353777.1.1,353319.1.1.1,demod:353317] equal(X,multiply(sk_c9,multiply(sk_c2,X))).
% 354534 [para:354020.1.1,353319.1.1.1,demod:353317] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 354572 [para:354524.1.1,354534.1.2.2] equal(sk_c11,multiply(sk_c11,sk_c10)).
% 354583 [para:353777.1.1,354532.1.2.2] equal(sk_c2,multiply(inverse(sk_c9),identity)).
% 354593 [para:354450.1.1,354532.1.2.2] equal(sk_c9,multiply(inverse(sk_c11),sk_c10)).
% 354594 [para:354533.1.2,354532.1.2.2] equal(multiply(sk_c2,X),multiply(inverse(sk_c9),X)).
% 354615 [para:354594.1.2,353318.1.1,demod:354346] equal(sk_c11,identity).
% 354619 [para:354594.1.2,354583.1.2] equal(sk_c2,multiply(sk_c2,identity)).
% 354620 [para:354615.1.1,354020.1.1.1,demod:353317] equal(sk_c1,identity).
% 354621 [para:354615.1.1,354450.1.1.1,demod:353317] equal(sk_c9,sk_c10).
% 354624 [para:354615.1.1,354534.1.2.1,demod:353317] equal(X,multiply(sk_c1,X)).
% 354625 [para:354615.1.1,354572.1.2.1,demod:353317] equal(sk_c11,sk_c10).
% 354626 [para:354620.1.1,354005.1.1.1] equal(inverse(identity),sk_c11).
% 354628 [para:354621.1.1,354346.1.1.2] equal(multiply(sk_c2,sk_c10),sk_c11).
% 354633 [para:354621.1.1,354594.1.2.1.1] equal(multiply(sk_c2,X),multiply(inverse(sk_c10),X)).
% 354639 [para:354625.1.1,354593.1.2.1.1,demod:354628,354633] equal(sk_c9,sk_c11).
% 354652 [para:354639.1.2,354615.1.1] equal(sk_c9,identity).
% 354657 [para:354652.1.1,354346.1.1.2,demod:354619] equal(sk_c2,sk_c11).
% 354662 [para:354657.1.2,354524.1.1.2,demod:354624] equal(sk_c2,sk_c10).
% 354666 [para:354662.1.1,353770.1.1.1] equal(inverse(sk_c10),sk_c9).
% 354686 [hyper:353370,354626,354524,demod:354572,353317,cut:353316,cut:353316,demod:354005,354666,cut:354639,cut:354625] 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 29
% 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(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10).
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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(55,40,1,119,0,1,71277,4,1499,71487,5,1502,71490,1,1502,71490,50,1502,71490,40,1502,71554,0,1502,80339,3,1806,81270,4,1953,82060,5,2103,82061,1,2103,82061,50,2103,82061,40,2103,82125,0,2103,83358,3,2418,83373,4,2554,83469,5,2704,83469,1,2704,83469,50,2704,83469,40,2704,83533,0,2704,110692,3,4206,111602,4,4955,112437,1,5705,112437,50,5706,112437,40,5706,112501,0,5706,130472,3,6459,131168,4,6832,131806,1,7207,131806,50,7207,131806,40,7207,131870,0,7207,148186,3,7963,149230,4,8333,150598,5,8708,150599,1,8708,150599,50,8708,150599,40,8708,150663,0,8708,200305,3,12612,201740,4,14559,202811,1,16509,202811,50,16510,202811,40,16510,202875,0,16510,247319,3,19061,248441,4,20336,249262,1,21611,249262,50,21612,249262,40,21612,249326,0,21612,282275,3,23113,283098,4,23863,283824,5,24613,283825,1,24613,283825,50,24614,283825,40,24614,283889,0,24614,300453,3,25369,301779,4,25740,303847,5,26115,303847,1,26115,303847,50,26115,303847,40,26115,303911,0,26115,331896,3,27316,332680,4,27916,333101,5,28516,333102,1,28516,333102,50,28517,333102,40,28517,333166,0,28517,352560,3,29268,352991,4,29643,353315,1,30018,353315,50,30018,353315,40,30018,353315,40,30018,353424,0,30018,354685,50,30022,354685,30,30022,354685,40,30022,354740,0,30022,354863,50,30023,354918,0,30028,355082,50,30030,355137,0,30030,355309,50,30033,355364,0,30038,355544,50,30043,355599,0,30043,355785,50,30051,355840,0,30056,356034,50,30070,356089,0,30070,356291,50,30098,356346,0,30103,356558,50,30159,356613,0,30159,356835,50,30272,356835,40,30272,356890,0,30272)
%
%
% START OF PROOF
% 356723 [?] ?
% 356724 [?] ?
% 356837 [] equal(multiply(identity,X),X).
% 356838 [] equal(multiply(inverse(X),X),identity).
% 356839 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 356840 [] -equal(multiply(X,sk_c10),sk_c9) | -equal(inverse(X),sk_c10).
% 357020 [para:356838.1.1,356839.1.1.1,demod:356837] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 357100 [para:356838.1.1,357020.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 357223 [para:357020.1.2,357020.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 357343 [para:357223.1.2,357100.1.2] equal(X,multiply(X,identity)).
% 357344 [para:357343.1.2,356838.1.1] equal(inverse(identity),identity).
% 357352 [para:357344.1.1,356840.2.1,demod:356837,cut:356723,cut:356724] 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 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11).
% 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,71277,4,1499,71487,5,1502,71490,1,1502,71490,50,1502,71490,40,1502,71554,0,1502,80339,3,1806,81270,4,1953,82060,5,2103,82061,1,2103,82061,50,2103,82061,40,2103,82125,0,2103,83358,3,2418,83373,4,2554,83469,5,2704,83469,1,2704,83469,50,2704,83469,40,2704,83533,0,2704,110692,3,4206,111602,4,4955,112437,1,5705,112437,50,5706,112437,40,5706,112501,0,5706,130472,3,6459,131168,4,6832,131806,1,7207,131806,50,7207,131806,40,7207,131870,0,7207,148186,3,7963,149230,4,8333,150598,5,8708,150599,1,8708,150599,50,8708,150599,40,8708,150663,0,8708,200305,3,12612,201740,4,14559,202811,1,16509,202811,50,16510,202811,40,16510,202875,0,16510,247319,3,19061,248441,4,20336,249262,1,21611,249262,50,21612,249262,40,21612,249326,0,21612,282275,3,23113,283098,4,23863,283824,5,24613,283825,1,24613,283825,50,24614,283825,40,24614,283889,0,24614,300453,3,25369,301779,4,25740,303847,5,26115,303847,1,26115,303847,50,26115,303847,40,26115,303911,0,26115,331896,3,27316,332680,4,27916,333101,5,28516,333102,1,28516,333102,50,28517,333102,40,28517,333166,0,28517,352560,3,29268,352991,4,29643,353315,1,30018,353315,50,30018,353315,40,30018,353315,40,30018,353424,0,30018,354685,50,30022,354685,30,30022,354685,40,30022,354740,0,30022,354863,50,30023,354918,0,30028,355082,50,30030,355137,0,30030,355309,50,30033,355364,0,30038,355544,50,30043,355599,0,30043,355785,50,30051,355840,0,30056,356034,50,30070,356089,0,30070,356291,50,30098,356346,0,30103,356558,50,30159,356613,0,30159,356835,50,30272,356835,40,30272,356890,0,30272,357351,50,30273,357351,30,30273,357351,40,30273,357406,0,30273)
%
%
% START OF PROOF
% 357352 [] equal(X,X).
% 357356 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 357395 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c3),sk_c11).
% 357396 [?] ?
% 357405 [?] ?
% 357406 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c3,sk_c11),sk_c10).
% 357438 [hyper:357356,357395,binarycut:357405] equal(inverse(sk_c3),sk_c11).
% 357440 [hyper:357356,357395,binarycut:357396] equal(inverse(sk_c1),sk_c11).
% 357464 [hyper:357356,357406,demod:357440,cut:357352] equal(multiply(sk_c3,sk_c11),sk_c10).
% 357466 [hyper:357356,357464,demod:357438,cut:357352] 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 29
% 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(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9).
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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(55,40,1,119,0,1,71277,4,1499,71487,5,1502,71490,1,1502,71490,50,1502,71490,40,1502,71554,0,1502,80339,3,1806,81270,4,1953,82060,5,2103,82061,1,2103,82061,50,2103,82061,40,2103,82125,0,2103,83358,3,2418,83373,4,2554,83469,5,2704,83469,1,2704,83469,50,2704,83469,40,2704,83533,0,2704,110692,3,4206,111602,4,4955,112437,1,5705,112437,50,5706,112437,40,5706,112501,0,5706,130472,3,6459,131168,4,6832,131806,1,7207,131806,50,7207,131806,40,7207,131870,0,7207,148186,3,7963,149230,4,8333,150598,5,8708,150599,1,8708,150599,50,8708,150599,40,8708,150663,0,8708,200305,3,12612,201740,4,14559,202811,1,16509,202811,50,16510,202811,40,16510,202875,0,16510,247319,3,19061,248441,4,20336,249262,1,21611,249262,50,21612,249262,40,21612,249326,0,21612,282275,3,23113,283098,4,23863,283824,5,24613,283825,1,24613,283825,50,24614,283825,40,24614,283889,0,24614,300453,3,25369,301779,4,25740,303847,5,26115,303847,1,26115,303847,50,26115,303847,40,26115,303911,0,26115,331896,3,27316,332680,4,27916,333101,5,28516,333102,1,28516,333102,50,28517,333102,40,28517,333166,0,28517,352560,3,29268,352991,4,29643,353315,1,30018,353315,50,30018,353315,40,30018,353315,40,30018,353424,0,30018,354685,50,30022,354685,30,30022,354685,40,30022,354740,0,30022,354863,50,30023,354918,0,30028,355082,50,30030,355137,0,30030,355309,50,30033,355364,0,30038,355544,50,30043,355599,0,30043,355785,50,30051,355840,0,30056,356034,50,30070,356089,0,30070,356291,50,30098,356346,0,30103,356558,50,30159,356613,0,30159,356835,50,30272,356835,40,30272,356890,0,30272,357351,50,30273,357351,30,30273,357351,40,30273,357406,0,30273,357465,50,30273,357465,30,30273,357465,40,30273,357520,0,30277,357709,50,30279,357764,0,30279,358005,50,30284,358060,0,30288,358309,50,30295,358364,0,30295,358626,50,30304,358681,0,30309,358950,50,30322,359005,0,30322,359282,50,30344,359337,0,30349,359623,50,30388,359678,0,30388,359974,50,30466,360029,0,30466,360336,50,30608,360336,40,30608,360391,0,30608)
%
%
% START OF PROOF
% 360156 [?] ?
% 360184 [?] ?
% 360338 [] equal(multiply(identity,X),X).
% 360339 [] equal(multiply(inverse(X),X),identity).
% 360340 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 360341 [] -equal(multiply(X,sk_c9),sk_c11) | -equal(inverse(X),sk_c9).
% 360521 [para:360339.1.1,360340.1.1.1,demod:360338] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 360601 [para:360339.1.1,360521.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 360724 [para:360521.1.2,360521.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 360844 [para:360724.1.2,360601.1.2] equal(X,multiply(X,identity)).
% 360845 [para:360844.1.2,360339.1.1] equal(inverse(identity),identity).
% 360853 [para:360845.1.1,360341.2.1,demod:360338,cut:360184,cut:360156] 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 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,71277,4,1499,71487,5,1502,71490,1,1502,71490,50,1502,71490,40,1502,71554,0,1502,80339,3,1806,81270,4,1953,82060,5,2103,82061,1,2103,82061,50,2103,82061,40,2103,82125,0,2103,83358,3,2418,83373,4,2554,83469,5,2704,83469,1,2704,83469,50,2704,83469,40,2704,83533,0,2704,110692,3,4206,111602,4,4955,112437,1,5705,112437,50,5706,112437,40,5706,112501,0,5706,130472,3,6459,131168,4,6832,131806,1,7207,131806,50,7207,131806,40,7207,131870,0,7207,148186,3,7963,149230,4,8333,150598,5,8708,150599,1,8708,150599,50,8708,150599,40,8708,150663,0,8708,200305,3,12612,201740,4,14559,202811,1,16509,202811,50,16510,202811,40,16510,202875,0,16510,247319,3,19061,248441,4,20336,249262,1,21611,249262,50,21612,249262,40,21612,249326,0,21612,282275,3,23113,283098,4,23863,283824,5,24613,283825,1,24613,283825,50,24614,283825,40,24614,283889,0,24614,300453,3,25369,301779,4,25740,303847,5,26115,303847,1,26115,303847,50,26115,303847,40,26115,303911,0,26115,331896,3,27316,332680,4,27916,333101,5,28516,333102,1,28516,333102,50,28517,333102,40,28517,333166,0,28517,352560,3,29268,352991,4,29643,353315,1,30018,353315,50,30018,353315,40,30018,353315,40,30018,353424,0,30018,354685,50,30022,354685,30,30022,354685,40,30022,354740,0,30022,354863,50,30023,354918,0,30028,355082,50,30030,355137,0,30030,355309,50,30033,355364,0,30038,355544,50,30043,355599,0,30043,355785,50,30051,355840,0,30056,356034,50,30070,356089,0,30070,356291,50,30098,356346,0,30103,356558,50,30159,356613,0,30159,356835,50,30272,356835,40,30272,356890,0,30272,357351,50,30273,357351,30,30273,357351,40,30273,357406,0,30273,357465,50,30273,357465,30,30273,357465,40,30273,357520,0,30277,357709,50,30279,357764,0,30279,358005,50,30284,358060,0,30288,358309,50,30295,358364,0,30295,358626,50,30304,358681,0,30309,358950,50,30322,359005,0,30322,359282,50,30344,359337,0,30349,359623,50,30388,359678,0,30388,359974,50,30466,360029,0,30466,360336,50,30608,360336,40,30608,360391,0,30608,360852,50,30614,360852,30,30614,360852,40,30614,360907,0,30614)
%
%
% START OF PROOF
% 360853 [] equal(X,X).
% 360857 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 360896 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c3),sk_c11).
% 360897 [?] ?
% 360906 [?] ?
% 360907 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c3,sk_c11),sk_c10).
% 360939 [hyper:360857,360896,binarycut:360906] equal(inverse(sk_c3),sk_c11).
% 360941 [hyper:360857,360896,binarycut:360897] equal(inverse(sk_c1),sk_c11).
% 360965 [hyper:360857,360907,demod:360941,cut:360853] equal(multiply(sk_c3,sk_c11),sk_c10).
% 360967 [hyper:360857,360965,demod:360939,cut:360853] 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 6 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c9),sk_c11) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(sk_c11,sk_c9),sk_c10).
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% clause depth limited to 10
% 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(55,40,1,119,0,1,71277,4,1499,71487,5,1502,71490,1,1502,71490,50,1502,71490,40,1502,71554,0,1502,80339,3,1806,81270,4,1953,82060,5,2103,82061,1,2103,82061,50,2103,82061,40,2103,82125,0,2103,83358,3,2418,83373,4,2554,83469,5,2704,83469,1,2704,83469,50,2704,83469,40,2704,83533,0,2704,110692,3,4206,111602,4,4955,112437,1,5705,112437,50,5706,112437,40,5706,112501,0,5706,130472,3,6459,131168,4,6832,131806,1,7207,131806,50,7207,131806,40,7207,131870,0,7207,148186,3,7963,149230,4,8333,150598,5,8708,150599,1,8708,150599,50,8708,150599,40,8708,150663,0,8708,200305,3,12612,201740,4,14559,202811,1,16509,202811,50,16510,202811,40,16510,202875,0,16510,247319,3,19061,248441,4,20336,249262,1,21611,249262,50,21612,249262,40,21612,249326,0,21612,282275,3,23113,283098,4,23863,283824,5,24613,283825,1,24613,283825,50,24614,283825,40,24614,283889,0,24614,300453,3,25369,301779,4,25740,303847,5,26115,303847,1,26115,303847,50,26115,303847,40,26115,303911,0,26115,331896,3,27316,332680,4,27916,333101,5,28516,333102,1,28516,333102,50,28517,333102,40,28517,333166,0,28517,352560,3,29268,352991,4,29643,353315,1,30018,353315,50,30018,353315,40,30018,353315,40,30018,353424,0,30018,354685,50,30022,354685,30,30022,354685,40,30022,354740,0,30022,354863,50,30023,354918,0,30028,355082,50,30030,355137,0,30030,355309,50,30033,355364,0,30038,355544,50,30043,355599,0,30043,355785,50,30051,355840,0,30056,356034,50,30070,356089,0,30070,356291,50,30098,356346,0,30103,356558,50,30159,356613,0,30159,356835,50,30272,356835,40,30272,356890,0,30272,357351,50,30273,357351,30,30273,357351,40,30273,357406,0,30273,357465,50,30273,357465,30,30273,357465,40,30273,357520,0,30277,357709,50,30279,357764,0,30279,358005,50,30284,358060,0,30288,358309,50,30295,358364,0,30295,358626,50,30304,358681,0,30309,358950,50,30322,359005,0,30322,359282,50,30344,359337,0,30349,359623,50,30388,359678,0,30388,359974,50,30466,360029,0,30466,360336,50,30608,360336,40,30608,360391,0,30608,360852,50,30614,360852,30,30614,360852,40,30614,360907,0,30614,360966,50,30614,360966,30,30614,360966,40,30614,361021,0,30615,361211,50,30617,361266,0,30621,361531,50,30626,361586,0,30626,361861,50,30633,361916,0,30638,362211,50,30649,362266,0,30649,362567,50,30665,362622,0,30669,362931,50,30694,362986,0,30694,363304,50,30741,363359,0,30741,363687,50,30819,363687,40,30819,363742,0,30819)
%
%
% START OF PROOF
% 363468 [?] ?
% 363689 [] equal(multiply(identity,X),X).
% 363690 [] equal(multiply(inverse(X),X),identity).
% 363691 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 363692 [] -equal(multiply(sk_c11,sk_c9),sk_c10).
% 363714 [?] ?
% 363715 [?] ?
% 363717 [?] ?
% 363718 [?] ?
% 363794 [input:363714,cut:363692] equal(inverse(sk_c6),sk_c8).
% 363795 [para:363794.1.1,363690.1.1.1] equal(multiply(sk_c8,sk_c6),identity).
% 363796 [input:363715,cut:363692] equal(inverse(sk_c7),sk_c6).
% 363797 [para:363796.1.1,363690.1.1.1] equal(multiply(sk_c6,sk_c7),identity).
% 363799 [input:363717,cut:363692] equal(inverse(sk_c5),sk_c8).
% 363800 [para:363799.1.1,363690.1.1.1] equal(multiply(sk_c8,sk_c5),identity).
% 363829 [input:363718,cut:363692] equal(multiply(sk_c5,sk_c8),sk_c11).
% 363856 [para:363795.1.1,363691.1.1.1,demod:363689] equal(X,multiply(sk_c8,multiply(sk_c6,X))).
% 363857 [para:363797.1.1,363691.1.1.1,demod:363689] equal(X,multiply(sk_c6,multiply(sk_c7,X))).
% 363885 [para:363829.1.1,363691.1.1.1] equal(multiply(sk_c11,X),multiply(sk_c5,multiply(sk_c8,X))).
% 363899 [para:363797.1.1,363856.1.2.2] equal(sk_c7,multiply(sk_c8,identity)).
% 363900 [para:363899.1.2,363691.1.1.1,demod:363689] equal(multiply(sk_c7,X),multiply(sk_c8,X)).
% 363928 [para:363900.1.1,363857.1.2.2] equal(X,multiply(sk_c6,multiply(sk_c8,X))).
% 363930 [para:363795.1.1,363928.1.2.2] equal(sk_c6,multiply(sk_c6,identity)).
% 363932 [para:363800.1.1,363928.1.2.2,demod:363930] equal(sk_c5,sk_c6).
% 363940 [para:363932.1.2,363857.1.2.1,demod:363885,363900] equal(X,multiply(sk_c11,X)).
% 363943 [para:363940.1.2,363692.1.1,cut:363468] 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: 38340
% derived clauses: 4445261
% kept clauses: 240509
% kept size sum: 330388
% kept mid-nuclei: 61836
% kept new demods: 6013
% forw unit-subs: 1473242
% forw double-subs: 2417438
% forw overdouble-subs: 192454
% backward subs: 18058
% fast unit cutoff: 31549
% full unit cutoff: 0
% dbl unit cutoff: 24117
% real runtime : 309.23
% process. runtime: 308.19
% specific non-discr-tree subsumption statistics:
% tried: 24355694
% length fails: 3075176
% strength fails: 8543981
% predlist fails: 1636614
% aux str. fails: 2165122
% by-lit fails: 3280156
% full subs tried: 2431846
% full subs fail: 2308546
%
% ; 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/GRP273-1+eq_r.in")
%
%------------------------------------------------------------------------------