TSTP Solution File: GRP238-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP238-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 : art08.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.7s
% Output : Assurance 298.7s
% 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/GRP238-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 31)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 31)
% (binary-posweight-lex-big-order 30 #f 3 31)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% was split for some strategies as:
% -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10).
% -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11).
% -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11).
% -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11).
% -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11).
% -equal(inverse(sk_c11),sk_c10).
%
% Starting a split proof attempt with 7 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% Split part used next: -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031)
%
%
% START OF PROOF
% 353945 [] equal(multiply(identity,X),X).
% 353946 [] equal(multiply(inverse(X),X),identity).
% 353947 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 353948 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c10).
% 353949 [?] ?
% 353950 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c9),sk_c10).
% 353959 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c9,sk_c11),sk_c10).
% 353960 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(inverse(sk_c9),sk_c10).
% 353969 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(multiply(sk_c9,sk_c11),sk_c10).
% 353970 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(inverse(sk_c9),sk_c10).
% 353979 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c9,sk_c11),sk_c10).
% 353980 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(inverse(sk_c9),sk_c10).
% 353989 [?] ?
% 353990 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c9),sk_c10).
% 353999 [?] ?
% 354000 [] equal(inverse(sk_c11),sk_c10) | equal(inverse(sk_c9),sk_c10).
% 354011 [hyper:353948,353950,binarycut:353949] equal(inverse(sk_c2),sk_c11).
% 354012 [para:354011.1.1,353946.1.1.1] equal(multiply(sk_c11,sk_c2),identity).
% 354016 [hyper:353948,353990,binarycut:353989] equal(inverse(sk_c1),sk_c11).
% 354020 [para:354016.1.1,353946.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 354024 [hyper:353948,354000,binarycut:353999] equal(inverse(sk_c11),sk_c10).
% 354027 [para:354024.1.1,353946.1.1.1] equal(multiply(sk_c10,sk_c11),identity).
% 354031 [hyper:353948,353960,353959] equal(multiply(sk_c2,sk_c11),sk_c3).
% 354038 [hyper:353948,353969,353970] equal(multiply(sk_c11,sk_c3),sk_c10).
% 354046 [hyper:353948,353979,353980] equal(multiply(sk_c1,sk_c10),sk_c11).
% 354047 [para:353946.1.1,353947.1.1.1,demod:353945] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 354048 [para:354012.1.1,353947.1.1.1,demod:353945] equal(X,multiply(sk_c11,multiply(sk_c2,X))).
% 354049 [para:354020.1.1,353947.1.1.1,demod:353945] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 354054 [para:354031.1.1,354048.1.2.2,demod:354038] equal(sk_c11,sk_c10).
% 354057 [para:354054.1.1,354024.1.1.1] equal(inverse(sk_c10),sk_c10).
% 354065 [para:354012.1.1,354047.1.2.2,demod:354024] equal(sk_c2,multiply(sk_c10,identity)).
% 354067 [para:354027.1.1,354047.1.2.2,demod:354065,354057] equal(sk_c11,sk_c2).
% 354070 [para:354048.1.2,354047.1.2.2,demod:354024] equal(multiply(sk_c2,X),multiply(sk_c10,X)).
% 354073 [para:354049.1.2,354047.1.2.2,demod:354070,354024] equal(multiply(sk_c1,X),multiply(sk_c2,X)).
% 354074 [para:354067.1.1,354012.1.1.1,demod:354073] equal(multiply(sk_c1,sk_c2),identity).
% 354078 [para:354067.1.1,354054.1.1] equal(sk_c2,sk_c10).
% 354082 [para:354078.1.2,354046.1.1.2,demod:354074] equal(identity,sk_c11).
% 354085 [para:354082.1.2,354024.1.1.1] equal(inverse(identity),sk_c10).
% 354108 [hyper:353948,354085,demod:353945,cut:354054] 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% Split part used next: -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,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 31
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031,354107,50,30031,354107,30,30031,354107,40,30031,354172,0,30031)
%
%
% START OF PROOF
% 354108 [] equal(X,X).
% 354109 [] equal(multiply(identity,X),X).
% 354110 [] equal(multiply(inverse(X),X),identity).
% 354111 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 354112 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(multiply(Y,X),sk_c10) | -equal(inverse(Y),X).
% 354115 [?] ?
% 354116 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 354117 [?] ?
% 354125 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c8,sk_c11),sk_c10).
% 354126 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(inverse(sk_c7),sk_c8).
% 354127 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 354135 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(multiply(sk_c8,sk_c11),sk_c10).
% 354136 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(inverse(sk_c7),sk_c8).
% 354137 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 354145 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c8,sk_c11),sk_c10).
% 354146 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 354147 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 354155 [?] ?
% 354156 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 354157 [?] ?
% 354165 [?] ?
% 354166 [] equal(inverse(sk_c11),sk_c10) | equal(inverse(sk_c7),sk_c8).
% 354167 [?] ?
% 354181 [hyper:354112,354116,binarycut:354117,binarycut:354115] equal(inverse(sk_c2),sk_c11).
% 354184 [para:354181.1.1,354110.1.1.1] equal(multiply(sk_c11,sk_c2),identity).
% 354199 [hyper:354112,354156,binarycut:354157,binarycut:354155] equal(inverse(sk_c1),sk_c11).
% 354202 [para:354199.1.1,354110.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 354212 [hyper:354112,354166,binarycut:354167,binarycut:354165] equal(inverse(sk_c11),sk_c10).
% 354218 [para:354212.1.1,354110.1.1.1] equal(multiply(sk_c10,sk_c11),identity).
% 354261 [hyper:354112,354127,354125,354126] equal(multiply(sk_c2,sk_c11),sk_c3).
% 354290 [hyper:354112,354137,354135,354136] equal(multiply(sk_c11,sk_c3),sk_c10).
% 354308 [hyper:354112,354147,354145,354146] equal(multiply(sk_c1,sk_c10),sk_c11).
% 354309 [para:354110.1.1,354111.1.1.1,demod:354109] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 354310 [para:354184.1.1,354111.1.1.1,demod:354109] equal(X,multiply(sk_c11,multiply(sk_c2,X))).
% 354311 [para:354202.1.1,354111.1.1.1,demod:354109] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 354318 [para:354261.1.1,354310.1.2.2,demod:354290] equal(sk_c11,sk_c10).
% 354321 [para:354318.1.1,354212.1.1.1] equal(inverse(sk_c10),sk_c10).
% 354331 [para:354184.1.1,354309.1.2.2,demod:354212] equal(sk_c2,multiply(sk_c10,identity)).
% 354333 [para:354218.1.1,354309.1.2.2,demod:354331,354321] equal(sk_c11,sk_c2).
% 354336 [para:354310.1.2,354309.1.2.2,demod:354212] equal(multiply(sk_c2,X),multiply(sk_c10,X)).
% 354341 [para:354311.1.2,354309.1.2.2,demod:354336,354212] equal(multiply(sk_c1,X),multiply(sk_c2,X)).
% 354342 [para:354333.1.1,354184.1.1.1,demod:354341] equal(multiply(sk_c1,sk_c2),identity).
% 354346 [para:354333.1.1,354318.1.1] equal(sk_c2,sk_c10).
% 354352 [para:354346.1.2,354308.1.1.2,demod:354342] equal(identity,sk_c11).
% 354355 [para:354352.1.2,354212.1.1.1] equal(inverse(identity),sk_c10).
% 354359 [para:354352.1.2,354318.1.1] equal(identity,sk_c10).
% 354378 [hyper:354112,354355,demod:354218,354109,cut:354108,cut:354359] 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% Split part used next: -equal(inverse(W),sk_c11) | -equal(multiply(W,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 31
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031,354107,50,30031,354107,30,30031,354107,40,30031,354172,0,30031,354377,50,30032,354377,30,30032,354377,40,30032,354442,0,30038)
%
%
% START OF PROOF
% 354378 [] equal(X,X).
% 354382 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(inverse(X),sk_c11).
% 354418 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c6,sk_c10),sk_c11).
% 354419 [?] ?
% 354428 [?] ?
% 354429 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c6),sk_c11).
% 354468 [hyper:354382,354429,binarycut:354419] equal(inverse(sk_c6),sk_c11).
% 354470 [hyper:354382,354429,binarycut:354428] equal(inverse(sk_c1),sk_c11).
% 354504 [hyper:354382,354418,demod:354470,cut:354378] equal(multiply(sk_c6,sk_c10),sk_c11).
% 354519 [hyper:354382,354504,demod:354468,cut:354378] 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% Split part used next: -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,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 31
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031,354107,50,30031,354107,30,30031,354107,40,30031,354172,0,30031,354377,50,30032,354377,30,30032,354377,40,30032,354442,0,30038,354518,50,30038,354518,30,30038,354518,40,30038,354583,0,30038)
%
%
% START OF PROOF
% 354520 [] equal(multiply(identity,X),X).
% 354521 [] equal(multiply(inverse(X),X),identity).
% 354522 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 354523 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,X),sk_c11) | -equal(inverse(Y),X).
% 354531 [?] ?
% 354532 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c4),sk_c5).
% 354533 [?] ?
% 354541 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c5,sk_c10),sk_c11).
% 354542 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(inverse(sk_c4),sk_c5).
% 354543 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c4,sk_c5),sk_c11).
% 354551 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(multiply(sk_c5,sk_c10),sk_c11).
% 354552 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(inverse(sk_c4),sk_c5).
% 354553 [] equal(multiply(sk_c11,sk_c3),sk_c10) | equal(multiply(sk_c4,sk_c5),sk_c11).
% 354561 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c5,sk_c10),sk_c11).
% 354562 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(inverse(sk_c4),sk_c5).
% 354563 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c4,sk_c5),sk_c11).
% 354571 [?] ?
% 354572 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c4),sk_c5).
% 354573 [?] ?
% 354581 [?] ?
% 354582 [] equal(inverse(sk_c11),sk_c10) | equal(inverse(sk_c4),sk_c5).
% 354583 [?] ?
% 354601 [hyper:354523,354532,binarycut:354533,binarycut:354531] equal(inverse(sk_c2),sk_c11).
% 354604 [para:354601.1.1,354521.1.1.1] equal(multiply(sk_c11,sk_c2),identity).
% 354625 [hyper:354523,354572,binarycut:354573,binarycut:354571] equal(inverse(sk_c1),sk_c11).
% 354628 [para:354625.1.1,354521.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 354651 [hyper:354523,354582,binarycut:354583,binarycut:354581] equal(inverse(sk_c11),sk_c10).
% 354654 [para:354651.1.1,354521.1.1.1] equal(multiply(sk_c10,sk_c11),identity).
% 354721 [hyper:354523,354543,354541,354542] equal(multiply(sk_c2,sk_c11),sk_c3).
% 354739 [hyper:354523,354553,354551,354552] equal(multiply(sk_c11,sk_c3),sk_c10).
% 354779 [hyper:354523,354563,354561,354562] equal(multiply(sk_c1,sk_c10),sk_c11).
% 354786 [para:354521.1.1,354522.1.1.1,demod:354520] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 354787 [para:354604.1.1,354522.1.1.1,demod:354520] equal(X,multiply(sk_c11,multiply(sk_c2,X))).
% 354788 [para:354628.1.1,354522.1.1.1,demod:354520] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 354795 [para:354721.1.1,354787.1.2.2,demod:354739] equal(sk_c11,sk_c10).
% 354798 [para:354795.1.1,354651.1.1.1] equal(inverse(sk_c10),sk_c10).
% 354799 [para:354795.1.1,354654.1.1.2] equal(multiply(sk_c10,sk_c10),identity).
% 354808 [para:354604.1.1,354786.1.2.2,demod:354651] equal(sk_c2,multiply(sk_c10,identity)).
% 354810 [para:354654.1.1,354786.1.2.2,demod:354808,354798] equal(sk_c11,sk_c2).
% 354813 [para:354787.1.2,354786.1.2.2,demod:354651] equal(multiply(sk_c2,X),multiply(sk_c10,X)).
% 354818 [para:354788.1.2,354786.1.2.2,demod:354813,354651] equal(multiply(sk_c1,X),multiply(sk_c2,X)).
% 354819 [para:354810.1.1,354604.1.1.1,demod:354818] equal(multiply(sk_c1,sk_c2),identity).
% 354823 [para:354810.1.1,354795.1.1] equal(sk_c2,sk_c10).
% 354829 [para:354823.1.2,354779.1.1.2,demod:354819] equal(identity,sk_c11).
% 354830 [para:354829.1.2,354604.1.1.1,demod:354520] equal(sk_c2,identity).
% 354832 [para:354829.1.2,354651.1.1.1] equal(inverse(identity),sk_c10).
% 354838 [para:354830.1.1,354601.1.1.1,demod:354832] equal(sk_c10,sk_c11).
% 354855 [hyper:354523,354832,demod:354799,354520,cut:354838,cut:354829] 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% Split part used next: -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 31
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031,354107,50,30031,354107,30,30031,354107,40,30031,354172,0,30031,354377,50,30032,354377,30,30032,354377,40,30032,354442,0,30038,354518,50,30038,354518,30,30038,354518,40,30038,354583,0,30038,354854,50,30038,354854,30,30038,354854,40,30038,354919,0,30042)
%
%
% START OF PROOF
% 354855 [] equal(X,X).
% 354856 [] equal(multiply(identity,X),X).
% 354857 [] equal(multiply(inverse(X),X),identity).
% 354858 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 354859 [] -equal(multiply(sk_c11,X),sk_c10) | -equal(multiply(Y,sk_c11),X) | -equal(inverse(Y),sk_c11).
% 354860 [] equal(multiply(sk_c9,sk_c11),sk_c10) | equal(inverse(sk_c2),sk_c11).
% 354861 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c9),sk_c10).
% 354862 [] equal(multiply(sk_c8,sk_c11),sk_c10) | equal(inverse(sk_c2),sk_c11).
% 354863 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 354864 [] equal(multiply(sk_c7,sk_c8),sk_c10) | equal(inverse(sk_c2),sk_c11).
% 354865 [] equal(multiply(sk_c6,sk_c10),sk_c11) | equal(inverse(sk_c2),sk_c11).
% 354866 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c6),sk_c11).
% 354870 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c9,sk_c11),sk_c10).
% 354871 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(inverse(sk_c9),sk_c10).
% 354872 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c8,sk_c11),sk_c10).
% 354873 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(inverse(sk_c7),sk_c8).
% 354874 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 354875 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(multiply(sk_c6,sk_c10),sk_c11).
% 354876 [] equal(multiply(sk_c2,sk_c11),sk_c3) | equal(inverse(sk_c6),sk_c11).
% 354880 [?] ?
% 354881 [?] ?
% 354882 [?] ?
% 354883 [?] ?
% 354884 [?] ?
% 354885 [?] ?
% 354886 [?] ?
% 355012 [hyper:354859,354871,binarycut:354881,binarycut:354861] equal(inverse(sk_c9),sk_c10).
% 355019 [hyper:354859,354870,354860,binarycut:354880] equal(multiply(sk_c9,sk_c11),sk_c10).
% 355022 [para:355012.1.1,354857.1.1.1] equal(multiply(sk_c10,sk_c9),identity).
% 355027 [hyper:354859,354873,binarycut:354883,binarycut:354863] equal(inverse(sk_c7),sk_c8).
% 355028 [para:355027.1.1,354857.1.1.1] equal(multiply(sk_c8,sk_c7),identity).
% 355034 [hyper:354859,354872,354862,binarycut:354882] equal(multiply(sk_c8,sk_c11),sk_c10).
% 355041 [hyper:354859,354876,binarycut:354886,binarycut:354866] equal(inverse(sk_c6),sk_c11).
% 355048 [para:355041.1.1,354857.1.1.1] equal(multiply(sk_c11,sk_c6),identity).
% 355055 [hyper:354859,354874,354864,binarycut:354884] equal(multiply(sk_c7,sk_c8),sk_c10).
% 355063 [hyper:354859,354875,354865,binarycut:354885] equal(multiply(sk_c6,sk_c10),sk_c11).
% 355078 [para:354857.1.1,354858.1.1.1,demod:354856] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 355080 [para:355022.1.1,354858.1.1.1,demod:354856] equal(X,multiply(sk_c10,multiply(sk_c9,X))).
% 355081 [para:355028.1.1,354858.1.1.1,demod:354856] equal(X,multiply(sk_c8,multiply(sk_c7,X))).
% 355083 [para:355048.1.1,354858.1.1.1,demod:354856] equal(X,multiply(sk_c11,multiply(sk_c6,X))).
% 355084 [para:355055.1.1,354858.1.1.1] equal(multiply(sk_c10,X),multiply(sk_c7,multiply(sk_c8,X))).
% 355091 [para:355019.1.1,355080.1.2.2] equal(sk_c11,multiply(sk_c10,sk_c10)).
% 355095 [para:355055.1.1,355081.1.2.2] equal(sk_c8,multiply(sk_c8,sk_c10)).
% 355096 [para:355095.1.2,354858.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c8,multiply(sk_c10,X))).
% 355099 [para:355063.1.1,355083.1.2.2] equal(sk_c10,multiply(sk_c11,sk_c11)).
% 355108 [para:355022.1.1,355078.1.2.2] equal(sk_c9,multiply(inverse(sk_c10),identity)).
% 355109 [para:355028.1.1,355078.1.2.2] equal(sk_c7,multiply(inverse(sk_c8),identity)).
% 355110 [para:355034.1.1,355078.1.2.2] equal(sk_c11,multiply(inverse(sk_c8),sk_c10)).
% 355115 [para:355081.1.2,355078.1.2.2] equal(multiply(sk_c7,X),multiply(inverse(sk_c8),X)).
% 355131 [para:355115.1.2,354857.1.1,demod:355055] equal(sk_c10,identity).
% 355133 [para:355115.1.2,355078.1.2,demod:355084] equal(X,multiply(sk_c10,X)).
% 355139 [para:355131.1.1,355080.1.2.1,demod:354856] equal(X,multiply(sk_c9,X)).
% 355140 [para:355131.1.1,355091.1.2.1,demod:354856] equal(sk_c11,sk_c10).
% 355141 [para:355131.1.1,355095.1.2.2] equal(sk_c8,multiply(sk_c8,identity)).
% 355142 [para:355131.1.1,355110.1.2.2,demod:355109] equal(sk_c11,sk_c7).
% 355148 [para:355140.1.1,355099.1.2.1,demod:355133] equal(sk_c10,sk_c11).
% 355149 [para:355140.1.1,355099.1.2.2] equal(sk_c10,multiply(sk_c11,sk_c10)).
% 355153 [para:355142.1.1,355019.1.1.2,demod:355139] equal(sk_c7,sk_c10).
% 355183 [para:355153.1.2,355108.1.2.1.1,demod:355141,355027] equal(sk_c9,sk_c8).
% 355220 [para:355183.1.1,355012.1.1.1] equal(inverse(sk_c8),sk_c10).
% 355229 [hyper:354859,355096,demod:355220,355149,355034,355133,cut:354855,cut:355148] 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 6 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031,354107,50,30031,354107,30,30031,354107,40,30031,354172,0,30031,354377,50,30032,354377,30,30032,354377,40,30032,354442,0,30038,354518,50,30038,354518,30,30038,354518,40,30038,354583,0,30038,354854,50,30038,354854,30,30038,354854,40,30038,354919,0,30042,355228,50,30043,355228,30,30043,355228,40,30043,355293,0,30043)
%
%
% START OF PROOF
% 355229 [] equal(X,X).
% 355233 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(inverse(X),sk_c11).
% 355269 [] equal(multiply(sk_c1,sk_c10),sk_c11) | equal(multiply(sk_c6,sk_c10),sk_c11).
% 355270 [?] ?
% 355279 [?] ?
% 355280 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c6),sk_c11).
% 355319 [hyper:355233,355280,binarycut:355270] equal(inverse(sk_c6),sk_c11).
% 355321 [hyper:355233,355280,binarycut:355279] equal(inverse(sk_c1),sk_c11).
% 355355 [hyper:355233,355269,demod:355321,cut:355229] equal(multiply(sk_c6,sk_c10),sk_c11).
% 355370 [hyper:355233,355355,demod:355319,cut:355229] 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 31
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 7 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(sk_c11,Y),sk_c10) | -equal(multiply(Z,sk_c11),Y) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,V),sk_c11) | -equal(inverse(U),V) | -equal(multiply(V,sk_c10),sk_c11) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c11),sk_c10) | -equal(inverse(X3),sk_c10) | -equal(multiply(X3,sk_c11),sk_c10).
% Split part used next: -equal(inverse(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 31
% 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 31
% 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 31
% 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 31
% 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 31
% 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 31
% 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 31
% 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 31
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,137,0,0,91066,5,1501,91066,1,1501,91066,50,1501,91066,40,1501,91138,0,1501,91692,5,2103,91696,1,2104,91696,50,2104,91696,40,2104,91768,0,2104,92311,5,2708,92317,1,2709,92317,50,2709,92317,40,2709,92389,0,2709,114815,3,4215,115878,4,4960,117135,5,5710,117136,1,5710,117136,50,5710,117136,40,5710,117208,0,5710,137136,3,6462,137683,4,6836,138417,5,7211,138418,1,7211,138418,50,7212,138418,40,7212,138490,0,7212,139467,5,8718,139467,1,8718,139467,50,8718,139467,40,8718,139539,0,8718,211562,3,12621,212360,4,14570,213187,5,16519,213188,1,16519,213188,50,16521,213188,40,16521,213260,0,16521,263323,3,19072,264251,4,20347,265017,1,21622,265017,50,21624,265017,40,21624,265089,0,21624,296644,3,23153,297758,4,23875,298638,1,24625,298638,50,24626,298638,40,24626,298710,0,24626,299664,5,26127,299664,1,26127,299664,50,26127,299664,40,26127,299736,0,26127,323332,3,27353,324408,4,27928,325435,5,28528,325436,1,28528,325436,50,28529,325436,40,28529,325508,0,28529,352690,3,29281,353322,4,29655,353942,5,30030,353943,1,30030,353943,50,30031,353943,40,30031,353943,40,30031,354008,0,30031,354107,50,30031,354107,30,30031,354107,40,30031,354172,0,30031,354377,50,30032,354377,30,30032,354377,40,30032,354442,0,30038,354518,50,30038,354518,30,30038,354518,40,30038,354583,0,30038,354854,50,30038,354854,30,30038,354854,40,30038,354919,0,30042,355228,50,30043,355228,30,30043,355228,40,30043,355293,0,30043,355369,50,30043,355369,30,30043,355369,40,30043,355434,0,30048,355658,50,30051,355723,0,30051,355999,50,30057,356064,0,30061,356348,50,30069,356413,0,30069,356705,50,30079,356770,0,30084,357068,50,30098,357133,0,30098,357439,50,30121,357504,0,30126,357818,50,30165,357883,0,30165,358207,50,30243,358207,40,30243,358272,0,30243)
%
%
% START OF PROOF
% 358045 [?] ?
% 358209 [] equal(multiply(identity,X),X).
% 358210 [] equal(multiply(inverse(X),X),identity).
% 358211 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 358212 [] -equal(inverse(sk_c11),sk_c10).
% 358265 [?] ?
% 358266 [?] ?
% 358267 [?] ?
% 358303 [input:358266,cut:358212] equal(inverse(sk_c7),sk_c8).
% 358304 [para:358303.1.1,358210.1.1.1] equal(multiply(sk_c8,sk_c7),identity).
% 358347 [input:358265,cut:358212] equal(multiply(sk_c8,sk_c11),sk_c10).
% 358348 [input:358267,cut:358212] equal(multiply(sk_c7,sk_c8),sk_c10).
% 358378 [para:358210.1.1,358211.1.1.1,demod:358209] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 358383 [para:358304.1.1,358211.1.1.1,demod:358209] equal(X,multiply(sk_c8,multiply(sk_c7,X))).
% 358458 [para:358348.1.1,358383.1.2.2] equal(sk_c8,multiply(sk_c8,sk_c10)).
% 358478 [para:358304.1.1,358378.1.2.2] equal(sk_c7,multiply(inverse(sk_c8),identity)).
% 358519 [para:358347.1.1,358378.1.2.2] equal(sk_c11,multiply(inverse(sk_c8),sk_c10)).
% 358554 [para:358383.1.2,358378.1.2.2] equal(multiply(sk_c7,X),multiply(inverse(sk_c8),X)).
% 358555 [para:358458.1.2,358378.1.2.2,demod:358554] equal(sk_c10,multiply(sk_c7,sk_c8)).
% 358591 [para:358554.1.2,358210.1.1,demod:358555] equal(sk_c10,identity).
% 358612 [para:358591.1.1,358519.1.2.2,demod:358478] equal(sk_c11,sk_c7).
% 358652 [para:358612.1.1,358212.1.1.1,cut:358045] 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: 20577
% derived clauses: 2620052
% kept clauses: 233693
% kept size sum: 17181
% kept mid-nuclei: 90670
% kept new demods: 2542
% forw unit-subs: 759773
% forw double-subs: 1237632
% forw overdouble-subs: 219767
% backward subs: 3659
% fast unit cutoff: 8672
% full unit cutoff: 0
% dbl unit cutoff: 3737
% real runtime : 304.9
% process. runtime: 302.45
% specific non-discr-tree subsumption statistics:
% tried: 154205423
% length fails: 18385973
% strength fails: 50492935
% predlist fails: 143166
% aux str. fails: 11960431
% by-lit fails: 41232980
% full subs tried: 6551247
% full subs fail: 6365694
%
% ; 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/GRP238-1+eq_r.in")
%
%------------------------------------------------------------------------------