TSTP Solution File: GRP210-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP210-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 : art07.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 298.2s
% Output : Assurance 298.2s
% 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/GRP210-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 25)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 25)
% (binary-posweight-lex-big-order 30 #f 3 25)
% (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,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10) | -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10) | -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10) | -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% was split for some strategies as:
% -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9).
% -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10).
% -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10).
% -equal(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10).
%
% 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(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10) | -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10) | -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10) | -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% Split part used next: -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(45,40,1,96,0,1,294020,4,1385,298506,5,1502,298506,1,1502,298506,50,1502,298506,40,1502,298557,0,1502,307299,3,1803,308258,4,1953,309623,1,2103,309623,50,2103,309623,40,2103,309674,0,2103,312144,3,2407,313040,4,2554,313050,5,2704,313050,1,2704,313050,50,2704,313050,40,2704,313101,0,2704,348428,3,4212,349127,4,4955,349790,5,5705,349791,1,5705,349791,50,5707,349791,40,5707,349842,0,5707,366892,3,6460,367700,4,6833,368580,5,7208,368581,1,7208,368581,50,7208,368581,40,7208,368632,0,7208,384861,3,7974,385525,4,8334,386620,1,8709,386620,50,8709,386620,40,8709,386671,0,8709,467358,3,12612,468290,4,14560,468993,5,16511,468994,1,16511,468994,50,16513,468994,40,16513,469045,0,16513,528531,3,19064,529475,4,20339,530256,1,21614,530256,50,21616,530256,40,21616,530307,0,21617,565100,3,23119,565978,4,23868,566984,5,24618,566985,1,24618,566985,50,24619,566985,40,24619,567036,0,24619,582065,3,25373,583202,4,25745,584317,5,26120,584318,1,26120,584318,50,26120,584318,40,26120,584369,0,26120,610920,3,27321,611899,4,27921,612764,5,28521,612765,1,28521,612765,50,28522,612765,40,28522,612816,0,28522,631597,3,29273,632498,4,29648,633303,1,30023,633303,50,30023,633303,40,30023,633303,40,30023,633348,0,30023)
%
%
% START OF PROOF
% 633304 [] equal(X,X).
% 633305 [] equal(multiply(identity,X),X).
% 633306 [] equal(multiply(inverse(X),X),identity).
% 633307 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 633308 [] -equal(multiply(sk_c10,X),sk_c9) | -equal(multiply(Y,sk_c10),X) | -equal(inverse(Y),sk_c10).
% 633309 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(inverse(sk_c7),sk_c10).
% 633310 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(multiply(sk_c7,sk_c10),sk_c8).
% 633311 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(multiply(sk_c10,sk_c8),sk_c9).
% 633317 [] equal(inverse(sk_c3),sk_c10) | equal(inverse(sk_c7),sk_c10).
% 633318 [] equal(multiply(sk_c7,sk_c10),sk_c8) | equal(inverse(sk_c3),sk_c10).
% 633319 [?] ?
% 633325 [] equal(multiply(sk_c2,sk_c9),sk_c10) | equal(inverse(sk_c7),sk_c10).
% 633326 [] equal(multiply(sk_c2,sk_c9),sk_c10) | equal(multiply(sk_c7,sk_c10),sk_c8).
% 633327 [] equal(multiply(sk_c2,sk_c9),sk_c10) | equal(multiply(sk_c10,sk_c8),sk_c9).
% 633333 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c7),sk_c10).
% 633334 [] equal(multiply(sk_c7,sk_c10),sk_c8) | equal(inverse(sk_c1),sk_c2).
% 633335 [?] ?
% 633341 [] equal(multiply(sk_c1,sk_c2),sk_c10) | equal(inverse(sk_c7),sk_c10).
% 633342 [] equal(multiply(sk_c1,sk_c2),sk_c10) | equal(multiply(sk_c7,sk_c10),sk_c8).
% 633343 [] equal(multiply(sk_c1,sk_c2),sk_c10) | equal(multiply(sk_c10,sk_c8),sk_c9).
% 633398 [hyper:633308,633318,633317,binarycut:633319] equal(inverse(sk_c3),sk_c10).
% 633405 [para:633398.1.1,633306.1.1.1] equal(multiply(sk_c10,sk_c3),identity).
% 633414 [hyper:633308,633311,633310,633309] equal(multiply(sk_c3,sk_c9),sk_c10).
% 633432 [hyper:633308,633334,633333,binarycut:633335] equal(inverse(sk_c1),sk_c2).
% 633446 [hyper:633308,633327,633326,633325] equal(multiply(sk_c2,sk_c9),sk_c10).
% 633459 [hyper:633308,633343,633342,633341] equal(multiply(sk_c1,sk_c2),sk_c10).
% 633460 [para:633306.1.1,633307.1.1.1,demod:633305] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 633461 [para:633405.1.1,633307.1.1.1,demod:633305] equal(X,multiply(sk_c10,multiply(sk_c3,X))).
% 633470 [para:633414.1.1,633460.1.2.2,demod:633398] equal(sk_c9,multiply(sk_c10,sk_c10)).
% 633473 [para:633459.1.1,633460.1.2.2,demod:633432] equal(sk_c2,multiply(sk_c2,sk_c10)).
% 633477 [para:633473.1.2,633460.1.2.2,demod:633306] equal(sk_c10,identity).
% 633478 [para:633477.1.1,633405.1.1.1,demod:633305] equal(sk_c3,identity).
% 633479 [para:633477.1.1,633470.1.2.1,demod:633305] equal(sk_c9,sk_c10).
% 633482 [para:633478.1.1,633398.1.1.1] equal(inverse(identity),sk_c10).
% 633485 [para:633479.1.1,633446.1.1.2,demod:633473] equal(sk_c2,sk_c10).
% 633490 [para:633478.1.1,633461.1.2.2.1,demod:633305] equal(X,multiply(sk_c10,X)).
% 633494 [para:633485.1.1,633473.1.2.1,demod:633470] equal(sk_c2,sk_c9).
% 633501 [para:633485.1.1,633494.1.1] equal(sk_c10,sk_c9).
% 633508 [hyper:633308,633482,633304,demod:633490,633305,cut:633501] 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 25
% 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(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10) | -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10) | -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10) | -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% Split part used next: -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),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 25
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(45,40,1,96,0,1,294020,4,1385,298506,5,1502,298506,1,1502,298506,50,1502,298506,40,1502,298557,0,1502,307299,3,1803,308258,4,1953,309623,1,2103,309623,50,2103,309623,40,2103,309674,0,2103,312144,3,2407,313040,4,2554,313050,5,2704,313050,1,2704,313050,50,2704,313050,40,2704,313101,0,2704,348428,3,4212,349127,4,4955,349790,5,5705,349791,1,5705,349791,50,5707,349791,40,5707,349842,0,5707,366892,3,6460,367700,4,6833,368580,5,7208,368581,1,7208,368581,50,7208,368581,40,7208,368632,0,7208,384861,3,7974,385525,4,8334,386620,1,8709,386620,50,8709,386620,40,8709,386671,0,8709,467358,3,12612,468290,4,14560,468993,5,16511,468994,1,16511,468994,50,16513,468994,40,16513,469045,0,16513,528531,3,19064,529475,4,20339,530256,1,21614,530256,50,21616,530256,40,21616,530307,0,21617,565100,3,23119,565978,4,23868,566984,5,24618,566985,1,24618,566985,50,24619,566985,40,24619,567036,0,24619,582065,3,25373,583202,4,25745,584317,5,26120,584318,1,26120,584318,50,26120,584318,40,26120,584369,0,26120,610920,3,27321,611899,4,27921,612764,5,28521,612765,1,28521,612765,50,28522,612765,40,28522,612816,0,28522,631597,3,29273,632498,4,29648,633303,1,30023,633303,50,30023,633303,40,30023,633303,40,30023,633348,0,30023,633507,50,30024,633507,30,30024,633507,40,30024,633552,0,30024)
%
%
% START OF PROOF
% 633508 [] equal(X,X).
% 633509 [] equal(multiply(identity,X),X).
% 633510 [] equal(multiply(inverse(X),X),identity).
% 633511 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 633512 [] -equal(multiply(X,sk_c10),sk_c9) | -equal(multiply(Y,X),sk_c9) | -equal(inverse(Y),X).
% 633516 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(multiply(sk_c6,sk_c10),sk_c9).
% 633517 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(inverse(sk_c5),sk_c6).
% 633518 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(multiply(sk_c5,sk_c6),sk_c9).
% 633524 [?] ?
% 633525 [] equal(inverse(sk_c3),sk_c10) | equal(inverse(sk_c5),sk_c6).
% 633526 [?] ?
% 633532 [] equal(multiply(sk_c2,sk_c9),sk_c10) | equal(multiply(sk_c6,sk_c10),sk_c9).
% 633533 [] equal(multiply(sk_c2,sk_c9),sk_c10) | equal(inverse(sk_c5),sk_c6).
% 633534 [] equal(multiply(sk_c2,sk_c9),sk_c10) | equal(multiply(sk_c5,sk_c6),sk_c9).
% 633540 [?] ?
% 633541 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c5),sk_c6).
% 633542 [?] ?
% 633548 [] equal(multiply(sk_c1,sk_c2),sk_c10) | equal(multiply(sk_c6,sk_c10),sk_c9).
% 633549 [] equal(multiply(sk_c1,sk_c2),sk_c10) | equal(inverse(sk_c5),sk_c6).
% 633550 [] equal(multiply(sk_c1,sk_c2),sk_c10) | equal(multiply(sk_c5,sk_c6),sk_c9).
% 633561 [hyper:633512,633525,binarycut:633526,binarycut:633524] equal(inverse(sk_c3),sk_c10).
% 633564 [para:633561.1.1,633510.1.1.1] equal(multiply(sk_c10,sk_c3),identity).
% 633574 [hyper:633512,633541,binarycut:633542,binarycut:633540] equal(inverse(sk_c1),sk_c2).
% 633619 [hyper:633512,633518,633516,633517] equal(multiply(sk_c3,sk_c9),sk_c10).
% 633633 [hyper:633512,633534,633532,633533] equal(multiply(sk_c2,sk_c9),sk_c10).
% 633647 [hyper:633512,633550,633548,633549] equal(multiply(sk_c1,sk_c2),sk_c10).
% 633648 [para:633510.1.1,633511.1.1.1,demod:633509] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 633649 [para:633564.1.1,633511.1.1.1,demod:633509] equal(X,multiply(sk_c10,multiply(sk_c3,X))).
% 633656 [para:633619.1.1,633649.1.2.2] equal(sk_c9,multiply(sk_c10,sk_c10)).
% 633663 [para:633647.1.1,633648.1.2.2,demod:633574] equal(sk_c2,multiply(sk_c2,sk_c10)).
% 633667 [para:633663.1.2,633648.1.2.2,demod:633510] equal(sk_c10,identity).
% 633668 [para:633667.1.1,633564.1.1.1,demod:633509] equal(sk_c3,identity).
% 633670 [para:633667.1.1,633656.1.2.1,demod:633509] equal(sk_c9,sk_c10).
% 633673 [para:633668.1.1,633561.1.1.1] equal(inverse(identity),sk_c10).
% 633676 [para:633670.1.1,633633.1.1.2,demod:633663] equal(sk_c2,sk_c10).
% 633683 [para:633676.1.1,633663.1.2.1,demod:633656] equal(sk_c2,sk_c9).
% 633692 [para:633676.1.1,633683.1.1] equal(sk_c10,sk_c9).
% 633694 [hyper:633512,633673,demod:633656,633509,cut:633692,cut:633508] 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 25
% 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(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10) | -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10) | -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10) | -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% Split part used next: -equal(inverse(U),sk_c10) | -equal(multiply(U,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 25
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(45,40,1,96,0,1,294020,4,1385,298506,5,1502,298506,1,1502,298506,50,1502,298506,40,1502,298557,0,1502,307299,3,1803,308258,4,1953,309623,1,2103,309623,50,2103,309623,40,2103,309674,0,2103,312144,3,2407,313040,4,2554,313050,5,2704,313050,1,2704,313050,50,2704,313050,40,2704,313101,0,2704,348428,3,4212,349127,4,4955,349790,5,5705,349791,1,5705,349791,50,5707,349791,40,5707,349842,0,5707,366892,3,6460,367700,4,6833,368580,5,7208,368581,1,7208,368581,50,7208,368581,40,7208,368632,0,7208,384861,3,7974,385525,4,8334,386620,1,8709,386620,50,8709,386620,40,8709,386671,0,8709,467358,3,12612,468290,4,14560,468993,5,16511,468994,1,16511,468994,50,16513,468994,40,16513,469045,0,16513,528531,3,19064,529475,4,20339,530256,1,21614,530256,50,21616,530256,40,21616,530307,0,21617,565100,3,23119,565978,4,23868,566984,5,24618,566985,1,24618,566985,50,24619,566985,40,24619,567036,0,24619,582065,3,25373,583202,4,25745,584317,5,26120,584318,1,26120,584318,50,26120,584318,40,26120,584369,0,26120,610920,3,27321,611899,4,27921,612764,5,28521,612765,1,28521,612765,50,28522,612765,40,28522,612816,0,28522,631597,3,29273,632498,4,29648,633303,1,30023,633303,50,30023,633303,40,30023,633303,40,30023,633348,0,30023,633507,50,30024,633507,30,30024,633507,40,30024,633552,0,30024,633693,50,30024,633693,30,30024,633693,40,30024,633738,0,30029)
%
%
% START OF PROOF
% 633694 [] equal(X,X).
% 633698 [] -equal(multiply(X,sk_c9),sk_c10) | -equal(inverse(X),sk_c10).
% 633705 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(multiply(sk_c4,sk_c9),sk_c10).
% 633706 [?] ?
% 633713 [?] ?
% 633714 [] equal(inverse(sk_c3),sk_c10) | equal(inverse(sk_c4),sk_c10).
% 633755 [hyper:633698,633714,binarycut:633706] equal(inverse(sk_c4),sk_c10).
% 633757 [hyper:633698,633714,binarycut:633713] equal(inverse(sk_c3),sk_c10).
% 633777 [hyper:633698,633705,demod:633757,cut:633694] equal(multiply(sk_c4,sk_c9),sk_c10).
% 633779 [hyper:633698,633777,demod:633755,cut:633694] 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 25
% 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(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10) | -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10) | -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10) | -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% Split part used next: -equal(inverse(Z),sk_c10) | -equal(multiply(Z,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 25
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(45,40,1,96,0,1,294020,4,1385,298506,5,1502,298506,1,1502,298506,50,1502,298506,40,1502,298557,0,1502,307299,3,1803,308258,4,1953,309623,1,2103,309623,50,2103,309623,40,2103,309674,0,2103,312144,3,2407,313040,4,2554,313050,5,2704,313050,1,2704,313050,50,2704,313050,40,2704,313101,0,2704,348428,3,4212,349127,4,4955,349790,5,5705,349791,1,5705,349791,50,5707,349791,40,5707,349842,0,5707,366892,3,6460,367700,4,6833,368580,5,7208,368581,1,7208,368581,50,7208,368581,40,7208,368632,0,7208,384861,3,7974,385525,4,8334,386620,1,8709,386620,50,8709,386620,40,8709,386671,0,8709,467358,3,12612,468290,4,14560,468993,5,16511,468994,1,16511,468994,50,16513,468994,40,16513,469045,0,16513,528531,3,19064,529475,4,20339,530256,1,21614,530256,50,21616,530256,40,21616,530307,0,21617,565100,3,23119,565978,4,23868,566984,5,24618,566985,1,24618,566985,50,24619,566985,40,24619,567036,0,24619,582065,3,25373,583202,4,25745,584317,5,26120,584318,1,26120,584318,50,26120,584318,40,26120,584369,0,26120,610920,3,27321,611899,4,27921,612764,5,28521,612765,1,28521,612765,50,28522,612765,40,28522,612816,0,28522,631597,3,29273,632498,4,29648,633303,1,30023,633303,50,30023,633303,40,30023,633303,40,30023,633348,0,30023,633507,50,30024,633507,30,30024,633507,40,30024,633552,0,30024,633693,50,30024,633693,30,30024,633693,40,30024,633738,0,30029,633778,50,30029,633778,30,30029,633778,40,30029,633823,0,30029)
%
%
% START OF PROOF
% 633779 [] equal(X,X).
% 633783 [] -equal(multiply(X,sk_c9),sk_c10) | -equal(inverse(X),sk_c10).
% 633790 [] equal(multiply(sk_c3,sk_c9),sk_c10) | equal(multiply(sk_c4,sk_c9),sk_c10).
% 633791 [?] ?
% 633798 [?] ?
% 633799 [] equal(inverse(sk_c3),sk_c10) | equal(inverse(sk_c4),sk_c10).
% 633840 [hyper:633783,633799,binarycut:633791] equal(inverse(sk_c4),sk_c10).
% 633842 [hyper:633783,633799,binarycut:633798] equal(inverse(sk_c3),sk_c10).
% 633862 [hyper:633783,633790,demod:633842,cut:633779] equal(multiply(sk_c4,sk_c9),sk_c10).
% 633864 [hyper:633783,633862,demod:633840,cut:633779] 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 25
% 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(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c9),sk_c10) | -equal(inverse(Z),sk_c10) | -equal(multiply(Z,sk_c9),sk_c10) | -equal(inverse(U),sk_c10) | -equal(multiply(U,sk_c9),sk_c10) | -equal(multiply(V,W),sk_c9) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(sk_c10,X1),sk_c9) | -equal(multiply(X2,sk_c10),X1) | -equal(inverse(X2),sk_c10).
% Split part used next: -equal(multiply(X,Y),sk_c10) | -equal(inverse(X),Y) | -equal(multiply(Y,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 25
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(45,40,1,96,0,1,294020,4,1385,298506,5,1502,298506,1,1502,298506,50,1502,298506,40,1502,298557,0,1502,307299,3,1803,308258,4,1953,309623,1,2103,309623,50,2103,309623,40,2103,309674,0,2103,312144,3,2407,313040,4,2554,313050,5,2704,313050,1,2704,313050,50,2704,313050,40,2704,313101,0,2704,348428,3,4212,349127,4,4955,349790,5,5705,349791,1,5705,349791,50,5707,349791,40,5707,349842,0,5707,366892,3,6460,367700,4,6833,368580,5,7208,368581,1,7208,368581,50,7208,368581,40,7208,368632,0,7208,384861,3,7974,385525,4,8334,386620,1,8709,386620,50,8709,386620,40,8709,386671,0,8709,467358,3,12612,468290,4,14560,468993,5,16511,468994,1,16511,468994,50,16513,468994,40,16513,469045,0,16513,528531,3,19064,529475,4,20339,530256,1,21614,530256,50,21616,530256,40,21616,530307,0,21617,565100,3,23119,565978,4,23868,566984,5,24618,566985,1,24618,566985,50,24619,566985,40,24619,567036,0,24619,582065,3,25373,583202,4,25745,584317,5,26120,584318,1,26120,584318,50,26120,584318,40,26120,584369,0,26120,610920,3,27321,611899,4,27921,612764,5,28521,612765,1,28521,612765,50,28522,612765,40,28522,612816,0,28522,631597,3,29273,632498,4,29648,633303,1,30023,633303,50,30023,633303,40,30023,633303,40,30023,633348,0,30023,633507,50,30024,633507,30,30024,633507,40,30024,633552,0,30024,633693,50,30024,633693,30,30024,633693,40,30024,633738,0,30029,633778,50,30029,633778,30,30029,633778,40,30029,633823,0,30029,633863,50,30029,633863,30,30029,633863,40,30029,633908,0,30029)
%
%
% START OF PROOF
% 633864 [] equal(X,X).
% 633865 [] equal(multiply(identity,X),X).
% 633866 [] equal(multiply(inverse(X),X),identity).
% 633867 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 633868 [] -equal(multiply(X,sk_c9),sk_c10) | -equal(multiply(Y,X),sk_c10) | -equal(inverse(Y),X).
% 633885 [?] ?
% 633886 [?] ?
% 633887 [?] ?
% 633889 [?] ?
% 633890 [?] ?
% 633891 [?] ?
% 633892 [?] ?
% 633893 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c7),sk_c10).
% 633894 [] equal(multiply(sk_c7,sk_c10),sk_c8) | equal(inverse(sk_c1),sk_c2).
% 633895 [] equal(multiply(sk_c10,sk_c8),sk_c9) | equal(inverse(sk_c1),sk_c2).
% 633897 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c5),sk_c6).
% 633898 [] equal(multiply(sk_c5,sk_c6),sk_c9) | equal(inverse(sk_c1),sk_c2).
% 633899 [] equal(multiply(sk_c4,sk_c9),sk_c10) | equal(inverse(sk_c1),sk_c2).
% 633900 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c4),sk_c10).
% 633901 [?] ?
% 633902 [?] ?
% 633903 [?] ?
% 633905 [?] ?
% 633906 [?] ?
% 633907 [?] ?
% 633908 [?] ?
% 633925 [hyper:633868,633893,binarycut:633901,binarycut:633885] equal(inverse(sk_c7),sk_c10).
% 633929 [para:633925.1.1,633866.1.1.1] equal(multiply(sk_c10,sk_c7),identity).
% 633938 [hyper:633868,633897,binarycut:633905,binarycut:633889] equal(inverse(sk_c5),sk_c6).
% 633946 [hyper:633868,633900,binarycut:633908,binarycut:633892] equal(inverse(sk_c4),sk_c10).
% 633950 [para:633946.1.1,633866.1.1.1] equal(multiply(sk_c10,sk_c4),identity).
% 633983 [hyper:633868,633894,binarycut:633902,binarycut:633886] equal(multiply(sk_c7,sk_c10),sk_c8).
% 633986 [hyper:633868,633895,binarycut:633903,binarycut:633887] equal(multiply(sk_c10,sk_c8),sk_c9).
% 633997 [hyper:633868,633898,binarycut:633906,binarycut:633890] equal(multiply(sk_c5,sk_c6),sk_c9).
% 634011 [hyper:633868,633899,binarycut:633907,binarycut:633891] equal(multiply(sk_c4,sk_c9),sk_c10).
% 634018 [para:633866.1.1,633867.1.1.1,demod:633865] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 634019 [para:633929.1.1,633867.1.1.1,demod:633865] equal(X,multiply(sk_c10,multiply(sk_c7,X))).
% 634029 [para:633983.1.1,634019.1.2.2,demod:633986] equal(sk_c10,sk_c9).
% 634042 [para:633997.1.1,634018.1.2.2,demod:633938] equal(sk_c6,multiply(sk_c6,sk_c9)).
% 634048 [para:634042.1.2,634018.1.2.2,demod:633866] equal(sk_c9,identity).
% 634054 [para:634048.1.1,634029.1.2] equal(sk_c10,identity).
% 634060 [para:634054.1.1,633929.1.1.1,demod:633865] equal(sk_c7,identity).
% 634061 [para:634054.1.1,633950.1.1.1,demod:633865] equal(sk_c4,identity).
% 634065 [para:634060.1.1,633925.1.1.1] equal(inverse(identity),sk_c10).
% 634067 [para:634060.1.1,634019.1.2.2.1,demod:633865] equal(X,multiply(sk_c10,X)).
% 634068 [para:634061.1.1,634011.1.1.1,demod:633865] equal(sk_c9,sk_c10).
% 634073 [hyper:633868,634065,demod:634067,633865,cut:633864,cut:634068] 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 25
% clause depth limited to 3
% seconds given: 6
%
%
% Split attempt finished with SUCCESS.
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 27573
% derived clauses: 5857006
% kept clauses: 290834
% kept size sum: 956
% kept mid-nuclei: 283086
% kept new demods: 646
% forw unit-subs: 1840820
% forw double-subs: 2850009
% forw overdouble-subs: 511051
% backward subs: 5968
% fast unit cutoff: 29657
% full unit cutoff: 0
% dbl unit cutoff: 16722
% real runtime : 302.44
% process. runtime: 300.29
% specific non-discr-tree subsumption statistics:
% tried: 32147759
% length fails: 3042091
% strength fails: 12664423
% predlist fails: 1967481
% aux str. fails: 3331505
% by-lit fails: 3967220
% full subs tried: 3970944
% full subs fail: 3806705
%
% ; 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/GRP210-1+eq_r.in")
%
%------------------------------------------------------------------------------