TSTP Solution File: GRP700+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:05 EDT 2022
% Result : Theorem 0.74s 1.09s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n017.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.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Tue Jun 14 03:08:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.09 *** allocated 10000 integers for termspace/termends
% 0.74/1.09 *** allocated 10000 integers for clauses
% 0.74/1.09 *** allocated 10000 integers for justifications
% 0.74/1.09 Bliksem 1.12
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Automatic Strategy Selection
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Clauses:
% 0.74/1.09
% 0.74/1.09 { mult( Y, ld( Y, X ) ) = X }.
% 0.74/1.09 { ld( Y, mult( Y, X ) ) = X }.
% 0.74/1.09 { mult( rd( Y, X ), X ) = Y }.
% 0.74/1.09 { rd( mult( Y, X ), X ) = Y }.
% 0.74/1.09 { mult( X, unit ) = X }.
% 0.74/1.09 { mult( unit, X ) = X }.
% 0.74/1.09 { mult( mult( mult( Z, Y ), Z ), mult( Z, X ) ) = mult( Z, mult( mult( mult
% 0.74/1.09 ( Y, Z ), Z ), X ) ) }.
% 0.74/1.09 { mult( mult( Z, Y ), mult( Y, mult( X, Y ) ) ) = mult( mult( Z, mult( Y,
% 0.74/1.09 mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 { ! mult( X, skol1 ) = unit, ! mult( skol1, X ) = unit }.
% 0.74/1.09
% 0.74/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.74/1.09 This is a pure equality problem
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Options Used:
% 0.74/1.09
% 0.74/1.09 useres = 1
% 0.74/1.09 useparamod = 1
% 0.74/1.09 useeqrefl = 1
% 0.74/1.09 useeqfact = 1
% 0.74/1.09 usefactor = 1
% 0.74/1.09 usesimpsplitting = 0
% 0.74/1.09 usesimpdemod = 5
% 0.74/1.09 usesimpres = 3
% 0.74/1.09
% 0.74/1.09 resimpinuse = 1000
% 0.74/1.09 resimpclauses = 20000
% 0.74/1.09 substype = eqrewr
% 0.74/1.09 backwardsubs = 1
% 0.74/1.09 selectoldest = 5
% 0.74/1.09
% 0.74/1.09 litorderings [0] = split
% 0.74/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.09
% 0.74/1.09 termordering = kbo
% 0.74/1.09
% 0.74/1.09 litapriori = 0
% 0.74/1.09 termapriori = 1
% 0.74/1.09 litaposteriori = 0
% 0.74/1.09 termaposteriori = 0
% 0.74/1.09 demodaposteriori = 0
% 0.74/1.09 ordereqreflfact = 0
% 0.74/1.09
% 0.74/1.09 litselect = negord
% 0.74/1.09
% 0.74/1.09 maxweight = 15
% 0.74/1.09 maxdepth = 30000
% 0.74/1.09 maxlength = 115
% 0.74/1.09 maxnrvars = 195
% 0.74/1.09 excuselevel = 1
% 0.74/1.09 increasemaxweight = 1
% 0.74/1.09
% 0.74/1.09 maxselected = 10000000
% 0.74/1.09 maxnrclauses = 10000000
% 0.74/1.09
% 0.74/1.09 showgenerated = 0
% 0.74/1.09 showkept = 0
% 0.74/1.09 showselected = 0
% 0.74/1.09 showdeleted = 0
% 0.74/1.09 showresimp = 1
% 0.74/1.09 showstatus = 2000
% 0.74/1.09
% 0.74/1.09 prologoutput = 0
% 0.74/1.09 nrgoals = 5000000
% 0.74/1.09 totalproof = 1
% 0.74/1.09
% 0.74/1.09 Symbols occurring in the translation:
% 0.74/1.09
% 0.74/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.09 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.74/1.09 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.74/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.09 ld [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.74/1.09 mult [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.74/1.09 rd [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.74/1.09 unit [40, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.74/1.09 skol1 [44, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Starting Search:
% 0.74/1.09
% 0.74/1.09 *** allocated 15000 integers for clauses
% 0.74/1.09 *** allocated 22500 integers for clauses
% 0.74/1.09
% 0.74/1.09 Bliksems!, er is een bewijs:
% 0.74/1.09 % SZS status Theorem
% 0.74/1.09 % SZS output start Refutation
% 0.74/1.09
% 0.74/1.09 (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.74/1.09 (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.74/1.09 (4) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.74/1.09 (5) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.74/1.09 (6) {G0,W19,D6,L1,V3,M1} I { mult( Z, mult( mult( mult( Y, Z ), Z ), X ) )
% 0.74/1.09 ==> mult( mult( mult( Z, Y ), Z ), mult( Z, X ) ) }.
% 0.74/1.09 (7) {G0,W19,D6,L1,V3,M1} I { mult( mult( Z, Y ), mult( Y, mult( X, Y ) ) )
% 0.74/1.09 ==> mult( mult( Z, mult( Y, mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 (8) {G0,W10,D3,L2,V1,M2} I { ! mult( X, skol1 ) ==> unit, ! mult( skol1, X
% 0.74/1.09 ) ==> unit }.
% 0.74/1.09 (15) {G1,W5,D3,L1,V1,M1} P(4,1) { ld( X, X ) ==> unit }.
% 0.74/1.09 (19) {G1,W10,D4,L2,V1,M2} P(0,8) { ! mult( ld( skol1, X ), skol1 ) ==> unit
% 0.74/1.09 , ! X = unit }.
% 0.74/1.09 (24) {G1,W19,D6,L1,V3,M1} P(6,1) { ld( X, mult( mult( mult( X, Y ), X ),
% 0.74/1.09 mult( X, Z ) ) ) ==> mult( mult( mult( Y, X ), X ), Z ) }.
% 0.74/1.09 (44) {G1,W15,D5,L1,V2,M1} P(5,7);d(5) { mult( X, mult( X, mult( Y, X ) ) )
% 0.74/1.09 ==> mult( mult( X, mult( X, Y ) ), X ) }.
% 0.74/1.09 (46) {G2,W15,D6,L1,V2,M1} P(44,1) { ld( X, mult( mult( X, mult( X, Y ) ), X
% 0.74/1.09 ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 (68) {G2,W15,D5,L1,V2,M1} P(4,24);d(5) { ld( X, mult( mult( X, X ), mult( X
% 0.74/1.09 , Y ) ) ) ==> mult( mult( X, X ), Y ) }.
% 0.74/1.09 (78) {G3,W15,D5,L1,V2,M1} P(7,68);d(46) { mult( X, mult( mult( X, Y ), X )
% 0.74/1.09 ) ==> mult( mult( X, X ), mult( Y, X ) ) }.
% 0.74/1.09 (83) {G4,W15,D5,L1,V2,M1} P(0,78) { mult( mult( X, X ), mult( ld( X, Y ), X
% 0.74/1.09 ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 (88) {G5,W15,D5,L1,V2,M1} P(83,1) { ld( mult( X, X ), mult( X, mult( Y, X )
% 0.74/1.09 ) ) ==> mult( ld( X, Y ), X ) }.
% 0.74/1.09 (91) {G6,W7,D4,L1,V1,M1} P(5,88);d(15) { mult( ld( X, unit ), X ) ==> unit
% 0.74/1.09 }.
% 0.74/1.09 (92) {G7,W0,D0,L0,V0,M0} R(91,19);q { }.
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 % SZS output end Refutation
% 0.74/1.09 found a proof!
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Unprocessed initial clauses:
% 0.74/1.09
% 0.74/1.09 (94) {G0,W7,D4,L1,V2,M1} { mult( Y, ld( Y, X ) ) = X }.
% 0.74/1.09 (95) {G0,W7,D4,L1,V2,M1} { ld( Y, mult( Y, X ) ) = X }.
% 0.74/1.09 (96) {G0,W7,D4,L1,V2,M1} { mult( rd( Y, X ), X ) = Y }.
% 0.74/1.09 (97) {G0,W7,D4,L1,V2,M1} { rd( mult( Y, X ), X ) = Y }.
% 0.74/1.09 (98) {G0,W5,D3,L1,V1,M1} { mult( X, unit ) = X }.
% 0.74/1.09 (99) {G0,W5,D3,L1,V1,M1} { mult( unit, X ) = X }.
% 0.74/1.09 (100) {G0,W19,D6,L1,V3,M1} { mult( mult( mult( Z, Y ), Z ), mult( Z, X ) )
% 0.74/1.09 = mult( Z, mult( mult( mult( Y, Z ), Z ), X ) ) }.
% 0.74/1.09 (101) {G0,W19,D6,L1,V3,M1} { mult( mult( Z, Y ), mult( Y, mult( X, Y ) ) )
% 0.74/1.09 = mult( mult( Z, mult( Y, mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 (102) {G0,W10,D3,L2,V1,M2} { ! mult( X, skol1 ) = unit, ! mult( skol1, X )
% 0.74/1.09 = unit }.
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Total Proof:
% 0.74/1.09
% 0.74/1.09 subsumption: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.74/1.09 parent0: (94) {G0,W7,D4,L1,V2,M1} { mult( Y, ld( Y, X ) ) = X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.74/1.09 parent0: (95) {G0,W7,D4,L1,V2,M1} { ld( Y, mult( Y, X ) ) = X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (4) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.74/1.09 parent0: (98) {G0,W5,D3,L1,V1,M1} { mult( X, unit ) = X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (5) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.74/1.09 parent0: (99) {G0,W5,D3,L1,V1,M1} { mult( unit, X ) = X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (123) {G0,W19,D6,L1,V3,M1} { mult( X, mult( mult( mult( Y, X ), X
% 0.74/1.09 ), Z ) ) = mult( mult( mult( X, Y ), X ), mult( X, Z ) ) }.
% 0.74/1.09 parent0[0]: (100) {G0,W19,D6,L1,V3,M1} { mult( mult( mult( Z, Y ), Z ),
% 0.74/1.09 mult( Z, X ) ) = mult( Z, mult( mult( mult( Y, Z ), Z ), X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Z
% 0.74/1.09 Y := Y
% 0.74/1.09 Z := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (6) {G0,W19,D6,L1,V3,M1} I { mult( Z, mult( mult( mult( Y, Z )
% 0.74/1.09 , Z ), X ) ) ==> mult( mult( mult( Z, Y ), Z ), mult( Z, X ) ) }.
% 0.74/1.09 parent0: (123) {G0,W19,D6,L1,V3,M1} { mult( X, mult( mult( mult( Y, X ), X
% 0.74/1.09 ), Z ) ) = mult( mult( mult( X, Y ), X ), mult( X, Z ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Z
% 0.74/1.09 Y := Y
% 0.74/1.09 Z := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (7) {G0,W19,D6,L1,V3,M1} I { mult( mult( Z, Y ), mult( Y, mult
% 0.74/1.09 ( X, Y ) ) ) ==> mult( mult( Z, mult( Y, mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 parent0: (101) {G0,W19,D6,L1,V3,M1} { mult( mult( Z, Y ), mult( Y, mult( X
% 0.74/1.09 , Y ) ) ) = mult( mult( Z, mult( Y, mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 Z := Z
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (8) {G0,W10,D3,L2,V1,M2} I { ! mult( X, skol1 ) ==> unit, !
% 0.74/1.09 mult( skol1, X ) ==> unit }.
% 0.74/1.09 parent0: (102) {G0,W10,D3,L2,V1,M2} { ! mult( X, skol1 ) = unit, ! mult(
% 0.74/1.09 skol1, X ) = unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 1 ==> 1
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (146) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) ) }.
% 0.74/1.09 parent0[0]: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (147) {G1,W5,D3,L1,V1,M1} { unit ==> ld( X, X ) }.
% 0.74/1.09 parent0[0]: (4) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.74/1.09 parent1[0; 4]: (146) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := unit
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (148) {G1,W5,D3,L1,V1,M1} { ld( X, X ) ==> unit }.
% 0.74/1.09 parent0[0]: (147) {G1,W5,D3,L1,V1,M1} { unit ==> ld( X, X ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (15) {G1,W5,D3,L1,V1,M1} P(4,1) { ld( X, X ) ==> unit }.
% 0.74/1.09 parent0: (148) {G1,W5,D3,L1,V1,M1} { ld( X, X ) ==> unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (150) {G0,W10,D3,L2,V1,M2} { ! unit ==> mult( X, skol1 ), ! mult(
% 0.74/1.09 skol1, X ) ==> unit }.
% 0.74/1.09 parent0[0]: (8) {G0,W10,D3,L2,V1,M2} I { ! mult( X, skol1 ) ==> unit, !
% 0.74/1.09 mult( skol1, X ) ==> unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (153) {G1,W10,D4,L2,V1,M2} { ! X ==> unit, ! unit ==> mult( ld(
% 0.74/1.09 skol1, X ), skol1 ) }.
% 0.74/1.09 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.74/1.09 parent1[1; 2]: (150) {G0,W10,D3,L2,V1,M2} { ! unit ==> mult( X, skol1 ), !
% 0.74/1.09 mult( skol1, X ) ==> unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := skol1
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := ld( skol1, X )
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (155) {G1,W10,D4,L2,V1,M2} { ! mult( ld( skol1, X ), skol1 ) ==>
% 0.74/1.09 unit, ! X ==> unit }.
% 0.74/1.09 parent0[1]: (153) {G1,W10,D4,L2,V1,M2} { ! X ==> unit, ! unit ==> mult( ld
% 0.74/1.09 ( skol1, X ), skol1 ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (19) {G1,W10,D4,L2,V1,M2} P(0,8) { ! mult( ld( skol1, X ),
% 0.74/1.09 skol1 ) ==> unit, ! X = unit }.
% 0.74/1.09 parent0: (155) {G1,W10,D4,L2,V1,M2} { ! mult( ld( skol1, X ), skol1 ) ==>
% 0.74/1.09 unit, ! X ==> unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 1 ==> 1
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (158) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) ) }.
% 0.74/1.09 parent0[0]: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (159) {G1,W19,D6,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z )
% 0.74/1.09 ==> ld( Y, mult( mult( mult( Y, X ), Y ), mult( Y, Z ) ) ) }.
% 0.74/1.09 parent0[0]: (6) {G0,W19,D6,L1,V3,M1} I { mult( Z, mult( mult( mult( Y, Z )
% 0.74/1.09 , Z ), X ) ) ==> mult( mult( mult( Z, Y ), Z ), mult( Z, X ) ) }.
% 0.74/1.09 parent1[0; 10]: (158) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) )
% 0.74/1.09 }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Z
% 0.74/1.09 Y := X
% 0.74/1.09 Z := Y
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := mult( mult( mult( X, Y ), Y ), Z )
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (160) {G1,W19,D6,L1,V3,M1} { ld( Y, mult( mult( mult( Y, X ), Y )
% 0.74/1.09 , mult( Y, Z ) ) ) ==> mult( mult( mult( X, Y ), Y ), Z ) }.
% 0.74/1.09 parent0[0]: (159) {G1,W19,D6,L1,V3,M1} { mult( mult( mult( X, Y ), Y ), Z
% 0.74/1.09 ) ==> ld( Y, mult( mult( mult( Y, X ), Y ), mult( Y, Z ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 Z := Z
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (24) {G1,W19,D6,L1,V3,M1} P(6,1) { ld( X, mult( mult( mult( X
% 0.74/1.09 , Y ), X ), mult( X, Z ) ) ) ==> mult( mult( mult( Y, X ), X ), Z ) }.
% 0.74/1.09 parent0: (160) {G1,W19,D6,L1,V3,M1} { ld( Y, mult( mult( mult( Y, X ), Y )
% 0.74/1.09 , mult( Y, Z ) ) ) ==> mult( mult( mult( X, Y ), Y ), Z ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 Z := Z
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (162) {G0,W19,D6,L1,V3,M1} { mult( mult( X, mult( Y, mult( Y, Z )
% 0.74/1.09 ) ), Y ) ==> mult( mult( X, Y ), mult( Y, mult( Z, Y ) ) ) }.
% 0.74/1.09 parent0[0]: (7) {G0,W19,D6,L1,V3,M1} I { mult( mult( Z, Y ), mult( Y, mult
% 0.74/1.09 ( X, Y ) ) ) ==> mult( mult( Z, mult( Y, mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Z
% 0.74/1.09 Y := Y
% 0.74/1.09 Z := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (166) {G1,W17,D6,L1,V2,M1} { mult( mult( unit, mult( X, mult( X,
% 0.74/1.09 Y ) ) ), X ) ==> mult( X, mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.74/1.09 parent1[0; 11]: (162) {G0,W19,D6,L1,V3,M1} { mult( mult( X, mult( Y, mult
% 0.74/1.09 ( Y, Z ) ) ), Y ) ==> mult( mult( X, Y ), mult( Y, mult( Z, Y ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := unit
% 0.74/1.09 Y := X
% 0.74/1.09 Z := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (179) {G1,W15,D5,L1,V2,M1} { mult( mult( X, mult( X, Y ) ), X )
% 0.74/1.09 ==> mult( X, mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.74/1.09 parent1[0; 2]: (166) {G1,W17,D6,L1,V2,M1} { mult( mult( unit, mult( X,
% 0.74/1.09 mult( X, Y ) ) ), X ) ==> mult( X, mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := mult( X, mult( X, Y ) )
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (180) {G1,W15,D5,L1,V2,M1} { mult( X, mult( X, mult( Y, X ) ) )
% 0.74/1.09 ==> mult( mult( X, mult( X, Y ) ), X ) }.
% 0.74/1.09 parent0[0]: (179) {G1,W15,D5,L1,V2,M1} { mult( mult( X, mult( X, Y ) ), X
% 0.74/1.09 ) ==> mult( X, mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (44) {G1,W15,D5,L1,V2,M1} P(5,7);d(5) { mult( X, mult( X, mult
% 0.74/1.09 ( Y, X ) ) ) ==> mult( mult( X, mult( X, Y ) ), X ) }.
% 0.74/1.09 parent0: (180) {G1,W15,D5,L1,V2,M1} { mult( X, mult( X, mult( Y, X ) ) )
% 0.74/1.09 ==> mult( mult( X, mult( X, Y ) ), X ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (182) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) ) }.
% 0.74/1.09 parent0[0]: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (183) {G1,W15,D6,L1,V2,M1} { mult( X, mult( Y, X ) ) ==> ld( X,
% 0.74/1.09 mult( mult( X, mult( X, Y ) ), X ) ) }.
% 0.74/1.09 parent0[0]: (44) {G1,W15,D5,L1,V2,M1} P(5,7);d(5) { mult( X, mult( X, mult
% 0.74/1.09 ( Y, X ) ) ) ==> mult( mult( X, mult( X, Y ) ), X ) }.
% 0.74/1.09 parent1[0; 8]: (182) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := mult( X, mult( Y, X ) )
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (184) {G1,W15,D6,L1,V2,M1} { ld( X, mult( mult( X, mult( X, Y ) )
% 0.74/1.09 , X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 parent0[0]: (183) {G1,W15,D6,L1,V2,M1} { mult( X, mult( Y, X ) ) ==> ld( X
% 0.74/1.09 , mult( mult( X, mult( X, Y ) ), X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (46) {G2,W15,D6,L1,V2,M1} P(44,1) { ld( X, mult( mult( X, mult
% 0.74/1.09 ( X, Y ) ), X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 parent0: (184) {G1,W15,D6,L1,V2,M1} { ld( X, mult( mult( X, mult( X, Y ) )
% 0.74/1.09 , X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (186) {G1,W19,D6,L1,V3,M1} { mult( mult( mult( Y, X ), X ), Z )
% 0.74/1.09 ==> ld( X, mult( mult( mult( X, Y ), X ), mult( X, Z ) ) ) }.
% 0.74/1.09 parent0[0]: (24) {G1,W19,D6,L1,V3,M1} P(6,1) { ld( X, mult( mult( mult( X,
% 0.74/1.09 Y ), X ), mult( X, Z ) ) ) ==> mult( mult( mult( Y, X ), X ), Z ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 Z := Z
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (191) {G1,W17,D5,L1,V2,M1} { mult( mult( mult( unit, X ), X ), Y
% 0.74/1.09 ) ==> ld( X, mult( mult( X, X ), mult( X, Y ) ) ) }.
% 0.74/1.09 parent0[0]: (4) {G0,W5,D3,L1,V1,M1} I { mult( X, unit ) ==> X }.
% 0.74/1.09 parent1[0; 12]: (186) {G1,W19,D6,L1,V3,M1} { mult( mult( mult( Y, X ), X )
% 0.74/1.09 , Z ) ==> ld( X, mult( mult( mult( X, Y ), X ), mult( X, Z ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := unit
% 0.74/1.09 Z := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (197) {G1,W15,D5,L1,V2,M1} { mult( mult( X, X ), Y ) ==> ld( X,
% 0.74/1.09 mult( mult( X, X ), mult( X, Y ) ) ) }.
% 0.74/1.09 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.74/1.09 parent1[0; 3]: (191) {G1,W17,D5,L1,V2,M1} { mult( mult( mult( unit, X ), X
% 0.74/1.09 ), Y ) ==> ld( X, mult( mult( X, X ), mult( X, Y ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (198) {G1,W15,D5,L1,V2,M1} { ld( X, mult( mult( X, X ), mult( X, Y
% 0.74/1.09 ) ) ) ==> mult( mult( X, X ), Y ) }.
% 0.74/1.09 parent0[0]: (197) {G1,W15,D5,L1,V2,M1} { mult( mult( X, X ), Y ) ==> ld( X
% 0.74/1.09 , mult( mult( X, X ), mult( X, Y ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (68) {G2,W15,D5,L1,V2,M1} P(4,24);d(5) { ld( X, mult( mult( X
% 0.74/1.09 , X ), mult( X, Y ) ) ) ==> mult( mult( X, X ), Y ) }.
% 0.74/1.09 parent0: (198) {G1,W15,D5,L1,V2,M1} { ld( X, mult( mult( X, X ), mult( X,
% 0.74/1.09 Y ) ) ) ==> mult( mult( X, X ), Y ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (200) {G2,W15,D5,L1,V2,M1} { mult( mult( X, X ), Y ) ==> ld( X,
% 0.74/1.09 mult( mult( X, X ), mult( X, Y ) ) ) }.
% 0.74/1.09 parent0[0]: (68) {G2,W15,D5,L1,V2,M1} P(4,24);d(5) { ld( X, mult( mult( X,
% 0.74/1.09 X ), mult( X, Y ) ) ) ==> mult( mult( X, X ), Y ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (203) {G1,W19,D7,L1,V2,M1} { mult( mult( X, X ), mult( Y, X ) )
% 0.74/1.09 ==> ld( X, mult( mult( X, mult( X, mult( X, Y ) ) ), X ) ) }.
% 0.74/1.09 parent0[0]: (7) {G0,W19,D6,L1,V3,M1} I { mult( mult( Z, Y ), mult( Y, mult
% 0.74/1.09 ( X, Y ) ) ) ==> mult( mult( Z, mult( Y, mult( Y, X ) ) ), Y ) }.
% 0.74/1.09 parent1[0; 10]: (200) {G2,W15,D5,L1,V2,M1} { mult( mult( X, X ), Y ) ==>
% 0.74/1.09 ld( X, mult( mult( X, X ), mult( X, Y ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 Z := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := mult( Y, X )
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (205) {G2,W15,D5,L1,V2,M1} { mult( mult( X, X ), mult( Y, X ) )
% 0.74/1.09 ==> mult( X, mult( mult( X, Y ), X ) ) }.
% 0.74/1.09 parent0[0]: (46) {G2,W15,D6,L1,V2,M1} P(44,1) { ld( X, mult( mult( X, mult
% 0.74/1.09 ( X, Y ) ), X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 parent1[0; 8]: (203) {G1,W19,D7,L1,V2,M1} { mult( mult( X, X ), mult( Y, X
% 0.74/1.09 ) ) ==> ld( X, mult( mult( X, mult( X, mult( X, Y ) ) ), X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := mult( X, Y )
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (206) {G2,W15,D5,L1,V2,M1} { mult( X, mult( mult( X, Y ), X ) )
% 0.74/1.09 ==> mult( mult( X, X ), mult( Y, X ) ) }.
% 0.74/1.09 parent0[0]: (205) {G2,W15,D5,L1,V2,M1} { mult( mult( X, X ), mult( Y, X )
% 0.74/1.09 ) ==> mult( X, mult( mult( X, Y ), X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (78) {G3,W15,D5,L1,V2,M1} P(7,68);d(46) { mult( X, mult( mult
% 0.74/1.09 ( X, Y ), X ) ) ==> mult( mult( X, X ), mult( Y, X ) ) }.
% 0.74/1.09 parent0: (206) {G2,W15,D5,L1,V2,M1} { mult( X, mult( mult( X, Y ), X ) )
% 0.74/1.09 ==> mult( mult( X, X ), mult( Y, X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (208) {G3,W15,D5,L1,V2,M1} { mult( mult( X, X ), mult( Y, X ) )
% 0.74/1.09 ==> mult( X, mult( mult( X, Y ), X ) ) }.
% 0.74/1.09 parent0[0]: (78) {G3,W15,D5,L1,V2,M1} P(7,68);d(46) { mult( X, mult( mult(
% 0.74/1.09 X, Y ), X ) ) ==> mult( mult( X, X ), mult( Y, X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (210) {G1,W15,D5,L1,V2,M1} { mult( mult( X, X ), mult( ld( X, Y )
% 0.74/1.09 , X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.74/1.09 parent1[0; 13]: (208) {G3,W15,D5,L1,V2,M1} { mult( mult( X, X ), mult( Y,
% 0.74/1.09 X ) ) ==> mult( X, mult( mult( X, Y ), X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := ld( X, Y )
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (83) {G4,W15,D5,L1,V2,M1} P(0,78) { mult( mult( X, X ), mult(
% 0.74/1.09 ld( X, Y ), X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 parent0: (210) {G1,W15,D5,L1,V2,M1} { mult( mult( X, X ), mult( ld( X, Y )
% 0.74/1.09 , X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (214) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) ) }.
% 0.74/1.09 parent0[0]: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := Y
% 0.74/1.09 Y := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (217) {G1,W15,D5,L1,V2,M1} { mult( ld( X, Y ), X ) ==> ld( mult(
% 0.74/1.09 X, X ), mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 parent0[0]: (83) {G4,W15,D5,L1,V2,M1} P(0,78) { mult( mult( X, X ), mult(
% 0.74/1.09 ld( X, Y ), X ) ) ==> mult( X, mult( Y, X ) ) }.
% 0.74/1.09 parent1[0; 10]: (214) {G0,W7,D4,L1,V2,M1} { Y ==> ld( X, mult( X, Y ) )
% 0.74/1.09 }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := mult( X, X )
% 0.74/1.09 Y := mult( ld( X, Y ), X )
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (218) {G1,W15,D5,L1,V2,M1} { ld( mult( X, X ), mult( X, mult( Y, X
% 0.74/1.09 ) ) ) ==> mult( ld( X, Y ), X ) }.
% 0.74/1.09 parent0[0]: (217) {G1,W15,D5,L1,V2,M1} { mult( ld( X, Y ), X ) ==> ld(
% 0.74/1.09 mult( X, X ), mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (88) {G5,W15,D5,L1,V2,M1} P(83,1) { ld( mult( X, X ), mult( X
% 0.74/1.09 , mult( Y, X ) ) ) ==> mult( ld( X, Y ), X ) }.
% 0.74/1.09 parent0: (218) {G1,W15,D5,L1,V2,M1} { ld( mult( X, X ), mult( X, mult( Y,
% 0.74/1.09 X ) ) ) ==> mult( ld( X, Y ), X ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (220) {G5,W15,D5,L1,V2,M1} { mult( ld( X, Y ), X ) ==> ld( mult( X
% 0.74/1.09 , X ), mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 parent0[0]: (88) {G5,W15,D5,L1,V2,M1} P(83,1) { ld( mult( X, X ), mult( X,
% 0.74/1.09 mult( Y, X ) ) ) ==> mult( ld( X, Y ), X ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 Y := Y
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (224) {G1,W13,D4,L1,V1,M1} { mult( ld( X, unit ), X ) ==> ld(
% 0.74/1.09 mult( X, X ), mult( X, X ) ) }.
% 0.74/1.09 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { mult( unit, X ) ==> X }.
% 0.74/1.09 parent1[0; 12]: (220) {G5,W15,D5,L1,V2,M1} { mult( ld( X, Y ), X ) ==> ld
% 0.74/1.09 ( mult( X, X ), mult( X, mult( Y, X ) ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 Y := unit
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 paramod: (226) {G2,W7,D4,L1,V1,M1} { mult( ld( X, unit ), X ) ==> unit }.
% 0.74/1.09 parent0[0]: (15) {G1,W5,D3,L1,V1,M1} P(4,1) { ld( X, X ) ==> unit }.
% 0.74/1.09 parent1[0; 6]: (224) {G1,W13,D4,L1,V1,M1} { mult( ld( X, unit ), X ) ==>
% 0.74/1.09 ld( mult( X, X ), mult( X, X ) ) }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := mult( X, X )
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (91) {G6,W7,D4,L1,V1,M1} P(5,88);d(15) { mult( ld( X, unit ),
% 0.74/1.09 X ) ==> unit }.
% 0.74/1.09 parent0: (226) {G2,W7,D4,L1,V1,M1} { mult( ld( X, unit ), X ) ==> unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 0 ==> 0
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (228) {G6,W7,D4,L1,V1,M1} { unit ==> mult( ld( X, unit ), X ) }.
% 0.74/1.09 parent0[0]: (91) {G6,W7,D4,L1,V1,M1} P(5,88);d(15) { mult( ld( X, unit ), X
% 0.74/1.09 ) ==> unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqswap: (229) {G1,W10,D4,L2,V1,M2} { ! unit ==> mult( ld( skol1, X ),
% 0.74/1.09 skol1 ), ! X = unit }.
% 0.74/1.09 parent0[0]: (19) {G1,W10,D4,L2,V1,M2} P(0,8) { ! mult( ld( skol1, X ),
% 0.74/1.09 skol1 ) ==> unit, ! X = unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := X
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 resolution: (232) {G2,W3,D2,L1,V0,M1} { ! unit = unit }.
% 0.74/1.09 parent0[0]: (229) {G1,W10,D4,L2,V1,M2} { ! unit ==> mult( ld( skol1, X ),
% 0.74/1.09 skol1 ), ! X = unit }.
% 0.74/1.09 parent1[0]: (228) {G6,W7,D4,L1,V1,M1} { unit ==> mult( ld( X, unit ), X )
% 0.74/1.09 }.
% 0.74/1.09 substitution0:
% 0.74/1.09 X := unit
% 0.74/1.09 end
% 0.74/1.09 substitution1:
% 0.74/1.09 X := skol1
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 eqrefl: (233) {G0,W0,D0,L0,V0,M0} { }.
% 0.74/1.09 parent0[0]: (232) {G2,W3,D2,L1,V0,M1} { ! unit = unit }.
% 0.74/1.09 substitution0:
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 subsumption: (92) {G7,W0,D0,L0,V0,M0} R(91,19);q { }.
% 0.74/1.09 parent0: (233) {G0,W0,D0,L0,V0,M0} { }.
% 0.74/1.09 substitution0:
% 0.74/1.09 end
% 0.74/1.09 permutation0:
% 0.74/1.09 end
% 0.74/1.09
% 0.74/1.09 Proof check complete!
% 0.74/1.09
% 0.74/1.09 Memory use:
% 0.74/1.09
% 0.74/1.09 space for terms: 1747
% 0.74/1.09 space for clauses: 15111
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 clauses generated: 1271
% 0.74/1.09 clauses kept: 93
% 0.74/1.09 clauses selected: 57
% 0.74/1.09 clauses deleted: 1
% 0.74/1.09 clauses inuse deleted: 0
% 0.74/1.09
% 0.74/1.09 subsentry: 578
% 0.74/1.09 literals s-matched: 205
% 0.74/1.09 literals matched: 202
% 0.74/1.09 full subsumption: 1
% 0.74/1.09
% 0.74/1.09 checksum: 116788127
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Bliksem ended
%------------------------------------------------------------------------------