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