TSTP Solution File: GRP279-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP279-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 299.6s
% Output : Assurance 299.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/GRP279-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 21)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 21)
% (binary-posweight-lex-big-order 30 #f 3 21)
% (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_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8).
% -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% -equal(multiply(sk_c8,sk_c7),sk_c6).
% -equal(multiply(sk_c7,sk_c8),sk_c6).
%
% 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(sk_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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(35,40,0,75,0,0,787,50,5,827,0,6,1771,50,18,1811,0,18,2761,50,31,2801,0,31,3837,50,43,3877,0,43,4980,50,59,5020,0,60,6231,50,85,6271,0,85,7571,50,128,7611,0,128,9041,50,208,9081,0,208,10621,50,362,10661,0,362,12353,50,598,12393,0,598,14217,50,1018,14217,40,1018,14257,0,1018,23866,3,1319,24625,4,1469,25372,5,1619,25373,1,1619,25373,50,1619,25373,40,1619,25413,0,1619,25732,3,1932,25741,4,2076,25761,5,2220,25761,1,2220,25761,50,2220,25761,40,2220,25801,0,2220,45018,3,3726,46605,4,4471,48148,5,5221,48149,1,5221,48149,50,5221,48149,40,5221,48189,0,5222,61215,3,5974,62372,4,6348,63548,1,6723,63548,50,6723,63548,40,6723,63588,0,6723,73762,3,7491,75046,4,7849,76305,1,8225,76305,50,8225,76305,40,8225,76345,0,8225,134162,3,12126,135457,4,14076,136678,5,16026,136679,1,16026,136679,50,16028,136679,40,16028,136719,0,16028,188276,3,18580,189266,4,19854,190119,1,21129,190119,50,21131,190119,40,21131,190159,0,21131,229841,3,22647,230522,4,23382,231365,5,24132,231366,1,24132,231366,50,24134,231366,40,24134,231406,0,24134,240625,3,24885,241515,4,25263,241792,5,25635,241792,1,25635,241792,50,25635,241792,40,25635,241832,0,25635,268021,3,26836,268932,4,27436,269777,5,28036,269778,1,28036,269778,50,28037,269778,40,28037,269818,0,28037,287119,3,28788,287965,4,29163,288782,5,29538,288783,1,29538,288783,50,29538,288783,40,29538,288783,40,29538,288818,0,29538,288947,50,29539,288982,0,29539)
%
%
% START OF PROOF
% 288914 [?] ?
% 288949 [] equal(multiply(identity,X),X).
% 288950 [] equal(multiply(inverse(X),X),identity).
% 288951 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 288952 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 288968 [?] ?
% 288969 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c7).
% 288973 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 288974 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(inverse(sk_c5),sk_c7).
% 288978 [] equal(multiply(sk_c8,sk_c7),sk_c6) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 288979 [] equal(multiply(sk_c8,sk_c7),sk_c6) | equal(inverse(sk_c5),sk_c7).
% 288990 [hyper:288952,288969,binarycut:288968] equal(inverse(sk_c1),sk_c8).
% 288991 [para:288990.1.1,288950.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 289015 [hyper:288952,288973,288974] equal(multiply(sk_c1,sk_c8),sk_c7).
% 289018 [hyper:288952,288978,288979] equal(multiply(sk_c8,sk_c7),sk_c6).
% 289021 [para:288991.1.1,288951.1.1.1,demod:288949] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 289028 [para:289015.1.1,289021.1.2.2,demod:289018] equal(sk_c8,sk_c6).
% 289030 [para:289028.1.1,289015.1.1.2] equal(multiply(sk_c1,sk_c6),sk_c7).
% 289045 [hyper:288952,289030,demod:288990,cut:288914] 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 21
% clause depth limited to 4
% seconds given: 4
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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 21
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,0,75,0,0,787,50,5,827,0,6,1771,50,18,1811,0,18,2761,50,31,2801,0,31,3837,50,43,3877,0,43,4980,50,59,5020,0,60,6231,50,85,6271,0,85,7571,50,128,7611,0,128,9041,50,208,9081,0,208,10621,50,362,10661,0,362,12353,50,598,12393,0,598,14217,50,1018,14217,40,1018,14257,0,1018,23866,3,1319,24625,4,1469,25372,5,1619,25373,1,1619,25373,50,1619,25373,40,1619,25413,0,1619,25732,3,1932,25741,4,2076,25761,5,2220,25761,1,2220,25761,50,2220,25761,40,2220,25801,0,2220,45018,3,3726,46605,4,4471,48148,5,5221,48149,1,5221,48149,50,5221,48149,40,5221,48189,0,5222,61215,3,5974,62372,4,6348,63548,1,6723,63548,50,6723,63548,40,6723,63588,0,6723,73762,3,7491,75046,4,7849,76305,1,8225,76305,50,8225,76305,40,8225,76345,0,8225,134162,3,12126,135457,4,14076,136678,5,16026,136679,1,16026,136679,50,16028,136679,40,16028,136719,0,16028,188276,3,18580,189266,4,19854,190119,1,21129,190119,50,21131,190119,40,21131,190159,0,21131,229841,3,22647,230522,4,23382,231365,5,24132,231366,1,24132,231366,50,24134,231366,40,24134,231406,0,24134,240625,3,24885,241515,4,25263,241792,5,25635,241792,1,25635,241792,50,25635,241792,40,25635,241832,0,25635,268021,3,26836,268932,4,27436,269777,5,28036,269778,1,28036,269778,50,28037,269778,40,28037,269818,0,28037,287119,3,28788,287965,4,29163,288782,5,29538,288783,1,29538,288783,50,29538,288783,40,29538,288783,40,29538,288818,0,29538,288947,50,29539,288982,0,29539,289044,50,29539,289044,30,29539,289044,40,29539,289079,0,29544)
%
%
% START OF PROOF
% 289046 [] equal(multiply(identity,X),X).
% 289047 [] equal(multiply(inverse(X),X),identity).
% 289048 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 289049 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 289052 [] equal(multiply(sk_c3,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 289053 [] equal(multiply(sk_c3,sk_c7),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 289057 [?] ?
% 289058 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c4),sk_c8).
% 289062 [] equal(multiply(sk_c2,sk_c3),sk_c8) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 289063 [] equal(multiply(sk_c2,sk_c3),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 289067 [?] ?
% 289068 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 289072 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 289073 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(inverse(sk_c4),sk_c8).
% 289077 [] equal(multiply(sk_c8,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 289078 [] equal(multiply(sk_c8,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c8).
% 289083 [hyper:289049,289058,binarycut:289057] equal(inverse(sk_c2),sk_c3).
% 289085 [para:289083.1.1,289047.1.1.1] equal(multiply(sk_c3,sk_c2),identity).
% 289092 [hyper:289049,289068,binarycut:289067] equal(inverse(sk_c1),sk_c8).
% 289095 [para:289092.1.1,289047.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 289115 [hyper:289049,289052,289053] equal(multiply(sk_c3,sk_c7),sk_c8).
% 289130 [hyper:289049,289062,289063] equal(multiply(sk_c2,sk_c3),sk_c8).
% 289134 [hyper:289049,289072,289073] equal(multiply(sk_c1,sk_c8),sk_c7).
% 289138 [hyper:289049,289077,289078] equal(multiply(sk_c8,sk_c7),sk_c6).
% 289139 [para:289047.1.1,289048.1.1.1,demod:289046] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 289140 [para:289085.1.1,289048.1.1.1,demod:289046] equal(X,multiply(sk_c3,multiply(sk_c2,X))).
% 289141 [para:289095.1.1,289048.1.1.1,demod:289046] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 289142 [para:289115.1.1,289048.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c3,multiply(sk_c7,X))).
% 289143 [para:289130.1.1,289048.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c2,multiply(sk_c3,X))).
% 289146 [para:289130.1.1,289140.1.2.2] equal(sk_c3,multiply(sk_c3,sk_c8)).
% 289148 [para:289134.1.1,289141.1.2.2,demod:289138] equal(sk_c8,sk_c6).
% 289149 [para:289148.1.1,289095.1.1.1] equal(multiply(sk_c6,sk_c1),identity).
% 289151 [para:289148.1.1,289138.1.1.1] equal(multiply(sk_c6,sk_c7),sk_c6).
% 289164 [para:289151.1.1,289139.1.2.2,demod:289047] equal(sk_c7,identity).
% 289171 [para:289164.1.1,289142.1.2.2.1,demod:289046] equal(multiply(sk_c8,X),multiply(sk_c3,X)).
% 289176 [para:289140.1.2,289143.1.2.2,demod:289140,289171] equal(X,multiply(sk_c2,X)).
% 289177 [para:289146.1.2,289143.1.2.2,demod:289130,289146,289171] equal(sk_c3,sk_c8).
% 289180 [para:289177.1.2,289148.1.1] equal(sk_c3,sk_c6).
% 289183 [para:289180.1.1,289140.1.2.1,demod:289176] equal(X,multiply(sk_c6,X)).
% 289185 [para:289183.1.2,289149.1.1] equal(sk_c1,identity).
% 289194 [para:289185.1.1,289092.1.1.1] equal(inverse(identity),sk_c8).
% 289196 [para:289185.1.1,289134.1.1.1,demod:289046] equal(sk_c8,sk_c7).
% 289199 [para:289196.1.1,289177.1.2] equal(sk_c3,sk_c7).
% 289200 [para:289199.1.2,289164.1.1] equal(sk_c3,identity).
% 289203 [para:289200.1.1,289115.1.1.1,demod:289046] equal(sk_c7,sk_c8).
% 289208 [hyper:289049,289194,demod:289046,cut:289203] 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 21
% 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(multiply(sk_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,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 21
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,0,75,0,0,787,50,5,827,0,6,1771,50,18,1811,0,18,2761,50,31,2801,0,31,3837,50,43,3877,0,43,4980,50,59,5020,0,60,6231,50,85,6271,0,85,7571,50,128,7611,0,128,9041,50,208,9081,0,208,10621,50,362,10661,0,362,12353,50,598,12393,0,598,14217,50,1018,14217,40,1018,14257,0,1018,23866,3,1319,24625,4,1469,25372,5,1619,25373,1,1619,25373,50,1619,25373,40,1619,25413,0,1619,25732,3,1932,25741,4,2076,25761,5,2220,25761,1,2220,25761,50,2220,25761,40,2220,25801,0,2220,45018,3,3726,46605,4,4471,48148,5,5221,48149,1,5221,48149,50,5221,48149,40,5221,48189,0,5222,61215,3,5974,62372,4,6348,63548,1,6723,63548,50,6723,63548,40,6723,63588,0,6723,73762,3,7491,75046,4,7849,76305,1,8225,76305,50,8225,76305,40,8225,76345,0,8225,134162,3,12126,135457,4,14076,136678,5,16026,136679,1,16026,136679,50,16028,136679,40,16028,136719,0,16028,188276,3,18580,189266,4,19854,190119,1,21129,190119,50,21131,190119,40,21131,190159,0,21131,229841,3,22647,230522,4,23382,231365,5,24132,231366,1,24132,231366,50,24134,231366,40,24134,231406,0,24134,240625,3,24885,241515,4,25263,241792,5,25635,241792,1,25635,241792,50,25635,241792,40,25635,241832,0,25635,268021,3,26836,268932,4,27436,269777,5,28036,269778,1,28036,269778,50,28037,269778,40,28037,269818,0,28037,287119,3,28788,287965,4,29163,288782,5,29538,288783,1,29538,288783,50,29538,288783,40,29538,288783,40,29538,288818,0,29538,288947,50,29539,288982,0,29539,289044,50,29539,289044,30,29539,289044,40,29539,289079,0,29544,289207,50,29544,289207,30,29544,289207,40,29544,289242,0,29544)
%
%
% START OF PROOF
% 289208 [] equal(X,X).
% 289209 [] equal(multiply(identity,X),X).
% 289210 [] equal(multiply(inverse(X),X),identity).
% 289211 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 289212 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,X),sk_c8) | -equal(inverse(Y),X).
% 289213 [?] ?
% 289214 [?] ?
% 289215 [?] ?
% 289216 [?] ?
% 289217 [] equal(multiply(sk_c3,sk_c7),sk_c8) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 289218 [] equal(multiply(sk_c5,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c3).
% 289219 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c5),sk_c7).
% 289220 [] equal(multiply(sk_c4,sk_c7),sk_c8) | equal(inverse(sk_c2),sk_c3).
% 289221 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c4),sk_c8).
% 289222 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c3).
% 289223 [?] ?
% 289224 [?] ?
% 289225 [?] ?
% 289226 [?] ?
% 289227 [?] ?
% 289247 [hyper:289212,289219,binarycut:289224,binarycut:289214] equal(inverse(sk_c5),sk_c7).
% 289250 [para:289247.1.1,289210.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 289254 [hyper:289212,289221,binarycut:289226,binarycut:289216] equal(inverse(sk_c4),sk_c8).
% 289258 [para:289254.1.1,289210.1.1.1] equal(multiply(sk_c8,sk_c4),identity).
% 289262 [hyper:289212,289218,binarycut:289223,binarycut:289213] equal(multiply(sk_c5,sk_c6),sk_c7).
% 289267 [hyper:289212,289220,binarycut:289225,binarycut:289215] equal(multiply(sk_c4,sk_c7),sk_c8).
% 289281 [hyper:289212,289222,binarycut:289227,binarycut:289217] equal(multiply(sk_c7,sk_c8),sk_c6).
% 289282 [para:289210.1.1,289211.1.1.1,demod:289209] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 289283 [para:289250.1.1,289211.1.1.1,demod:289209] equal(X,multiply(sk_c7,multiply(sk_c5,X))).
% 289284 [para:289258.1.1,289211.1.1.1,demod:289209] equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 289290 [para:289262.1.1,289283.1.2.2] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 289294 [para:289267.1.1,289284.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 289301 [para:289281.1.1,289282.1.2.2] equal(sk_c8,multiply(inverse(sk_c7),sk_c6)).
% 289303 [para:289290.1.2,289282.1.2.2,demod:289301] equal(sk_c7,sk_c8).
% 289307 [para:289303.1.2,289294.1.2.1,demod:289281] equal(sk_c7,sk_c6).
% 289308 [para:289303.1.2,289294.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c7)).
% 289311 [para:289307.1.1,289281.1.1.1] equal(multiply(sk_c6,sk_c8),sk_c6).
% 289330 [para:289311.1.1,289282.1.2.2,demod:289210] equal(sk_c8,identity).
% 289333 [para:289330.1.1,289258.1.1.1,demod:289209] equal(sk_c4,identity).
% 289338 [para:289333.1.1,289254.1.1.1] equal(inverse(identity),sk_c8).
% 289346 [hyper:289212,289338,demod:289308,289209,cut:289208,cut:289303] 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 21
% 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(sk_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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(X,sk_c8),sk_c7) | -equal(inverse(X),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 21
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,0,75,0,0,787,50,5,827,0,6,1771,50,18,1811,0,18,2761,50,31,2801,0,31,3837,50,43,3877,0,43,4980,50,59,5020,0,60,6231,50,85,6271,0,85,7571,50,128,7611,0,128,9041,50,208,9081,0,208,10621,50,362,10661,0,362,12353,50,598,12393,0,598,14217,50,1018,14217,40,1018,14257,0,1018,23866,3,1319,24625,4,1469,25372,5,1619,25373,1,1619,25373,50,1619,25373,40,1619,25413,0,1619,25732,3,1932,25741,4,2076,25761,5,2220,25761,1,2220,25761,50,2220,25761,40,2220,25801,0,2220,45018,3,3726,46605,4,4471,48148,5,5221,48149,1,5221,48149,50,5221,48149,40,5221,48189,0,5222,61215,3,5974,62372,4,6348,63548,1,6723,63548,50,6723,63548,40,6723,63588,0,6723,73762,3,7491,75046,4,7849,76305,1,8225,76305,50,8225,76305,40,8225,76345,0,8225,134162,3,12126,135457,4,14076,136678,5,16026,136679,1,16026,136679,50,16028,136679,40,16028,136719,0,16028,188276,3,18580,189266,4,19854,190119,1,21129,190119,50,21131,190119,40,21131,190159,0,21131,229841,3,22647,230522,4,23382,231365,5,24132,231366,1,24132,231366,50,24134,231366,40,24134,231406,0,24134,240625,3,24885,241515,4,25263,241792,5,25635,241792,1,25635,241792,50,25635,241792,40,25635,241832,0,25635,268021,3,26836,268932,4,27436,269777,5,28036,269778,1,28036,269778,50,28037,269778,40,28037,269818,0,28037,287119,3,28788,287965,4,29163,288782,5,29538,288783,1,29538,288783,50,29538,288783,40,29538,288783,40,29538,288818,0,29538,288947,50,29539,288982,0,29539,289044,50,29539,289044,30,29539,289044,40,29539,289079,0,29544,289207,50,29544,289207,30,29544,289207,40,29544,289242,0,29544,289345,50,29545,289345,30,29545,289345,40,29545,289380,0,29545)
%
%
% START OF PROOF
% 289347 [] equal(multiply(identity,X),X).
% 289348 [] equal(multiply(inverse(X),X),identity).
% 289349 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 289350 [] -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 289366 [] equal(multiply(sk_c5,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c8).
% 289367 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c7).
% 289368 [] equal(multiply(sk_c4,sk_c7),sk_c8) | equal(inverse(sk_c1),sk_c8).
% 289369 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 289370 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c1),sk_c8).
% 289371 [?] ?
% 289372 [?] ?
% 289373 [?] ?
% 289374 [?] ?
% 289375 [?] ?
% 289387 [hyper:289350,289367,binarycut:289372] equal(inverse(sk_c5),sk_c7).
% 289388 [para:289387.1.1,289348.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 289391 [hyper:289350,289369,binarycut:289374] equal(inverse(sk_c4),sk_c8).
% 289395 [para:289391.1.1,289348.1.1.1] equal(multiply(sk_c8,sk_c4),identity).
% 289404 [hyper:289350,289366,binarycut:289371] equal(multiply(sk_c5,sk_c6),sk_c7).
% 289407 [hyper:289350,289368,binarycut:289373] equal(multiply(sk_c4,sk_c7),sk_c8).
% 289411 [hyper:289350,289370,binarycut:289375] equal(multiply(sk_c7,sk_c8),sk_c6).
% 289412 [para:289348.1.1,289349.1.1.1,demod:289347] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 289413 [para:289388.1.1,289349.1.1.1,demod:289347] equal(X,multiply(sk_c7,multiply(sk_c5,X))).
% 289414 [para:289395.1.1,289349.1.1.1,demod:289347] equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 289418 [para:289404.1.1,289413.1.2.2] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 289420 [para:289407.1.1,289414.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 289423 [para:289388.1.1,289412.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),identity)).
% 289425 [para:289411.1.1,289412.1.2.2] equal(sk_c8,multiply(inverse(sk_c7),sk_c6)).
% 289427 [para:289418.1.2,289412.1.2.2,demod:289425] equal(sk_c7,sk_c8).
% 289429 [para:289427.1.2,289395.1.1.1] equal(multiply(sk_c7,sk_c4),identity).
% 289431 [para:289427.1.2,289420.1.2.1,demod:289411] equal(sk_c7,sk_c6).
% 289435 [para:289431.1.1,289411.1.1.1] equal(multiply(sk_c6,sk_c8),sk_c6).
% 289439 [para:289429.1.1,289412.1.2.2,demod:289423] equal(sk_c4,sk_c5).
% 289441 [para:289439.1.2,289387.1.1.1,demod:289391] equal(sk_c8,sk_c7).
% 289452 [para:289435.1.1,289412.1.2.2,demod:289348] equal(sk_c8,identity).
% 289455 [para:289452.1.1,289395.1.1.1,demod:289347] equal(sk_c4,identity).
% 289460 [para:289455.1.1,289391.1.1.1] equal(inverse(identity),sk_c8).
% 289468 [hyper:289350,289460,demod:289347,cut:289441] 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 21
% 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(multiply(sk_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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_c8,sk_c7),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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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(35,40,0,75,0,0,787,50,5,827,0,6,1771,50,18,1811,0,18,2761,50,31,2801,0,31,3837,50,43,3877,0,43,4980,50,59,5020,0,60,6231,50,85,6271,0,85,7571,50,128,7611,0,128,9041,50,208,9081,0,208,10621,50,362,10661,0,362,12353,50,598,12393,0,598,14217,50,1018,14217,40,1018,14257,0,1018,23866,3,1319,24625,4,1469,25372,5,1619,25373,1,1619,25373,50,1619,25373,40,1619,25413,0,1619,25732,3,1932,25741,4,2076,25761,5,2220,25761,1,2220,25761,50,2220,25761,40,2220,25801,0,2220,45018,3,3726,46605,4,4471,48148,5,5221,48149,1,5221,48149,50,5221,48149,40,5221,48189,0,5222,61215,3,5974,62372,4,6348,63548,1,6723,63548,50,6723,63548,40,6723,63588,0,6723,73762,3,7491,75046,4,7849,76305,1,8225,76305,50,8225,76305,40,8225,76345,0,8225,134162,3,12126,135457,4,14076,136678,5,16026,136679,1,16026,136679,50,16028,136679,40,16028,136719,0,16028,188276,3,18580,189266,4,19854,190119,1,21129,190119,50,21131,190119,40,21131,190159,0,21131,229841,3,22647,230522,4,23382,231365,5,24132,231366,1,24132,231366,50,24134,231366,40,24134,231406,0,24134,240625,3,24885,241515,4,25263,241792,5,25635,241792,1,25635,241792,50,25635,241792,40,25635,241832,0,25635,268021,3,26836,268932,4,27436,269777,5,28036,269778,1,28036,269778,50,28037,269778,40,28037,269818,0,28037,287119,3,28788,287965,4,29163,288782,5,29538,288783,1,29538,288783,50,29538,288783,40,29538,288783,40,29538,288818,0,29538,288947,50,29539,288982,0,29539,289044,50,29539,289044,30,29539,289044,40,29539,289079,0,29544,289207,50,29544,289207,30,29544,289207,40,29544,289242,0,29544,289345,50,29545,289345,30,29545,289345,40,29545,289380,0,29545,289467,50,29545,289467,30,29545,289467,40,29545,289502,0,29550,289613,50,29551,289648,0,29551,289824,50,29553,289859,0,29558,290052,50,29561,290087,0,29561,290293,50,29566,290328,0,29566,290540,50,29573,290575,0,29577,290795,50,29590,290830,0,29590,291058,50,29617,291093,0,29621,291331,50,29675,291366,0,29675,291614,50,29785,291614,40,29785,291649,0,29785)
%
%
% START OF PROOF
% 291615 [] equal(X,X).
% 291616 [] equal(multiply(identity,X),X).
% 291617 [] equal(multiply(inverse(X),X),identity).
% 291618 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 291619 [] -equal(multiply(sk_c8,sk_c7),sk_c6).
% 291645 [?] ?
% 291646 [?] ?
% 291649 [?] ?
% 291690 [input:291646,cut:291619] equal(inverse(sk_c5),sk_c7).
% 291691 [para:291690.1.1,291617.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 291703 [input:291645,cut:291619] equal(multiply(sk_c5,sk_c6),sk_c7).
% 291705 [input:291649,cut:291619] equal(multiply(sk_c7,sk_c8),sk_c6).
% 291707 [para:291617.1.1,291618.1.1.1,demod:291616] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 291728 [para:291691.1.1,291618.1.1.1,demod:291616] equal(X,multiply(sk_c7,multiply(sk_c5,X))).
% 291753 [para:291703.1.1,291728.1.2.2] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 291807 [para:291705.1.1,291707.1.2.2] equal(sk_c8,multiply(inverse(sk_c7),sk_c6)).
% 291811 [para:291753.1.2,291707.1.2.2,demod:291807] equal(sk_c7,sk_c8).
% 291816 [para:291811.1.2,291619.1.1.1,demod:291753,cut:291615] 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(multiply(sk_c8,sk_c7),sk_c6) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,Z),sk_c8) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c8) | -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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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(35,40,0,75,0,0,787,50,5,827,0,6,1771,50,18,1811,0,18,2761,50,31,2801,0,31,3837,50,43,3877,0,43,4980,50,59,5020,0,60,6231,50,85,6271,0,85,7571,50,128,7611,0,128,9041,50,208,9081,0,208,10621,50,362,10661,0,362,12353,50,598,12393,0,598,14217,50,1018,14217,40,1018,14257,0,1018,23866,3,1319,24625,4,1469,25372,5,1619,25373,1,1619,25373,50,1619,25373,40,1619,25413,0,1619,25732,3,1932,25741,4,2076,25761,5,2220,25761,1,2220,25761,50,2220,25761,40,2220,25801,0,2220,45018,3,3726,46605,4,4471,48148,5,5221,48149,1,5221,48149,50,5221,48149,40,5221,48189,0,5222,61215,3,5974,62372,4,6348,63548,1,6723,63548,50,6723,63548,40,6723,63588,0,6723,73762,3,7491,75046,4,7849,76305,1,8225,76305,50,8225,76305,40,8225,76345,0,8225,134162,3,12126,135457,4,14076,136678,5,16026,136679,1,16026,136679,50,16028,136679,40,16028,136719,0,16028,188276,3,18580,189266,4,19854,190119,1,21129,190119,50,21131,190119,40,21131,190159,0,21131,229841,3,22647,230522,4,23382,231365,5,24132,231366,1,24132,231366,50,24134,231366,40,24134,231406,0,24134,240625,3,24885,241515,4,25263,241792,5,25635,241792,1,25635,241792,50,25635,241792,40,25635,241832,0,25635,268021,3,26836,268932,4,27436,269777,5,28036,269778,1,28036,269778,50,28037,269778,40,28037,269818,0,28037,287119,3,28788,287965,4,29163,288782,5,29538,288783,1,29538,288783,50,29538,288783,40,29538,288783,40,29538,288818,0,29538,288947,50,29539,288982,0,29539,289044,50,29539,289044,30,29539,289044,40,29539,289079,0,29544,289207,50,29544,289207,30,29544,289207,40,29544,289242,0,29544,289345,50,29545,289345,30,29545,289345,40,29545,289380,0,29545,289467,50,29545,289467,30,29545,289467,40,29545,289502,0,29550,289613,50,29551,289648,0,29551,289824,50,29553,289859,0,29558,290052,50,29561,290087,0,29561,290293,50,29566,290328,0,29566,290540,50,29573,290575,0,29577,290795,50,29590,290830,0,29590,291058,50,29617,291093,0,29621,291331,50,29675,291366,0,29675,291614,50,29785,291614,40,29785,291649,0,29785,291815,50,29785,291815,30,29785,291815,40,29785,291850,0,29785,291990,50,29786,292025,0,29791,292222,50,29794,292257,0,29794,292470,50,29798,292505,0,29798,292731,50,29803,292766,0,29807,292998,50,29815,293033,0,29815,293273,50,29829,293308,0,29834,293556,50,29862,293591,0,29862,293849,50,29922,293884,0,29922,294152,50,30037,294152,40,30037,294187,0,30037)
%
%
% START OF PROOF
% 294154 [] equal(multiply(identity,X),X).
% 294155 [] equal(multiply(inverse(X),X),identity).
% 294156 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 294157 [] -equal(multiply(sk_c7,sk_c8),sk_c6).
% 294177 [?] ?
% 294182 [?] ?
% 294187 [?] ?
% 294221 [input:294177,cut:294157] equal(inverse(sk_c1),sk_c8).
% 294222 [para:294221.1.1,294155.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 294240 [input:294182,cut:294157] equal(multiply(sk_c1,sk_c8),sk_c7).
% 294243 [input:294187,cut:294157] equal(multiply(sk_c8,sk_c7),sk_c6).
% 294246 [para:294155.1.1,294156.1.1.1,demod:294154] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 294261 [para:294222.1.1,294156.1.1.1,demod:294154] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 294297 [para:294240.1.1,294261.1.2.2] equal(sk_c8,multiply(sk_c8,sk_c7)).
% 294302 [para:294297.1.2,294243.1.1] equal(sk_c8,sk_c6).
% 294317 [para:294302.1.1,294243.1.1.1] equal(multiply(sk_c6,sk_c7),sk_c6).
% 294385 [para:294317.1.1,294246.1.2.2,demod:294155] equal(sk_c7,identity).
% 294389 [para:294385.1.1,294157.1.1.1,demod:294154,cut:294302] 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: 38637
% derived clauses: 6184865
% kept clauses: 239693
% kept size sum: 883295
% kept mid-nuclei: 10909
% kept new demods: 4235
% forw unit-subs: 2682563
% forw double-subs: 3040876
% forw overdouble-subs: 164181
% backward subs: 7850
% fast unit cutoff: 16222
% full unit cutoff: 0
% dbl unit cutoff: 6046
% real runtime : 301.5
% process. runtime: 300.38
% specific non-discr-tree subsumption statistics:
% tried: 41645698
% length fails: 4710216
% strength fails: 16362698
% predlist fails: 2587047
% aux str. fails: 5189363
% by-lit fails: 6523706
% full subs tried: 1352645
% full subs fail: 1277207
%
% ; 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/GRP279-1+eq_r.in")
%
%------------------------------------------------------------------------------