TSTP Solution File: KLE142+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE142+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 : Sun Jul 17 01:37:24 EDT 2022
% Result : Theorem 1.58s 1.94s
% Output : Refutation 1.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE142+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Thu Jun 16 15:28:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.58/1.94 *** allocated 10000 integers for termspace/termends
% 1.58/1.94 *** allocated 10000 integers for clauses
% 1.58/1.94 *** allocated 10000 integers for justifications
% 1.58/1.94 Bliksem 1.12
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Automatic Strategy Selection
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Clauses:
% 1.58/1.94
% 1.58/1.94 { addition( X, Y ) = addition( Y, X ) }.
% 1.58/1.94 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 1.58/1.94 { addition( X, zero ) = X }.
% 1.58/1.94 { addition( X, X ) = X }.
% 1.58/1.94 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 1.58/1.94 multiplication( X, Y ), Z ) }.
% 1.58/1.94 { multiplication( X, one ) = X }.
% 1.58/1.94 { multiplication( one, X ) = X }.
% 1.58/1.94 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 1.58/1.94 , multiplication( X, Z ) ) }.
% 1.58/1.94 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 1.58/1.94 , multiplication( Y, Z ) ) }.
% 1.58/1.94 { multiplication( zero, X ) = zero }.
% 1.58/1.94 { addition( one, multiplication( X, star( X ) ) ) = star( X ) }.
% 1.58/1.94 { addition( one, multiplication( star( X ), X ) ) = star( X ) }.
% 1.58/1.94 { ! leq( addition( multiplication( X, Z ), Y ), Z ), leq( multiplication(
% 1.58/1.94 star( X ), Y ), Z ) }.
% 1.58/1.94 { ! leq( addition( multiplication( Z, X ), Y ), Z ), leq( multiplication( Y
% 1.58/1.94 , star( X ) ), Z ) }.
% 1.58/1.94 { strong_iteration( X ) = addition( multiplication( X, strong_iteration( X
% 1.58/1.94 ) ), one ) }.
% 1.58/1.94 { ! leq( Z, addition( multiplication( X, Z ), Y ) ), leq( Z, multiplication
% 1.58/1.94 ( strong_iteration( X ), Y ) ) }.
% 1.58/1.94 { strong_iteration( X ) = addition( star( X ), multiplication(
% 1.58/1.94 strong_iteration( X ), zero ) ) }.
% 1.58/1.94 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 1.58/1.94 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 1.58/1.94 { ! strong_iteration( strong_iteration( skol1 ) ) = strong_iteration( one )
% 1.58/1.94 }.
% 1.58/1.94
% 1.58/1.94 percentage equality = 0.680000, percentage horn = 1.000000
% 1.58/1.94 This is a problem with some equality
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Options Used:
% 1.58/1.94
% 1.58/1.94 useres = 1
% 1.58/1.94 useparamod = 1
% 1.58/1.94 useeqrefl = 1
% 1.58/1.94 useeqfact = 1
% 1.58/1.94 usefactor = 1
% 1.58/1.94 usesimpsplitting = 0
% 1.58/1.94 usesimpdemod = 5
% 1.58/1.94 usesimpres = 3
% 1.58/1.94
% 1.58/1.94 resimpinuse = 1000
% 1.58/1.94 resimpclauses = 20000
% 1.58/1.94 substype = eqrewr
% 1.58/1.94 backwardsubs = 1
% 1.58/1.94 selectoldest = 5
% 1.58/1.94
% 1.58/1.94 litorderings [0] = split
% 1.58/1.94 litorderings [1] = extend the termordering, first sorting on arguments
% 1.58/1.94
% 1.58/1.94 termordering = kbo
% 1.58/1.94
% 1.58/1.94 litapriori = 0
% 1.58/1.94 termapriori = 1
% 1.58/1.94 litaposteriori = 0
% 1.58/1.94 termaposteriori = 0
% 1.58/1.94 demodaposteriori = 0
% 1.58/1.94 ordereqreflfact = 0
% 1.58/1.94
% 1.58/1.94 litselect = negord
% 1.58/1.94
% 1.58/1.94 maxweight = 15
% 1.58/1.94 maxdepth = 30000
% 1.58/1.94 maxlength = 115
% 1.58/1.94 maxnrvars = 195
% 1.58/1.94 excuselevel = 1
% 1.58/1.94 increasemaxweight = 1
% 1.58/1.94
% 1.58/1.94 maxselected = 10000000
% 1.58/1.94 maxnrclauses = 10000000
% 1.58/1.94
% 1.58/1.94 showgenerated = 0
% 1.58/1.94 showkept = 0
% 1.58/1.94 showselected = 0
% 1.58/1.94 showdeleted = 0
% 1.58/1.94 showresimp = 1
% 1.58/1.94 showstatus = 2000
% 1.58/1.94
% 1.58/1.94 prologoutput = 0
% 1.58/1.94 nrgoals = 5000000
% 1.58/1.94 totalproof = 1
% 1.58/1.94
% 1.58/1.94 Symbols occurring in the translation:
% 1.58/1.94
% 1.58/1.94 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.58/1.94 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 1.58/1.94 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 1.58/1.94 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.58/1.94 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.58/1.94 addition [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 1.58/1.94 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.58/1.94 multiplication [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 1.58/1.94 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.58/1.94 star [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 1.58/1.94 leq [43, 2] (w:1, o:45, a:1, s:1, b:0),
% 1.58/1.94 strong_iteration [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 1.58/1.94 skol1 [46, 0] (w:1, o:12, a:1, s:1, b:1).
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Starting Search:
% 1.58/1.94
% 1.58/1.94 *** allocated 15000 integers for clauses
% 1.58/1.94 *** allocated 22500 integers for clauses
% 1.58/1.94 *** allocated 33750 integers for clauses
% 1.58/1.94 *** allocated 50625 integers for clauses
% 1.58/1.94 *** allocated 75937 integers for clauses
% 1.58/1.94 *** allocated 15000 integers for termspace/termends
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94 *** allocated 22500 integers for termspace/termends
% 1.58/1.94 *** allocated 113905 integers for clauses
% 1.58/1.94 *** allocated 33750 integers for termspace/termends
% 1.58/1.94
% 1.58/1.94 Intermediate Status:
% 1.58/1.94 Generated: 18163
% 1.58/1.94 Kept: 2008
% 1.58/1.94 Inuse: 241
% 1.58/1.94 Deleted: 35
% 1.58/1.94 Deletedinuse: 10
% 1.58/1.94
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94 *** allocated 170857 integers for clauses
% 1.58/1.94 *** allocated 50625 integers for termspace/termends
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94 *** allocated 256285 integers for clauses
% 1.58/1.94
% 1.58/1.94 Intermediate Status:
% 1.58/1.94 Generated: 36158
% 1.58/1.94 Kept: 4022
% 1.58/1.94 Inuse: 357
% 1.58/1.94 Deleted: 46
% 1.58/1.94 Deletedinuse: 11
% 1.58/1.94
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94 *** allocated 75937 integers for termspace/termends
% 1.58/1.94 *** allocated 384427 integers for clauses
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Intermediate Status:
% 1.58/1.94 Generated: 54124
% 1.58/1.94 Kept: 6062
% 1.58/1.94 Inuse: 477
% 1.58/1.94 Deleted: 59
% 1.58/1.94 Deletedinuse: 12
% 1.58/1.94
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94 *** allocated 113905 integers for termspace/termends
% 1.58/1.94 *** allocated 576640 integers for clauses
% 1.58/1.94 Resimplifying inuse:
% 1.58/1.94 Done
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Bliksems!, er is een bewijs:
% 1.58/1.94 % SZS status Theorem
% 1.58/1.94 % SZS output start Refutation
% 1.58/1.94
% 1.58/1.94 (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X ) }.
% 1.58/1.94 (1) {G0,W11,D4,L1,V3,M1} I { addition( Z, addition( Y, X ) ) ==> addition(
% 1.58/1.94 addition( Z, Y ), X ) }.
% 1.58/1.94 (2) {G0,W5,D3,L1,V1,M1} I { addition( X, zero ) ==> X }.
% 1.58/1.94 (3) {G0,W5,D3,L1,V1,M1} I { addition( X, X ) ==> X }.
% 1.58/1.94 (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 1.58/1.94 (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 1.58/1.94 (7) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Y ),
% 1.58/1.94 multiplication( X, Z ) ) ==> multiplication( X, addition( Y, Z ) ) }.
% 1.58/1.94 (8) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Z ),
% 1.58/1.94 multiplication( Y, Z ) ) ==> multiplication( addition( X, Y ), Z ) }.
% 1.58/1.94 (14) {G0,W9,D5,L1,V1,M1} I { addition( multiplication( X, strong_iteration
% 1.58/1.94 ( X ) ), one ) ==> strong_iteration( X ) }.
% 1.58/1.94 (15) {G0,W13,D4,L2,V3,M2} I { ! leq( Z, addition( multiplication( X, Z ), Y
% 1.58/1.94 ) ), leq( Z, multiplication( strong_iteration( X ), Y ) ) }.
% 1.58/1.94 (17) {G0,W8,D3,L2,V2,M2} I { ! leq( X, Y ), addition( X, Y ) ==> Y }.
% 1.58/1.94 (18) {G0,W8,D3,L2,V2,M2} I { ! addition( X, Y ) ==> Y, leq( X, Y ) }.
% 1.58/1.94 (19) {G0,W6,D4,L1,V0,M1} I { ! strong_iteration( strong_iteration( skol1 )
% 1.58/1.94 ) ==> strong_iteration( one ) }.
% 1.58/1.94 (20) {G1,W5,D3,L1,V1,M1} P(0,2) { addition( zero, X ) ==> X }.
% 1.58/1.94 (22) {G1,W3,D2,L1,V1,M1} R(18,3) { leq( X, X ) }.
% 1.58/1.94 (25) {G1,W14,D4,L2,V3,M2} P(1,18) { ! addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( Y, Z ), leq( X, addition( Y, Z ) ) }.
% 1.58/1.94 (26) {G1,W11,D4,L1,V3,M1} P(1,0) { addition( addition( X, Y ), Z ) =
% 1.58/1.94 addition( addition( Y, Z ), X ) }.
% 1.58/1.94 (29) {G1,W9,D4,L1,V2,M1} P(3,1) { addition( addition( Y, X ), X ) ==>
% 1.58/1.94 addition( Y, X ) }.
% 1.58/1.94 (35) {G1,W12,D4,L2,V3,M2} P(17,1) { addition( addition( Z, X ), Y ) ==>
% 1.58/1.94 addition( Z, Y ), ! leq( X, Y ) }.
% 1.58/1.94 (36) {G1,W8,D3,L2,V2,M2} P(17,0) { addition( Y, X ) ==> Y, ! leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 (73) {G1,W16,D4,L2,V3,M2} P(7,18) { ! multiplication( X, addition( Y, Z ) )
% 1.58/1.94 ==> multiplication( X, Z ), leq( multiplication( X, Y ), multiplication
% 1.58/1.94 ( X, Z ) ) }.
% 1.58/1.94 (108) {G1,W11,D4,L1,V2,M1} P(6,8) { addition( multiplication( Y, X ), X ) =
% 1.58/1.94 multiplication( addition( Y, one ), X ) }.
% 1.58/1.94 (298) {G2,W5,D3,L1,V2,M1} P(3,25);q { leq( X, addition( X, Y ) ) }.
% 1.58/1.94 (313) {G3,W5,D3,L1,V2,M1} P(0,298) { leq( X, addition( Y, X ) ) }.
% 1.58/1.94 (338) {G4,W7,D4,L1,V3,M1} P(26,313) { leq( Z, addition( addition( Y, Z ), X
% 1.58/1.94 ) ) }.
% 1.58/1.94 (404) {G2,W7,D4,L1,V1,M1} P(14,29) { addition( strong_iteration( X ), one )
% 1.58/1.94 ==> strong_iteration( X ) }.
% 1.58/1.94 (571) {G5,W8,D3,L2,V3,M2} P(35,338) { leq( Y, addition( X, Z ) ), ! leq( Y
% 1.58/1.94 , Z ) }.
% 1.58/1.94 (2004) {G2,W7,D3,L1,V2,M1} P(20,73);q { leq( multiplication( Y, zero ),
% 1.58/1.94 multiplication( Y, X ) ) }.
% 1.58/1.94 (2130) {G3,W5,D3,L1,V1,M1} P(5,2004) { leq( multiplication( X, zero ), X )
% 1.58/1.94 }.
% 1.58/1.94 (2134) {G4,W7,D4,L1,V1,M1} R(2130,36) { addition( X, multiplication( X,
% 1.58/1.94 zero ) ) ==> X }.
% 1.58/1.94 (2138) {G4,W7,D4,L1,V1,M1} R(2130,17) { addition( multiplication( X, zero )
% 1.58/1.94 , X ) ==> X }.
% 1.58/1.94 (2543) {G6,W8,D3,L2,V2,M2} P(2134,571) { leq( Y, X ), ! leq( Y,
% 1.58/1.94 multiplication( X, zero ) ) }.
% 1.58/1.94 (4138) {G5,W8,D5,L1,V3,M1} P(108,15);r(338) { leq( Y, multiplication(
% 1.58/1.94 strong_iteration( addition( X, one ) ), Z ) ) }.
% 1.58/1.94 (5900) {G7,W6,D4,L1,V2,M1} R(4138,2543) { leq( X, strong_iteration(
% 1.58/1.94 addition( Y, one ) ) ) }.
% 1.58/1.94 (5938) {G8,W4,D3,L1,V1,M1} P(2138,5900) { leq( X, strong_iteration( one ) )
% 1.58/1.94 }.
% 1.58/1.94 (5939) {G8,W5,D4,L1,V2,M1} P(404,5900) { leq( Y, strong_iteration(
% 1.58/1.94 strong_iteration( X ) ) ) }.
% 1.58/1.94 (5952) {G9,W7,D4,L1,V1,M1} R(5938,36) { addition( strong_iteration( one ),
% 1.58/1.94 X ) ==> strong_iteration( one ) }.
% 1.58/1.94 (6320) {G10,W8,D3,L2,V1,M2} P(5952,17) { ! leq( strong_iteration( one ), X
% 1.58/1.94 ), strong_iteration( one ) = X }.
% 1.58/1.94 (7440) {G11,W6,D4,L1,V1,M1} R(6320,5939) { strong_iteration(
% 1.58/1.94 strong_iteration( X ) ) ==> strong_iteration( one ) }.
% 1.58/1.94 (7541) {G12,W0,D0,L0,V0,M0} P(6320,19);q;d(7440);r(22) { }.
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 % SZS output end Refutation
% 1.58/1.94 found a proof!
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Unprocessed initial clauses:
% 1.58/1.94
% 1.58/1.94 (7543) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 1.58/1.94 (7544) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 1.58/1.94 addition( Z, Y ), X ) }.
% 1.58/1.94 (7545) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 1.58/1.94 (7546) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 1.58/1.94 (7547) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) )
% 1.58/1.94 = multiplication( multiplication( X, Y ), Z ) }.
% 1.58/1.94 (7548) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 1.58/1.94 (7549) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 1.58/1.94 (7550) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 1.58/1.94 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 1.58/1.94 (7551) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 1.58/1.94 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 1.58/1.94 (7552) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 1.58/1.94 (7553) {G0,W9,D5,L1,V1,M1} { addition( one, multiplication( X, star( X ) )
% 1.58/1.94 ) = star( X ) }.
% 1.58/1.94 (7554) {G0,W9,D5,L1,V1,M1} { addition( one, multiplication( star( X ), X )
% 1.58/1.94 ) = star( X ) }.
% 1.58/1.94 (7555) {G0,W13,D4,L2,V3,M2} { ! leq( addition( multiplication( X, Z ), Y )
% 1.58/1.94 , Z ), leq( multiplication( star( X ), Y ), Z ) }.
% 1.58/1.94 (7556) {G0,W13,D4,L2,V3,M2} { ! leq( addition( multiplication( Z, X ), Y )
% 1.58/1.94 , Z ), leq( multiplication( Y, star( X ) ), Z ) }.
% 1.58/1.94 (7557) {G0,W9,D5,L1,V1,M1} { strong_iteration( X ) = addition(
% 1.58/1.94 multiplication( X, strong_iteration( X ) ), one ) }.
% 1.58/1.94 (7558) {G0,W13,D4,L2,V3,M2} { ! leq( Z, addition( multiplication( X, Z ),
% 1.58/1.94 Y ) ), leq( Z, multiplication( strong_iteration( X ), Y ) ) }.
% 1.58/1.94 (7559) {G0,W10,D5,L1,V1,M1} { strong_iteration( X ) = addition( star( X )
% 1.58/1.94 , multiplication( strong_iteration( X ), zero ) ) }.
% 1.58/1.94 (7560) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 1.58/1.94 (7561) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 1.58/1.94 (7562) {G0,W6,D4,L1,V0,M1} { ! strong_iteration( strong_iteration( skol1 )
% 1.58/1.94 ) = strong_iteration( one ) }.
% 1.58/1.94
% 1.58/1.94
% 1.58/1.94 Total Proof:
% 1.58/1.94
% 1.58/1.94 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X
% 1.58/1.94 ) }.
% 1.58/1.94 parent0: (7543) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (1) {G0,W11,D4,L1,V3,M1} I { addition( Z, addition( Y, X ) )
% 1.58/1.94 ==> addition( addition( Z, Y ), X ) }.
% 1.58/1.94 parent0: (7544) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) =
% 1.58/1.94 addition( addition( Z, Y ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (2) {G0,W5,D3,L1,V1,M1} I { addition( X, zero ) ==> X }.
% 1.58/1.94 parent0: (7545) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (3) {G0,W5,D3,L1,V1,M1} I { addition( X, X ) ==> X }.
% 1.58/1.94 parent0: (7546) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 1.58/1.94 parent0: (7548) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 1.58/1.94 parent0: (7549) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7586) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Y ),
% 1.58/1.94 multiplication( X, Z ) ) = multiplication( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0[0]: (7550) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y,
% 1.58/1.94 Z ) ) = addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (7) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Y )
% 1.58/1.94 , multiplication( X, Z ) ) ==> multiplication( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0: (7586) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Y ),
% 1.58/1.94 multiplication( X, Z ) ) = multiplication( X, addition( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7594) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Z ),
% 1.58/1.94 multiplication( Y, Z ) ) = multiplication( addition( X, Y ), Z ) }.
% 1.58/1.94 parent0[0]: (7551) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y )
% 1.58/1.94 , Z ) = addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (8) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Z )
% 1.58/1.94 , multiplication( Y, Z ) ) ==> multiplication( addition( X, Y ), Z ) }.
% 1.58/1.94 parent0: (7594) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Z ),
% 1.58/1.94 multiplication( Y, Z ) ) = multiplication( addition( X, Y ), Z ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7606) {G0,W9,D5,L1,V1,M1} { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) = strong_iteration( X ) }.
% 1.58/1.94 parent0[0]: (7557) {G0,W9,D5,L1,V1,M1} { strong_iteration( X ) = addition
% 1.58/1.94 ( multiplication( X, strong_iteration( X ) ), one ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (14) {G0,W9,D5,L1,V1,M1} I { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) ==> strong_iteration( X ) }.
% 1.58/1.94 parent0: (7606) {G0,W9,D5,L1,V1,M1} { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) = strong_iteration( X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (15) {G0,W13,D4,L2,V3,M2} I { ! leq( Z, addition(
% 1.58/1.94 multiplication( X, Z ), Y ) ), leq( Z, multiplication( strong_iteration(
% 1.58/1.94 X ), Y ) ) }.
% 1.58/1.94 parent0: (7558) {G0,W13,D4,L2,V3,M2} { ! leq( Z, addition( multiplication
% 1.58/1.94 ( X, Z ), Y ) ), leq( Z, multiplication( strong_iteration( X ), Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (17) {G0,W8,D3,L2,V2,M2} I { ! leq( X, Y ), addition( X, Y )
% 1.58/1.94 ==> Y }.
% 1.58/1.94 parent0: (7560) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (18) {G0,W8,D3,L2,V2,M2} I { ! addition( X, Y ) ==> Y, leq( X
% 1.58/1.94 , Y ) }.
% 1.58/1.94 parent0: (7561) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (19) {G0,W6,D4,L1,V0,M1} I { ! strong_iteration(
% 1.58/1.94 strong_iteration( skol1 ) ) ==> strong_iteration( one ) }.
% 1.58/1.94 parent0: (7562) {G0,W6,D4,L1,V0,M1} { ! strong_iteration( strong_iteration
% 1.58/1.94 ( skol1 ) ) = strong_iteration( one ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7664) {G0,W5,D3,L1,V1,M1} { X ==> addition( X, zero ) }.
% 1.58/1.94 parent0[0]: (2) {G0,W5,D3,L1,V1,M1} I { addition( X, zero ) ==> X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7665) {G1,W5,D3,L1,V1,M1} { X ==> addition( zero, X ) }.
% 1.58/1.94 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent1[0; 2]: (7664) {G0,W5,D3,L1,V1,M1} { X ==> addition( X, zero ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := zero
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7668) {G1,W5,D3,L1,V1,M1} { addition( zero, X ) ==> X }.
% 1.58/1.94 parent0[0]: (7665) {G1,W5,D3,L1,V1,M1} { X ==> addition( zero, X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (20) {G1,W5,D3,L1,V1,M1} P(0,2) { addition( zero, X ) ==> X
% 1.58/1.94 }.
% 1.58/1.94 parent0: (7668) {G1,W5,D3,L1,V1,M1} { addition( zero, X ) ==> X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7669) {G0,W8,D3,L2,V2,M2} { ! Y ==> addition( X, Y ), leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (18) {G0,W8,D3,L2,V2,M2} I { ! addition( X, Y ) ==> Y, leq( X,
% 1.58/1.94 Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7670) {G0,W5,D3,L1,V1,M1} { X ==> addition( X, X ) }.
% 1.58/1.94 parent0[0]: (3) {G0,W5,D3,L1,V1,M1} I { addition( X, X ) ==> X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 resolution: (7671) {G1,W3,D2,L1,V1,M1} { leq( X, X ) }.
% 1.58/1.94 parent0[0]: (7669) {G0,W8,D3,L2,V2,M2} { ! Y ==> addition( X, Y ), leq( X
% 1.58/1.94 , Y ) }.
% 1.58/1.94 parent1[0]: (7670) {G0,W5,D3,L1,V1,M1} { X ==> addition( X, X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (22) {G1,W3,D2,L1,V1,M1} R(18,3) { leq( X, X ) }.
% 1.58/1.94 parent0: (7671) {G1,W3,D2,L1,V1,M1} { leq( X, X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7673) {G0,W8,D3,L2,V2,M2} { ! Y ==> addition( X, Y ), leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (18) {G0,W8,D3,L2,V2,M2} I { ! addition( X, Y ) ==> Y, leq( X,
% 1.58/1.94 Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7674) {G1,W14,D4,L2,V3,M2} { ! addition( X, Y ) ==> addition(
% 1.58/1.94 addition( Z, X ), Y ), leq( Z, addition( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (1) {G0,W11,D4,L1,V3,M1} I { addition( Z, addition( Y, X ) )
% 1.58/1.94 ==> addition( addition( Z, Y ), X ) }.
% 1.58/1.94 parent1[0; 5]: (7673) {G0,W8,D3,L2,V2,M2} { ! Y ==> addition( X, Y ), leq
% 1.58/1.94 ( X, Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := addition( X, Y )
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7675) {G1,W14,D4,L2,V3,M2} { ! addition( addition( Z, X ), Y )
% 1.58/1.94 ==> addition( X, Y ), leq( Z, addition( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (7674) {G1,W14,D4,L2,V3,M2} { ! addition( X, Y ) ==> addition
% 1.58/1.94 ( addition( Z, X ), Y ), leq( Z, addition( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (25) {G1,W14,D4,L2,V3,M2} P(1,18) { ! addition( addition( X, Y
% 1.58/1.94 ), Z ) ==> addition( Y, Z ), leq( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0: (7675) {G1,W14,D4,L2,V3,M2} { ! addition( addition( Z, X ), Y )
% 1.58/1.94 ==> addition( X, Y ), leq( Z, addition( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := Z
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7676) {G0,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0[0]: (1) {G0,W11,D4,L1,V3,M1} I { addition( Z, addition( Y, X ) )
% 1.58/1.94 ==> addition( addition( Z, Y ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7679) {G1,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( addition( Y, Z ), X ) }.
% 1.58/1.94 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent1[0; 6]: (7676) {G0,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z
% 1.58/1.94 ) ==> addition( X, addition( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := addition( Y, Z )
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (26) {G1,W11,D4,L1,V3,M1} P(1,0) { addition( addition( X, Y )
% 1.58/1.94 , Z ) = addition( addition( Y, Z ), X ) }.
% 1.58/1.94 parent0: (7679) {G1,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( addition( Y, Z ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7694) {G0,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0[0]: (1) {G0,W11,D4,L1,V3,M1} I { addition( Z, addition( Y, X ) )
% 1.58/1.94 ==> addition( addition( Z, Y ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7700) {G1,W9,D4,L1,V2,M1} { addition( addition( X, Y ), Y ) ==>
% 1.58/1.94 addition( X, Y ) }.
% 1.58/1.94 parent0[0]: (3) {G0,W5,D3,L1,V1,M1} I { addition( X, X ) ==> X }.
% 1.58/1.94 parent1[0; 8]: (7694) {G0,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z
% 1.58/1.94 ) ==> addition( X, addition( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (29) {G1,W9,D4,L1,V2,M1} P(3,1) { addition( addition( Y, X ),
% 1.58/1.94 X ) ==> addition( Y, X ) }.
% 1.58/1.94 parent0: (7700) {G1,W9,D4,L1,V2,M1} { addition( addition( X, Y ), Y ) ==>
% 1.58/1.94 addition( X, Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7706) {G0,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0[0]: (1) {G0,W11,D4,L1,V3,M1} I { addition( Z, addition( Y, X ) )
% 1.58/1.94 ==> addition( addition( Z, Y ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7712) {G1,W12,D4,L2,V3,M2} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( X, Z ), ! leq( Y, Z ) }.
% 1.58/1.94 parent0[1]: (17) {G0,W8,D3,L2,V2,M2} I { ! leq( X, Y ), addition( X, Y )
% 1.58/1.94 ==> Y }.
% 1.58/1.94 parent1[0; 8]: (7706) {G0,W11,D4,L1,V3,M1} { addition( addition( X, Y ), Z
% 1.58/1.94 ) ==> addition( X, addition( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := Z
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (35) {G1,W12,D4,L2,V3,M2} P(17,1) { addition( addition( Z, X )
% 1.58/1.94 , Y ) ==> addition( Z, Y ), ! leq( X, Y ) }.
% 1.58/1.94 parent0: (7712) {G1,W12,D4,L2,V3,M2} { addition( addition( X, Y ), Z ) ==>
% 1.58/1.94 addition( X, Z ), ! leq( Y, Z ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7759) {G0,W8,D3,L2,V2,M2} { Y ==> addition( X, Y ), ! leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 parent0[1]: (17) {G0,W8,D3,L2,V2,M2} I { ! leq( X, Y ), addition( X, Y )
% 1.58/1.94 ==> Y }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7760) {G1,W8,D3,L2,V2,M2} { X ==> addition( X, Y ), ! leq( Y, X
% 1.58/1.94 ) }.
% 1.58/1.94 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent1[0; 2]: (7759) {G0,W8,D3,L2,V2,M2} { Y ==> addition( X, Y ), ! leq
% 1.58/1.94 ( X, Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7763) {G1,W8,D3,L2,V2,M2} { addition( X, Y ) ==> X, ! leq( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (7760) {G1,W8,D3,L2,V2,M2} { X ==> addition( X, Y ), ! leq( Y
% 1.58/1.94 , X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (36) {G1,W8,D3,L2,V2,M2} P(17,0) { addition( Y, X ) ==> Y, !
% 1.58/1.94 leq( X, Y ) }.
% 1.58/1.94 parent0: (7763) {G1,W8,D3,L2,V2,M2} { addition( X, Y ) ==> X, ! leq( Y, X
% 1.58/1.94 ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7765) {G0,W8,D3,L2,V2,M2} { ! Y ==> addition( X, Y ), leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (18) {G0,W8,D3,L2,V2,M2} I { ! addition( X, Y ) ==> Y, leq( X,
% 1.58/1.94 Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7766) {G1,W16,D4,L2,V3,M2} { ! multiplication( X, Y ) ==>
% 1.58/1.94 multiplication( X, addition( Z, Y ) ), leq( multiplication( X, Z ),
% 1.58/1.94 multiplication( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (7) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Y ),
% 1.58/1.94 multiplication( X, Z ) ) ==> multiplication( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent1[0; 5]: (7765) {G0,W8,D3,L2,V2,M2} { ! Y ==> addition( X, Y ), leq
% 1.58/1.94 ( X, Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Z
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := multiplication( X, Z )
% 1.58/1.94 Y := multiplication( X, Y )
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7767) {G1,W16,D4,L2,V3,M2} { ! multiplication( X, addition( Z, Y
% 1.58/1.94 ) ) ==> multiplication( X, Y ), leq( multiplication( X, Z ),
% 1.58/1.94 multiplication( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (7766) {G1,W16,D4,L2,V3,M2} { ! multiplication( X, Y ) ==>
% 1.58/1.94 multiplication( X, addition( Z, Y ) ), leq( multiplication( X, Z ),
% 1.58/1.94 multiplication( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (73) {G1,W16,D4,L2,V3,M2} P(7,18) { ! multiplication( X,
% 1.58/1.94 addition( Y, Z ) ) ==> multiplication( X, Z ), leq( multiplication( X, Y
% 1.58/1.94 ), multiplication( X, Z ) ) }.
% 1.58/1.94 parent0: (7767) {G1,W16,D4,L2,V3,M2} { ! multiplication( X, addition( Z, Y
% 1.58/1.94 ) ) ==> multiplication( X, Y ), leq( multiplication( X, Z ),
% 1.58/1.94 multiplication( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Z
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7769) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Z ), Y
% 1.58/1.94 ) ==> addition( multiplication( X, Y ), multiplication( Z, Y ) ) }.
% 1.58/1.94 parent0[0]: (8) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Z ),
% 1.58/1.94 multiplication( Y, Z ) ) ==> multiplication( addition( X, Y ), Z ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Z
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7771) {G1,W11,D4,L1,V2,M1} { multiplication( addition( X, one )
% 1.58/1.94 , Y ) ==> addition( multiplication( X, Y ), Y ) }.
% 1.58/1.94 parent0[0]: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 1.58/1.94 parent1[0; 10]: (7769) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X
% 1.58/1.94 , Z ), Y ) ==> addition( multiplication( X, Y ), multiplication( Z, Y ) )
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := one
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7773) {G1,W11,D4,L1,V2,M1} { addition( multiplication( X, Y ), Y
% 1.58/1.94 ) ==> multiplication( addition( X, one ), Y ) }.
% 1.58/1.94 parent0[0]: (7771) {G1,W11,D4,L1,V2,M1} { multiplication( addition( X, one
% 1.58/1.94 ), Y ) ==> addition( multiplication( X, Y ), Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (108) {G1,W11,D4,L1,V2,M1} P(6,8) { addition( multiplication(
% 1.58/1.94 Y, X ), X ) = multiplication( addition( Y, one ), X ) }.
% 1.58/1.94 parent0: (7773) {G1,W11,D4,L1,V2,M1} { addition( multiplication( X, Y ), Y
% 1.58/1.94 ) ==> multiplication( addition( X, one ), Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7775) {G1,W14,D4,L2,V3,M2} { ! addition( Y, Z ) ==> addition(
% 1.58/1.94 addition( X, Y ), Z ), leq( X, addition( Y, Z ) ) }.
% 1.58/1.94 parent0[0]: (25) {G1,W14,D4,L2,V3,M2} P(1,18) { ! addition( addition( X, Y
% 1.58/1.94 ), Z ) ==> addition( Y, Z ), leq( X, addition( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7778) {G1,W12,D3,L2,V2,M2} { ! addition( X, Y ) ==> addition( X
% 1.58/1.94 , Y ), leq( X, addition( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (3) {G0,W5,D3,L1,V1,M1} I { addition( X, X ) ==> X }.
% 1.58/1.94 parent1[0; 6]: (7775) {G1,W14,D4,L2,V3,M2} { ! addition( Y, Z ) ==>
% 1.58/1.94 addition( addition( X, Y ), Z ), leq( X, addition( Y, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqrefl: (7781) {G0,W5,D3,L1,V2,M1} { leq( X, addition( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (7778) {G1,W12,D3,L2,V2,M2} { ! addition( X, Y ) ==> addition
% 1.58/1.94 ( X, Y ), leq( X, addition( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (298) {G2,W5,D3,L1,V2,M1} P(3,25);q { leq( X, addition( X, Y )
% 1.58/1.94 ) }.
% 1.58/1.94 parent0: (7781) {G0,W5,D3,L1,V2,M1} { leq( X, addition( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7782) {G1,W5,D3,L1,V2,M1} { leq( X, addition( Y, X ) ) }.
% 1.58/1.94 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent1[0; 2]: (298) {G2,W5,D3,L1,V2,M1} P(3,25);q { leq( X, addition( X, Y
% 1.58/1.94 ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (313) {G3,W5,D3,L1,V2,M1} P(0,298) { leq( X, addition( Y, X )
% 1.58/1.94 ) }.
% 1.58/1.94 parent0: (7782) {G1,W5,D3,L1,V2,M1} { leq( X, addition( Y, X ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7784) {G1,W11,D4,L1,V3,M1} { addition( addition( Y, Z ), X ) =
% 1.58/1.94 addition( addition( X, Y ), Z ) }.
% 1.58/1.94 parent0[0]: (26) {G1,W11,D4,L1,V3,M1} P(1,0) { addition( addition( X, Y ),
% 1.58/1.94 Z ) = addition( addition( Y, Z ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7785) {G2,W7,D4,L1,V3,M1} { leq( X, addition( addition( X, Y ),
% 1.58/1.94 Z ) ) }.
% 1.58/1.94 parent0[0]: (7784) {G1,W11,D4,L1,V3,M1} { addition( addition( Y, Z ), X )
% 1.58/1.94 = addition( addition( X, Y ), Z ) }.
% 1.58/1.94 parent1[0; 2]: (313) {G3,W5,D3,L1,V2,M1} P(0,298) { leq( X, addition( Y, X
% 1.58/1.94 ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := addition( Y, Z )
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7786) {G2,W7,D4,L1,V3,M1} { leq( X, addition( addition( Z, X ),
% 1.58/1.94 Y ) ) }.
% 1.58/1.94 parent0[0]: (7784) {G1,W11,D4,L1,V3,M1} { addition( addition( Y, Z ), X )
% 1.58/1.94 = addition( addition( X, Y ), Z ) }.
% 1.58/1.94 parent1[0; 2]: (7785) {G2,W7,D4,L1,V3,M1} { leq( X, addition( addition( X
% 1.58/1.94 , Y ), Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (338) {G4,W7,D4,L1,V3,M1} P(26,313) { leq( Z, addition(
% 1.58/1.94 addition( Y, Z ), X ) ) }.
% 1.58/1.94 parent0: (7786) {G2,W7,D4,L1,V3,M1} { leq( X, addition( addition( Z, X ),
% 1.58/1.94 Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7789) {G1,W9,D4,L1,V2,M1} { addition( X, Y ) ==> addition(
% 1.58/1.94 addition( X, Y ), Y ) }.
% 1.58/1.94 parent0[0]: (29) {G1,W9,D4,L1,V2,M1} P(3,1) { addition( addition( Y, X ), X
% 1.58/1.94 ) ==> addition( Y, X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7791) {G1,W11,D5,L1,V1,M1} { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) ==> addition( strong_iteration( X ), one )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (14) {G0,W9,D5,L1,V1,M1} I { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) ==> strong_iteration( X ) }.
% 1.58/1.94 parent1[0; 8]: (7789) {G1,W9,D4,L1,V2,M1} { addition( X, Y ) ==> addition
% 1.58/1.94 ( addition( X, Y ), Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := multiplication( X, strong_iteration( X ) )
% 1.58/1.94 Y := one
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7792) {G1,W7,D4,L1,V1,M1} { strong_iteration( X ) ==> addition(
% 1.58/1.94 strong_iteration( X ), one ) }.
% 1.58/1.94 parent0[0]: (14) {G0,W9,D5,L1,V1,M1} I { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) ==> strong_iteration( X ) }.
% 1.58/1.94 parent1[0; 1]: (7791) {G1,W11,D5,L1,V1,M1} { addition( multiplication( X,
% 1.58/1.94 strong_iteration( X ) ), one ) ==> addition( strong_iteration( X ), one )
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7794) {G1,W7,D4,L1,V1,M1} { addition( strong_iteration( X ), one
% 1.58/1.94 ) ==> strong_iteration( X ) }.
% 1.58/1.94 parent0[0]: (7792) {G1,W7,D4,L1,V1,M1} { strong_iteration( X ) ==>
% 1.58/1.94 addition( strong_iteration( X ), one ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (404) {G2,W7,D4,L1,V1,M1} P(14,29) { addition(
% 1.58/1.94 strong_iteration( X ), one ) ==> strong_iteration( X ) }.
% 1.58/1.94 parent0: (7794) {G1,W7,D4,L1,V1,M1} { addition( strong_iteration( X ), one
% 1.58/1.94 ) ==> strong_iteration( X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7797) {G2,W8,D3,L2,V3,M2} { leq( X, addition( Y, Z ) ), ! leq( X
% 1.58/1.94 , Z ) }.
% 1.58/1.94 parent0[0]: (35) {G1,W12,D4,L2,V3,M2} P(17,1) { addition( addition( Z, X )
% 1.58/1.94 , Y ) ==> addition( Z, Y ), ! leq( X, Y ) }.
% 1.58/1.94 parent1[0; 2]: (338) {G4,W7,D4,L1,V3,M1} P(26,313) { leq( Z, addition(
% 1.58/1.94 addition( Y, Z ), X ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Z
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (571) {G5,W8,D3,L2,V3,M2} P(35,338) { leq( Y, addition( X, Z )
% 1.58/1.94 ), ! leq( Y, Z ) }.
% 1.58/1.94 parent0: (7797) {G2,W8,D3,L2,V3,M2} { leq( X, addition( Y, Z ) ), ! leq( X
% 1.58/1.94 , Z ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7801) {G1,W16,D4,L2,V3,M2} { ! multiplication( X, Z ) ==>
% 1.58/1.94 multiplication( X, addition( Y, Z ) ), leq( multiplication( X, Y ),
% 1.58/1.94 multiplication( X, Z ) ) }.
% 1.58/1.94 parent0[0]: (73) {G1,W16,D4,L2,V3,M2} P(7,18) { ! multiplication( X,
% 1.58/1.94 addition( Y, Z ) ) ==> multiplication( X, Z ), leq( multiplication( X, Y
% 1.58/1.94 ), multiplication( X, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7802) {G2,W14,D3,L2,V2,M2} { ! multiplication( X, Y ) ==>
% 1.58/1.94 multiplication( X, Y ), leq( multiplication( X, zero ), multiplication( X
% 1.58/1.94 , Y ) ) }.
% 1.58/1.94 parent0[0]: (20) {G1,W5,D3,L1,V1,M1} P(0,2) { addition( zero, X ) ==> X }.
% 1.58/1.94 parent1[0; 7]: (7801) {G1,W16,D4,L2,V3,M2} { ! multiplication( X, Z ) ==>
% 1.58/1.94 multiplication( X, addition( Y, Z ) ), leq( multiplication( X, Y ),
% 1.58/1.94 multiplication( X, Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := zero
% 1.58/1.94 Z := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqrefl: (7803) {G0,W7,D3,L1,V2,M1} { leq( multiplication( X, zero ),
% 1.58/1.94 multiplication( X, Y ) ) }.
% 1.58/1.94 parent0[0]: (7802) {G2,W14,D3,L2,V2,M2} { ! multiplication( X, Y ) ==>
% 1.58/1.94 multiplication( X, Y ), leq( multiplication( X, zero ), multiplication( X
% 1.58/1.94 , Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (2004) {G2,W7,D3,L1,V2,M1} P(20,73);q { leq( multiplication( Y
% 1.58/1.94 , zero ), multiplication( Y, X ) ) }.
% 1.58/1.94 parent0: (7803) {G0,W7,D3,L1,V2,M1} { leq( multiplication( X, zero ),
% 1.58/1.94 multiplication( X, Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7805) {G1,W5,D3,L1,V1,M1} { leq( multiplication( X, zero ), X )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 1.58/1.94 parent1[0; 4]: (2004) {G2,W7,D3,L1,V2,M1} P(20,73);q { leq( multiplication
% 1.58/1.94 ( Y, zero ), multiplication( Y, X ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := one
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (2130) {G3,W5,D3,L1,V1,M1} P(5,2004) { leq( multiplication( X
% 1.58/1.94 , zero ), X ) }.
% 1.58/1.94 parent0: (7805) {G1,W5,D3,L1,V1,M1} { leq( multiplication( X, zero ), X )
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7806) {G1,W8,D3,L2,V2,M2} { X ==> addition( X, Y ), ! leq( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (36) {G1,W8,D3,L2,V2,M2} P(17,0) { addition( Y, X ) ==> Y, !
% 1.58/1.94 leq( X, Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 resolution: (7807) {G2,W7,D4,L1,V1,M1} { X ==> addition( X, multiplication
% 1.58/1.94 ( X, zero ) ) }.
% 1.58/1.94 parent0[1]: (7806) {G1,W8,D3,L2,V2,M2} { X ==> addition( X, Y ), ! leq( Y
% 1.58/1.94 , X ) }.
% 1.58/1.94 parent1[0]: (2130) {G3,W5,D3,L1,V1,M1} P(5,2004) { leq( multiplication( X,
% 1.58/1.94 zero ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := multiplication( X, zero )
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7808) {G2,W7,D4,L1,V1,M1} { addition( X, multiplication( X, zero
% 1.58/1.94 ) ) ==> X }.
% 1.58/1.94 parent0[0]: (7807) {G2,W7,D4,L1,V1,M1} { X ==> addition( X, multiplication
% 1.58/1.94 ( X, zero ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (2134) {G4,W7,D4,L1,V1,M1} R(2130,36) { addition( X,
% 1.58/1.94 multiplication( X, zero ) ) ==> X }.
% 1.58/1.94 parent0: (7808) {G2,W7,D4,L1,V1,M1} { addition( X, multiplication( X, zero
% 1.58/1.94 ) ) ==> X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7809) {G0,W8,D3,L2,V2,M2} { Y ==> addition( X, Y ), ! leq( X, Y )
% 1.58/1.94 }.
% 1.58/1.94 parent0[1]: (17) {G0,W8,D3,L2,V2,M2} I { ! leq( X, Y ), addition( X, Y )
% 1.58/1.94 ==> Y }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 resolution: (7810) {G1,W7,D4,L1,V1,M1} { X ==> addition( multiplication( X
% 1.58/1.94 , zero ), X ) }.
% 1.58/1.94 parent0[1]: (7809) {G0,W8,D3,L2,V2,M2} { Y ==> addition( X, Y ), ! leq( X
% 1.58/1.94 , Y ) }.
% 1.58/1.94 parent1[0]: (2130) {G3,W5,D3,L1,V1,M1} P(5,2004) { leq( multiplication( X,
% 1.58/1.94 zero ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := multiplication( X, zero )
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7811) {G1,W7,D4,L1,V1,M1} { addition( multiplication( X, zero ),
% 1.58/1.94 X ) ==> X }.
% 1.58/1.94 parent0[0]: (7810) {G1,W7,D4,L1,V1,M1} { X ==> addition( multiplication( X
% 1.58/1.94 , zero ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (2138) {G4,W7,D4,L1,V1,M1} R(2130,17) { addition(
% 1.58/1.94 multiplication( X, zero ), X ) ==> X }.
% 1.58/1.94 parent0: (7811) {G1,W7,D4,L1,V1,M1} { addition( multiplication( X, zero )
% 1.58/1.94 , X ) ==> X }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7813) {G5,W8,D3,L2,V2,M2} { leq( X, Y ), ! leq( X,
% 1.58/1.94 multiplication( Y, zero ) ) }.
% 1.58/1.94 parent0[0]: (2134) {G4,W7,D4,L1,V1,M1} R(2130,36) { addition( X,
% 1.58/1.94 multiplication( X, zero ) ) ==> X }.
% 1.58/1.94 parent1[0; 2]: (571) {G5,W8,D3,L2,V3,M2} P(35,338) { leq( Y, addition( X, Z
% 1.58/1.94 ) ), ! leq( Y, Z ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 Z := multiplication( Y, zero )
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (2543) {G6,W8,D3,L2,V2,M2} P(2134,571) { leq( Y, X ), ! leq( Y
% 1.58/1.94 , multiplication( X, zero ) ) }.
% 1.58/1.94 parent0: (7813) {G5,W8,D3,L2,V2,M2} { leq( X, Y ), ! leq( X,
% 1.58/1.94 multiplication( Y, zero ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 1 ==> 1
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7814) {G1,W11,D4,L1,V2,M1} { multiplication( addition( X, one ),
% 1.58/1.94 Y ) = addition( multiplication( X, Y ), Y ) }.
% 1.58/1.94 parent0[0]: (108) {G1,W11,D4,L1,V2,M1} P(6,8) { addition( multiplication( Y
% 1.58/1.94 , X ), X ) = multiplication( addition( Y, one ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7815) {G1,W17,D5,L2,V3,M2} { ! leq( X, addition( addition(
% 1.58/1.94 multiplication( Y, X ), X ), Z ) ), leq( X, multiplication(
% 1.58/1.94 strong_iteration( addition( Y, one ) ), Z ) ) }.
% 1.58/1.94 parent0[0]: (7814) {G1,W11,D4,L1,V2,M1} { multiplication( addition( X, one
% 1.58/1.94 ), Y ) = addition( multiplication( X, Y ), Y ) }.
% 1.58/1.94 parent1[0; 4]: (15) {G0,W13,D4,L2,V3,M2} I { ! leq( Z, addition(
% 1.58/1.94 multiplication( X, Z ), Y ) ), leq( Z, multiplication( strong_iteration(
% 1.58/1.94 X ), Y ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := addition( Y, one )
% 1.58/1.94 Y := Z
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 resolution: (7816) {G2,W8,D5,L1,V3,M1} { leq( X, multiplication(
% 1.58/1.94 strong_iteration( addition( Y, one ) ), Z ) ) }.
% 1.58/1.94 parent0[0]: (7815) {G1,W17,D5,L2,V3,M2} { ! leq( X, addition( addition(
% 1.58/1.94 multiplication( Y, X ), X ), Z ) ), leq( X, multiplication(
% 1.58/1.94 strong_iteration( addition( Y, one ) ), Z ) ) }.
% 1.58/1.94 parent1[0]: (338) {G4,W7,D4,L1,V3,M1} P(26,313) { leq( Z, addition(
% 1.58/1.94 addition( Y, Z ), X ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := Z
% 1.58/1.94 Y := multiplication( Y, X )
% 1.58/1.94 Z := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (4138) {G5,W8,D5,L1,V3,M1} P(108,15);r(338) { leq( Y,
% 1.58/1.94 multiplication( strong_iteration( addition( X, one ) ), Z ) ) }.
% 1.58/1.94 parent0: (7816) {G2,W8,D5,L1,V3,M1} { leq( X, multiplication(
% 1.58/1.94 strong_iteration( addition( Y, one ) ), Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 Z := Z
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 resolution: (7817) {G6,W6,D4,L1,V2,M1} { leq( X, strong_iteration(
% 1.58/1.94 addition( Y, one ) ) ) }.
% 1.58/1.94 parent0[1]: (2543) {G6,W8,D3,L2,V2,M2} P(2134,571) { leq( Y, X ), ! leq( Y
% 1.58/1.94 , multiplication( X, zero ) ) }.
% 1.58/1.94 parent1[0]: (4138) {G5,W8,D5,L1,V3,M1} P(108,15);r(338) { leq( Y,
% 1.58/1.94 multiplication( strong_iteration( addition( X, one ) ), Z ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := strong_iteration( addition( Y, one ) )
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 Z := zero
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (5900) {G7,W6,D4,L1,V2,M1} R(4138,2543) { leq( X,
% 1.58/1.94 strong_iteration( addition( Y, one ) ) ) }.
% 1.58/1.94 parent0: (7817) {G6,W6,D4,L1,V2,M1} { leq( X, strong_iteration( addition(
% 1.58/1.94 Y, one ) ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 Y := Y
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7819) {G5,W4,D3,L1,V1,M1} { leq( X, strong_iteration( one ) )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (2138) {G4,W7,D4,L1,V1,M1} R(2130,17) { addition(
% 1.58/1.94 multiplication( X, zero ), X ) ==> X }.
% 1.58/1.94 parent1[0; 3]: (5900) {G7,W6,D4,L1,V2,M1} R(4138,2543) { leq( X,
% 1.58/1.94 strong_iteration( addition( Y, one ) ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := one
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := multiplication( one, zero )
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (5938) {G8,W4,D3,L1,V1,M1} P(2138,5900) { leq( X,
% 1.58/1.94 strong_iteration( one ) ) }.
% 1.58/1.94 parent0: (7819) {G5,W4,D3,L1,V1,M1} { leq( X, strong_iteration( one ) )
% 1.58/1.94 }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7821) {G3,W5,D4,L1,V2,M1} { leq( X, strong_iteration(
% 1.58/1.94 strong_iteration( Y ) ) ) }.
% 1.58/1.94 parent0[0]: (404) {G2,W7,D4,L1,V1,M1} P(14,29) { addition( strong_iteration
% 1.58/1.94 ( X ), one ) ==> strong_iteration( X ) }.
% 1.58/1.94 parent1[0; 3]: (5900) {G7,W6,D4,L1,V2,M1} R(4138,2543) { leq( X,
% 1.58/1.94 strong_iteration( addition( Y, one ) ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 Y := strong_iteration( Y )
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (5939) {G8,W5,D4,L1,V2,M1} P(404,5900) { leq( Y,
% 1.58/1.94 strong_iteration( strong_iteration( X ) ) ) }.
% 1.58/1.94 parent0: (7821) {G3,W5,D4,L1,V2,M1} { leq( X, strong_iteration(
% 1.58/1.94 strong_iteration( Y ) ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7822) {G1,W8,D3,L2,V2,M2} { X ==> addition( X, Y ), ! leq( Y, X )
% 1.58/1.94 }.
% 1.58/1.94 parent0[0]: (36) {G1,W8,D3,L2,V2,M2} P(17,0) { addition( Y, X ) ==> Y, !
% 1.58/1.94 leq( X, Y ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := Y
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 resolution: (7823) {G2,W7,D4,L1,V1,M1} { strong_iteration( one ) ==>
% 1.58/1.94 addition( strong_iteration( one ), X ) }.
% 1.58/1.94 parent0[1]: (7822) {G1,W8,D3,L2,V2,M2} { X ==> addition( X, Y ), ! leq( Y
% 1.58/1.94 , X ) }.
% 1.58/1.94 parent1[0]: (5938) {G8,W4,D3,L1,V1,M1} P(2138,5900) { leq( X,
% 1.58/1.94 strong_iteration( one ) ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := strong_iteration( one )
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7824) {G2,W7,D4,L1,V1,M1} { addition( strong_iteration( one ), X
% 1.58/1.94 ) ==> strong_iteration( one ) }.
% 1.58/1.94 parent0[0]: (7823) {G2,W7,D4,L1,V1,M1} { strong_iteration( one ) ==>
% 1.58/1.94 addition( strong_iteration( one ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (5952) {G9,W7,D4,L1,V1,M1} R(5938,36) { addition(
% 1.58/1.94 strong_iteration( one ), X ) ==> strong_iteration( one ) }.
% 1.58/1.94 parent0: (7824) {G2,W7,D4,L1,V1,M1} { addition( strong_iteration( one ), X
% 1.58/1.94 ) ==> strong_iteration( one ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94 permutation0:
% 1.58/1.94 0 ==> 0
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 eqswap: (7825) {G9,W7,D4,L1,V1,M1} { strong_iteration( one ) ==> addition
% 1.58/1.94 ( strong_iteration( one ), X ) }.
% 1.58/1.94 parent0[0]: (5952) {G9,W7,D4,L1,V1,M1} R(5938,36) { addition(
% 1.58/1.94 strong_iteration( one ), X ) ==> strong_iteration( one ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 paramod: (7827) {G1,W8,D3,L2,V1,M2} { strong_iteration( one ) ==> X, ! leq
% 1.58/1.94 ( strong_iteration( one ), X ) }.
% 1.58/1.94 parent0[1]: (17) {G0,W8,D3,L2,V2,M2} I { ! leq( X, Y ), addition( X, Y )
% 1.58/1.94 ==> Y }.
% 1.58/1.94 parent1[0; 3]: (7825) {G9,W7,D4,L1,V1,M1} { strong_iteration( one ) ==>
% 1.58/1.94 addition( strong_iteration( one ), X ) }.
% 1.58/1.94 substitution0:
% 1.58/1.94 X := strong_iteration( one )
% 1.58/1.94 Y := X
% 1.58/1.94 end
% 1.58/1.94 substitution1:
% 1.58/1.94 X := X
% 1.58/1.94 end
% 1.58/1.94
% 1.58/1.94 subsumption: (6320) {G10,W8,D3,L2,V1,M2} P(5952,17) { ! leq(
% 1.81/2.20 strong_iteration( one ), X ), strong_iteration( one ) = X }.
% 1.81/2.20 parent0: (7827) {G1,W8,D3,L2,V1,M2} { strong_iteration( one ) ==> X, ! leq
% 1.81/2.20 ( strong_iteration( one ), X ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := X
% 1.81/2.20 end
% 1.81/2.20 permutation0:
% 1.81/2.20 0 ==> 1
% 1.81/2.20 1 ==> 0
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 eqswap: (7829) {G10,W8,D3,L2,V1,M2} { X = strong_iteration( one ), ! leq(
% 1.81/2.20 strong_iteration( one ), X ) }.
% 1.81/2.20 parent0[1]: (6320) {G10,W8,D3,L2,V1,M2} P(5952,17) { ! leq(
% 1.81/2.20 strong_iteration( one ), X ), strong_iteration( one ) = X }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := X
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 resolution: (7830) {G9,W6,D4,L1,V1,M1} { strong_iteration(
% 1.81/2.20 strong_iteration( X ) ) = strong_iteration( one ) }.
% 1.81/2.20 parent0[1]: (7829) {G10,W8,D3,L2,V1,M2} { X = strong_iteration( one ), !
% 1.81/2.20 leq( strong_iteration( one ), X ) }.
% 1.81/2.20 parent1[0]: (5939) {G8,W5,D4,L1,V2,M1} P(404,5900) { leq( Y,
% 1.81/2.20 strong_iteration( strong_iteration( X ) ) ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := strong_iteration( strong_iteration( X ) )
% 1.81/2.20 end
% 1.81/2.20 substitution1:
% 1.81/2.20 X := X
% 1.81/2.20 Y := strong_iteration( one )
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 subsumption: (7440) {G11,W6,D4,L1,V1,M1} R(6320,5939) { strong_iteration(
% 1.81/2.20 strong_iteration( X ) ) ==> strong_iteration( one ) }.
% 1.81/2.20 parent0: (7830) {G9,W6,D4,L1,V1,M1} { strong_iteration( strong_iteration(
% 1.81/2.20 X ) ) = strong_iteration( one ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := X
% 1.81/2.20 end
% 1.81/2.20 permutation0:
% 1.81/2.20 0 ==> 0
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 *** allocated 170857 integers for termspace/termends
% 1.81/2.20 eqswap: (7832) {G10,W8,D3,L2,V1,M2} { X = strong_iteration( one ), ! leq(
% 1.81/2.20 strong_iteration( one ), X ) }.
% 1.81/2.20 parent0[1]: (6320) {G10,W8,D3,L2,V1,M2} P(5952,17) { ! leq(
% 1.81/2.20 strong_iteration( one ), X ), strong_iteration( one ) = X }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := X
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 eqswap: (7833) {G0,W6,D4,L1,V0,M1} { ! strong_iteration( one ) ==>
% 1.81/2.20 strong_iteration( strong_iteration( skol1 ) ) }.
% 1.81/2.20 parent0[0]: (19) {G0,W6,D4,L1,V0,M1} I { ! strong_iteration(
% 1.81/2.20 strong_iteration( skol1 ) ) ==> strong_iteration( one ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 paramod: (7837) {G1,W11,D4,L2,V0,M2} { ! strong_iteration( one ) ==>
% 1.81/2.20 strong_iteration( one ), ! leq( strong_iteration( one ), strong_iteration
% 1.81/2.20 ( strong_iteration( skol1 ) ) ) }.
% 1.81/2.20 parent0[0]: (7832) {G10,W8,D3,L2,V1,M2} { X = strong_iteration( one ), !
% 1.81/2.20 leq( strong_iteration( one ), X ) }.
% 1.81/2.20 parent1[0; 4]: (7833) {G0,W6,D4,L1,V0,M1} { ! strong_iteration( one ) ==>
% 1.81/2.20 strong_iteration( strong_iteration( skol1 ) ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := strong_iteration( strong_iteration( skol1 ) )
% 1.81/2.20 end
% 1.81/2.20 substitution1:
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 eqrefl: (108607) {G0,W6,D4,L1,V0,M1} { ! leq( strong_iteration( one ),
% 1.81/2.20 strong_iteration( strong_iteration( skol1 ) ) ) }.
% 1.81/2.20 parent0[0]: (7837) {G1,W11,D4,L2,V0,M2} { ! strong_iteration( one ) ==>
% 1.81/2.20 strong_iteration( one ), ! leq( strong_iteration( one ), strong_iteration
% 1.81/2.20 ( strong_iteration( skol1 ) ) ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 paramod: (108608) {G1,W5,D3,L1,V0,M1} { ! leq( strong_iteration( one ),
% 1.81/2.20 strong_iteration( one ) ) }.
% 1.81/2.20 parent0[0]: (7440) {G11,W6,D4,L1,V1,M1} R(6320,5939) { strong_iteration(
% 1.81/2.20 strong_iteration( X ) ) ==> strong_iteration( one ) }.
% 1.81/2.20 parent1[0; 4]: (108607) {G0,W6,D4,L1,V0,M1} { ! leq( strong_iteration( one
% 1.81/2.20 ), strong_iteration( strong_iteration( skol1 ) ) ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 X := skol1
% 1.81/2.20 end
% 1.81/2.20 substitution1:
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 resolution: (108609) {G2,W0,D0,L0,V0,M0} { }.
% 1.81/2.20 parent0[0]: (108608) {G1,W5,D3,L1,V0,M1} { ! leq( strong_iteration( one )
% 1.81/2.20 , strong_iteration( one ) ) }.
% 1.81/2.20 parent1[0]: (22) {G1,W3,D2,L1,V1,M1} R(18,3) { leq( X, X ) }.
% 1.81/2.20 substitution0:
% 1.81/2.20 end
% 1.81/2.20 substitution1:
% 1.81/2.20 X := strong_iteration( one )
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 subsumption: (7541) {G12,W0,D0,L0,V0,M0} P(6320,19);q;d(7440);r(22) { }.
% 1.81/2.20 parent0: (108609) {G2,W0,D0,L0,V0,M0} { }.
% 1.81/2.20 substitution0:
% 1.81/2.20 end
% 1.81/2.20 permutation0:
% 1.81/2.20 end
% 1.81/2.20
% 1.81/2.20 Proof check complete!
% 1.81/2.20
% 1.81/2.20 Memory use:
% 1.81/2.20
% 1.81/2.20 space for terms: 93664
% 1.81/2.20 space for clauses: 408011
% 1.81/2.20
% 1.81/2.20
% 1.81/2.20 clauses generated: 78153
% 1.81/2.20 clauses kept: 7542
% 1.81/2.20 clauses selected: 595
% 1.81/2.20 clauses deleted: 148
% 1.81/2.20 clauses inuse deleted: 64
% 1.81/2.20
% 1.81/2.20 subsentry: 785690
% 1.81/2.20 literals s-matched: 407919
% 1.81/2.20 literals matched: 402772
% 1.81/2.20 full subsumption: 34965
% 1.81/2.20
% 1.81/2.20 checksum: 846442398
% 1.81/2.20
% 1.81/2.20
% 1.81/2.20 Bliksem ended
%------------------------------------------------------------------------------