TSTP Solution File: GRP704+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:09 EDT 2022
% Result : Theorem 0.48s 1.11s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % DateTime : Tue Jun 14 12:30:58 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.48/1.11 *** allocated 10000 integers for termspace/termends
% 0.48/1.11 *** allocated 10000 integers for clauses
% 0.48/1.11 *** allocated 10000 integers for justifications
% 0.48/1.11 Bliksem 1.12
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Automatic Strategy Selection
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Clauses:
% 0.48/1.11
% 0.48/1.11 { mult( Y, ld( Y, X ) ) = X }.
% 0.48/1.11 { ld( Y, mult( Y, X ) ) = X }.
% 0.48/1.11 { mult( rd( Y, X ), X ) = Y }.
% 0.48/1.11 { rd( mult( Y, X ), X ) = Y }.
% 0.48/1.11 { mult( X, unit ) = X }.
% 0.48/1.11 { mult( unit, X ) = X }.
% 0.48/1.11 { mult( Z, mult( Y, mult( Y, X ) ) ) = mult( mult( mult( Z, Y ), Y ), X ) }
% 0.48/1.11 .
% 0.48/1.11 { mult( op_c, mult( Y, X ) ) = mult( mult( op_c, Y ), X ) }.
% 0.48/1.11 { mult( Y, mult( X, op_c ) ) = mult( mult( Y, X ), op_c ) }.
% 0.48/1.11 { mult( Y, mult( op_c, X ) ) = mult( mult( Y, op_c ), X ) }.
% 0.48/1.11 { op_d = ld( X, mult( op_c, X ) ) }.
% 0.48/1.11 { op_e = mult( mult( rd( op_c, mult( Y, X ) ), X ), Y ) }.
% 0.48/1.11 { op_f = mult( Y, mult( X, ld( mult( Y, X ), op_c ) ) ) }.
% 0.48/1.11 { ! mult( op_f, mult( skol1, skol2 ) ) = mult( mult( op_f, skol1 ), skol2 )
% 0.48/1.11 , ! mult( skol1, mult( skol2, op_f ) ) = mult( mult( skol1, skol2 ), op_f
% 0.48/1.11 ), ! mult( skol1, mult( op_f, skol2 ) ) = mult( mult( skol1, op_f ),
% 0.48/1.11 skol2 ) }.
% 0.48/1.11
% 0.48/1.11 percentage equality = 1.000000, percentage horn = 1.000000
% 0.48/1.11 This is a pure equality problem
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Options Used:
% 0.48/1.11
% 0.48/1.11 useres = 1
% 0.48/1.11 useparamod = 1
% 0.48/1.11 useeqrefl = 1
% 0.48/1.11 useeqfact = 1
% 0.48/1.11 usefactor = 1
% 0.48/1.11 usesimpsplitting = 0
% 0.48/1.11 usesimpdemod = 5
% 0.48/1.11 usesimpres = 3
% 0.48/1.11
% 0.48/1.11 resimpinuse = 1000
% 0.48/1.11 resimpclauses = 20000
% 0.48/1.11 substype = eqrewr
% 0.48/1.11 backwardsubs = 1
% 0.48/1.11 selectoldest = 5
% 0.48/1.11
% 0.48/1.11 litorderings [0] = split
% 0.48/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.48/1.11
% 0.48/1.11 termordering = kbo
% 0.48/1.11
% 0.48/1.11 litapriori = 0
% 0.48/1.11 termapriori = 1
% 0.48/1.11 litaposteriori = 0
% 0.48/1.11 termaposteriori = 0
% 0.48/1.11 demodaposteriori = 0
% 0.48/1.11 ordereqreflfact = 0
% 0.48/1.11
% 0.48/1.11 litselect = negord
% 0.48/1.11
% 0.48/1.11 maxweight = 15
% 0.48/1.11 maxdepth = 30000
% 0.48/1.11 maxlength = 115
% 0.48/1.11 maxnrvars = 195
% 0.48/1.11 excuselevel = 1
% 0.48/1.11 increasemaxweight = 1
% 0.48/1.11
% 0.48/1.11 maxselected = 10000000
% 0.48/1.11 maxnrclauses = 10000000
% 0.48/1.11
% 0.48/1.11 showgenerated = 0
% 0.48/1.11 showkept = 0
% 0.48/1.11 showselected = 0
% 0.48/1.11 showdeleted = 0
% 0.48/1.11 showresimp = 1
% 0.48/1.11 showstatus = 2000
% 0.48/1.11
% 0.48/1.11 prologoutput = 0
% 0.48/1.11 nrgoals = 5000000
% 0.48/1.11 totalproof = 1
% 0.48/1.11
% 0.48/1.11 Symbols occurring in the translation:
% 0.48/1.11
% 0.48/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.48/1.11 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.48/1.11 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.48/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.48/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.48/1.11 ld [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.48/1.11 mult [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.48/1.11 rd [39, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.48/1.11 unit [40, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.48/1.11 op_c [42, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.48/1.11 op_d [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.48/1.11 op_e [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.48/1.11 op_f [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.48/1.11 skol1 [48, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.48/1.11 skol2 [49, 0] (w:1, o:17, a:1, s:1, b:1).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Starting Search:
% 0.48/1.11
% 0.48/1.11 *** allocated 15000 integers for clauses
% 0.48/1.11 *** allocated 22500 integers for clauses
% 0.48/1.11
% 0.48/1.11 Bliksems!, er is een bewijs:
% 0.48/1.11 % SZS status Theorem
% 0.48/1.11 % SZS output start Refutation
% 0.48/1.11
% 0.48/1.11 (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.48/1.11 (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.48/1.11 (2) {G0,W7,D4,L1,V2,M1} I { mult( rd( Y, X ), X ) ==> Y }.
% 0.48/1.11 (3) {G0,W7,D4,L1,V2,M1} I { rd( mult( Y, X ), X ) ==> Y }.
% 0.48/1.11 (7) {G0,W11,D4,L1,V2,M1} I { mult( op_c, mult( Y, X ) ) ==> mult( mult(
% 0.48/1.11 op_c, Y ), X ) }.
% 0.48/1.11 (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==> mult( mult( Y,
% 0.48/1.11 X ), op_c ) }.
% 0.48/1.11 (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==> mult( mult( Y,
% 0.48/1.11 op_c ), X ) }.
% 0.48/1.11 (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d }.
% 0.48/1.11 (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X ) ), X ), Y
% 0.48/1.11 ) ==> op_e }.
% 0.48/1.11 (12) {G0,W11,D6,L1,V2,M1} I { mult( Y, mult( X, ld( mult( Y, X ), op_c ) )
% 0.48/1.11 ) ==> op_f }.
% 0.48/1.11 (13) {G0,W33,D4,L3,V0,M3} I { ! mult( op_f, mult( skol1, skol2 ) ) ==> mult
% 0.48/1.11 ( mult( op_f, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_f ) ) ==>
% 0.48/1.11 mult( mult( skol1, skol2 ), op_f ), ! mult( skol1, mult( op_f, skol2 ) )
% 0.48/1.11 ==> mult( mult( skol1, op_f ), skol2 ) }.
% 0.48/1.11 (30) {G1,W3,D2,L1,V0,M1} P(10,1) { op_d ==> op_c }.
% 0.48/1.11 (32) {G2,W7,D3,L1,V1,M1} P(10,0);d(30) { mult( X, op_c ) = mult( op_c, X )
% 0.48/1.11 }.
% 0.48/1.11 (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c ) ==> X }.
% 0.48/1.11 (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld( op_c, X ) )
% 0.48/1.11 ==> mult( Y, X ) }.
% 0.48/1.11 (65) {G4,W11,D4,L1,V2,M1} P(49,63) { mult( X, ld( op_c, Y ) ) ==> mult( ld
% 0.48/1.11 ( op_c, X ), Y ) }.
% 0.48/1.11 (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c }.
% 0.48/1.11 (99) {G5,W11,D5,L1,V2,M1} P(0,11);d(83) { mult( mult( rd( op_c, Y ), ld( X
% 0.48/1.11 , Y ) ), X ) ==> op_c }.
% 0.48/1.11 (100) {G5,W11,D5,L1,V2,M1} P(11,3);d(83) { mult( rd( op_c, mult( X, Y ) ),
% 0.48/1.11 Y ) ==> rd( op_c, X ) }.
% 0.48/1.11 (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99) { op_f ==>
% 0.48/1.11 op_c }.
% 0.48/1.11 (125) {G7,W0,D0,L0,V0,M0} S(13);d(109);d(109);d(109);d(7);d(8);d(9);q;q;q
% 0.48/1.11 { }.
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 % SZS output end Refutation
% 0.48/1.11 found a proof!
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Unprocessed initial clauses:
% 0.48/1.11
% 0.48/1.11 (127) {G0,W7,D4,L1,V2,M1} { mult( Y, ld( Y, X ) ) = X }.
% 0.48/1.11 (128) {G0,W7,D4,L1,V2,M1} { ld( Y, mult( Y, X ) ) = X }.
% 0.48/1.11 (129) {G0,W7,D4,L1,V2,M1} { mult( rd( Y, X ), X ) = Y }.
% 0.48/1.11 (130) {G0,W7,D4,L1,V2,M1} { rd( mult( Y, X ), X ) = Y }.
% 0.48/1.11 (131) {G0,W5,D3,L1,V1,M1} { mult( X, unit ) = X }.
% 0.48/1.11 (132) {G0,W5,D3,L1,V1,M1} { mult( unit, X ) = X }.
% 0.48/1.11 (133) {G0,W15,D5,L1,V3,M1} { mult( Z, mult( Y, mult( Y, X ) ) ) = mult(
% 0.48/1.11 mult( mult( Z, Y ), Y ), X ) }.
% 0.48/1.11 (134) {G0,W11,D4,L1,V2,M1} { mult( op_c, mult( Y, X ) ) = mult( mult( op_c
% 0.48/1.11 , Y ), X ) }.
% 0.48/1.11 (135) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( X, op_c ) ) = mult( mult( Y, X
% 0.48/1.11 ), op_c ) }.
% 0.48/1.11 (136) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( op_c, X ) ) = mult( mult( Y,
% 0.48/1.11 op_c ), X ) }.
% 0.48/1.11 (137) {G0,W7,D4,L1,V1,M1} { op_d = ld( X, mult( op_c, X ) ) }.
% 0.48/1.11 (138) {G0,W11,D6,L1,V2,M1} { op_e = mult( mult( rd( op_c, mult( Y, X ) ),
% 0.48/1.11 X ), Y ) }.
% 0.48/1.11 (139) {G0,W11,D6,L1,V2,M1} { op_f = mult( Y, mult( X, ld( mult( Y, X ),
% 0.48/1.11 op_c ) ) ) }.
% 0.48/1.11 (140) {G0,W33,D4,L3,V0,M3} { ! mult( op_f, mult( skol1, skol2 ) ) = mult(
% 0.48/1.11 mult( op_f, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_f ) ) = mult
% 0.48/1.11 ( mult( skol1, skol2 ), op_f ), ! mult( skol1, mult( op_f, skol2 ) ) =
% 0.48/1.11 mult( mult( skol1, op_f ), skol2 ) }.
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Total Proof:
% 0.48/1.11
% 0.48/1.11 subsumption: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.48/1.11 parent0: (127) {G0,W7,D4,L1,V2,M1} { mult( Y, ld( Y, X ) ) = X }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.48/1.11 parent0: (128) {G0,W7,D4,L1,V2,M1} { ld( Y, mult( Y, X ) ) = X }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (2) {G0,W7,D4,L1,V2,M1} I { mult( rd( Y, X ), X ) ==> Y }.
% 0.48/1.11 parent0: (129) {G0,W7,D4,L1,V2,M1} { mult( rd( Y, X ), X ) = Y }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (3) {G0,W7,D4,L1,V2,M1} I { rd( mult( Y, X ), X ) ==> Y }.
% 0.48/1.11 parent0: (130) {G0,W7,D4,L1,V2,M1} { rd( mult( Y, X ), X ) = Y }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (7) {G0,W11,D4,L1,V2,M1} I { mult( op_c, mult( Y, X ) ) ==>
% 0.48/1.11 mult( mult( op_c, Y ), X ) }.
% 0.48/1.11 parent0: (134) {G0,W11,D4,L1,V2,M1} { mult( op_c, mult( Y, X ) ) = mult(
% 0.48/1.11 mult( op_c, Y ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==>
% 0.48/1.11 mult( mult( Y, X ), op_c ) }.
% 0.48/1.11 parent0: (135) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( X, op_c ) ) = mult(
% 0.48/1.11 mult( Y, X ), op_c ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==>
% 0.48/1.11 mult( mult( Y, op_c ), X ) }.
% 0.48/1.11 parent0: (136) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( op_c, X ) ) = mult(
% 0.48/1.11 mult( Y, op_c ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (188) {G0,W7,D4,L1,V1,M1} { ld( X, mult( op_c, X ) ) = op_d }.
% 0.48/1.11 parent0[0]: (137) {G0,W7,D4,L1,V1,M1} { op_d = ld( X, mult( op_c, X ) )
% 0.48/1.11 }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d
% 0.48/1.11 }.
% 0.48/1.11 parent0: (188) {G0,W7,D4,L1,V1,M1} { ld( X, mult( op_c, X ) ) = op_d }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (200) {G0,W11,D6,L1,V2,M1} { mult( mult( rd( op_c, mult( X, Y ) )
% 0.48/1.11 , Y ), X ) = op_e }.
% 0.48/1.11 parent0[0]: (138) {G0,W11,D6,L1,V2,M1} { op_e = mult( mult( rd( op_c, mult
% 0.48/1.11 ( Y, X ) ), X ), Y ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.48/1.11 ) ), X ), Y ) ==> op_e }.
% 0.48/1.11 parent0: (200) {G0,W11,D6,L1,V2,M1} { mult( mult( rd( op_c, mult( X, Y ) )
% 0.48/1.11 , Y ), X ) = op_e }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (213) {G0,W11,D6,L1,V2,M1} { mult( X, mult( Y, ld( mult( X, Y ),
% 0.48/1.11 op_c ) ) ) = op_f }.
% 0.48/1.11 parent0[0]: (139) {G0,W11,D6,L1,V2,M1} { op_f = mult( Y, mult( X, ld( mult
% 0.48/1.11 ( Y, X ), op_c ) ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (12) {G0,W11,D6,L1,V2,M1} I { mult( Y, mult( X, ld( mult( Y, X
% 0.48/1.11 ), op_c ) ) ) ==> op_f }.
% 0.48/1.11 parent0: (213) {G0,W11,D6,L1,V2,M1} { mult( X, mult( Y, ld( mult( X, Y ),
% 0.48/1.11 op_c ) ) ) = op_f }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (13) {G0,W33,D4,L3,V0,M3} I { ! mult( op_f, mult( skol1, skol2
% 0.48/1.11 ) ) ==> mult( mult( op_f, skol1 ), skol2 ), ! mult( skol1, mult( skol2,
% 0.48/1.11 op_f ) ) ==> mult( mult( skol1, skol2 ), op_f ), ! mult( skol1, mult(
% 0.48/1.11 op_f, skol2 ) ) ==> mult( mult( skol1, op_f ), skol2 ) }.
% 0.48/1.11 parent0: (140) {G0,W33,D4,L3,V0,M3} { ! mult( op_f, mult( skol1, skol2 ) )
% 0.48/1.11 = mult( mult( op_f, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_f )
% 0.48/1.11 ) = mult( mult( skol1, skol2 ), op_f ), ! mult( skol1, mult( op_f, skol2
% 0.48/1.11 ) ) = mult( mult( skol1, op_f ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 1 ==> 1
% 0.48/1.11 2 ==> 2
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (234) {G0,W7,D4,L1,V1,M1} { op_d ==> ld( X, mult( op_c, X ) ) }.
% 0.48/1.11 parent0[0]: (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d
% 0.48/1.11 }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (236) {G1,W3,D2,L1,V0,M1} { op_d ==> op_c }.
% 0.48/1.11 parent0[0]: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.48/1.11 parent1[0; 2]: (234) {G0,W7,D4,L1,V1,M1} { op_d ==> ld( X, mult( op_c, X )
% 0.48/1.11 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := op_c
% 0.48/1.11 Y := op_c
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := op_c
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (30) {G1,W3,D2,L1,V0,M1} P(10,1) { op_d ==> op_c }.
% 0.48/1.11 parent0: (236) {G1,W3,D2,L1,V0,M1} { op_d ==> op_c }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (239) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.48/1.11 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (244) {G1,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X, op_d )
% 0.48/1.11 }.
% 0.48/1.11 parent0[0]: (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d
% 0.48/1.11 }.
% 0.48/1.11 parent1[0; 6]: (239) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 Y := mult( op_c, X )
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (245) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X, op_c )
% 0.48/1.11 }.
% 0.48/1.11 parent0[0]: (30) {G1,W3,D2,L1,V0,M1} P(10,1) { op_d ==> op_c }.
% 0.48/1.11 parent1[0; 6]: (244) {G1,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X,
% 0.48/1.11 op_d ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (246) {G2,W7,D3,L1,V1,M1} { mult( X, op_c ) ==> mult( op_c, X )
% 0.48/1.11 }.
% 0.48/1.11 parent0[0]: (245) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X, op_c
% 0.48/1.11 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (32) {G2,W7,D3,L1,V1,M1} P(10,0);d(30) { mult( X, op_c ) =
% 0.48/1.11 mult( op_c, X ) }.
% 0.48/1.11 parent0: (246) {G2,W7,D3,L1,V1,M1} { mult( X, op_c ) ==> mult( op_c, X )
% 0.48/1.11 }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (247) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) = mult( X, op_c ) }.
% 0.48/1.11 parent0[0]: (32) {G2,W7,D3,L1,V1,M1} P(10,0);d(30) { mult( X, op_c ) = mult
% 0.48/1.11 ( op_c, X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (248) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.48/1.11 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (249) {G1,W7,D4,L1,V1,M1} { X ==> mult( ld( op_c, X ), op_c ) }.
% 0.48/1.11 parent0[0]: (247) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) = mult( X, op_c )
% 0.48/1.11 }.
% 0.48/1.11 parent1[0; 2]: (248) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := ld( op_c, X )
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := op_c
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (250) {G1,W7,D4,L1,V1,M1} { mult( ld( op_c, X ), op_c ) ==> X }.
% 0.48/1.11 parent0[0]: (249) {G1,W7,D4,L1,V1,M1} { X ==> mult( ld( op_c, X ), op_c )
% 0.48/1.11 }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c )
% 0.48/1.11 ==> X }.
% 0.48/1.11 parent0: (250) {G1,W7,D4,L1,V1,M1} { mult( ld( op_c, X ), op_c ) ==> X }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (252) {G0,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), Y ) ==> mult(
% 0.48/1.11 X, mult( op_c, Y ) ) }.
% 0.48/1.11 parent0[0]: (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==>
% 0.48/1.11 mult( mult( Y, op_c ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (254) {G1,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), ld( op_c, Y )
% 0.48/1.11 ) ==> mult( X, Y ) }.
% 0.48/1.11 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.48/1.11 parent1[0; 10]: (252) {G0,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), Y )
% 0.48/1.11 ==> mult( X, mult( op_c, Y ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := op_c
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 Y := ld( op_c, Y )
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld(
% 0.48/1.11 op_c, X ) ) ==> mult( Y, X ) }.
% 0.48/1.11 parent0: (254) {G1,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), ld( op_c, Y )
% 0.48/1.11 ) ==> mult( X, Y ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (258) {G1,W11,D4,L1,V2,M1} { mult( X, Y ) ==> mult( mult( X, op_c
% 0.48/1.11 ), ld( op_c, Y ) ) }.
% 0.48/1.11 parent0[0]: (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld(
% 0.48/1.11 op_c, X ) ) ==> mult( Y, X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (261) {G2,W11,D4,L1,V2,M1} { mult( ld( op_c, X ), Y ) ==> mult( X
% 0.48/1.11 , ld( op_c, Y ) ) }.
% 0.48/1.11 parent0[0]: (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c )
% 0.48/1.11 ==> X }.
% 0.48/1.11 parent1[0; 7]: (258) {G1,W11,D4,L1,V2,M1} { mult( X, Y ) ==> mult( mult( X
% 0.48/1.11 , op_c ), ld( op_c, Y ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := ld( op_c, X )
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (266) {G2,W11,D4,L1,V2,M1} { mult( X, ld( op_c, Y ) ) ==> mult( ld
% 0.48/1.11 ( op_c, X ), Y ) }.
% 0.48/1.11 parent0[0]: (261) {G2,W11,D4,L1,V2,M1} { mult( ld( op_c, X ), Y ) ==> mult
% 0.48/1.11 ( X, ld( op_c, Y ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (65) {G4,W11,D4,L1,V2,M1} P(49,63) { mult( X, ld( op_c, Y ) )
% 0.48/1.11 ==> mult( ld( op_c, X ), Y ) }.
% 0.48/1.11 parent0: (266) {G2,W11,D4,L1,V2,M1} { mult( X, ld( op_c, Y ) ) ==> mult(
% 0.48/1.11 ld( op_c, X ), Y ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (267) {G0,W11,D6,L1,V2,M1} { op_e ==> mult( mult( rd( op_c, mult(
% 0.48/1.11 X, Y ) ), Y ), X ) }.
% 0.48/1.11 parent0[0]: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.48/1.11 ) ), X ), Y ) ==> op_e }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (271) {G1,W11,D6,L1,V1,M1} { op_e ==> mult( rd( op_c, mult( ld(
% 0.48/1.11 op_c, X ), op_c ) ), X ) }.
% 0.48/1.11 parent0[0]: (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld(
% 0.48/1.11 op_c, X ) ) ==> mult( Y, X ) }.
% 0.48/1.11 parent1[0; 2]: (267) {G0,W11,D6,L1,V2,M1} { op_e ==> mult( mult( rd( op_c
% 0.48/1.11 , mult( X, Y ) ), Y ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := rd( op_c, mult( ld( op_c, X ), op_c ) )
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := ld( op_c, X )
% 0.48/1.11 Y := op_c
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (273) {G2,W7,D4,L1,V1,M1} { op_e ==> mult( rd( op_c, X ), X ) }.
% 0.48/1.11 parent0[0]: (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c )
% 0.48/1.11 ==> X }.
% 0.48/1.11 parent1[0; 5]: (271) {G1,W11,D6,L1,V1,M1} { op_e ==> mult( rd( op_c, mult
% 0.48/1.11 ( ld( op_c, X ), op_c ) ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (274) {G1,W3,D2,L1,V0,M1} { op_e ==> op_c }.
% 0.48/1.11 parent0[0]: (2) {G0,W7,D4,L1,V2,M1} I { mult( rd( Y, X ), X ) ==> Y }.
% 0.48/1.11 parent1[0; 2]: (273) {G2,W7,D4,L1,V1,M1} { op_e ==> mult( rd( op_c, X ), X
% 0.48/1.11 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := op_c
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.48/1.11 }.
% 0.48/1.11 parent0: (274) {G1,W3,D2,L1,V0,M1} { op_e ==> op_c }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (277) {G0,W11,D6,L1,V2,M1} { op_e ==> mult( mult( rd( op_c, mult(
% 0.48/1.11 X, Y ) ), Y ), X ) }.
% 0.48/1.11 parent0[0]: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.48/1.11 ) ), X ), Y ) ==> op_e }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (279) {G1,W11,D5,L1,V2,M1} { op_e ==> mult( mult( rd( op_c, Y ),
% 0.48/1.11 ld( X, Y ) ), X ) }.
% 0.48/1.11 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.48/1.11 parent1[0; 6]: (277) {G0,W11,D6,L1,V2,M1} { op_e ==> mult( mult( rd( op_c
% 0.48/1.11 , mult( X, Y ) ), Y ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 Y := ld( X, Y )
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (280) {G2,W11,D5,L1,V2,M1} { op_c ==> mult( mult( rd( op_c, X ),
% 0.48/1.11 ld( Y, X ) ), Y ) }.
% 0.48/1.11 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.48/1.11 }.
% 0.48/1.11 parent1[0; 1]: (279) {G1,W11,D5,L1,V2,M1} { op_e ==> mult( mult( rd( op_c
% 0.48/1.11 , Y ), ld( X, Y ) ), X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (281) {G2,W11,D5,L1,V2,M1} { mult( mult( rd( op_c, X ), ld( Y, X )
% 0.48/1.11 ), Y ) ==> op_c }.
% 0.48/1.11 parent0[0]: (280) {G2,W11,D5,L1,V2,M1} { op_c ==> mult( mult( rd( op_c, X
% 0.48/1.11 ), ld( Y, X ) ), Y ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (99) {G5,W11,D5,L1,V2,M1} P(0,11);d(83) { mult( mult( rd( op_c
% 0.48/1.11 , Y ), ld( X, Y ) ), X ) ==> op_c }.
% 0.48/1.11 parent0: (281) {G2,W11,D5,L1,V2,M1} { mult( mult( rd( op_c, X ), ld( Y, X
% 0.48/1.11 ) ), Y ) ==> op_c }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (283) {G0,W7,D4,L1,V2,M1} { X ==> rd( mult( X, Y ), Y ) }.
% 0.48/1.11 parent0[0]: (3) {G0,W7,D4,L1,V2,M1} I { rd( mult( Y, X ), X ) ==> Y }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (285) {G1,W11,D5,L1,V2,M1} { mult( rd( op_c, mult( X, Y ) ), Y )
% 0.48/1.11 ==> rd( op_e, X ) }.
% 0.48/1.11 parent0[0]: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.48/1.11 ) ), X ), Y ) ==> op_e }.
% 0.48/1.11 parent1[0; 9]: (283) {G0,W7,D4,L1,V2,M1} { X ==> rd( mult( X, Y ), Y ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := mult( rd( op_c, mult( X, Y ) ), Y )
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (286) {G2,W11,D5,L1,V2,M1} { mult( rd( op_c, mult( X, Y ) ), Y )
% 0.48/1.11 ==> rd( op_c, X ) }.
% 0.48/1.11 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.48/1.11 }.
% 0.48/1.11 parent1[0; 9]: (285) {G1,W11,D5,L1,V2,M1} { mult( rd( op_c, mult( X, Y ) )
% 0.48/1.11 , Y ) ==> rd( op_e, X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (100) {G5,W11,D5,L1,V2,M1} P(11,3);d(83) { mult( rd( op_c,
% 0.48/1.11 mult( X, Y ) ), Y ) ==> rd( op_c, X ) }.
% 0.48/1.11 parent0: (286) {G2,W11,D5,L1,V2,M1} { mult( rd( op_c, mult( X, Y ) ), Y )
% 0.48/1.11 ==> rd( op_c, X ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqswap: (289) {G0,W11,D6,L1,V2,M1} { op_f ==> mult( X, mult( Y, ld( mult(
% 0.48/1.11 X, Y ), op_c ) ) ) }.
% 0.48/1.11 parent0[0]: (12) {G0,W11,D6,L1,V2,M1} I { mult( Y, mult( X, ld( mult( Y, X
% 0.48/1.11 ), op_c ) ) ) ==> op_f }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (296) {G1,W15,D6,L1,V2,M1} { op_f ==> mult( mult( rd( op_c, mult
% 0.48/1.11 ( X, Y ) ), Y ), mult( X, ld( op_e, op_c ) ) ) }.
% 0.48/1.11 parent0[0]: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.48/1.11 ) ), X ), Y ) ==> op_e }.
% 0.48/1.11 parent1[0; 13]: (289) {G0,W11,D6,L1,V2,M1} { op_f ==> mult( X, mult( Y, ld
% 0.48/1.11 ( mult( X, Y ), op_c ) ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := Y
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := mult( rd( op_c, mult( X, Y ) ), Y )
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (297) {G2,W11,D5,L1,V1,M1} { op_f ==> mult( rd( op_c, X ), mult(
% 0.48/1.11 X, ld( op_e, op_c ) ) ) }.
% 0.48/1.11 parent0[0]: (100) {G5,W11,D5,L1,V2,M1} P(11,3);d(83) { mult( rd( op_c, mult
% 0.48/1.11 ( X, Y ) ), Y ) ==> rd( op_c, X ) }.
% 0.48/1.11 parent1[0; 3]: (296) {G1,W15,D6,L1,V2,M1} { op_f ==> mult( mult( rd( op_c
% 0.48/1.11 , mult( X, Y ) ), Y ), mult( X, ld( op_e, op_c ) ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 Y := Y
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (298) {G3,W11,D5,L1,V1,M1} { op_f ==> mult( rd( op_c, X ), mult(
% 0.48/1.11 X, ld( op_c, op_c ) ) ) }.
% 0.48/1.11 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.48/1.11 }.
% 0.48/1.11 parent1[0; 9]: (297) {G2,W11,D5,L1,V1,M1} { op_f ==> mult( rd( op_c, X ),
% 0.48/1.11 mult( X, ld( op_e, op_c ) ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (299) {G4,W11,D5,L1,V1,M1} { op_f ==> mult( rd( op_c, X ), mult(
% 0.48/1.11 ld( op_c, X ), op_c ) ) }.
% 0.48/1.11 parent0[0]: (65) {G4,W11,D4,L1,V2,M1} P(49,63) { mult( X, ld( op_c, Y ) )
% 0.48/1.11 ==> mult( ld( op_c, X ), Y ) }.
% 0.48/1.11 parent1[0; 6]: (298) {G3,W11,D5,L1,V1,M1} { op_f ==> mult( rd( op_c, X ),
% 0.48/1.11 mult( X, ld( op_c, op_c ) ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := X
% 0.48/1.11 Y := op_c
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (300) {G1,W11,D5,L1,V1,M1} { op_f ==> mult( mult( rd( op_c, X ),
% 0.48/1.11 ld( op_c, X ) ), op_c ) }.
% 0.48/1.11 parent0[0]: (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==>
% 0.48/1.11 mult( mult( Y, X ), op_c ) }.
% 0.48/1.11 parent1[0; 2]: (299) {G4,W11,D5,L1,V1,M1} { op_f ==> mult( rd( op_c, X ),
% 0.48/1.11 mult( ld( op_c, X ), op_c ) ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := ld( op_c, X )
% 0.48/1.11 Y := rd( op_c, X )
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (301) {G2,W3,D2,L1,V0,M1} { op_f ==> op_c }.
% 0.48/1.11 parent0[0]: (99) {G5,W11,D5,L1,V2,M1} P(0,11);d(83) { mult( mult( rd( op_c
% 0.48/1.11 , Y ), ld( X, Y ) ), X ) ==> op_c }.
% 0.48/1.11 parent1[0; 2]: (300) {G1,W11,D5,L1,V1,M1} { op_f ==> mult( mult( rd( op_c
% 0.48/1.11 , X ), ld( op_c, X ) ), op_c ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := op_c
% 0.48/1.11 Y := X
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 X := X
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(
% 0.48/1.11 99) { op_f ==> op_c }.
% 0.48/1.11 parent0: (301) {G2,W3,D2,L1,V0,M1} { op_f ==> op_c }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 0 ==> 0
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (321) {G1,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_f, skol2 ) )
% 0.48/1.11 ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f, mult( skol1, skol2
% 0.48/1.11 ) ) ==> mult( mult( op_f, skol1 ), skol2 ), ! mult( skol1, mult( skol2,
% 0.48/1.11 op_f ) ) ==> mult( mult( skol1, skol2 ), op_f ) }.
% 0.48/1.11 parent0[0]: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99
% 0.48/1.11 ) { op_f ==> op_c }.
% 0.48/1.11 parent1[2; 10]: (13) {G0,W33,D4,L3,V0,M3} I { ! mult( op_f, mult( skol1,
% 0.48/1.11 skol2 ) ) ==> mult( mult( op_f, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.48/1.11 skol2, op_f ) ) ==> mult( mult( skol1, skol2 ), op_f ), ! mult( skol1,
% 0.48/1.11 mult( op_f, skol2 ) ) ==> mult( mult( skol1, op_f ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (342) {G2,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2, op_f ) )
% 0.48/1.11 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_f, skol2
% 0.48/1.11 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f, mult( skol1,
% 0.48/1.11 skol2 ) ) ==> mult( mult( op_f, skol1 ), skol2 ) }.
% 0.48/1.11 parent0[0]: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99
% 0.48/1.11 ) { op_f ==> op_c }.
% 0.48/1.11 parent1[2; 11]: (321) {G1,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_f,
% 0.48/1.11 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f, mult(
% 0.48/1.11 skol1, skol2 ) ) ==> mult( mult( op_f, skol1 ), skol2 ), ! mult( skol1,
% 0.48/1.11 mult( skol2, op_f ) ) ==> mult( mult( skol1, skol2 ), op_f ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (359) {G3,W33,D4,L3,V0,M3} { ! mult( op_f, mult( skol1, skol2 ) )
% 0.48/1.11 ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_f
% 0.48/1.11 ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_f,
% 0.48/1.11 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 parent0[0]: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99
% 0.48/1.11 ) { op_f ==> op_c }.
% 0.48/1.11 parent1[2; 9]: (342) {G2,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2,
% 0.48/1.11 op_f ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult(
% 0.48/1.11 op_f, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f,
% 0.48/1.11 mult( skol1, skol2 ) ) ==> mult( mult( op_f, skol1 ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (362) {G4,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_c, skol2 ) )
% 0.48/1.11 ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f, mult( skol1, skol2
% 0.48/1.11 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2,
% 0.48/1.11 op_f ) ) ==> mult( mult( skol1, skol2 ), op_c ) }.
% 0.48/1.11 parent0[0]: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99
% 0.48/1.11 ) { op_f ==> op_c }.
% 0.48/1.11 parent1[2; 5]: (359) {G3,W33,D4,L3,V0,M3} { ! mult( op_f, mult( skol1,
% 0.48/1.11 skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.48/1.11 skol2, op_f ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1,
% 0.48/1.11 mult( op_f, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (364) {G5,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2, op_c ) )
% 0.48/1.11 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_c, skol2
% 0.48/1.11 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f, mult( skol1,
% 0.48/1.11 skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 parent0[0]: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99
% 0.48/1.11 ) { op_f ==> op_c }.
% 0.48/1.11 parent1[2; 6]: (362) {G4,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_c,
% 0.48/1.11 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f, mult(
% 0.48/1.11 skol1, skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1,
% 0.48/1.11 mult( skol2, op_f ) ) ==> mult( mult( skol1, skol2 ), op_c ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (365) {G6,W33,D4,L3,V0,M3} { ! mult( op_c, mult( skol1, skol2 ) )
% 0.48/1.11 ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_c
% 0.48/1.11 ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_c,
% 0.48/1.11 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 parent0[0]: (109) {G6,W3,D2,L1,V0,M1} P(11,12);d(100);d(83);d(65);d(8);d(99
% 0.48/1.11 ) { op_f ==> op_c }.
% 0.48/1.11 parent1[2; 3]: (364) {G5,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2,
% 0.48/1.11 op_c ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult(
% 0.48/1.11 op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_f,
% 0.48/1.11 mult( skol1, skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (370) {G1,W33,D4,L3,V0,M3} { ! mult( mult( op_c, skol1 ), skol2 )
% 0.48/1.11 ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_c
% 0.48/1.11 ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_c,
% 0.48/1.11 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 parent0[0]: (7) {G0,W11,D4,L1,V2,M1} I { mult( op_c, mult( Y, X ) ) ==>
% 0.48/1.11 mult( mult( op_c, Y ), X ) }.
% 0.48/1.11 parent1[0; 2]: (365) {G6,W33,D4,L3,V0,M3} { ! mult( op_c, mult( skol1,
% 0.48/1.11 skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.48/1.11 skol2, op_c ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1,
% 0.48/1.11 mult( op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := skol2
% 0.48/1.11 Y := skol1
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (371) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, skol2 ), op_c )
% 0.48/1.11 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1 ),
% 0.48/1.11 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( op_c
% 0.48/1.11 , skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 parent0[0]: (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==>
% 0.48/1.11 mult( mult( Y, X ), op_c ) }.
% 0.48/1.11 parent1[1; 2]: (370) {G1,W33,D4,L3,V0,M3} { ! mult( mult( op_c, skol1 ),
% 0.48/1.11 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.48/1.11 skol2, op_c ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1,
% 0.48/1.11 mult( op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := skol2
% 0.48/1.11 Y := skol1
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 paramod: (372) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, op_c ), skol2 )
% 0.48/1.11 ==> mult( mult( skol1, op_c ), skol2 ), ! mult( mult( skol1, skol2 ),
% 0.48/1.11 op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1
% 0.48/1.11 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 parent0[0]: (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==>
% 0.48/1.11 mult( mult( Y, op_c ), X ) }.
% 0.48/1.11 parent1[2; 2]: (371) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, skol2 ),
% 0.48/1.11 op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1
% 0.48/1.11 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.48/1.11 op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 X := skol2
% 0.48/1.11 Y := skol1
% 0.48/1.11 end
% 0.48/1.11 substitution1:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqrefl: (373) {G0,W22,D4,L2,V0,M2} { ! mult( mult( skol1, skol2 ), op_c )
% 0.48/1.11 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1 ),
% 0.48/1.11 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 parent0[0]: (372) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, op_c ),
% 0.48/1.11 skol2 ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( mult( skol1,
% 0.48/1.11 skol2 ), op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult(
% 0.48/1.11 op_c, skol1 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqrefl: (376) {G0,W11,D4,L1,V0,M1} { ! mult( mult( op_c, skol1 ), skol2 )
% 0.48/1.11 ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 parent0[0]: (373) {G0,W22,D4,L2,V0,M2} { ! mult( mult( skol1, skol2 ),
% 0.48/1.11 op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1
% 0.48/1.11 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 eqrefl: (378) {G0,W0,D0,L0,V0,M0} { }.
% 0.48/1.11 parent0[0]: (376) {G0,W11,D4,L1,V0,M1} { ! mult( mult( op_c, skol1 ),
% 0.48/1.11 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 subsumption: (125) {G7,W0,D0,L0,V0,M0} S(13);d(109);d(109);d(109);d(7);d(8)
% 0.48/1.11 ;d(9);q;q;q { }.
% 0.48/1.11 parent0: (378) {G0,W0,D0,L0,V0,M0} { }.
% 0.48/1.11 substitution0:
% 0.48/1.11 end
% 0.48/1.11 permutation0:
% 0.48/1.11 end
% 0.48/1.11
% 0.48/1.11 Proof check complete!
% 0.48/1.11
% 0.48/1.11 Memory use:
% 0.48/1.11
% 0.48/1.11 space for terms: 1847
% 0.48/1.11 space for clauses: 15206
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 clauses generated: 483
% 0.48/1.11 clauses kept: 126
% 0.48/1.11 clauses selected: 36
% 0.48/1.11 clauses deleted: 5
% 0.48/1.11 clauses inuse deleted: 0
% 0.48/1.11
% 0.48/1.11 subsentry: 1598
% 0.48/1.11 literals s-matched: 421
% 0.48/1.11 literals matched: 419
% 0.48/1.11 full subsumption: 0
% 0.48/1.11
% 0.48/1.11 checksum: -367023369
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Bliksem ended
%------------------------------------------------------------------------------