TSTP Solution File: COM007+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COM007+2 : TPTP v8.1.0. Released v3.2.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 : Fri Jul 15 00:51:01 EDT 2022
% Result : Theorem 0.49s 1.13s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COM007+2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Thu Jun 16 18:14:35 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.49/1.13 *** allocated 10000 integers for termspace/termends
% 0.49/1.13 *** allocated 10000 integers for clauses
% 0.49/1.13 *** allocated 10000 integers for justifications
% 0.49/1.13 Bliksem 1.12
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Automatic Strategy Selection
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Clauses:
% 0.49/1.13
% 0.49/1.13 { reflexive_rewrite( a, b ) }.
% 0.49/1.13 { reflexive_rewrite( a, c ) }.
% 0.49/1.13 { ! reflexive_rewrite( b, X ), ! reflexive_rewrite( c, X ), goal }.
% 0.49/1.13 { ! X = Y, reflexive_rewrite( X, Y ) }.
% 0.49/1.13 { ! rewrite( X, Y ), reflexive_rewrite( X, Y ) }.
% 0.49/1.13 { ! reflexive_rewrite( X, Y ), X = Y, rewrite( X, Y ) }.
% 0.49/1.13 { ! rewrite( Z, X ), ! rewrite( Z, Y ), rewrite( Y, skol1( T, Y ) ) }.
% 0.49/1.13 { ! rewrite( Z, X ), ! rewrite( Z, Y ), rewrite( X, skol1( X, Y ) ) }.
% 0.49/1.13 { ! goal }.
% 0.49/1.13
% 0.49/1.13 percentage equality = 0.105263, percentage horn = 0.888889
% 0.49/1.13 This is a problem with some equality
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Options Used:
% 0.49/1.13
% 0.49/1.13 useres = 1
% 0.49/1.13 useparamod = 1
% 0.49/1.13 useeqrefl = 1
% 0.49/1.13 useeqfact = 1
% 0.49/1.13 usefactor = 1
% 0.49/1.13 usesimpsplitting = 0
% 0.49/1.13 usesimpdemod = 5
% 0.49/1.13 usesimpres = 3
% 0.49/1.13
% 0.49/1.13 resimpinuse = 1000
% 0.49/1.13 resimpclauses = 20000
% 0.49/1.13 substype = eqrewr
% 0.49/1.13 backwardsubs = 1
% 0.49/1.13 selectoldest = 5
% 0.49/1.13
% 0.49/1.13 litorderings [0] = split
% 0.49/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.49/1.13
% 0.49/1.13 termordering = kbo
% 0.49/1.13
% 0.49/1.13 litapriori = 0
% 0.49/1.13 termapriori = 1
% 0.49/1.13 litaposteriori = 0
% 0.49/1.13 termaposteriori = 0
% 0.49/1.13 demodaposteriori = 0
% 0.49/1.13 ordereqreflfact = 0
% 0.49/1.13
% 0.49/1.13 litselect = negord
% 0.49/1.13
% 0.49/1.13 maxweight = 15
% 0.49/1.13 maxdepth = 30000
% 0.49/1.13 maxlength = 115
% 0.49/1.13 maxnrvars = 195
% 0.49/1.13 excuselevel = 1
% 0.49/1.13 increasemaxweight = 1
% 0.49/1.13
% 0.49/1.13 maxselected = 10000000
% 0.49/1.13 maxnrclauses = 10000000
% 0.49/1.13
% 0.49/1.13 showgenerated = 0
% 0.49/1.13 showkept = 0
% 0.49/1.13 showselected = 0
% 0.49/1.13 showdeleted = 0
% 0.49/1.13 showresimp = 1
% 0.49/1.13 showstatus = 2000
% 0.49/1.13
% 0.49/1.13 prologoutput = 0
% 0.49/1.13 nrgoals = 5000000
% 0.49/1.13 totalproof = 1
% 0.49/1.13
% 0.49/1.13 Symbols occurring in the translation:
% 0.49/1.13
% 0.49/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.49/1.13 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.49/1.13 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.49/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.13 a [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.49/1.13 b [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.49/1.13 reflexive_rewrite [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.49/1.13 c [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.49/1.13 goal [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.49/1.13 rewrite [42, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.49/1.13 skol1 [45, 2] (w:1, o:45, a:1, s:1, b:1).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Starting Search:
% 0.49/1.13
% 0.49/1.13 *** allocated 15000 integers for clauses
% 0.49/1.13
% 0.49/1.13 Bliksems!, er is een bewijs:
% 0.49/1.13 % SZS status Theorem
% 0.49/1.13 % SZS output start Refutation
% 0.49/1.13
% 0.49/1.13 (0) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, b ) }.
% 0.49/1.13 (1) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, c ) }.
% 0.49/1.13 (2) {G0,W7,D2,L3,V1,M3} I { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ), goal }.
% 0.49/1.13 (3) {G0,W6,D2,L2,V2,M2} I { ! X = Y, reflexive_rewrite( X, Y ) }.
% 0.49/1.13 (4) {G0,W6,D2,L2,V2,M2} I { ! rewrite( X, Y ), reflexive_rewrite( X, Y )
% 0.49/1.13 }.
% 0.49/1.13 (5) {G0,W9,D2,L3,V2,M3} I { ! reflexive_rewrite( X, Y ), X = Y, rewrite( X
% 0.49/1.13 , Y ) }.
% 0.49/1.13 (6) {G0,W11,D3,L3,V4,M3} I { ! rewrite( Z, X ), ! rewrite( Z, Y ), rewrite
% 0.49/1.13 ( Y, skol1( T, Y ) ) }.
% 0.49/1.13 (7) {G0,W11,D3,L3,V3,M3} I { ! rewrite( Z, X ), ! rewrite( Z, Y ), rewrite
% 0.49/1.13 ( X, skol1( X, Y ) ) }.
% 0.49/1.13 (8) {G0,W1,D1,L1,V0,M1} I { ! goal }.
% 0.49/1.13 (9) {G1,W3,D2,L1,V1,M1} Q(3) { reflexive_rewrite( X, X ) }.
% 0.49/1.13 (10) {G1,W8,D3,L2,V3,M2} F(6) { ! rewrite( X, Y ), rewrite( Y, skol1( Z, Y
% 0.49/1.13 ) ) }.
% 0.49/1.13 (11) {G1,W6,D2,L2,V1,M2} S(2);r(8) { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ) }.
% 0.49/1.13 (14) {G2,W6,D2,L2,V1,M2} R(11,4) { ! reflexive_rewrite( c, X ), ! rewrite(
% 0.49/1.13 b, X ) }.
% 0.49/1.13 (16) {G2,W3,D2,L1,V0,M1} R(11,9) { ! reflexive_rewrite( c, b ) }.
% 0.49/1.13 (17) {G2,W3,D2,L1,V0,M1} R(11,9) { ! reflexive_rewrite( b, c ) }.
% 0.49/1.13 (19) {G3,W3,D2,L1,V0,M1} R(16,4) { ! rewrite( c, b ) }.
% 0.49/1.13 (20) {G1,W6,D2,L2,V0,M2} R(5,0) { b ==> a, rewrite( a, b ) }.
% 0.49/1.13 (21) {G1,W6,D2,L2,V0,M2} R(5,1) { c ==> a, rewrite( a, c ) }.
% 0.49/1.13 (93) {G3,W6,D2,L2,V1,M2} R(14,4) { ! rewrite( b, X ), ! rewrite( c, X ) }.
% 0.49/1.13 (124) {G3,W3,D2,L1,V0,M1} P(20,17);r(1) { rewrite( a, b ) }.
% 0.49/1.13 (143) {G4,W5,D3,L1,V1,M1} R(124,10) { rewrite( b, skol1( X, b ) ) }.
% 0.49/1.13 (151) {G5,W5,D3,L1,V1,M1} R(143,93) { ! rewrite( c, skol1( X, b ) ) }.
% 0.49/1.13 (161) {G6,W6,D2,L2,V1,M2} R(151,7) { ! rewrite( X, c ), ! rewrite( X, b )
% 0.49/1.13 }.
% 0.49/1.13 (185) {G4,W3,D2,L1,V0,M1} P(21,19);r(124) { rewrite( a, c ) }.
% 0.49/1.13 (244) {G7,W0,D0,L0,V0,M0} R(161,185);r(124) { }.
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 % SZS output end Refutation
% 0.49/1.13 found a proof!
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Unprocessed initial clauses:
% 0.49/1.13
% 0.49/1.13 (246) {G0,W3,D2,L1,V0,M1} { reflexive_rewrite( a, b ) }.
% 0.49/1.13 (247) {G0,W3,D2,L1,V0,M1} { reflexive_rewrite( a, c ) }.
% 0.49/1.13 (248) {G0,W7,D2,L3,V1,M3} { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ), goal }.
% 0.49/1.13 (249) {G0,W6,D2,L2,V2,M2} { ! X = Y, reflexive_rewrite( X, Y ) }.
% 0.49/1.13 (250) {G0,W6,D2,L2,V2,M2} { ! rewrite( X, Y ), reflexive_rewrite( X, Y )
% 0.49/1.13 }.
% 0.49/1.13 (251) {G0,W9,D2,L3,V2,M3} { ! reflexive_rewrite( X, Y ), X = Y, rewrite( X
% 0.49/1.13 , Y ) }.
% 0.49/1.13 (252) {G0,W11,D3,L3,V4,M3} { ! rewrite( Z, X ), ! rewrite( Z, Y ), rewrite
% 0.49/1.13 ( Y, skol1( T, Y ) ) }.
% 0.49/1.13 (253) {G0,W11,D3,L3,V3,M3} { ! rewrite( Z, X ), ! rewrite( Z, Y ), rewrite
% 0.49/1.13 ( X, skol1( X, Y ) ) }.
% 0.49/1.13 (254) {G0,W1,D1,L1,V0,M1} { ! goal }.
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Total Proof:
% 0.49/1.13
% 0.49/1.13 subsumption: (0) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, b ) }.
% 0.49/1.13 parent0: (246) {G0,W3,D2,L1,V0,M1} { reflexive_rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (1) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, c ) }.
% 0.49/1.13 parent0: (247) {G0,W3,D2,L1,V0,M1} { reflexive_rewrite( a, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (2) {G0,W7,D2,L3,V1,M3} I { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ), goal }.
% 0.49/1.13 parent0: (248) {G0,W7,D2,L3,V1,M3} { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ), goal }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 2 ==> 2
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (3) {G0,W6,D2,L2,V2,M2} I { ! X = Y, reflexive_rewrite( X, Y )
% 0.49/1.13 }.
% 0.49/1.13 parent0: (249) {G0,W6,D2,L2,V2,M2} { ! X = Y, reflexive_rewrite( X, Y )
% 0.49/1.13 }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (4) {G0,W6,D2,L2,V2,M2} I { ! rewrite( X, Y ),
% 0.49/1.13 reflexive_rewrite( X, Y ) }.
% 0.49/1.13 parent0: (250) {G0,W6,D2,L2,V2,M2} { ! rewrite( X, Y ), reflexive_rewrite
% 0.49/1.13 ( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! reflexive_rewrite( X, Y ), X = Y
% 0.49/1.13 , rewrite( X, Y ) }.
% 0.49/1.13 parent0: (251) {G0,W9,D2,L3,V2,M3} { ! reflexive_rewrite( X, Y ), X = Y,
% 0.49/1.13 rewrite( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 2 ==> 2
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (6) {G0,W11,D3,L3,V4,M3} I { ! rewrite( Z, X ), ! rewrite( Z,
% 0.49/1.13 Y ), rewrite( Y, skol1( T, Y ) ) }.
% 0.49/1.13 parent0: (252) {G0,W11,D3,L3,V4,M3} { ! rewrite( Z, X ), ! rewrite( Z, Y )
% 0.49/1.13 , rewrite( Y, skol1( T, Y ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 Z := Z
% 0.49/1.13 T := T
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 2 ==> 2
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (7) {G0,W11,D3,L3,V3,M3} I { ! rewrite( Z, X ), ! rewrite( Z,
% 0.49/1.13 Y ), rewrite( X, skol1( X, Y ) ) }.
% 0.49/1.13 parent0: (253) {G0,W11,D3,L3,V3,M3} { ! rewrite( Z, X ), ! rewrite( Z, Y )
% 0.49/1.13 , rewrite( X, skol1( X, Y ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 Z := Z
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 2 ==> 2
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (8) {G0,W1,D1,L1,V0,M1} I { ! goal }.
% 0.49/1.13 parent0: (254) {G0,W1,D1,L1,V0,M1} { ! goal }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 eqswap: (270) {G0,W6,D2,L2,V2,M2} { ! Y = X, reflexive_rewrite( X, Y ) }.
% 0.49/1.13 parent0[0]: (3) {G0,W6,D2,L2,V2,M2} I { ! X = Y, reflexive_rewrite( X, Y )
% 0.49/1.13 }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 eqrefl: (271) {G0,W3,D2,L1,V1,M1} { reflexive_rewrite( X, X ) }.
% 0.49/1.13 parent0[0]: (270) {G0,W6,D2,L2,V2,M2} { ! Y = X, reflexive_rewrite( X, Y )
% 0.49/1.13 }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := X
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (9) {G1,W3,D2,L1,V1,M1} Q(3) { reflexive_rewrite( X, X ) }.
% 0.49/1.13 parent0: (271) {G0,W3,D2,L1,V1,M1} { reflexive_rewrite( X, X ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 factor: (272) {G0,W8,D3,L2,V3,M2} { ! rewrite( X, Y ), rewrite( Y, skol1(
% 0.49/1.13 Z, Y ) ) }.
% 0.49/1.13 parent0[0, 1]: (6) {G0,W11,D3,L3,V4,M3} I { ! rewrite( Z, X ), ! rewrite( Z
% 0.49/1.13 , Y ), rewrite( Y, skol1( T, Y ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := Y
% 0.49/1.13 Y := Y
% 0.49/1.13 Z := X
% 0.49/1.13 T := Z
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (10) {G1,W8,D3,L2,V3,M2} F(6) { ! rewrite( X, Y ), rewrite( Y
% 0.49/1.13 , skol1( Z, Y ) ) }.
% 0.49/1.13 parent0: (272) {G0,W8,D3,L2,V3,M2} { ! rewrite( X, Y ), rewrite( Y, skol1
% 0.49/1.13 ( Z, Y ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 Z := Z
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (273) {G1,W6,D2,L2,V1,M2} { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ) }.
% 0.49/1.13 parent0[0]: (8) {G0,W1,D1,L1,V0,M1} I { ! goal }.
% 0.49/1.13 parent1[2]: (2) {G0,W7,D2,L3,V1,M3} I { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ), goal }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (11) {G1,W6,D2,L2,V1,M2} S(2);r(8) { ! reflexive_rewrite( b, X
% 0.49/1.13 ), ! reflexive_rewrite( c, X ) }.
% 0.49/1.13 parent0: (273) {G1,W6,D2,L2,V1,M2} { ! reflexive_rewrite( b, X ), !
% 0.49/1.13 reflexive_rewrite( c, X ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (274) {G1,W6,D2,L2,V1,M2} { ! reflexive_rewrite( c, X ), !
% 0.49/1.13 rewrite( b, X ) }.
% 0.49/1.13 parent0[0]: (11) {G1,W6,D2,L2,V1,M2} S(2);r(8) { ! reflexive_rewrite( b, X
% 0.49/1.13 ), ! reflexive_rewrite( c, X ) }.
% 0.49/1.13 parent1[1]: (4) {G0,W6,D2,L2,V2,M2} I { ! rewrite( X, Y ),
% 0.49/1.13 reflexive_rewrite( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := b
% 0.49/1.13 Y := X
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (14) {G2,W6,D2,L2,V1,M2} R(11,4) { ! reflexive_rewrite( c, X )
% 0.49/1.13 , ! rewrite( b, X ) }.
% 0.49/1.13 parent0: (274) {G1,W6,D2,L2,V1,M2} { ! reflexive_rewrite( c, X ), !
% 0.49/1.13 rewrite( b, X ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (276) {G2,W3,D2,L1,V0,M1} { ! reflexive_rewrite( c, b ) }.
% 0.49/1.13 parent0[0]: (11) {G1,W6,D2,L2,V1,M2} S(2);r(8) { ! reflexive_rewrite( b, X
% 0.49/1.13 ), ! reflexive_rewrite( c, X ) }.
% 0.49/1.13 parent1[0]: (9) {G1,W3,D2,L1,V1,M1} Q(3) { reflexive_rewrite( X, X ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := b
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := b
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (16) {G2,W3,D2,L1,V0,M1} R(11,9) { ! reflexive_rewrite( c, b )
% 0.49/1.13 }.
% 0.49/1.13 parent0: (276) {G2,W3,D2,L1,V0,M1} { ! reflexive_rewrite( c, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (279) {G2,W3,D2,L1,V0,M1} { ! reflexive_rewrite( b, c ) }.
% 0.49/1.13 parent0[1]: (11) {G1,W6,D2,L2,V1,M2} S(2);r(8) { ! reflexive_rewrite( b, X
% 0.49/1.13 ), ! reflexive_rewrite( c, X ) }.
% 0.49/1.13 parent1[0]: (9) {G1,W3,D2,L1,V1,M1} Q(3) { reflexive_rewrite( X, X ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := c
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := c
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (17) {G2,W3,D2,L1,V0,M1} R(11,9) { ! reflexive_rewrite( b, c )
% 0.49/1.13 }.
% 0.49/1.13 parent0: (279) {G2,W3,D2,L1,V0,M1} { ! reflexive_rewrite( b, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (280) {G1,W3,D2,L1,V0,M1} { ! rewrite( c, b ) }.
% 0.49/1.13 parent0[0]: (16) {G2,W3,D2,L1,V0,M1} R(11,9) { ! reflexive_rewrite( c, b )
% 0.49/1.13 }.
% 0.49/1.13 parent1[1]: (4) {G0,W6,D2,L2,V2,M2} I { ! rewrite( X, Y ),
% 0.49/1.13 reflexive_rewrite( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := c
% 0.49/1.13 Y := b
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (19) {G3,W3,D2,L1,V0,M1} R(16,4) { ! rewrite( c, b ) }.
% 0.49/1.13 parent0: (280) {G1,W3,D2,L1,V0,M1} { ! rewrite( c, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 eqswap: (281) {G0,W9,D2,L3,V2,M3} { Y = X, ! reflexive_rewrite( X, Y ),
% 0.49/1.13 rewrite( X, Y ) }.
% 0.49/1.13 parent0[1]: (5) {G0,W9,D2,L3,V2,M3} I { ! reflexive_rewrite( X, Y ), X = Y
% 0.49/1.13 , rewrite( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (282) {G1,W6,D2,L2,V0,M2} { b = a, rewrite( a, b ) }.
% 0.49/1.13 parent0[1]: (281) {G0,W9,D2,L3,V2,M3} { Y = X, ! reflexive_rewrite( X, Y )
% 0.49/1.13 , rewrite( X, Y ) }.
% 0.49/1.13 parent1[0]: (0) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := a
% 0.49/1.13 Y := b
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (20) {G1,W6,D2,L2,V0,M2} R(5,0) { b ==> a, rewrite( a, b ) }.
% 0.49/1.13 parent0: (282) {G1,W6,D2,L2,V0,M2} { b = a, rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 eqswap: (284) {G0,W9,D2,L3,V2,M3} { Y = X, ! reflexive_rewrite( X, Y ),
% 0.49/1.13 rewrite( X, Y ) }.
% 0.49/1.13 parent0[1]: (5) {G0,W9,D2,L3,V2,M3} I { ! reflexive_rewrite( X, Y ), X = Y
% 0.49/1.13 , rewrite( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 Y := Y
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (285) {G1,W6,D2,L2,V0,M2} { c = a, rewrite( a, c ) }.
% 0.49/1.13 parent0[1]: (284) {G0,W9,D2,L3,V2,M3} { Y = X, ! reflexive_rewrite( X, Y )
% 0.49/1.13 , rewrite( X, Y ) }.
% 0.49/1.13 parent1[0]: (1) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := a
% 0.49/1.13 Y := c
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (21) {G1,W6,D2,L2,V0,M2} R(5,1) { c ==> a, rewrite( a, c ) }.
% 0.49/1.13 parent0: (285) {G1,W6,D2,L2,V0,M2} { c = a, rewrite( a, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (287) {G1,W6,D2,L2,V1,M2} { ! rewrite( b, X ), ! rewrite( c, X
% 0.49/1.13 ) }.
% 0.49/1.13 parent0[0]: (14) {G2,W6,D2,L2,V1,M2} R(11,4) { ! reflexive_rewrite( c, X )
% 0.49/1.13 , ! rewrite( b, X ) }.
% 0.49/1.13 parent1[1]: (4) {G0,W6,D2,L2,V2,M2} I { ! rewrite( X, Y ),
% 0.49/1.13 reflexive_rewrite( X, Y ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := c
% 0.49/1.13 Y := X
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (93) {G3,W6,D2,L2,V1,M2} R(14,4) { ! rewrite( b, X ), !
% 0.49/1.13 rewrite( c, X ) }.
% 0.49/1.13 parent0: (287) {G1,W6,D2,L2,V1,M2} { ! rewrite( b, X ), ! rewrite( c, X )
% 0.49/1.13 }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 paramod: (289) {G2,W6,D2,L2,V0,M2} { ! reflexive_rewrite( a, c ), rewrite
% 0.49/1.13 ( a, b ) }.
% 0.49/1.13 parent0[0]: (20) {G1,W6,D2,L2,V0,M2} R(5,0) { b ==> a, rewrite( a, b ) }.
% 0.49/1.13 parent1[0; 2]: (17) {G2,W3,D2,L1,V0,M1} R(11,9) { ! reflexive_rewrite( b, c
% 0.49/1.13 ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (300) {G1,W3,D2,L1,V0,M1} { rewrite( a, b ) }.
% 0.49/1.13 parent0[0]: (289) {G2,W6,D2,L2,V0,M2} { ! reflexive_rewrite( a, c ),
% 0.49/1.13 rewrite( a, b ) }.
% 0.49/1.13 parent1[0]: (1) {G0,W3,D2,L1,V0,M1} I { reflexive_rewrite( a, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (124) {G3,W3,D2,L1,V0,M1} P(20,17);r(1) { rewrite( a, b ) }.
% 0.49/1.13 parent0: (300) {G1,W3,D2,L1,V0,M1} { rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (301) {G2,W5,D3,L1,V1,M1} { rewrite( b, skol1( X, b ) ) }.
% 0.49/1.13 parent0[0]: (10) {G1,W8,D3,L2,V3,M2} F(6) { ! rewrite( X, Y ), rewrite( Y,
% 0.49/1.13 skol1( Z, Y ) ) }.
% 0.49/1.13 parent1[0]: (124) {G3,W3,D2,L1,V0,M1} P(20,17);r(1) { rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := a
% 0.49/1.13 Y := b
% 0.49/1.13 Z := X
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (143) {G4,W5,D3,L1,V1,M1} R(124,10) { rewrite( b, skol1( X, b
% 0.49/1.13 ) ) }.
% 0.49/1.13 parent0: (301) {G2,W5,D3,L1,V1,M1} { rewrite( b, skol1( X, b ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (302) {G4,W5,D3,L1,V1,M1} { ! rewrite( c, skol1( X, b ) ) }.
% 0.49/1.13 parent0[0]: (93) {G3,W6,D2,L2,V1,M2} R(14,4) { ! rewrite( b, X ), ! rewrite
% 0.49/1.13 ( c, X ) }.
% 0.49/1.13 parent1[0]: (143) {G4,W5,D3,L1,V1,M1} R(124,10) { rewrite( b, skol1( X, b )
% 0.49/1.13 ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := skol1( X, b )
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (151) {G5,W5,D3,L1,V1,M1} R(143,93) { ! rewrite( c, skol1( X,
% 0.49/1.13 b ) ) }.
% 0.49/1.13 parent0: (302) {G4,W5,D3,L1,V1,M1} { ! rewrite( c, skol1( X, b ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (303) {G1,W6,D2,L2,V1,M2} { ! rewrite( X, c ), ! rewrite( X, b
% 0.49/1.13 ) }.
% 0.49/1.13 parent0[0]: (151) {G5,W5,D3,L1,V1,M1} R(143,93) { ! rewrite( c, skol1( X, b
% 0.49/1.13 ) ) }.
% 0.49/1.13 parent1[2]: (7) {G0,W11,D3,L3,V3,M3} I { ! rewrite( Z, X ), ! rewrite( Z, Y
% 0.49/1.13 ), rewrite( X, skol1( X, Y ) ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := c
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 X := c
% 0.49/1.13 Y := b
% 0.49/1.13 Z := X
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (161) {G6,W6,D2,L2,V1,M2} R(151,7) { ! rewrite( X, c ), !
% 0.49/1.13 rewrite( X, b ) }.
% 0.49/1.13 parent0: (303) {G1,W6,D2,L2,V1,M2} { ! rewrite( X, c ), ! rewrite( X, b )
% 0.49/1.13 }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := X
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 1 ==> 1
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 paramod: (305) {G2,W6,D2,L2,V0,M2} { ! rewrite( a, b ), rewrite( a, c )
% 0.49/1.13 }.
% 0.49/1.13 parent0[0]: (21) {G1,W6,D2,L2,V0,M2} R(5,1) { c ==> a, rewrite( a, c ) }.
% 0.49/1.13 parent1[0; 2]: (19) {G3,W3,D2,L1,V0,M1} R(16,4) { ! rewrite( c, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (316) {G3,W3,D2,L1,V0,M1} { rewrite( a, c ) }.
% 0.49/1.13 parent0[0]: (305) {G2,W6,D2,L2,V0,M2} { ! rewrite( a, b ), rewrite( a, c )
% 0.49/1.13 }.
% 0.49/1.13 parent1[0]: (124) {G3,W3,D2,L1,V0,M1} P(20,17);r(1) { rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (185) {G4,W3,D2,L1,V0,M1} P(21,19);r(124) { rewrite( a, c )
% 0.49/1.13 }.
% 0.49/1.13 parent0: (316) {G3,W3,D2,L1,V0,M1} { rewrite( a, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 0 ==> 0
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (317) {G5,W3,D2,L1,V0,M1} { ! rewrite( a, b ) }.
% 0.49/1.13 parent0[0]: (161) {G6,W6,D2,L2,V1,M2} R(151,7) { ! rewrite( X, c ), !
% 0.49/1.13 rewrite( X, b ) }.
% 0.49/1.13 parent1[0]: (185) {G4,W3,D2,L1,V0,M1} P(21,19);r(124) { rewrite( a, c ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 X := a
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 resolution: (318) {G4,W0,D0,L0,V0,M0} { }.
% 0.49/1.13 parent0[0]: (317) {G5,W3,D2,L1,V0,M1} { ! rewrite( a, b ) }.
% 0.49/1.13 parent1[0]: (124) {G3,W3,D2,L1,V0,M1} P(20,17);r(1) { rewrite( a, b ) }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 substitution1:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 subsumption: (244) {G7,W0,D0,L0,V0,M0} R(161,185);r(124) { }.
% 0.49/1.13 parent0: (318) {G4,W0,D0,L0,V0,M0} { }.
% 0.49/1.13 substitution0:
% 0.49/1.13 end
% 0.49/1.13 permutation0:
% 0.49/1.13 end
% 0.49/1.13
% 0.49/1.13 Proof check complete!
% 0.49/1.13
% 0.49/1.13 Memory use:
% 0.49/1.13
% 0.49/1.13 space for terms: 3053
% 0.49/1.13 space for clauses: 11134
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 clauses generated: 474
% 0.49/1.13 clauses kept: 245
% 0.49/1.13 clauses selected: 40
% 0.49/1.13 clauses deleted: 2
% 0.49/1.13 clauses inuse deleted: 0
% 0.49/1.13
% 0.49/1.13 subsentry: 929
% 0.49/1.13 literals s-matched: 778
% 0.49/1.13 literals matched: 778
% 0.49/1.13 full subsumption: 66
% 0.49/1.13
% 0.49/1.13 checksum: 33666425
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Bliksem ended
%------------------------------------------------------------------------------