TSTP Solution File: GRP710+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP710+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Sat Jul 16 07:39:12 EDT 2022
% Result : Theorem 0.40s 1.07s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP710+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jun 13 20:06:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/1.07 *** allocated 10000 integers for termspace/termends
% 0.40/1.07 *** allocated 10000 integers for clauses
% 0.40/1.07 *** allocated 10000 integers for justifications
% 0.40/1.07 Bliksem 1.12
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Automatic Strategy Selection
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Clauses:
% 0.40/1.07
% 0.40/1.07 { mult( X, unit ) = X }.
% 0.40/1.07 { mult( unit, X ) = X }.
% 0.40/1.07 { mult( Z, mult( Y, mult( Y, X ) ) ) = mult( mult( mult( Z, Y ), Y ), X ) }
% 0.40/1.07 .
% 0.40/1.07 { mult( X, i( X ) ) = unit }.
% 0.40/1.07 { mult( i( X ), X ) = unit }.
% 0.40/1.07 { ! mult( skol1, X ) = skol2, ! mult( Y, skol4 ) = skol3 }.
% 0.40/1.07
% 0.40/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.40/1.07 This is a pure equality problem
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Options Used:
% 0.40/1.07
% 0.40/1.07 useres = 1
% 0.40/1.07 useparamod = 1
% 0.40/1.07 useeqrefl = 1
% 0.40/1.07 useeqfact = 1
% 0.40/1.07 usefactor = 1
% 0.40/1.07 usesimpsplitting = 0
% 0.40/1.07 usesimpdemod = 5
% 0.40/1.07 usesimpres = 3
% 0.40/1.07
% 0.40/1.07 resimpinuse = 1000
% 0.40/1.07 resimpclauses = 20000
% 0.40/1.07 substype = eqrewr
% 0.40/1.07 backwardsubs = 1
% 0.40/1.07 selectoldest = 5
% 0.40/1.07
% 0.40/1.07 litorderings [0] = split
% 0.40/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.40/1.07
% 0.40/1.07 termordering = kbo
% 0.40/1.07
% 0.40/1.07 litapriori = 0
% 0.40/1.07 termapriori = 1
% 0.40/1.07 litaposteriori = 0
% 0.40/1.07 termaposteriori = 0
% 0.40/1.07 demodaposteriori = 0
% 0.40/1.07 ordereqreflfact = 0
% 0.40/1.07
% 0.40/1.07 litselect = negord
% 0.40/1.07
% 0.40/1.07 maxweight = 15
% 0.40/1.07 maxdepth = 30000
% 0.40/1.07 maxlength = 115
% 0.40/1.07 maxnrvars = 195
% 0.40/1.07 excuselevel = 1
% 0.40/1.07 increasemaxweight = 1
% 0.40/1.07
% 0.40/1.07 maxselected = 10000000
% 0.40/1.07 maxnrclauses = 10000000
% 0.40/1.07
% 0.40/1.07 showgenerated = 0
% 0.40/1.07 showkept = 0
% 0.40/1.07 showselected = 0
% 0.40/1.07 showdeleted = 0
% 0.40/1.07 showresimp = 1
% 0.40/1.07 showstatus = 2000
% 0.40/1.07
% 0.40/1.07 prologoutput = 0
% 0.40/1.07 nrgoals = 5000000
% 0.40/1.07 totalproof = 1
% 0.40/1.07
% 0.40/1.07 Symbols occurring in the translation:
% 0.40/1.07
% 0.40/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.40/1.07 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.40/1.07 ! [4, 1] (w:0, o:20, a:1, s:1, b:0),
% 0.40/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.07 unit [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.40/1.07 mult [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.40/1.07 i [40, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.40/1.07 skol1 [47, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.40/1.07 skol2 [48, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.40/1.07 skol3 [49, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.40/1.07 skol4 [50, 0] (w:1, o:19, a:1, s:1, b:1).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Starting Search:
% 0.40/1.07
% 0.40/1.07 *** allocated 15000 integers for clauses
% 0.40/1.07
% 0.40/1.07 Bliksems!, er is een bewijs:
% 0.40/1.07 % SZS status Theorem
% 0.40/1.07 % SZS output start Refutation
% 0.40/1.07
% 0.40/1.07 (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) ) ==> mult(
% 0.40/1.07 mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 (3) {G0,W6,D4,L1,V1,M1} I { mult( X, i( X ) ) ==> unit }.
% 0.40/1.07 (4) {G0,W6,D4,L1,V1,M1} I { mult( i( X ), X ) ==> unit }.
% 0.40/1.07 (5) {G0,W10,D3,L2,V2,M2} I { ! mult( skol1, X ) ==> skol2, ! mult( Y, skol4
% 0.40/1.07 ) ==> skol3 }.
% 0.40/1.07 (8) {G1,W23,D7,L1,V4,M1} P(2,2);d(2) { mult( T, mult( X, mult( mult( mult(
% 0.40/1.07 X, Y ), Y ), Z ) ) ) ==> mult( mult( mult( mult( mult( T, X ), X ), Y ),
% 0.40/1.07 Y ), Z ) }.
% 0.40/1.07 (9) {G1,W12,D5,L1,V2,M1} P(3,2);d(0) { mult( mult( mult( Y, X ), X ), i( X
% 0.40/1.07 ) ) ==> mult( Y, X ) }.
% 0.40/1.07 (11) {G1,W14,D6,L1,V2,M1} P(4,2);d(0) { mult( mult( mult( Y, i( X ) ), i( X
% 0.40/1.07 ) ), X ) ==> mult( Y, i( X ) ) }.
% 0.40/1.07 (13) {G1,W11,D4,L1,V2,M1} P(2,1);d(1) { mult( X, mult( X, Y ) ) ==> mult(
% 0.40/1.07 mult( X, X ), Y ) }.
% 0.40/1.07 (27) {G2,W15,D5,L1,V3,M1} P(1,8);d(1);d(0);d(0) { mult( Z, mult( mult( X, X
% 0.40/1.07 ), Y ) ) ==> mult( mult( mult( Z, X ), X ), Y ) }.
% 0.40/1.07 (37) {G2,W8,D4,L1,V1,M1} P(1,9) { mult( mult( X, X ), i( X ) ) ==> X }.
% 0.40/1.07 (38) {G3,W5,D4,L1,V1,M1} P(37,9);d(3);d(1) { i( i( X ) ) ==> X }.
% 0.40/1.07 (49) {G4,W12,D5,L1,V2,M1} P(11,11);d(38) { mult( mult( mult( X, Y ), i( Y )
% 0.40/1.07 ), Y ) ==> mult( X, Y ) }.
% 0.40/1.07 (53) {G2,W11,D4,L2,V2,M2} P(11,5) { ! mult( skol1, Y ) ==> skol2, ! mult( X
% 0.40/1.07 , i( skol4 ) ) ==> skol3 }.
% 0.40/1.07 (109) {G3,W12,D5,L1,V2,M1} P(3,27);d(0) { mult( mult( mult( Y, X ), X ), i
% 0.40/1.07 ( mult( X, X ) ) ) ==> Y }.
% 0.40/1.07 (110) {G5,W8,D4,L1,V2,M1} P(49,109);d(109) { mult( mult( X, Y ), i( Y ) )
% 0.40/1.07 ==> X }.
% 0.40/1.07 (116) {G6,W5,D3,L1,V1,M1} R(110,53) { ! mult( skol1, X ) ==> skol2 }.
% 0.40/1.07 (123) {G7,W7,D4,L1,V1,M1} P(13,116) { ! mult( mult( skol1, skol1 ), X ) ==>
% 0.40/1.07 skol2 }.
% 0.40/1.07 (130) {G8,W11,D6,L1,V2,M1} P(27,123) { ! mult( mult( mult( mult( skol1,
% 0.40/1.07 skol1 ), X ), X ), Y ) ==> skol2 }.
% 0.40/1.07 (174) {G9,W3,D2,L1,V1,M1} P(110,130);d(3);d(1) { ! X = skol2 }.
% 0.40/1.07 (175) {G10,W0,D0,L0,V0,M0} Q(174) { }.
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 % SZS output end Refutation
% 0.40/1.07 found a proof!
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Unprocessed initial clauses:
% 0.40/1.07
% 0.40/1.07 (177) {G0,W5,D3,L1,V1,M1} { mult( X, unit ) = X }.
% 0.40/1.07 (178) {G0,W5,D3,L1,V1,M1} { mult( unit, X ) = X }.
% 0.40/1.07 (179) {G0,W15,D5,L1,V3,M1} { mult( Z, mult( Y, mult( Y, X ) ) ) = mult(
% 0.40/1.07 mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 (180) {G0,W6,D4,L1,V1,M1} { mult( X, i( X ) ) = unit }.
% 0.40/1.07 (181) {G0,W6,D4,L1,V1,M1} { mult( i( X ), X ) = unit }.
% 0.40/1.07 (182) {G0,W10,D3,L2,V2,M2} { ! mult( skol1, X ) = skol2, ! mult( Y, skol4
% 0.40/1.07 ) = skol3 }.
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Total Proof:
% 0.40/1.07
% 0.40/1.07 subsumption: (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 parent0: (177) {G0,W5,D3,L1,V1,M1} { mult( X, unit ) = X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent0: (178) {G0,W5,D3,L1,V1,M1} { mult( unit, X ) = X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) )
% 0.40/1.07 ) ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 parent0: (179) {G0,W15,D5,L1,V3,M1} { mult( Z, mult( Y, mult( Y, X ) ) ) =
% 0.40/1.07 mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (3) {G0,W6,D4,L1,V1,M1} I { mult( X, i( X ) ) ==> unit }.
% 0.40/1.07 parent0: (180) {G0,W6,D4,L1,V1,M1} { mult( X, i( X ) ) = unit }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (4) {G0,W6,D4,L1,V1,M1} I { mult( i( X ), X ) ==> unit }.
% 0.40/1.07 parent0: (181) {G0,W6,D4,L1,V1,M1} { mult( i( X ), X ) = unit }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (5) {G0,W10,D3,L2,V2,M2} I { ! mult( skol1, X ) ==> skol2, !
% 0.40/1.07 mult( Y, skol4 ) ==> skol3 }.
% 0.40/1.07 parent0: (182) {G0,W10,D3,L2,V2,M2} { ! mult( skol1, X ) = skol2, ! mult(
% 0.40/1.07 Y, skol4 ) = skol3 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 1 ==> 1
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (206) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.40/1.07 ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 parent0[0]: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) )
% 0.40/1.07 ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Z
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (214) {G1,W23,D7,L1,V4,M1} { mult( mult( mult( X, Y ), Y ), mult
% 0.40/1.07 ( Z, mult( Z, T ) ) ) ==> mult( X, mult( Y, mult( mult( mult( Y, Z ), Z )
% 0.40/1.07 , T ) ) ) }.
% 0.40/1.07 parent0[0]: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) )
% 0.40/1.07 ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 parent1[0; 16]: (206) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , Z ) ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := T
% 0.40/1.07 Y := Z
% 0.40/1.07 Z := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := mult( Z, mult( Z, T ) )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (224) {G1,W23,D7,L1,V4,M1} { mult( mult( mult( mult( mult( X, Y )
% 0.40/1.07 , Y ), Z ), Z ), T ) ==> mult( X, mult( Y, mult( mult( mult( Y, Z ), Z )
% 0.40/1.07 , T ) ) ) }.
% 0.40/1.07 parent0[0]: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) )
% 0.40/1.07 ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 parent1[0; 1]: (214) {G1,W23,D7,L1,V4,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , mult( Z, mult( Z, T ) ) ) ==> mult( X, mult( Y, mult( mult( mult( Y, Z
% 0.40/1.07 ), Z ), T ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := T
% 0.40/1.07 Y := Z
% 0.40/1.07 Z := mult( mult( X, Y ), Y )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 T := T
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (225) {G1,W23,D7,L1,V4,M1} { mult( X, mult( Y, mult( mult( mult( Y
% 0.40/1.07 , Z ), Z ), T ) ) ) ==> mult( mult( mult( mult( mult( X, Y ), Y ), Z ), Z
% 0.40/1.07 ), T ) }.
% 0.40/1.07 parent0[0]: (224) {G1,W23,D7,L1,V4,M1} { mult( mult( mult( mult( mult( X,
% 0.40/1.07 Y ), Y ), Z ), Z ), T ) ==> mult( X, mult( Y, mult( mult( mult( Y, Z ), Z
% 0.40/1.07 ), T ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 T := T
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (8) {G1,W23,D7,L1,V4,M1} P(2,2);d(2) { mult( T, mult( X, mult
% 0.40/1.07 ( mult( mult( X, Y ), Y ), Z ) ) ) ==> mult( mult( mult( mult( mult( T, X
% 0.40/1.07 ), X ), Y ), Y ), Z ) }.
% 0.40/1.07 parent0: (225) {G1,W23,D7,L1,V4,M1} { mult( X, mult( Y, mult( mult( mult(
% 0.40/1.07 Y, Z ), Z ), T ) ) ) ==> mult( mult( mult( mult( mult( X, Y ), Y ), Z ),
% 0.40/1.07 Z ), T ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := T
% 0.40/1.07 Y := X
% 0.40/1.07 Z := Y
% 0.40/1.07 T := Z
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (227) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.40/1.07 ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 parent0[0]: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) )
% 0.40/1.07 ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Z
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (231) {G1,W14,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y ), i( Y
% 0.40/1.07 ) ) ==> mult( X, mult( Y, unit ) ) }.
% 0.40/1.07 parent0[0]: (3) {G0,W6,D4,L1,V1,M1} I { mult( X, i( X ) ) ==> unit }.
% 0.40/1.07 parent1[0; 13]: (227) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , Z ) ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := i( Y )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (232) {G1,W12,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y ), i( Y
% 0.40/1.07 ) ) ==> mult( X, Y ) }.
% 0.40/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 parent1[0; 11]: (231) {G1,W14,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , i( Y ) ) ==> mult( X, mult( Y, unit ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (9) {G1,W12,D5,L1,V2,M1} P(3,2);d(0) { mult( mult( mult( Y, X
% 0.40/1.07 ), X ), i( X ) ) ==> mult( Y, X ) }.
% 0.40/1.07 parent0: (232) {G1,W12,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y ), i( Y
% 0.40/1.07 ) ) ==> mult( X, Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (235) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.40/1.07 ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 parent0[0]: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) )
% 0.40/1.07 ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Z
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (240) {G1,W16,D6,L1,V2,M1} { mult( mult( mult( X, i( Y ) ), i( Y
% 0.40/1.07 ) ), Y ) ==> mult( X, mult( i( Y ), unit ) ) }.
% 0.40/1.07 parent0[0]: (4) {G0,W6,D4,L1,V1,M1} I { mult( i( X ), X ) ==> unit }.
% 0.40/1.07 parent1[0; 15]: (235) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , Z ) ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := i( Y )
% 0.40/1.07 Z := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (241) {G1,W14,D6,L1,V2,M1} { mult( mult( mult( X, i( Y ) ), i( Y
% 0.40/1.07 ) ), Y ) ==> mult( X, i( Y ) ) }.
% 0.40/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 parent1[0; 12]: (240) {G1,W16,D6,L1,V2,M1} { mult( mult( mult( X, i( Y ) )
% 0.40/1.07 , i( Y ) ), Y ) ==> mult( X, mult( i( Y ), unit ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := i( Y )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (11) {G1,W14,D6,L1,V2,M1} P(4,2);d(0) { mult( mult( mult( Y, i
% 0.40/1.07 ( X ) ), i( X ) ), X ) ==> mult( Y, i( X ) ) }.
% 0.40/1.07 parent0: (241) {G1,W14,D6,L1,V2,M1} { mult( mult( mult( X, i( Y ) ), i( Y
% 0.40/1.07 ) ), Y ) ==> mult( X, i( Y ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (243) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.40/1.07 ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 parent0[0]: (2) {G0,W15,D5,L1,V3,M1} I { mult( Z, mult( Y, mult( Y, X ) ) )
% 0.40/1.07 ==> mult( mult( mult( Z, Y ), Y ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Z
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (247) {G1,W13,D5,L1,V2,M1} { mult( mult( mult( unit, X ), X ), Y
% 0.40/1.07 ) ==> mult( X, mult( X, Y ) ) }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 8]: (243) {G0,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , Z ) ==> mult( X, mult( Y, mult( Y, Z ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := mult( X, mult( X, Y ) )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := unit
% 0.40/1.07 Y := X
% 0.40/1.07 Z := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (253) {G1,W11,D4,L1,V2,M1} { mult( mult( X, X ), Y ) ==> mult( X
% 0.40/1.07 , mult( X, Y ) ) }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 3]: (247) {G1,W13,D5,L1,V2,M1} { mult( mult( mult( unit, X ), X
% 0.40/1.07 ), Y ) ==> mult( X, mult( X, Y ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (254) {G1,W11,D4,L1,V2,M1} { mult( X, mult( X, Y ) ) ==> mult(
% 0.40/1.07 mult( X, X ), Y ) }.
% 0.40/1.07 parent0[0]: (253) {G1,W11,D4,L1,V2,M1} { mult( mult( X, X ), Y ) ==> mult
% 0.40/1.07 ( X, mult( X, Y ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (13) {G1,W11,D4,L1,V2,M1} P(2,1);d(1) { mult( X, mult( X, Y )
% 0.40/1.07 ) ==> mult( mult( X, X ), Y ) }.
% 0.40/1.07 parent0: (254) {G1,W11,D4,L1,V2,M1} { mult( X, mult( X, Y ) ) ==> mult(
% 0.40/1.07 mult( X, X ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (256) {G1,W23,D7,L1,V4,M1} { mult( mult( mult( mult( mult( X, Y )
% 0.40/1.07 , Y ), Z ), Z ), T ) ==> mult( X, mult( Y, mult( mult( mult( Y, Z ), Z )
% 0.40/1.07 , T ) ) ) }.
% 0.40/1.07 parent0[0]: (8) {G1,W23,D7,L1,V4,M1} P(2,2);d(2) { mult( T, mult( X, mult(
% 0.40/1.07 mult( mult( X, Y ), Y ), Z ) ) ) ==> mult( mult( mult( mult( mult( T, X )
% 0.40/1.07 , X ), Y ), Y ), Z ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := Z
% 0.40/1.07 Z := T
% 0.40/1.07 T := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (265) {G1,W21,D7,L1,V3,M1} { mult( mult( mult( mult( mult( X,
% 0.40/1.07 unit ), unit ), Y ), Y ), Z ) ==> mult( X, mult( unit, mult( mult( Y, Y )
% 0.40/1.07 , Z ) ) ) }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 18]: (256) {G1,W23,D7,L1,V4,M1} { mult( mult( mult( mult( mult
% 0.40/1.07 ( X, Y ), Y ), Z ), Z ), T ) ==> mult( X, mult( Y, mult( mult( mult( Y, Z
% 0.40/1.07 ), Z ), T ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := unit
% 0.40/1.07 Z := Y
% 0.40/1.07 T := Z
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (268) {G1,W19,D7,L1,V3,M1} { mult( mult( mult( mult( mult( X,
% 0.40/1.07 unit ), unit ), Y ), Y ), Z ) ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 14]: (265) {G1,W21,D7,L1,V3,M1} { mult( mult( mult( mult( mult
% 0.40/1.07 ( X, unit ), unit ), Y ), Y ), Z ) ==> mult( X, mult( unit, mult( mult( Y
% 0.40/1.07 , Y ), Z ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := mult( mult( Y, Y ), Z )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (269) {G1,W17,D6,L1,V3,M1} { mult( mult( mult( mult( X, unit ), Y
% 0.40/1.07 ), Y ), Z ) ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 parent1[0; 4]: (268) {G1,W19,D7,L1,V3,M1} { mult( mult( mult( mult( mult(
% 0.40/1.07 X, unit ), unit ), Y ), Y ), Z ) ==> mult( X, mult( mult( Y, Y ), Z ) )
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := mult( X, unit )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (271) {G1,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.40/1.07 ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 parent1[0; 4]: (269) {G1,W17,D6,L1,V3,M1} { mult( mult( mult( mult( X,
% 0.40/1.07 unit ), Y ), Y ), Z ) ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (272) {G1,W15,D5,L1,V3,M1} { mult( X, mult( mult( Y, Y ), Z ) )
% 0.40/1.07 ==> mult( mult( mult( X, Y ), Y ), Z ) }.
% 0.40/1.07 parent0[0]: (271) {G1,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z
% 0.40/1.07 ) ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := Z
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (27) {G2,W15,D5,L1,V3,M1} P(1,8);d(1);d(0);d(0) { mult( Z,
% 0.40/1.07 mult( mult( X, X ), Y ) ) ==> mult( mult( mult( Z, X ), X ), Y ) }.
% 0.40/1.07 parent0: (272) {G1,W15,D5,L1,V3,M1} { mult( X, mult( mult( Y, Y ), Z ) )
% 0.40/1.07 ==> mult( mult( mult( X, Y ), Y ), Z ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Z
% 0.40/1.07 Y := X
% 0.40/1.07 Z := Y
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (274) {G1,W12,D5,L1,V2,M1} { mult( X, Y ) ==> mult( mult( mult( X
% 0.40/1.07 , Y ), Y ), i( Y ) ) }.
% 0.40/1.07 parent0[0]: (9) {G1,W12,D5,L1,V2,M1} P(3,2);d(0) { mult( mult( mult( Y, X )
% 0.40/1.07 , X ), i( X ) ) ==> mult( Y, X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (276) {G1,W10,D4,L1,V1,M1} { mult( unit, X ) ==> mult( mult( X, X
% 0.40/1.07 ), i( X ) ) }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 6]: (274) {G1,W12,D5,L1,V2,M1} { mult( X, Y ) ==> mult( mult(
% 0.40/1.07 mult( X, Y ), Y ), i( Y ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := unit
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (277) {G1,W8,D4,L1,V1,M1} { X ==> mult( mult( X, X ), i( X ) )
% 0.40/1.07 }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 1]: (276) {G1,W10,D4,L1,V1,M1} { mult( unit, X ) ==> mult( mult
% 0.40/1.07 ( X, X ), i( X ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (279) {G1,W8,D4,L1,V1,M1} { mult( mult( X, X ), i( X ) ) ==> X }.
% 0.40/1.07 parent0[0]: (277) {G1,W8,D4,L1,V1,M1} { X ==> mult( mult( X, X ), i( X ) )
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (37) {G2,W8,D4,L1,V1,M1} P(1,9) { mult( mult( X, X ), i( X ) )
% 0.40/1.07 ==> X }.
% 0.40/1.07 parent0: (279) {G1,W8,D4,L1,V1,M1} { mult( mult( X, X ), i( X ) ) ==> X
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (282) {G1,W12,D5,L1,V2,M1} { mult( X, Y ) ==> mult( mult( mult( X
% 0.40/1.07 , Y ), Y ), i( Y ) ) }.
% 0.40/1.07 parent0[0]: (9) {G1,W12,D5,L1,V2,M1} P(3,2);d(0) { mult( mult( mult( Y, X )
% 0.40/1.07 , X ), i( X ) ) ==> mult( Y, X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (286) {G2,W15,D5,L1,V1,M1} { mult( mult( X, X ), i( X ) ) ==>
% 0.40/1.07 mult( mult( X, i( X ) ), i( i( X ) ) ) }.
% 0.40/1.07 parent0[0]: (37) {G2,W8,D4,L1,V1,M1} P(1,9) { mult( mult( X, X ), i( X ) )
% 0.40/1.07 ==> X }.
% 0.40/1.07 parent1[0; 9]: (282) {G1,W12,D5,L1,V2,M1} { mult( X, Y ) ==> mult( mult(
% 0.40/1.07 mult( X, Y ), Y ), i( Y ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := mult( X, X )
% 0.40/1.07 Y := i( X )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (287) {G3,W10,D5,L1,V1,M1} { X ==> mult( mult( X, i( X ) ), i( i
% 0.40/1.07 ( X ) ) ) }.
% 0.40/1.07 parent0[0]: (37) {G2,W8,D4,L1,V1,M1} P(1,9) { mult( mult( X, X ), i( X ) )
% 0.40/1.07 ==> X }.
% 0.40/1.07 parent1[0; 1]: (286) {G2,W15,D5,L1,V1,M1} { mult( mult( X, X ), i( X ) )
% 0.40/1.07 ==> mult( mult( X, i( X ) ), i( i( X ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (291) {G1,W7,D5,L1,V1,M1} { X ==> mult( unit, i( i( X ) ) ) }.
% 0.40/1.07 parent0[0]: (3) {G0,W6,D4,L1,V1,M1} I { mult( X, i( X ) ) ==> unit }.
% 0.40/1.07 parent1[0; 3]: (287) {G3,W10,D5,L1,V1,M1} { X ==> mult( mult( X, i( X ) )
% 0.40/1.07 , i( i( X ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (292) {G1,W5,D4,L1,V1,M1} { X ==> i( i( X ) ) }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 2]: (291) {G1,W7,D5,L1,V1,M1} { X ==> mult( unit, i( i( X ) ) )
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := i( i( X ) )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (293) {G1,W5,D4,L1,V1,M1} { i( i( X ) ) ==> X }.
% 0.40/1.07 parent0[0]: (292) {G1,W5,D4,L1,V1,M1} { X ==> i( i( X ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (38) {G3,W5,D4,L1,V1,M1} P(37,9);d(3);d(1) { i( i( X ) ) ==> X
% 0.40/1.07 }.
% 0.40/1.07 parent0: (293) {G1,W5,D4,L1,V1,M1} { i( i( X ) ) ==> X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (294) {G1,W14,D6,L1,V2,M1} { mult( X, i( Y ) ) ==> mult( mult(
% 0.40/1.07 mult( X, i( Y ) ), i( Y ) ), Y ) }.
% 0.40/1.07 parent0[0]: (11) {G1,W14,D6,L1,V2,M1} P(4,2);d(0) { mult( mult( mult( Y, i
% 0.40/1.07 ( X ) ), i( X ) ), X ) ==> mult( Y, i( X ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (298) {G2,W23,D7,L1,V2,M1} { mult( mult( mult( X, i( i( Y ) ) ),
% 0.40/1.07 i( i( Y ) ) ), i( Y ) ) ==> mult( mult( mult( X, i( i( Y ) ) ), i( Y ) )
% 0.40/1.07 , Y ) }.
% 0.40/1.07 parent0[0]: (11) {G1,W14,D6,L1,V2,M1} P(4,2);d(0) { mult( mult( mult( Y, i
% 0.40/1.07 ( X ) ), i( X ) ), X ) ==> mult( Y, i( X ) ) }.
% 0.40/1.07 parent1[0; 15]: (294) {G1,W14,D6,L1,V2,M1} { mult( X, i( Y ) ) ==> mult(
% 0.40/1.07 mult( mult( X, i( Y ) ), i( Y ) ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := i( Y )
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := mult( mult( X, i( i( Y ) ) ), i( i( Y ) ) )
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (300) {G2,W16,D7,L1,V2,M1} { mult( X, i( i( Y ) ) ) ==> mult(
% 0.40/1.07 mult( mult( X, i( i( Y ) ) ), i( Y ) ), Y ) }.
% 0.40/1.07 parent0[0]: (11) {G1,W14,D6,L1,V2,M1} P(4,2);d(0) { mult( mult( mult( Y, i
% 0.40/1.07 ( X ) ), i( X ) ), X ) ==> mult( Y, i( X ) ) }.
% 0.40/1.07 parent1[0; 1]: (298) {G2,W23,D7,L1,V2,M1} { mult( mult( mult( X, i( i( Y )
% 0.40/1.07 ) ), i( i( Y ) ) ), i( Y ) ) ==> mult( mult( mult( X, i( i( Y ) ) ), i(
% 0.40/1.07 Y ) ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := i( Y )
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (317) {G3,W14,D5,L1,V2,M1} { mult( X, i( i( Y ) ) ) ==> mult(
% 0.40/1.07 mult( mult( X, Y ), i( Y ) ), Y ) }.
% 0.40/1.07 parent0[0]: (38) {G3,W5,D4,L1,V1,M1} P(37,9);d(3);d(1) { i( i( X ) ) ==> X
% 0.40/1.07 }.
% 0.40/1.07 parent1[0; 10]: (300) {G2,W16,D7,L1,V2,M1} { mult( X, i( i( Y ) ) ) ==>
% 0.40/1.07 mult( mult( mult( X, i( i( Y ) ) ), i( Y ) ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (318) {G4,W12,D5,L1,V2,M1} { mult( X, Y ) ==> mult( mult( mult( X
% 0.40/1.07 , Y ), i( Y ) ), Y ) }.
% 0.40/1.07 parent0[0]: (38) {G3,W5,D4,L1,V1,M1} P(37,9);d(3);d(1) { i( i( X ) ) ==> X
% 0.40/1.07 }.
% 0.40/1.07 parent1[0; 3]: (317) {G3,W14,D5,L1,V2,M1} { mult( X, i( i( Y ) ) ) ==>
% 0.40/1.07 mult( mult( mult( X, Y ), i( Y ) ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (320) {G4,W12,D5,L1,V2,M1} { mult( mult( mult( X, Y ), i( Y ) ), Y
% 0.40/1.07 ) ==> mult( X, Y ) }.
% 0.40/1.07 parent0[0]: (318) {G4,W12,D5,L1,V2,M1} { mult( X, Y ) ==> mult( mult( mult
% 0.40/1.07 ( X, Y ), i( Y ) ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (49) {G4,W12,D5,L1,V2,M1} P(11,11);d(38) { mult( mult( mult( X
% 0.40/1.07 , Y ), i( Y ) ), Y ) ==> mult( X, Y ) }.
% 0.40/1.07 parent0: (320) {G4,W12,D5,L1,V2,M1} { mult( mult( mult( X, Y ), i( Y ) ),
% 0.40/1.07 Y ) ==> mult( X, Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (323) {G0,W10,D3,L2,V2,M2} { ! skol2 ==> mult( skol1, X ), ! mult
% 0.40/1.07 ( Y, skol4 ) ==> skol3 }.
% 0.40/1.07 parent0[0]: (5) {G0,W10,D3,L2,V2,M2} I { ! mult( skol1, X ) ==> skol2, !
% 0.40/1.07 mult( Y, skol4 ) ==> skol3 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (326) {G1,W11,D4,L2,V2,M2} { ! mult( X, i( skol4 ) ) ==> skol3, !
% 0.40/1.07 skol2 ==> mult( skol1, Y ) }.
% 0.40/1.07 parent0[0]: (11) {G1,W14,D6,L1,V2,M1} P(4,2);d(0) { mult( mult( mult( Y, i
% 0.40/1.07 ( X ) ), i( X ) ), X ) ==> mult( Y, i( X ) ) }.
% 0.40/1.07 parent1[1; 2]: (323) {G0,W10,D3,L2,V2,M2} { ! skol2 ==> mult( skol1, X ),
% 0.40/1.07 ! mult( Y, skol4 ) ==> skol3 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := skol4
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := mult( mult( X, i( skol4 ) ), i( skol4 ) )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (328) {G1,W11,D4,L2,V2,M2} { ! mult( skol1, X ) ==> skol2, ! mult
% 0.40/1.07 ( Y, i( skol4 ) ) ==> skol3 }.
% 0.40/1.07 parent0[1]: (326) {G1,W11,D4,L2,V2,M2} { ! mult( X, i( skol4 ) ) ==> skol3
% 0.40/1.07 , ! skol2 ==> mult( skol1, Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (53) {G2,W11,D4,L2,V2,M2} P(11,5) { ! mult( skol1, Y ) ==>
% 0.40/1.07 skol2, ! mult( X, i( skol4 ) ) ==> skol3 }.
% 0.40/1.07 parent0: (328) {G1,W11,D4,L2,V2,M2} { ! mult( skol1, X ) ==> skol2, ! mult
% 0.40/1.07 ( Y, i( skol4 ) ) ==> skol3 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 1 ==> 1
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 *** allocated 22500 integers for clauses
% 0.40/1.07 eqswap: (331) {G2,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.40/1.07 ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 parent0[0]: (27) {G2,W15,D5,L1,V3,M1} P(1,8);d(1);d(0);d(0) { mult( Z, mult
% 0.40/1.07 ( mult( X, X ), Y ) ) ==> mult( mult( mult( Z, X ), X ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := Z
% 0.40/1.07 Z := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (335) {G1,W14,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y ), i(
% 0.40/1.07 mult( Y, Y ) ) ) ==> mult( X, unit ) }.
% 0.40/1.07 parent0[0]: (3) {G0,W6,D4,L1,V1,M1} I { mult( X, i( X ) ) ==> unit }.
% 0.40/1.07 parent1[0; 13]: (331) {G2,W15,D5,L1,V3,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , Z ) ==> mult( X, mult( mult( Y, Y ), Z ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := mult( Y, Y )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := i( mult( Y, Y ) )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (336) {G1,W12,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y ), i(
% 0.40/1.07 mult( Y, Y ) ) ) ==> X }.
% 0.40/1.07 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.40/1.07 parent1[0; 11]: (335) {G1,W14,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y )
% 0.40/1.07 , i( mult( Y, Y ) ) ) ==> mult( X, unit ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (109) {G3,W12,D5,L1,V2,M1} P(3,27);d(0) { mult( mult( mult( Y
% 0.40/1.07 , X ), X ), i( mult( X, X ) ) ) ==> Y }.
% 0.40/1.07 parent0: (336) {G1,W12,D5,L1,V2,M1} { mult( mult( mult( X, Y ), Y ), i(
% 0.40/1.07 mult( Y, Y ) ) ) ==> X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (339) {G3,W12,D5,L1,V2,M1} { X ==> mult( mult( mult( X, Y ), Y ),
% 0.40/1.07 i( mult( Y, Y ) ) ) }.
% 0.40/1.07 parent0[0]: (109) {G3,W12,D5,L1,V2,M1} P(3,27);d(0) { mult( mult( mult( Y,
% 0.40/1.07 X ), X ), i( mult( X, X ) ) ) ==> Y }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (348) {G4,W17,D5,L1,V2,M1} { mult( mult( X, Y ), i( Y ) ) ==>
% 0.40/1.07 mult( mult( mult( X, Y ), Y ), i( mult( Y, Y ) ) ) }.
% 0.40/1.07 parent0[0]: (49) {G4,W12,D5,L1,V2,M1} P(11,11);d(38) { mult( mult( mult( X
% 0.40/1.07 , Y ), i( Y ) ), Y ) ==> mult( X, Y ) }.
% 0.40/1.07 parent1[0; 9]: (339) {G3,W12,D5,L1,V2,M1} { X ==> mult( mult( mult( X, Y )
% 0.40/1.07 , Y ), i( mult( Y, Y ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := mult( mult( X, Y ), i( Y ) )
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (349) {G4,W8,D4,L1,V2,M1} { mult( mult( X, Y ), i( Y ) ) ==> X
% 0.40/1.07 }.
% 0.40/1.07 parent0[0]: (109) {G3,W12,D5,L1,V2,M1} P(3,27);d(0) { mult( mult( mult( Y,
% 0.40/1.07 X ), X ), i( mult( X, X ) ) ) ==> Y }.
% 0.40/1.07 parent1[0; 7]: (348) {G4,W17,D5,L1,V2,M1} { mult( mult( X, Y ), i( Y ) )
% 0.40/1.07 ==> mult( mult( mult( X, Y ), Y ), i( mult( Y, Y ) ) ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (110) {G5,W8,D4,L1,V2,M1} P(49,109);d(109) { mult( mult( X, Y
% 0.40/1.07 ), i( Y ) ) ==> X }.
% 0.40/1.07 parent0: (349) {G4,W8,D4,L1,V2,M1} { mult( mult( X, Y ), i( Y ) ) ==> X
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (351) {G5,W8,D4,L1,V2,M1} { X ==> mult( mult( X, Y ), i( Y ) ) }.
% 0.40/1.07 parent0[0]: (110) {G5,W8,D4,L1,V2,M1} P(49,109);d(109) { mult( mult( X, Y )
% 0.40/1.07 , i( Y ) ) ==> X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (353) {G2,W11,D4,L2,V2,M2} { ! skol3 ==> mult( X, i( skol4 ) ), !
% 0.40/1.07 mult( skol1, Y ) ==> skol2 }.
% 0.40/1.07 parent0[1]: (53) {G2,W11,D4,L2,V2,M2} P(11,5) { ! mult( skol1, Y ) ==>
% 0.40/1.07 skol2, ! mult( X, i( skol4 ) ) ==> skol3 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (354) {G2,W11,D4,L2,V2,M2} { ! skol2 ==> mult( skol1, X ), ! skol3
% 0.40/1.07 ==> mult( Y, i( skol4 ) ) }.
% 0.40/1.07 parent0[1]: (353) {G2,W11,D4,L2,V2,M2} { ! skol3 ==> mult( X, i( skol4 ) )
% 0.40/1.07 , ! mult( skol1, Y ) ==> skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := Y
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 resolution: (355) {G3,W5,D3,L1,V1,M1} { ! skol2 ==> mult( skol1, X ) }.
% 0.40/1.07 parent0[1]: (354) {G2,W11,D4,L2,V2,M2} { ! skol2 ==> mult( skol1, X ), !
% 0.40/1.07 skol3 ==> mult( Y, i( skol4 ) ) }.
% 0.40/1.07 parent1[0]: (351) {G5,W8,D4,L1,V2,M1} { X ==> mult( mult( X, Y ), i( Y ) )
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := mult( skol3, skol4 )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := skol3
% 0.40/1.07 Y := skol4
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (356) {G3,W5,D3,L1,V1,M1} { ! mult( skol1, X ) ==> skol2 }.
% 0.40/1.07 parent0[0]: (355) {G3,W5,D3,L1,V1,M1} { ! skol2 ==> mult( skol1, X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (116) {G6,W5,D3,L1,V1,M1} R(110,53) { ! mult( skol1, X ) ==>
% 0.40/1.07 skol2 }.
% 0.40/1.07 parent0: (356) {G3,W5,D3,L1,V1,M1} { ! mult( skol1, X ) ==> skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (358) {G6,W5,D3,L1,V1,M1} { ! skol2 ==> mult( skol1, X ) }.
% 0.40/1.07 parent0[0]: (116) {G6,W5,D3,L1,V1,M1} R(110,53) { ! mult( skol1, X ) ==>
% 0.40/1.07 skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (359) {G2,W7,D4,L1,V1,M1} { ! skol2 ==> mult( mult( skol1, skol1
% 0.40/1.07 ), X ) }.
% 0.40/1.07 parent0[0]: (13) {G1,W11,D4,L1,V2,M1} P(2,1);d(1) { mult( X, mult( X, Y ) )
% 0.40/1.07 ==> mult( mult( X, X ), Y ) }.
% 0.40/1.07 parent1[0; 3]: (358) {G6,W5,D3,L1,V1,M1} { ! skol2 ==> mult( skol1, X )
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := skol1
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := mult( skol1, X )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (360) {G2,W7,D4,L1,V1,M1} { ! mult( mult( skol1, skol1 ), X ) ==>
% 0.40/1.07 skol2 }.
% 0.40/1.07 parent0[0]: (359) {G2,W7,D4,L1,V1,M1} { ! skol2 ==> mult( mult( skol1,
% 0.40/1.07 skol1 ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (123) {G7,W7,D4,L1,V1,M1} P(13,116) { ! mult( mult( skol1,
% 0.40/1.07 skol1 ), X ) ==> skol2 }.
% 0.40/1.07 parent0: (360) {G2,W7,D4,L1,V1,M1} { ! mult( mult( skol1, skol1 ), X ) ==>
% 0.40/1.07 skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (362) {G7,W7,D4,L1,V1,M1} { ! skol2 ==> mult( mult( skol1, skol1 )
% 0.40/1.07 , X ) }.
% 0.40/1.07 parent0[0]: (123) {G7,W7,D4,L1,V1,M1} P(13,116) { ! mult( mult( skol1,
% 0.40/1.07 skol1 ), X ) ==> skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (363) {G3,W11,D6,L1,V2,M1} { ! skol2 ==> mult( mult( mult( mult(
% 0.40/1.07 skol1, skol1 ), X ), X ), Y ) }.
% 0.40/1.07 parent0[0]: (27) {G2,W15,D5,L1,V3,M1} P(1,8);d(1);d(0);d(0) { mult( Z, mult
% 0.40/1.07 ( mult( X, X ), Y ) ) ==> mult( mult( mult( Z, X ), X ), Y ) }.
% 0.40/1.07 parent1[0; 3]: (362) {G7,W7,D4,L1,V1,M1} { ! skol2 ==> mult( mult( skol1,
% 0.40/1.07 skol1 ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 Z := mult( skol1, skol1 )
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := mult( mult( X, X ), Y )
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (364) {G3,W11,D6,L1,V2,M1} { ! mult( mult( mult( mult( skol1,
% 0.40/1.07 skol1 ), X ), X ), Y ) ==> skol2 }.
% 0.40/1.07 parent0[0]: (363) {G3,W11,D6,L1,V2,M1} { ! skol2 ==> mult( mult( mult(
% 0.40/1.07 mult( skol1, skol1 ), X ), X ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (130) {G8,W11,D6,L1,V2,M1} P(27,123) { ! mult( mult( mult(
% 0.40/1.07 mult( skol1, skol1 ), X ), X ), Y ) ==> skol2 }.
% 0.40/1.07 parent0: (364) {G3,W11,D6,L1,V2,M1} { ! mult( mult( mult( mult( skol1,
% 0.40/1.07 skol1 ), X ), X ), Y ) ==> skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (366) {G8,W11,D6,L1,V2,M1} { ! skol2 ==> mult( mult( mult( mult(
% 0.40/1.07 skol1, skol1 ), X ), X ), Y ) }.
% 0.40/1.07 parent0[0]: (130) {G8,W11,D6,L1,V2,M1} P(27,123) { ! mult( mult( mult( mult
% 0.40/1.07 ( skol1, skol1 ), X ), X ), Y ) ==> skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 Y := Y
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (370) {G6,W8,D5,L1,V1,M1} { ! skol2 ==> mult( mult( skol1, i(
% 0.40/1.07 skol1 ) ), X ) }.
% 0.40/1.07 parent0[0]: (110) {G5,W8,D4,L1,V2,M1} P(49,109);d(109) { mult( mult( X, Y )
% 0.40/1.07 , i( Y ) ) ==> X }.
% 0.40/1.07 parent1[0; 5]: (366) {G8,W11,D6,L1,V2,M1} { ! skol2 ==> mult( mult( mult(
% 0.40/1.07 mult( skol1, skol1 ), X ), X ), Y ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := skol1
% 0.40/1.07 Y := skol1
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := i( skol1 )
% 0.40/1.07 Y := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (371) {G1,W5,D3,L1,V1,M1} { ! skol2 ==> mult( unit, X ) }.
% 0.40/1.07 parent0[0]: (3) {G0,W6,D4,L1,V1,M1} I { mult( X, i( X ) ) ==> unit }.
% 0.40/1.07 parent1[0; 4]: (370) {G6,W8,D5,L1,V1,M1} { ! skol2 ==> mult( mult( skol1,
% 0.40/1.07 i( skol1 ) ), X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := skol1
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 paramod: (372) {G1,W3,D2,L1,V1,M1} { ! skol2 ==> X }.
% 0.40/1.07 parent0[0]: (1) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.40/1.07 parent1[0; 3]: (371) {G1,W5,D3,L1,V1,M1} { ! skol2 ==> mult( unit, X ) }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 substitution1:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (373) {G1,W3,D2,L1,V1,M1} { ! X ==> skol2 }.
% 0.40/1.07 parent0[0]: (372) {G1,W3,D2,L1,V1,M1} { ! skol2 ==> X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (174) {G9,W3,D2,L1,V1,M1} P(110,130);d(3);d(1) { ! X = skol2
% 0.40/1.07 }.
% 0.40/1.07 parent0: (373) {G1,W3,D2,L1,V1,M1} { ! X ==> skol2 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 0 ==> 0
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqswap: (374) {G9,W3,D2,L1,V1,M1} { ! skol2 = X }.
% 0.40/1.07 parent0[0]: (174) {G9,W3,D2,L1,V1,M1} P(110,130);d(3);d(1) { ! X = skol2
% 0.40/1.07 }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := X
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 eqrefl: (375) {G0,W0,D0,L0,V0,M0} { }.
% 0.40/1.07 parent0[0]: (374) {G9,W3,D2,L1,V1,M1} { ! skol2 = X }.
% 0.40/1.07 substitution0:
% 0.40/1.07 X := skol2
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 subsumption: (175) {G10,W0,D0,L0,V0,M0} Q(174) { }.
% 0.40/1.07 parent0: (375) {G0,W0,D0,L0,V0,M0} { }.
% 0.40/1.07 substitution0:
% 0.40/1.07 end
% 0.40/1.07 permutation0:
% 0.40/1.07 end
% 0.40/1.07
% 0.40/1.07 Proof check complete!
% 0.40/1.07
% 0.40/1.07 Memory use:
% 0.40/1.07
% 0.40/1.07 space for terms: 2347
% 0.40/1.07 space for clauses: 12268
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 clauses generated: 1567
% 0.40/1.07 clauses kept: 176
% 0.40/1.07 clauses selected: 90
% 0.40/1.07 clauses deleted: 10
% 0.40/1.07 clauses inuse deleted: 0
% 0.40/1.07
% 0.40/1.07 subsentry: 1347
% 0.40/1.07 literals s-matched: 685
% 0.40/1.07 literals matched: 654
% 0.40/1.07 full subsumption: 0
% 0.40/1.07
% 0.40/1.07 checksum: 702115541
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Bliksem ended
%------------------------------------------------------------------------------