TSTP Solution File: GRP217-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP217-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 : art09.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.3s
% Output : Assurance 297.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/GRP217-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 27)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 27)
% (binary-posweight-lex-big-order 30 #f 3 27)
% (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(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11) | -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11) | -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% was split for some strategies as:
% -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11).
% -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11).
% -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10).
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11).
%
% Starting a split proof attempt with 5 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11) | -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11) | -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% Split part used next: -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(53,40,0,112,0,0,210584,5,1501,210584,1,1501,210584,50,1501,210584,40,1501,210643,0,1501,219289,3,1802,220325,4,1952,221582,5,2102,221583,1,2102,221583,50,2102,221583,40,2102,221642,0,2102,224160,3,2410,224883,4,2553,225017,5,2703,225017,1,2703,225017,50,2703,225017,40,2703,225076,0,2703,242069,3,4204,243063,4,4954,244008,1,5704,244008,50,5704,244008,40,5704,244067,0,5704,257065,3,6455,257733,4,6830,258466,1,7205,258466,50,7205,258466,40,7205,258525,0,7205,268847,3,7967,270136,4,8331,271754,1,8706,271754,50,8706,271754,40,8706,271813,0,8706,327469,3,12608,328064,4,14557,328339,5,16507,328340,1,16507,328340,50,16509,328340,40,16509,328399,0,16509,368147,3,19061,368660,4,20335,368910,1,21610,368910,50,21612,368910,40,21612,368969,0,21612,406116,3,23116,406743,4,23863,407458,1,24613,407458,50,24614,407458,40,24614,407517,0,24614,423133,3,25366,424246,4,25740,425335,5,26115,425335,1,26115,425335,50,26115,425335,40,26115,425394,0,26115,445910,3,27316,446722,4,27916,447160,1,28516,447160,50,28516,447160,40,28516,447219,0,28516,461899,3,29267,462737,4,29642,463460,1,30017,463460,50,30017,463460,40,30017,463460,40,30017,463513,0,30017)
%
%
% START OF PROOF
% 463461 [] equal(X,X).
% 463465 [] -equal(multiply(sk_c11,X),sk_c10) | -equal(multiply(Y,sk_c11),X) | -equal(inverse(Y),sk_c11).
% 463466 [] equal(inverse(sk_c4),sk_c11) | equal(inverse(sk_c8),sk_c11).
% 463467 [] equal(multiply(sk_c8,sk_c11),sk_c9) | equal(inverse(sk_c4),sk_c11).
% 463468 [?] ?
% 463472 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(inverse(sk_c8),sk_c11).
% 463473 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(multiply(sk_c8,sk_c11),sk_c9).
% 463474 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(multiply(sk_c11,sk_c9),sk_c10).
% 463478 [?] ?
% 463479 [?] ?
% 463480 [?] ?
% 463549 [hyper:463465,463467,463466,binarycut:463468] equal(inverse(sk_c4),sk_c11).
% 463561 [hyper:463465,463472,demod:463549,cut:463461,binarycut:463478] equal(inverse(sk_c8),sk_c11).
% 463568 [hyper:463465,463473,demod:463549,cut:463461,binarycut:463479] equal(multiply(sk_c8,sk_c11),sk_c9).
% 463582 [hyper:463465,463474,demod:463549,cut:463461,binarycut:463480] equal(multiply(sk_c11,sk_c9),sk_c10).
% 463589 [hyper:463465,463582,463568,demod:463561,cut:463461] 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 27
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11) | -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11) | -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% Split part used next: -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),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 27
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(53,40,0,112,0,0,210584,5,1501,210584,1,1501,210584,50,1501,210584,40,1501,210643,0,1501,219289,3,1802,220325,4,1952,221582,5,2102,221583,1,2102,221583,50,2102,221583,40,2102,221642,0,2102,224160,3,2410,224883,4,2553,225017,5,2703,225017,1,2703,225017,50,2703,225017,40,2703,225076,0,2703,242069,3,4204,243063,4,4954,244008,1,5704,244008,50,5704,244008,40,5704,244067,0,5704,257065,3,6455,257733,4,6830,258466,1,7205,258466,50,7205,258466,40,7205,258525,0,7205,268847,3,7967,270136,4,8331,271754,1,8706,271754,50,8706,271754,40,8706,271813,0,8706,327469,3,12608,328064,4,14557,328339,5,16507,328340,1,16507,328340,50,16509,328340,40,16509,328399,0,16509,368147,3,19061,368660,4,20335,368910,1,21610,368910,50,21612,368910,40,21612,368969,0,21612,406116,3,23116,406743,4,23863,407458,1,24613,407458,50,24614,407458,40,24614,407517,0,24614,423133,3,25366,424246,4,25740,425335,5,26115,425335,1,26115,425335,50,26115,425335,40,26115,425394,0,26115,445910,3,27316,446722,4,27916,447160,1,28516,447160,50,28516,447160,40,28516,447219,0,28516,461899,3,29267,462737,4,29642,463460,1,30017,463460,50,30017,463460,40,30017,463460,40,30017,463513,0,30017,463588,50,30017,463588,30,30017,463588,40,30017,463641,0,30017)
%
%
% START OF PROOF
% 463589 [] equal(X,X).
% 463590 [] equal(multiply(identity,X),X).
% 463591 [] equal(multiply(inverse(X),X),identity).
% 463592 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 463593 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,X),sk_c11) | -equal(inverse(Y),X).
% 463597 [?] ?
% 463598 [] equal(inverse(sk_c4),sk_c11) | equal(inverse(sk_c6),sk_c7).
% 463599 [?] ?
% 463603 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(multiply(sk_c7,sk_c10),sk_c11).
% 463604 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(inverse(sk_c6),sk_c7).
% 463605 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(multiply(sk_c6,sk_c7),sk_c11).
% 463609 [] equal(multiply(sk_c11,sk_c5),sk_c10) | equal(multiply(sk_c7,sk_c10),sk_c11).
% 463610 [] equal(multiply(sk_c11,sk_c5),sk_c10) | equal(inverse(sk_c6),sk_c7).
% 463611 [] equal(multiply(sk_c11,sk_c5),sk_c10) | equal(multiply(sk_c6,sk_c7),sk_c11).
% 463633 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c7,sk_c10),sk_c11).
% 463634 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(inverse(sk_c6),sk_c7).
% 463635 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c6,sk_c7),sk_c11).
% 463639 [?] ?
% 463640 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c6),sk_c7).
% 463641 [?] ?
% 463650 [hyper:463593,463598,binarycut:463599,binarycut:463597] equal(inverse(sk_c4),sk_c11).
% 463653 [para:463650.1.1,463591.1.1.1] equal(multiply(sk_c11,sk_c4),identity).
% 463680 [hyper:463593,463640,binarycut:463641,binarycut:463639] equal(inverse(sk_c1),sk_c11).
% 463683 [para:463680.1.1,463591.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 463730 [hyper:463593,463605,463603,463604] equal(multiply(sk_c4,sk_c11),sk_c5).
% 463742 [hyper:463593,463611,463609,463610] equal(multiply(sk_c11,sk_c5),sk_c10).
% 463792 [hyper:463593,463635,463633,463634] equal(multiply(sk_c1,sk_c10),sk_c11).
% 463799 [para:463591.1.1,463592.1.1.1,demod:463590] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 463800 [para:463653.1.1,463592.1.1.1,demod:463590] equal(X,multiply(sk_c11,multiply(sk_c4,X))).
% 463802 [para:463683.1.1,463592.1.1.1,demod:463590] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 463803 [para:463730.1.1,463592.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c4,multiply(sk_c11,X))).
% 463810 [para:463730.1.1,463800.1.2.2,demod:463742] equal(sk_c11,sk_c10).
% 463814 [para:463653.1.1,463799.1.2.2] equal(sk_c4,multiply(inverse(sk_c11),identity)).
% 463816 [para:463683.1.1,463799.1.2.2,demod:463814] equal(sk_c1,sk_c4).
% 463821 [para:463800.1.2,463799.1.2.2] equal(multiply(sk_c4,X),multiply(inverse(sk_c11),X)).
% 463822 [para:463810.1.1,463653.1.1.1] equal(multiply(sk_c10,sk_c4),identity).
% 463823 [para:463810.1.1,463683.1.1.1] equal(multiply(sk_c10,sk_c1),identity).
% 463824 [para:463810.1.1,463730.1.1.2] equal(multiply(sk_c4,sk_c10),sk_c5).
% 463828 [para:463816.1.1,463792.1.1.1,demod:463824] equal(sk_c5,sk_c11).
% 463837 [para:463828.1.2,463800.1.2.1] equal(X,multiply(sk_c5,multiply(sk_c4,X))).
% 463838 [para:463828.1.2,463810.1.1] equal(sk_c5,sk_c10).
% 463839 [para:463838.1.1,463742.1.1.2] equal(multiply(sk_c11,sk_c10),sk_c10).
% 463853 [para:463802.1.2,463799.1.2.2,demod:463821] equal(multiply(sk_c1,X),multiply(sk_c4,X)).
% 463856 [para:463800.1.2,463803.1.2.2,demod:463837] equal(X,multiply(sk_c4,X)).
% 463857 [para:463810.1.1,463803.1.2.2.1,demod:463856] equal(multiply(sk_c5,X),multiply(sk_c10,X)).
% 463858 [para:463802.1.2,463803.1.2.2,demod:463857,463856,463853] equal(multiply(sk_c10,X),X).
% 463864 [para:463858.1.1,463822.1.1] equal(sk_c4,identity).
% 463866 [para:463858.1.1,463823.1.1] equal(sk_c1,identity).
% 463868 [para:463864.1.1,463650.1.1.1] equal(inverse(identity),sk_c11).
% 463869 [para:463866.1.1,463792.1.1.1,demod:463590] equal(sk_c10,sk_c11).
% 463870 [hyper:463593,463868,demod:463839,463590,cut:463589,cut:463869] 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 27
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11) | -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11) | -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% Split part used next: -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),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 27
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(53,40,0,112,0,0,210584,5,1501,210584,1,1501,210584,50,1501,210584,40,1501,210643,0,1501,219289,3,1802,220325,4,1952,221582,5,2102,221583,1,2102,221583,50,2102,221583,40,2102,221642,0,2102,224160,3,2410,224883,4,2553,225017,5,2703,225017,1,2703,225017,50,2703,225017,40,2703,225076,0,2703,242069,3,4204,243063,4,4954,244008,1,5704,244008,50,5704,244008,40,5704,244067,0,5704,257065,3,6455,257733,4,6830,258466,1,7205,258466,50,7205,258466,40,7205,258525,0,7205,268847,3,7967,270136,4,8331,271754,1,8706,271754,50,8706,271754,40,8706,271813,0,8706,327469,3,12608,328064,4,14557,328339,5,16507,328340,1,16507,328340,50,16509,328340,40,16509,328399,0,16509,368147,3,19061,368660,4,20335,368910,1,21610,368910,50,21612,368910,40,21612,368969,0,21612,406116,3,23116,406743,4,23863,407458,1,24613,407458,50,24614,407458,40,24614,407517,0,24614,423133,3,25366,424246,4,25740,425335,5,26115,425335,1,26115,425335,50,26115,425335,40,26115,425394,0,26115,445910,3,27316,446722,4,27916,447160,1,28516,447160,50,28516,447160,40,28516,447219,0,28516,461899,3,29267,462737,4,29642,463460,1,30017,463460,50,30017,463460,40,30017,463460,40,30017,463513,0,30017,463588,50,30017,463588,30,30017,463588,40,30017,463641,0,30017,463869,50,30018,463869,30,30018,463869,40,30018,463922,0,30023)
%
%
% START OF PROOF
% 463870 [] equal(X,X).
% 463874 [] -equal(multiply(sk_c11,X),sk_c10) | -equal(multiply(Y,sk_c11),X) | -equal(inverse(Y),sk_c11).
% 463875 [] equal(inverse(sk_c4),sk_c11) | equal(inverse(sk_c8),sk_c11).
% 463876 [] equal(multiply(sk_c8,sk_c11),sk_c9) | equal(inverse(sk_c4),sk_c11).
% 463877 [?] ?
% 463881 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(inverse(sk_c8),sk_c11).
% 463882 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(multiply(sk_c8,sk_c11),sk_c9).
% 463883 [] equal(multiply(sk_c4,sk_c11),sk_c5) | equal(multiply(sk_c11,sk_c9),sk_c10).
% 463887 [?] ?
% 463888 [?] ?
% 463889 [?] ?
% 463958 [hyper:463874,463876,463875,binarycut:463877] equal(inverse(sk_c4),sk_c11).
% 463970 [hyper:463874,463881,demod:463958,cut:463870,binarycut:463887] equal(inverse(sk_c8),sk_c11).
% 463977 [hyper:463874,463882,demod:463958,cut:463870,binarycut:463888] equal(multiply(sk_c8,sk_c11),sk_c9).
% 463991 [hyper:463874,463883,demod:463958,cut:463870,binarycut:463889] equal(multiply(sk_c11,sk_c9),sk_c10).
% 463998 [hyper:463874,463991,463977,demod:463970,cut:463870] 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 27
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11) | -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11) | -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% Split part used next: -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),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 27
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(53,40,0,112,0,0,210584,5,1501,210584,1,1501,210584,50,1501,210584,40,1501,210643,0,1501,219289,3,1802,220325,4,1952,221582,5,2102,221583,1,2102,221583,50,2102,221583,40,2102,221642,0,2102,224160,3,2410,224883,4,2553,225017,5,2703,225017,1,2703,225017,50,2703,225017,40,2703,225076,0,2703,242069,3,4204,243063,4,4954,244008,1,5704,244008,50,5704,244008,40,5704,244067,0,5704,257065,3,6455,257733,4,6830,258466,1,7205,258466,50,7205,258466,40,7205,258525,0,7205,268847,3,7967,270136,4,8331,271754,1,8706,271754,50,8706,271754,40,8706,271813,0,8706,327469,3,12608,328064,4,14557,328339,5,16507,328340,1,16507,328340,50,16509,328340,40,16509,328399,0,16509,368147,3,19061,368660,4,20335,368910,1,21610,368910,50,21612,368910,40,21612,368969,0,21612,406116,3,23116,406743,4,23863,407458,1,24613,407458,50,24614,407458,40,24614,407517,0,24614,423133,3,25366,424246,4,25740,425335,5,26115,425335,1,26115,425335,50,26115,425335,40,26115,425394,0,26115,445910,3,27316,446722,4,27916,447160,1,28516,447160,50,28516,447160,40,28516,447219,0,28516,461899,3,29267,462737,4,29642,463460,1,30017,463460,50,30017,463460,40,30017,463460,40,30017,463513,0,30017,463588,50,30017,463588,30,30017,463588,40,30017,463641,0,30017,463869,50,30018,463869,30,30018,463869,40,30018,463922,0,30023,463997,50,30023,463997,30,30023,463997,40,30023,464050,0,30023)
%
%
% START OF PROOF
% 463999 [] equal(multiply(identity,X),X).
% 464000 [] equal(multiply(inverse(X),X),identity).
% 464001 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 464002 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(multiply(Y,X),sk_c10) | -equal(inverse(Y),X).
% 464021 [?] ?
% 464022 [?] ?
% 464023 [?] ?
% 464025 [?] ?
% 464026 [?] ?
% 464027 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c8),sk_c11).
% 464028 [] equal(multiply(sk_c8,sk_c11),sk_c9) | equal(inverse(sk_c2),sk_c3).
% 464029 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c2),sk_c3).
% 464031 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c6),sk_c7).
% 464032 [] equal(multiply(sk_c6,sk_c7),sk_c11) | equal(inverse(sk_c2),sk_c3).
% 464033 [?] ?
% 464034 [?] ?
% 464035 [?] ?
% 464037 [?] ?
% 464038 [?] ?
% 464062 [hyper:464002,464027,binarycut:464033,binarycut:464021] equal(inverse(sk_c8),sk_c11).
% 464066 [para:464062.1.1,464000.1.1.1] equal(multiply(sk_c11,sk_c8),identity).
% 464070 [hyper:464002,464031,binarycut:464037,binarycut:464025] equal(inverse(sk_c6),sk_c7).
% 464093 [hyper:464002,464028,binarycut:464034,binarycut:464022] equal(multiply(sk_c8,sk_c11),sk_c9).
% 464097 [hyper:464002,464029,binarycut:464035,binarycut:464023] equal(multiply(sk_c11,sk_c9),sk_c10).
% 464107 [hyper:464002,464032,binarycut:464038,binarycut:464026] equal(multiply(sk_c6,sk_c7),sk_c11).
% 464108 [para:464000.1.1,464001.1.1.1,demod:463999] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 464109 [para:464066.1.1,464001.1.1.1,demod:463999] equal(X,multiply(sk_c11,multiply(sk_c8,X))).
% 464117 [para:464093.1.1,464109.1.2.2,demod:464097] equal(sk_c11,sk_c10).
% 464130 [para:464107.1.1,464108.1.2.2,demod:464070] equal(sk_c7,multiply(sk_c7,sk_c11)).
% 464141 [para:464130.1.2,464108.1.2.2,demod:464000] equal(sk_c11,identity).
% 464148 [para:464141.1.1,464066.1.1.1,demod:463999] equal(sk_c8,identity).
% 464159 [para:464148.1.1,464062.1.1.1] equal(inverse(identity),sk_c11).
% 464161 [para:464148.1.1,464109.1.2.2.1,demod:463999] equal(X,multiply(sk_c11,X)).
% 464191 [hyper:464002,464159,demod:464161,463999,cut:464117,cut:464117] 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 27
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,Z),sk_c10) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(multiply(sk_c11,U),sk_c10) | -equal(multiply(V,sk_c11),U) | -equal(inverse(V),sk_c11) | -equal(multiply(W,X1),sk_c11) | -equal(inverse(W),X1) | -equal(multiply(X1,sk_c10),sk_c11) | -equal(multiply(sk_c11,X2),sk_c10) | -equal(multiply(X3,sk_c11),X2) | -equal(inverse(X3),sk_c11).
% Split part used next: -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),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 27
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(53,40,0,112,0,0,210584,5,1501,210584,1,1501,210584,50,1501,210584,40,1501,210643,0,1501,219289,3,1802,220325,4,1952,221582,5,2102,221583,1,2102,221583,50,2102,221583,40,2102,221642,0,2102,224160,3,2410,224883,4,2553,225017,5,2703,225017,1,2703,225017,50,2703,225017,40,2703,225076,0,2703,242069,3,4204,243063,4,4954,244008,1,5704,244008,50,5704,244008,40,5704,244067,0,5704,257065,3,6455,257733,4,6830,258466,1,7205,258466,50,7205,258466,40,7205,258525,0,7205,268847,3,7967,270136,4,8331,271754,1,8706,271754,50,8706,271754,40,8706,271813,0,8706,327469,3,12608,328064,4,14557,328339,5,16507,328340,1,16507,328340,50,16509,328340,40,16509,328399,0,16509,368147,3,19061,368660,4,20335,368910,1,21610,368910,50,21612,368910,40,21612,368969,0,21612,406116,3,23116,406743,4,23863,407458,1,24613,407458,50,24614,407458,40,24614,407517,0,24614,423133,3,25366,424246,4,25740,425335,5,26115,425335,1,26115,425335,50,26115,425335,40,26115,425394,0,26115,445910,3,27316,446722,4,27916,447160,1,28516,447160,50,28516,447160,40,28516,447219,0,28516,461899,3,29267,462737,4,29642,463460,1,30017,463460,50,30017,463460,40,30017,463460,40,30017,463513,0,30017,463588,50,30017,463588,30,30017,463588,40,30017,463641,0,30017,463869,50,30018,463869,30,30018,463869,40,30018,463922,0,30023,463997,50,30023,463997,30,30023,463997,40,30023,464050,0,30023,464190,50,30024,464190,30,30024,464190,40,30024,464243,0,30028)
%
%
% START OF PROOF
% 464192 [] equal(multiply(identity,X),X).
% 464193 [] equal(multiply(inverse(X),X),identity).
% 464194 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 464195 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(inverse(X),sk_c11).
% 464232 [?] ?
% 464233 [?] ?
% 464234 [?] ?
% 464235 [?] ?
% 464236 [?] ?
% 464237 [?] ?
% 464238 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c8),sk_c11).
% 464239 [] equal(multiply(sk_c8,sk_c11),sk_c9) | equal(inverse(sk_c1),sk_c11).
% 464240 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c1),sk_c11).
% 464241 [] equal(multiply(sk_c7,sk_c10),sk_c11) | equal(inverse(sk_c1),sk_c11).
% 464242 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c6),sk_c7).
% 464243 [] equal(multiply(sk_c6,sk_c7),sk_c11) | equal(inverse(sk_c1),sk_c11).
% 464256 [hyper:464195,464238,binarycut:464232] equal(inverse(sk_c8),sk_c11).
% 464260 [para:464256.1.1,464193.1.1.1] equal(multiply(sk_c11,sk_c8),identity).
% 464267 [hyper:464195,464242,binarycut:464236] equal(inverse(sk_c6),sk_c7).
% 464289 [hyper:464195,464239,binarycut:464233] equal(multiply(sk_c8,sk_c11),sk_c9).
% 464292 [hyper:464195,464240,binarycut:464234] equal(multiply(sk_c11,sk_c9),sk_c10).
% 464299 [hyper:464195,464241,binarycut:464235] equal(multiply(sk_c7,sk_c10),sk_c11).
% 464305 [hyper:464195,464243,binarycut:464237] equal(multiply(sk_c6,sk_c7),sk_c11).
% 464306 [para:464193.1.1,464194.1.1.1,demod:464192] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 464307 [para:464260.1.1,464194.1.1.1,demod:464192] equal(X,multiply(sk_c11,multiply(sk_c8,X))).
% 464313 [para:464289.1.1,464307.1.2.2,demod:464292] equal(sk_c11,sk_c10).
% 464324 [para:464305.1.1,464306.1.2.2,demod:464267] equal(sk_c7,multiply(sk_c7,sk_c11)).
% 464332 [para:464313.1.1,464324.1.2.2,demod:464299] equal(sk_c7,sk_c11).
% 464333 [para:464324.1.2,464306.1.2.2,demod:464193] equal(sk_c11,identity).
% 464340 [para:464333.1.1,464260.1.1.1,demod:464192] equal(sk_c8,identity).
% 464347 [para:464333.1.1,464332.1.2] equal(sk_c7,identity).
% 464349 [para:464340.1.1,464256.1.1.1] equal(inverse(identity),sk_c11).
% 464362 [para:464347.1.1,464299.1.1.1,demod:464192] equal(sk_c10,sk_c11).
% 464379 [hyper:464195,464349,demod:464192,cut:464362] 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 27
% clause depth limited to 3
% seconds given: 6
%
%
% Split attempt finished with SUCCESS.
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 31017
% derived clauses: 3269480
% kept clauses: 211851
% kept size sum: 1272
% kept mid-nuclei: 209334
% kept new demods: 774
% forw unit-subs: 705296
% forw double-subs: 1846502
% forw overdouble-subs: 248265
% backward subs: 33867
% fast unit cutoff: 28735
% full unit cutoff: 2
% dbl unit cutoff: 7246
% real runtime : 303.31
% process. runtime: 300.29
% specific non-discr-tree subsumption statistics:
% tried: 20039004
% length fails: 2205326
% strength fails: 7325185
% predlist fails: 1001114
% aux str. fails: 2844055
% by-lit fails: 1942272
% full subs tried: 2898734
% full subs fail: 2708420
%
% ; 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/GRP217-1+eq_r.in")
%
%------------------------------------------------------------------------------