TSTP Solution File: GRP703+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP703+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:08 EDT 2022
% Result : Theorem 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP703+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Tue Jun 14 01:52:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09
% 0.70/1.09 { mult( Y, ld( Y, X ) ) = X }.
% 0.70/1.09 { ld( Y, mult( Y, X ) ) = X }.
% 0.70/1.09 { mult( rd( Y, X ), X ) = Y }.
% 0.70/1.09 { rd( mult( Y, X ), X ) = Y }.
% 0.70/1.09 { mult( X, unit ) = X }.
% 0.70/1.09 { mult( unit, X ) = X }.
% 0.70/1.09 { mult( Z, mult( Y, mult( Y, X ) ) ) = mult( mult( mult( Z, Y ), Y ), X ) }
% 0.70/1.09 .
% 0.70/1.09 { mult( op_c, mult( Y, X ) ) = mult( mult( op_c, Y ), X ) }.
% 0.70/1.09 { mult( Y, mult( X, op_c ) ) = mult( mult( Y, X ), op_c ) }.
% 0.70/1.09 { mult( Y, mult( op_c, X ) ) = mult( mult( Y, op_c ), X ) }.
% 0.70/1.09 { op_d = ld( X, mult( op_c, X ) ) }.
% 0.70/1.09 { op_e = mult( mult( rd( op_c, mult( Y, X ) ), X ), Y ) }.
% 0.70/1.09 { op_f = mult( Y, mult( X, ld( mult( Y, X ), op_c ) ) ) }.
% 0.70/1.09 { ! mult( op_e, mult( skol1, skol2 ) ) = mult( mult( op_e, skol1 ), skol2 )
% 0.70/1.09 , ! mult( skol1, mult( skol2, op_e ) ) = mult( mult( skol1, skol2 ), op_e
% 0.70/1.09 ), ! mult( skol1, mult( op_e, skol2 ) ) = mult( mult( skol1, op_e ),
% 0.70/1.09 skol2 ) }.
% 0.70/1.09
% 0.70/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.09 This is a pure equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 1
% 0.70/1.09 useeqrefl = 1
% 0.70/1.09 useeqfact = 1
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 5
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = eqrewr
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.09
% 0.70/1.09 termordering = kbo
% 0.70/1.09
% 0.70/1.09 litapriori = 0
% 0.70/1.09 termapriori = 1
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = negord
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 0
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ld [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.70/1.09 mult [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.70/1.09 rd [39, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.70/1.09 unit [40, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.70/1.09 op_c [42, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.70/1.09 op_d [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.70/1.09 op_e [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.09 op_f [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.70/1.09 skol1 [48, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.70/1.09 skol2 [49, 0] (w:1, o:17, a:1, s:1, b:1).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09 *** allocated 15000 integers for clauses
% 0.70/1.09 *** allocated 22500 integers for clauses
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Theorem
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.70/1.09 (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.70/1.09 (2) {G0,W7,D4,L1,V2,M1} I { mult( rd( Y, X ), X ) ==> Y }.
% 0.70/1.09 (7) {G0,W11,D4,L1,V2,M1} I { mult( op_c, mult( Y, X ) ) ==> mult( mult(
% 0.70/1.09 op_c, Y ), X ) }.
% 0.70/1.09 (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==> mult( mult( Y,
% 0.70/1.09 X ), op_c ) }.
% 0.70/1.09 (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==> mult( mult( Y,
% 0.70/1.09 op_c ), X ) }.
% 0.70/1.09 (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d }.
% 0.70/1.09 (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X ) ), X ), Y
% 0.70/1.09 ) ==> op_e }.
% 0.70/1.09 (13) {G0,W33,D4,L3,V0,M3} I { ! mult( op_e, mult( skol1, skol2 ) ) ==> mult
% 0.70/1.09 ( mult( op_e, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_e ) ) ==>
% 0.70/1.09 mult( mult( skol1, skol2 ), op_e ), ! mult( skol1, mult( op_e, skol2 ) )
% 0.70/1.09 ==> mult( mult( skol1, op_e ), skol2 ) }.
% 0.70/1.09 (30) {G1,W3,D2,L1,V0,M1} P(10,1) { op_d ==> op_c }.
% 0.70/1.09 (32) {G2,W7,D3,L1,V1,M1} P(10,0);d(30) { mult( X, op_c ) = mult( op_c, X )
% 0.70/1.09 }.
% 0.70/1.09 (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c ) ==> X }.
% 0.70/1.09 (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld( op_c, X ) )
% 0.70/1.09 ==> mult( Y, X ) }.
% 0.70/1.09 (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c }.
% 0.70/1.09 (125) {G5,W0,D0,L0,V0,M0} S(13);d(83);d(83);d(83);d(7);d(8);d(9);q;q;q {
% 0.70/1.09 }.
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Unprocessed initial clauses:
% 0.70/1.09
% 0.70/1.09 (127) {G0,W7,D4,L1,V2,M1} { mult( Y, ld( Y, X ) ) = X }.
% 0.70/1.09 (128) {G0,W7,D4,L1,V2,M1} { ld( Y, mult( Y, X ) ) = X }.
% 0.70/1.09 (129) {G0,W7,D4,L1,V2,M1} { mult( rd( Y, X ), X ) = Y }.
% 0.70/1.09 (130) {G0,W7,D4,L1,V2,M1} { rd( mult( Y, X ), X ) = Y }.
% 0.70/1.09 (131) {G0,W5,D3,L1,V1,M1} { mult( X, unit ) = X }.
% 0.70/1.09 (132) {G0,W5,D3,L1,V1,M1} { mult( unit, X ) = X }.
% 0.70/1.09 (133) {G0,W15,D5,L1,V3,M1} { mult( Z, mult( Y, mult( Y, X ) ) ) = mult(
% 0.70/1.09 mult( mult( Z, Y ), Y ), X ) }.
% 0.70/1.09 (134) {G0,W11,D4,L1,V2,M1} { mult( op_c, mult( Y, X ) ) = mult( mult( op_c
% 0.70/1.09 , Y ), X ) }.
% 0.70/1.09 (135) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( X, op_c ) ) = mult( mult( Y, X
% 0.70/1.09 ), op_c ) }.
% 0.70/1.09 (136) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( op_c, X ) ) = mult( mult( Y,
% 0.70/1.09 op_c ), X ) }.
% 0.70/1.09 (137) {G0,W7,D4,L1,V1,M1} { op_d = ld( X, mult( op_c, X ) ) }.
% 0.70/1.09 (138) {G0,W11,D6,L1,V2,M1} { op_e = mult( mult( rd( op_c, mult( Y, X ) ),
% 0.70/1.09 X ), Y ) }.
% 0.70/1.09 (139) {G0,W11,D6,L1,V2,M1} { op_f = mult( Y, mult( X, ld( mult( Y, X ),
% 0.70/1.09 op_c ) ) ) }.
% 0.70/1.09 (140) {G0,W33,D4,L3,V0,M3} { ! mult( op_e, mult( skol1, skol2 ) ) = mult(
% 0.70/1.09 mult( op_e, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_e ) ) = mult
% 0.70/1.09 ( mult( skol1, skol2 ), op_e ), ! mult( skol1, mult( op_e, skol2 ) ) =
% 0.70/1.09 mult( mult( skol1, op_e ), skol2 ) }.
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Total Proof:
% 0.70/1.09
% 0.70/1.09 subsumption: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.70/1.09 parent0: (127) {G0,W7,D4,L1,V2,M1} { mult( Y, ld( Y, X ) ) = X }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.70/1.09 parent0: (128) {G0,W7,D4,L1,V2,M1} { ld( Y, mult( Y, X ) ) = X }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (2) {G0,W7,D4,L1,V2,M1} I { mult( rd( Y, X ), X ) ==> Y }.
% 0.70/1.09 parent0: (129) {G0,W7,D4,L1,V2,M1} { mult( rd( Y, X ), X ) = Y }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (7) {G0,W11,D4,L1,V2,M1} I { mult( op_c, mult( Y, X ) ) ==>
% 0.70/1.09 mult( mult( op_c, Y ), X ) }.
% 0.70/1.09 parent0: (134) {G0,W11,D4,L1,V2,M1} { mult( op_c, mult( Y, X ) ) = mult(
% 0.70/1.09 mult( op_c, Y ), X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==>
% 0.70/1.09 mult( mult( Y, X ), op_c ) }.
% 0.70/1.09 parent0: (135) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( X, op_c ) ) = mult(
% 0.70/1.09 mult( Y, X ), op_c ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==>
% 0.70/1.09 mult( mult( Y, op_c ), X ) }.
% 0.70/1.09 parent0: (136) {G0,W11,D4,L1,V2,M1} { mult( Y, mult( op_c, X ) ) = mult(
% 0.70/1.09 mult( Y, op_c ), X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (184) {G0,W7,D4,L1,V1,M1} { ld( X, mult( op_c, X ) ) = op_d }.
% 0.70/1.09 parent0[0]: (137) {G0,W7,D4,L1,V1,M1} { op_d = ld( X, mult( op_c, X ) )
% 0.70/1.09 }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d
% 0.70/1.09 }.
% 0.70/1.09 parent0: (184) {G0,W7,D4,L1,V1,M1} { ld( X, mult( op_c, X ) ) = op_d }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (196) {G0,W11,D6,L1,V2,M1} { mult( mult( rd( op_c, mult( X, Y ) )
% 0.70/1.09 , Y ), X ) = op_e }.
% 0.70/1.09 parent0[0]: (138) {G0,W11,D6,L1,V2,M1} { op_e = mult( mult( rd( op_c, mult
% 0.70/1.09 ( Y, X ) ), X ), Y ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.70/1.09 ) ), X ), Y ) ==> op_e }.
% 0.70/1.09 parent0: (196) {G0,W11,D6,L1,V2,M1} { mult( mult( rd( op_c, mult( X, Y ) )
% 0.70/1.09 , Y ), X ) = op_e }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (13) {G0,W33,D4,L3,V0,M3} I { ! mult( op_e, mult( skol1, skol2
% 0.70/1.09 ) ) ==> mult( mult( op_e, skol1 ), skol2 ), ! mult( skol1, mult( skol2,
% 0.70/1.09 op_e ) ) ==> mult( mult( skol1, skol2 ), op_e ), ! mult( skol1, mult(
% 0.70/1.09 op_e, skol2 ) ) ==> mult( mult( skol1, op_e ), skol2 ) }.
% 0.70/1.09 parent0: (140) {G0,W33,D4,L3,V0,M3} { ! mult( op_e, mult( skol1, skol2 ) )
% 0.70/1.09 = mult( mult( op_e, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_e )
% 0.70/1.09 ) = mult( mult( skol1, skol2 ), op_e ), ! mult( skol1, mult( op_e, skol2
% 0.70/1.09 ) ) = mult( mult( skol1, op_e ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 1
% 0.70/1.09 2 ==> 2
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (217) {G0,W7,D4,L1,V1,M1} { op_d ==> ld( X, mult( op_c, X ) ) }.
% 0.70/1.09 parent0[0]: (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d
% 0.70/1.09 }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (219) {G1,W3,D2,L1,V0,M1} { op_d ==> op_c }.
% 0.70/1.09 parent0[0]: (1) {G0,W7,D4,L1,V2,M1} I { ld( Y, mult( Y, X ) ) ==> X }.
% 0.70/1.09 parent1[0; 2]: (217) {G0,W7,D4,L1,V1,M1} { op_d ==> ld( X, mult( op_c, X )
% 0.70/1.09 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := op_c
% 0.70/1.09 Y := op_c
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := op_c
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (30) {G1,W3,D2,L1,V0,M1} P(10,1) { op_d ==> op_c }.
% 0.70/1.09 parent0: (219) {G1,W3,D2,L1,V0,M1} { op_d ==> op_c }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (222) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.70/1.09 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (227) {G1,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X, op_d )
% 0.70/1.09 }.
% 0.70/1.09 parent0[0]: (10) {G0,W7,D4,L1,V1,M1} I { ld( X, mult( op_c, X ) ) ==> op_d
% 0.70/1.09 }.
% 0.70/1.09 parent1[0; 6]: (222) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 Y := mult( op_c, X )
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (228) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X, op_c )
% 0.70/1.09 }.
% 0.70/1.09 parent0[0]: (30) {G1,W3,D2,L1,V0,M1} P(10,1) { op_d ==> op_c }.
% 0.70/1.09 parent1[0; 6]: (227) {G1,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X,
% 0.70/1.09 op_d ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (229) {G2,W7,D3,L1,V1,M1} { mult( X, op_c ) ==> mult( op_c, X )
% 0.70/1.09 }.
% 0.70/1.09 parent0[0]: (228) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) ==> mult( X, op_c
% 0.70/1.09 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (32) {G2,W7,D3,L1,V1,M1} P(10,0);d(30) { mult( X, op_c ) =
% 0.70/1.09 mult( op_c, X ) }.
% 0.70/1.09 parent0: (229) {G2,W7,D3,L1,V1,M1} { mult( X, op_c ) ==> mult( op_c, X )
% 0.70/1.09 }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (230) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) = mult( X, op_c ) }.
% 0.70/1.09 parent0[0]: (32) {G2,W7,D3,L1,V1,M1} P(10,0);d(30) { mult( X, op_c ) = mult
% 0.70/1.09 ( op_c, X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (231) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.70/1.09 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (232) {G1,W7,D4,L1,V1,M1} { X ==> mult( ld( op_c, X ), op_c ) }.
% 0.70/1.09 parent0[0]: (230) {G2,W7,D3,L1,V1,M1} { mult( op_c, X ) = mult( X, op_c )
% 0.70/1.09 }.
% 0.70/1.09 parent1[0; 2]: (231) {G0,W7,D4,L1,V2,M1} { Y ==> mult( X, ld( X, Y ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := ld( op_c, X )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := op_c
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (233) {G1,W7,D4,L1,V1,M1} { mult( ld( op_c, X ), op_c ) ==> X }.
% 0.70/1.09 parent0[0]: (232) {G1,W7,D4,L1,V1,M1} { X ==> mult( ld( op_c, X ), op_c )
% 0.70/1.09 }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c )
% 0.70/1.09 ==> X }.
% 0.70/1.09 parent0: (233) {G1,W7,D4,L1,V1,M1} { mult( ld( op_c, X ), op_c ) ==> X }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (235) {G0,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), Y ) ==> mult(
% 0.70/1.09 X, mult( op_c, Y ) ) }.
% 0.70/1.09 parent0[0]: (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==>
% 0.70/1.09 mult( mult( Y, op_c ), X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (237) {G1,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), ld( op_c, Y )
% 0.70/1.09 ) ==> mult( X, Y ) }.
% 0.70/1.09 parent0[0]: (0) {G0,W7,D4,L1,V2,M1} I { mult( Y, ld( Y, X ) ) ==> X }.
% 0.70/1.09 parent1[0; 10]: (235) {G0,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), Y )
% 0.70/1.09 ==> mult( X, mult( op_c, Y ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := op_c
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 Y := ld( op_c, Y )
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld(
% 0.70/1.09 op_c, X ) ) ==> mult( Y, X ) }.
% 0.70/1.09 parent0: (237) {G1,W11,D4,L1,V2,M1} { mult( mult( X, op_c ), ld( op_c, Y )
% 0.70/1.09 ) ==> mult( X, Y ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqswap: (240) {G0,W11,D6,L1,V2,M1} { op_e ==> mult( mult( rd( op_c, mult(
% 0.70/1.09 X, Y ) ), Y ), X ) }.
% 0.70/1.09 parent0[0]: (11) {G0,W11,D6,L1,V2,M1} I { mult( mult( rd( op_c, mult( Y, X
% 0.70/1.09 ) ), X ), Y ) ==> op_e }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (244) {G1,W11,D6,L1,V1,M1} { op_e ==> mult( rd( op_c, mult( ld(
% 0.70/1.09 op_c, X ), op_c ) ), X ) }.
% 0.70/1.09 parent0[0]: (63) {G1,W11,D4,L1,V2,M1} P(0,9) { mult( mult( Y, op_c ), ld(
% 0.70/1.09 op_c, X ) ) ==> mult( Y, X ) }.
% 0.70/1.09 parent1[0; 2]: (240) {G0,W11,D6,L1,V2,M1} { op_e ==> mult( mult( rd( op_c
% 0.70/1.09 , mult( X, Y ) ), Y ), X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := rd( op_c, mult( ld( op_c, X ), op_c ) )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := ld( op_c, X )
% 0.70/1.09 Y := op_c
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (246) {G2,W7,D4,L1,V1,M1} { op_e ==> mult( rd( op_c, X ), X ) }.
% 0.70/1.09 parent0[0]: (49) {G3,W7,D4,L1,V1,M1} P(32,0) { mult( ld( op_c, X ), op_c )
% 0.70/1.09 ==> X }.
% 0.70/1.09 parent1[0; 5]: (244) {G1,W11,D6,L1,V1,M1} { op_e ==> mult( rd( op_c, mult
% 0.70/1.09 ( ld( op_c, X ), op_c ) ), X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (247) {G1,W3,D2,L1,V0,M1} { op_e ==> op_c }.
% 0.70/1.09 parent0[0]: (2) {G0,W7,D4,L1,V2,M1} I { mult( rd( Y, X ), X ) ==> Y }.
% 0.70/1.09 parent1[0; 2]: (246) {G2,W7,D4,L1,V1,M1} { op_e ==> mult( rd( op_c, X ), X
% 0.70/1.09 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := op_c
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent0: (247) {G1,W3,D2,L1,V0,M1} { op_e ==> op_c }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (267) {G1,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_e, skol2 ) )
% 0.70/1.09 ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e, mult( skol1, skol2
% 0.70/1.09 ) ) ==> mult( mult( op_e, skol1 ), skol2 ), ! mult( skol1, mult( skol2,
% 0.70/1.09 op_e ) ) ==> mult( mult( skol1, skol2 ), op_e ) }.
% 0.70/1.09 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent1[2; 10]: (13) {G0,W33,D4,L3,V0,M3} I { ! mult( op_e, mult( skol1,
% 0.70/1.09 skol2 ) ) ==> mult( mult( op_e, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.70/1.09 skol2, op_e ) ) ==> mult( mult( skol1, skol2 ), op_e ), ! mult( skol1,
% 0.70/1.09 mult( op_e, skol2 ) ) ==> mult( mult( skol1, op_e ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (288) {G2,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2, op_e ) )
% 0.70/1.09 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_e, skol2
% 0.70/1.09 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e, mult( skol1,
% 0.70/1.09 skol2 ) ) ==> mult( mult( op_e, skol1 ), skol2 ) }.
% 0.70/1.09 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent1[2; 11]: (267) {G1,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_e,
% 0.70/1.09 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e, mult(
% 0.70/1.09 skol1, skol2 ) ) ==> mult( mult( op_e, skol1 ), skol2 ), ! mult( skol1,
% 0.70/1.09 mult( skol2, op_e ) ) ==> mult( mult( skol1, skol2 ), op_e ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (305) {G3,W33,D4,L3,V0,M3} { ! mult( op_e, mult( skol1, skol2 ) )
% 0.70/1.09 ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_e
% 0.70/1.09 ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_e,
% 0.70/1.09 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent1[2; 9]: (288) {G2,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2,
% 0.70/1.09 op_e ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult(
% 0.70/1.09 op_e, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e,
% 0.70/1.09 mult( skol1, skol2 ) ) ==> mult( mult( op_e, skol1 ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (308) {G4,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_c, skol2 ) )
% 0.70/1.09 ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e, mult( skol1, skol2
% 0.70/1.09 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2,
% 0.70/1.09 op_e ) ) ==> mult( mult( skol1, skol2 ), op_c ) }.
% 0.70/1.09 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent1[2; 5]: (305) {G3,W33,D4,L3,V0,M3} { ! mult( op_e, mult( skol1,
% 0.70/1.09 skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.70/1.09 skol2, op_e ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1,
% 0.70/1.09 mult( op_e, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (310) {G5,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2, op_c ) )
% 0.70/1.09 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_c, skol2
% 0.70/1.09 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e, mult( skol1,
% 0.70/1.09 skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent1[2; 6]: (308) {G4,W33,D4,L3,V0,M3} { ! mult( skol1, mult( op_c,
% 0.70/1.09 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e, mult(
% 0.70/1.09 skol1, skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1,
% 0.70/1.09 mult( skol2, op_e ) ) ==> mult( mult( skol1, skol2 ), op_c ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (311) {G5,W33,D4,L3,V0,M3} { ! mult( op_c, mult( skol1, skol2 ) )
% 0.70/1.09 ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_c
% 0.70/1.09 ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_c,
% 0.70/1.09 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 parent0[0]: (83) {G4,W3,D2,L1,V0,M1} P(11,63);d(49);d(2) { op_e ==> op_c
% 0.70/1.09 }.
% 0.70/1.09 parent1[2; 3]: (310) {G5,W33,D4,L3,V0,M3} { ! mult( skol1, mult( skol2,
% 0.70/1.09 op_c ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult(
% 0.70/1.09 op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( op_e,
% 0.70/1.09 mult( skol1, skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (316) {G1,W33,D4,L3,V0,M3} { ! mult( mult( op_c, skol1 ), skol2 )
% 0.70/1.09 ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( skol2, op_c
% 0.70/1.09 ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1, mult( op_c,
% 0.70/1.09 skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 parent0[0]: (7) {G0,W11,D4,L1,V2,M1} I { mult( op_c, mult( Y, X ) ) ==>
% 0.70/1.09 mult( mult( op_c, Y ), X ) }.
% 0.70/1.09 parent1[0; 2]: (311) {G5,W33,D4,L3,V0,M3} { ! mult( op_c, mult( skol1,
% 0.70/1.09 skol2 ) ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.70/1.09 skol2, op_c ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1,
% 0.70/1.09 mult( op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := skol2
% 0.70/1.09 Y := skol1
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (317) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, skol2 ), op_c )
% 0.70/1.09 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1 ),
% 0.70/1.09 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult( op_c
% 0.70/1.09 , skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 parent0[0]: (8) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( X, op_c ) ) ==>
% 0.70/1.09 mult( mult( Y, X ), op_c ) }.
% 0.70/1.09 parent1[1; 2]: (316) {G1,W33,D4,L3,V0,M3} { ! mult( mult( op_c, skol1 ),
% 0.70/1.09 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.70/1.09 skol2, op_c ) ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( skol1,
% 0.70/1.09 mult( op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := skol2
% 0.70/1.09 Y := skol1
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 paramod: (318) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, op_c ), skol2 )
% 0.70/1.09 ==> mult( mult( skol1, op_c ), skol2 ), ! mult( mult( skol1, skol2 ),
% 0.70/1.09 op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1
% 0.70/1.09 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 parent0[0]: (9) {G0,W11,D4,L1,V2,M1} I { mult( Y, mult( op_c, X ) ) ==>
% 0.70/1.09 mult( mult( Y, op_c ), X ) }.
% 0.70/1.09 parent1[2; 2]: (317) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, skol2 ),
% 0.70/1.09 op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1
% 0.70/1.09 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ), ! mult( skol1, mult(
% 0.70/1.09 op_c, skol2 ) ) ==> mult( mult( skol1, op_c ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := skol2
% 0.70/1.09 Y := skol1
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqrefl: (319) {G0,W22,D4,L2,V0,M2} { ! mult( mult( skol1, skol2 ), op_c )
% 0.70/1.09 ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1 ),
% 0.70/1.09 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 parent0[0]: (318) {G1,W33,D4,L3,V0,M3} { ! mult( mult( skol1, op_c ),
% 0.70/1.09 skol2 ) ==> mult( mult( skol1, op_c ), skol2 ), ! mult( mult( skol1,
% 0.70/1.09 skol2 ), op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult(
% 0.70/1.09 op_c, skol1 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqrefl: (322) {G0,W11,D4,L1,V0,M1} { ! mult( mult( op_c, skol1 ), skol2 )
% 0.70/1.09 ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 parent0[0]: (319) {G0,W22,D4,L2,V0,M2} { ! mult( mult( skol1, skol2 ),
% 0.70/1.09 op_c ) ==> mult( mult( skol1, skol2 ), op_c ), ! mult( mult( op_c, skol1
% 0.70/1.09 ), skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 eqrefl: (324) {G0,W0,D0,L0,V0,M0} { }.
% 0.70/1.09 parent0[0]: (322) {G0,W11,D4,L1,V0,M1} { ! mult( mult( op_c, skol1 ),
% 0.70/1.09 skol2 ) ==> mult( mult( op_c, skol1 ), skol2 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (125) {G5,W0,D0,L0,V0,M0} S(13);d(83);d(83);d(83);d(7);d(8);d(
% 0.70/1.09 9);q;q;q { }.
% 0.70/1.09 parent0: (324) {G0,W0,D0,L0,V0,M0} { }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 Proof check complete!
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 1847
% 0.70/1.09 space for clauses: 15206
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 483
% 0.70/1.09 clauses kept: 126
% 0.70/1.09 clauses selected: 36
% 0.70/1.09 clauses deleted: 5
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 1400
% 0.70/1.09 literals s-matched: 345
% 0.70/1.09 literals matched: 345
% 0.70/1.09 full subsumption: 0
% 0.70/1.09
% 0.70/1.09 checksum: -367029148
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------