TSTP Solution File: SWV488+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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 : Wed Jul 20 16:25:19 EDT 2022
% Result : Theorem 0.71s 1.16s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Thu Jun 16 00:32:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.16 *** allocated 10000 integers for termspace/termends
% 0.71/1.16 *** allocated 10000 integers for clauses
% 0.71/1.16 *** allocated 10000 integers for justifications
% 0.71/1.16 Bliksem 1.12
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Automatic Strategy Selection
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Clauses:
% 0.71/1.16
% 0.71/1.16 { ! int_leq( X, Y ), int_less( X, Y ), X = Y }.
% 0.71/1.16 { ! int_less( X, Y ), int_leq( X, Y ) }.
% 0.71/1.16 { ! X = Y, int_leq( X, Y ) }.
% 0.71/1.16 { ! int_less( X, Z ), ! int_less( Z, Y ), int_less( X, Y ) }.
% 0.71/1.16 { ! int_less( X, Y ), ! X = Y }.
% 0.71/1.16 { int_less( X, Y ), int_leq( Y, X ) }.
% 0.71/1.16 { int_less( int_zero, int_one ) }.
% 0.71/1.16 { plus( X, Y ) = plus( Y, X ) }.
% 0.71/1.16 { plus( X, int_zero ) = X }.
% 0.71/1.16 { ! int_less( X, Y ), ! int_leq( Z, T ), int_leq( plus( X, Z ), plus( Y, T
% 0.71/1.16 ) ) }.
% 0.71/1.16 { ! int_less( X, Y ), int_less( int_zero, skol1( Z, T ) ) }.
% 0.71/1.16 { ! int_less( X, Y ), plus( X, skol1( X, Y ) ) = Y }.
% 0.71/1.16 { ! plus( X, Z ) = Y, ! int_less( int_zero, Z ), int_less( X, Y ) }.
% 0.71/1.16 { ! int_less( int_zero, X ), int_leq( int_one, X ) }.
% 0.71/1.16 { ! int_leq( int_one, X ), int_less( int_zero, X ) }.
% 0.71/1.16 { ! real_zero = real_one }.
% 0.71/1.16 { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), !
% 0.71/1.16 int_leq( Y, n ), ! int_less( int_zero, Z ), ! X = plus( Y, Z ), ! int_leq
% 0.71/1.16 ( int_one, T ), ! int_leq( T, Y ), a( plus( T, Z ), T ) = real_zero }.
% 0.71/1.16 { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), !
% 0.71/1.16 int_leq( Y, n ), ! int_leq( int_one, Z ), ! int_leq( Z, Y ), a( Z, Z ) =
% 0.71/1.16 real_one }.
% 0.71/1.16 { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), !
% 0.71/1.16 int_leq( Y, n ), ! int_less( int_zero, Z ), ! Y = plus( X, Z ), ! int_leq
% 0.71/1.16 ( int_one, T ), ! int_leq( T, X ), a( T, plus( T, Z ) ) = real_zero }.
% 0.71/1.16 { int_leq( int_one, skol3 ) }.
% 0.71/1.16 { int_leq( skol3, skol2 ) }.
% 0.71/1.16 { int_leq( skol2, n ) }.
% 0.71/1.16 { skol2 = skol3 }.
% 0.71/1.16 { a( skol2, skol3 ) = real_zero }.
% 0.71/1.16
% 0.71/1.16 percentage equality = 0.241935, percentage horn = 0.916667
% 0.71/1.16 This is a problem with some equality
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Options Used:
% 0.71/1.16
% 0.71/1.16 useres = 1
% 0.71/1.16 useparamod = 1
% 0.71/1.16 useeqrefl = 1
% 0.71/1.16 useeqfact = 1
% 0.71/1.16 usefactor = 1
% 0.71/1.16 usesimpsplitting = 0
% 0.71/1.16 usesimpdemod = 5
% 0.71/1.16 usesimpres = 3
% 0.71/1.16
% 0.71/1.16 resimpinuse = 1000
% 0.71/1.16 resimpclauses = 20000
% 0.71/1.16 substype = eqrewr
% 0.71/1.16 backwardsubs = 1
% 0.71/1.16 selectoldest = 5
% 0.71/1.16
% 0.71/1.16 litorderings [0] = split
% 0.71/1.16 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.16
% 0.71/1.16 termordering = kbo
% 0.71/1.16
% 0.71/1.16 litapriori = 0
% 0.71/1.16 termapriori = 1
% 0.71/1.16 litaposteriori = 0
% 0.71/1.16 termaposteriori = 0
% 0.71/1.16 demodaposteriori = 0
% 0.71/1.16 ordereqreflfact = 0
% 0.71/1.16
% 0.71/1.16 litselect = negord
% 0.71/1.16
% 0.71/1.16 maxweight = 15
% 0.71/1.16 maxdepth = 30000
% 0.71/1.16 maxlength = 115
% 0.71/1.16 maxnrvars = 195
% 0.71/1.16 excuselevel = 1
% 0.71/1.16 increasemaxweight = 1
% 0.71/1.16
% 0.71/1.16 maxselected = 10000000
% 0.71/1.16 maxnrclauses = 10000000
% 0.71/1.16
% 0.71/1.16 showgenerated = 0
% 0.71/1.16 showkept = 0
% 0.71/1.16 showselected = 0
% 0.71/1.16 showdeleted = 0
% 0.71/1.16 showresimp = 1
% 0.71/1.16 showstatus = 2000
% 0.71/1.16
% 0.71/1.16 prologoutput = 0
% 0.71/1.16 nrgoals = 5000000
% 0.71/1.16 totalproof = 1
% 0.71/1.16
% 0.71/1.16 Symbols occurring in the translation:
% 0.71/1.16
% 0.71/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.16 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.71/1.16 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 0.71/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.16 int_leq [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.16 int_less [38, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.16 int_zero [40, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.16 int_one [41, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.71/1.16 plus [42, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.71/1.16 real_zero [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.16 real_one [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.16 n [49, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.16 a [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.71/1.16 skol1 [52, 2] (w:1, o:54, a:1, s:1, b:1),
% 0.71/1.16 skol2 [53, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.71/1.16 skol3 [54, 0] (w:1, o:20, a:1, s:1, b:1).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Starting Search:
% 0.71/1.16
% 0.71/1.16 *** allocated 15000 integers for clauses
% 0.71/1.16 *** allocated 22500 integers for clauses
% 0.71/1.16 *** allocated 33750 integers for clauses
% 0.71/1.16 *** allocated 15000 integers for termspace/termends
% 0.71/1.16 *** allocated 50625 integers for clauses
% 0.71/1.16
% 0.71/1.16 Bliksems!, er is een bewijs:
% 0.71/1.16 % SZS status Theorem
% 0.71/1.16 % SZS output start Refutation
% 0.71/1.16
% 0.71/1.16 (2) {G0,W6,D2,L2,V2,M2} I { ! X = Y, int_leq( X, Y ) }.
% 0.71/1.16 (15) {G0,W3,D2,L1,V0,M1} I { ! real_one ==> real_zero }.
% 0.71/1.16 (17) {G0,W23,D3,L7,V3,M7} I { ! int_leq( int_one, X ), ! int_leq( X, n ), !
% 0.71/1.16 int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_leq( int_one, Z ), !
% 0.71/1.16 int_leq( Z, Y ), a( Z, Z ) ==> real_one }.
% 0.71/1.16 (19) {G0,W3,D2,L1,V0,M1} I { int_leq( int_one, skol3 ) }.
% 0.71/1.16 (21) {G0,W3,D2,L1,V0,M1} I { int_leq( skol2, n ) }.
% 0.71/1.16 (22) {G0,W3,D2,L1,V0,M1} I { skol3 ==> skol2 }.
% 0.71/1.16 (23) {G1,W5,D3,L1,V0,M1} I;d(22) { a( skol2, skol2 ) ==> real_zero }.
% 0.71/1.16 (24) {G1,W3,D2,L1,V1,M1} Q(2) { int_leq( X, X ) }.
% 0.71/1.16 (30) {G1,W17,D3,L5,V2,M5} F(17);f { ! int_leq( int_one, X ), ! int_leq( X,
% 0.71/1.16 n ), ! int_leq( int_one, Y ), ! int_leq( Y, X ), a( Y, Y ) ==> real_one
% 0.71/1.16 }.
% 0.71/1.16 (35) {G2,W11,D3,L3,V1,M3} F(30);r(24) { ! int_leq( int_one, X ), ! int_leq
% 0.71/1.16 ( X, n ), a( X, X ) ==> real_one }.
% 0.71/1.16 (44) {G1,W3,D2,L1,V0,M1} S(19);d(22) { int_leq( int_one, skol2 ) }.
% 0.71/1.16 (888) {G3,W3,D2,L1,V0,M1} R(35,44);d(23);r(21) { real_one ==> real_zero }.
% 0.71/1.16 (889) {G4,W0,D0,L0,V0,M0} S(888);r(15) { }.
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 % SZS output end Refutation
% 0.71/1.16 found a proof!
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Unprocessed initial clauses:
% 0.71/1.16
% 0.71/1.16 (891) {G0,W9,D2,L3,V2,M3} { ! int_leq( X, Y ), int_less( X, Y ), X = Y }.
% 0.71/1.16 (892) {G0,W6,D2,L2,V2,M2} { ! int_less( X, Y ), int_leq( X, Y ) }.
% 0.71/1.16 (893) {G0,W6,D2,L2,V2,M2} { ! X = Y, int_leq( X, Y ) }.
% 0.71/1.16 (894) {G0,W9,D2,L3,V3,M3} { ! int_less( X, Z ), ! int_less( Z, Y ),
% 0.71/1.16 int_less( X, Y ) }.
% 0.71/1.16 (895) {G0,W6,D2,L2,V2,M2} { ! int_less( X, Y ), ! X = Y }.
% 0.71/1.16 (896) {G0,W6,D2,L2,V2,M2} { int_less( X, Y ), int_leq( Y, X ) }.
% 0.71/1.16 (897) {G0,W3,D2,L1,V0,M1} { int_less( int_zero, int_one ) }.
% 0.71/1.16 (898) {G0,W7,D3,L1,V2,M1} { plus( X, Y ) = plus( Y, X ) }.
% 0.71/1.16 (899) {G0,W5,D3,L1,V1,M1} { plus( X, int_zero ) = X }.
% 0.71/1.16 (900) {G0,W13,D3,L3,V4,M3} { ! int_less( X, Y ), ! int_leq( Z, T ),
% 0.71/1.16 int_leq( plus( X, Z ), plus( Y, T ) ) }.
% 0.71/1.16 (901) {G0,W8,D3,L2,V4,M2} { ! int_less( X, Y ), int_less( int_zero, skol1
% 0.71/1.16 ( Z, T ) ) }.
% 0.71/1.16 (902) {G0,W10,D4,L2,V2,M2} { ! int_less( X, Y ), plus( X, skol1( X, Y ) )
% 0.71/1.16 = Y }.
% 0.71/1.16 (903) {G0,W11,D3,L3,V3,M3} { ! plus( X, Z ) = Y, ! int_less( int_zero, Z )
% 0.71/1.16 , int_less( X, Y ) }.
% 0.71/1.16 (904) {G0,W6,D2,L2,V1,M2} { ! int_less( int_zero, X ), int_leq( int_one, X
% 0.71/1.16 ) }.
% 0.71/1.16 (905) {G0,W6,D2,L2,V1,M2} { ! int_leq( int_one, X ), int_less( int_zero, X
% 0.71/1.16 ) }.
% 0.71/1.16 (906) {G0,W3,D2,L1,V0,M1} { ! real_zero = real_one }.
% 0.71/1.16 (907) {G0,W33,D4,L9,V4,M9} { ! int_leq( int_one, X ), ! int_leq( X, n ), !
% 0.71/1.16 int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_less( int_zero, Z ), ! X
% 0.71/1.16 = plus( Y, Z ), ! int_leq( int_one, T ), ! int_leq( T, Y ), a( plus( T,
% 0.71/1.16 Z ), T ) = real_zero }.
% 0.71/1.16 (908) {G0,W23,D3,L7,V3,M7} { ! int_leq( int_one, X ), ! int_leq( X, n ), !
% 0.71/1.16 int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_leq( int_one, Z ), !
% 0.71/1.16 int_leq( Z, Y ), a( Z, Z ) = real_one }.
% 0.71/1.16 (909) {G0,W33,D4,L9,V4,M9} { ! int_leq( int_one, X ), ! int_leq( X, n ), !
% 0.71/1.16 int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_less( int_zero, Z ), ! Y
% 0.71/1.16 = plus( X, Z ), ! int_leq( int_one, T ), ! int_leq( T, X ), a( T, plus(
% 0.71/1.16 T, Z ) ) = real_zero }.
% 0.71/1.16 (910) {G0,W3,D2,L1,V0,M1} { int_leq( int_one, skol3 ) }.
% 0.71/1.16 (911) {G0,W3,D2,L1,V0,M1} { int_leq( skol3, skol2 ) }.
% 0.71/1.16 (912) {G0,W3,D2,L1,V0,M1} { int_leq( skol2, n ) }.
% 0.71/1.16 (913) {G0,W3,D2,L1,V0,M1} { skol2 = skol3 }.
% 0.71/1.16 (914) {G0,W5,D3,L1,V0,M1} { a( skol2, skol3 ) = real_zero }.
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Total Proof:
% 0.71/1.16
% 0.71/1.16 subsumption: (2) {G0,W6,D2,L2,V2,M2} I { ! X = Y, int_leq( X, Y ) }.
% 0.71/1.16 parent0: (893) {G0,W6,D2,L2,V2,M2} { ! X = Y, int_leq( X, Y ) }.
% 0.71/1.16 substitution0:
% 0.71/1.16 X := X
% 0.71/1.16 Y := Y
% 0.71/1.16 end
% 0.71/1.16 permutation0:
% 0.71/1.16 0 ==> 0
% 0.71/1.16 1 ==> 1
% 0.71/1.16 end
% 0.71/1.16
% 0.71/1.16 eqswap: (924) {G0,W3,D2,L1,V0,M1} { ! real_one = real_zero }.
% 0.71/1.16 parent0[0]: (906) {G0,W3,D2,L1,V0,M1} { ! real_zero = real_one }.
% 0.71/1.16 substitution0:
% 0.71/1.16 end
% 0.71/1.16
% 0.71/1.16 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { ! real_one ==> real_zero }.
% 0.71/1.16 parent0: (924) {G0,W3,D2,L1,V0,M1} { ! real_one = real_zero }.
% 0.71/1.16 substitution0:
% 0.71/1.16 end
% 0.71/1.16 permutation0:
% 0.71/1.16 0 ==> 0
% 0.71/1.16 end
% 0.71/1.16
% 0.71/1.16 *** allocated 22500 integers for termspace/termends
% 0.71/1.16 subsumption: (17) {G0,W23,D3,L7,V3,M7} I { ! int_leq( int_one, X ), !
% 0.71/1.16 int_leq( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_leq(
% 0.71/1.16 int_one, Z ), ! int_leq( Z, Y ), a( Z, Z ) ==> real_one }.
% 0.71/1.16 parent0: (908) {G0,W23,D3,L7,V3,M7} { ! int_leq( int_one, X ), ! int_leq(
% 0.71/1.16 X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_leq( int_one, Z
% 0.73/1.18 ), ! int_leq( Z, Y ), a( Z, Z ) = real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := Y
% 0.73/1.18 Z := Z
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 1 ==> 1
% 0.73/1.18 2 ==> 2
% 0.73/1.18 3 ==> 3
% 0.73/1.18 4 ==> 4
% 0.73/1.18 5 ==> 5
% 0.73/1.18 6 ==> 6
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 *** allocated 75937 integers for clauses
% 0.73/1.18 *** allocated 33750 integers for termspace/termends
% 0.73/1.18 subsumption: (19) {G0,W3,D2,L1,V0,M1} I { int_leq( int_one, skol3 ) }.
% 0.73/1.18 parent0: (910) {G0,W3,D2,L1,V0,M1} { int_leq( int_one, skol3 ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 *** allocated 50625 integers for termspace/termends
% 0.73/1.18 subsumption: (21) {G0,W3,D2,L1,V0,M1} I { int_leq( skol2, n ) }.
% 0.73/1.18 parent0: (912) {G0,W3,D2,L1,V0,M1} { int_leq( skol2, n ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 eqswap: (1878) {G0,W3,D2,L1,V0,M1} { skol3 = skol2 }.
% 0.73/1.18 parent0[0]: (913) {G0,W3,D2,L1,V0,M1} { skol2 = skol3 }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (22) {G0,W3,D2,L1,V0,M1} I { skol3 ==> skol2 }.
% 0.73/1.18 parent0: (1878) {G0,W3,D2,L1,V0,M1} { skol3 = skol2 }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 *** allocated 75937 integers for termspace/termends
% 0.73/1.18 *** allocated 113905 integers for clauses
% 0.73/1.18 paramod: (2178) {G1,W5,D3,L1,V0,M1} { a( skol2, skol2 ) = real_zero }.
% 0.73/1.18 parent0[0]: (22) {G0,W3,D2,L1,V0,M1} I { skol3 ==> skol2 }.
% 0.73/1.18 parent1[0; 3]: (914) {G0,W5,D3,L1,V0,M1} { a( skol2, skol3 ) = real_zero
% 0.73/1.18 }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (23) {G1,W5,D3,L1,V0,M1} I;d(22) { a( skol2, skol2 ) ==>
% 0.73/1.18 real_zero }.
% 0.73/1.18 parent0: (2178) {G1,W5,D3,L1,V0,M1} { a( skol2, skol2 ) = real_zero }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 eqswap: (2180) {G0,W6,D2,L2,V2,M2} { ! Y = X, int_leq( X, Y ) }.
% 0.73/1.18 parent0[0]: (2) {G0,W6,D2,L2,V2,M2} I { ! X = Y, int_leq( X, Y ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := Y
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 eqrefl: (2181) {G0,W3,D2,L1,V1,M1} { int_leq( X, X ) }.
% 0.73/1.18 parent0[0]: (2180) {G0,W6,D2,L2,V2,M2} { ! Y = X, int_leq( X, Y ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := X
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (24) {G1,W3,D2,L1,V1,M1} Q(2) { int_leq( X, X ) }.
% 0.73/1.18 parent0: (2181) {G0,W3,D2,L1,V1,M1} { int_leq( X, X ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 factor: (2192) {G0,W20,D3,L6,V2,M6} { ! int_leq( int_one, X ), ! int_leq(
% 0.73/1.18 X, n ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, X ), a
% 0.73/1.18 ( Y, Y ) ==> real_one }.
% 0.73/1.18 parent0[0, 2]: (17) {G0,W23,D3,L7,V3,M7} I { ! int_leq( int_one, X ), !
% 0.73/1.18 int_leq( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, n ), ! int_leq(
% 0.73/1.18 int_one, Z ), ! int_leq( Z, Y ), a( Z, Z ) ==> real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := X
% 0.73/1.18 Z := Y
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 factor: (2195) {G0,W17,D3,L5,V2,M5} { ! int_leq( int_one, X ), ! int_leq(
% 0.73/1.18 X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, X ), a( Y, Y ) ==>
% 0.73/1.18 real_one }.
% 0.73/1.18 parent0[1, 2]: (2192) {G0,W20,D3,L6,V2,M6} { ! int_leq( int_one, X ), !
% 0.73/1.18 int_leq( X, n ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y
% 0.73/1.18 , X ), a( Y, Y ) ==> real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := Y
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (30) {G1,W17,D3,L5,V2,M5} F(17);f { ! int_leq( int_one, X ), !
% 0.73/1.18 int_leq( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, X ), a( Y, Y )
% 0.73/1.18 ==> real_one }.
% 0.73/1.18 parent0: (2195) {G0,W17,D3,L5,V2,M5} { ! int_leq( int_one, X ), ! int_leq
% 0.73/1.18 ( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, X ), a( Y, Y ) ==>
% 0.73/1.18 real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := Y
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 1 ==> 1
% 0.73/1.18 2 ==> 2
% 0.73/1.18 3 ==> 3
% 0.73/1.18 4 ==> 4
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 factor: (2207) {G1,W14,D3,L4,V1,M4} { ! int_leq( int_one, X ), ! int_leq(
% 0.73/1.18 X, n ), ! int_leq( X, X ), a( X, X ) ==> real_one }.
% 0.73/1.18 parent0[0, 2]: (30) {G1,W17,D3,L5,V2,M5} F(17);f { ! int_leq( int_one, X )
% 0.73/1.18 , ! int_leq( X, n ), ! int_leq( int_one, Y ), ! int_leq( Y, X ), a( Y, Y
% 0.73/1.18 ) ==> real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 Y := X
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 resolution: (2214) {G2,W11,D3,L3,V1,M3} { ! int_leq( int_one, X ), !
% 0.73/1.18 int_leq( X, n ), a( X, X ) ==> real_one }.
% 0.73/1.18 parent0[2]: (2207) {G1,W14,D3,L4,V1,M4} { ! int_leq( int_one, X ), !
% 0.73/1.18 int_leq( X, n ), ! int_leq( X, X ), a( X, X ) ==> real_one }.
% 0.73/1.18 parent1[0]: (24) {G1,W3,D2,L1,V1,M1} Q(2) { int_leq( X, X ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 X := X
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (35) {G2,W11,D3,L3,V1,M3} F(30);r(24) { ! int_leq( int_one, X
% 0.73/1.18 ), ! int_leq( X, n ), a( X, X ) ==> real_one }.
% 0.73/1.18 parent0: (2214) {G2,W11,D3,L3,V1,M3} { ! int_leq( int_one, X ), ! int_leq
% 0.73/1.18 ( X, n ), a( X, X ) ==> real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 1 ==> 1
% 0.73/1.18 2 ==> 2
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 paramod: (2217) {G1,W3,D2,L1,V0,M1} { int_leq( int_one, skol2 ) }.
% 0.73/1.18 parent0[0]: (22) {G0,W3,D2,L1,V0,M1} I { skol3 ==> skol2 }.
% 0.73/1.18 parent1[0; 2]: (19) {G0,W3,D2,L1,V0,M1} I { int_leq( int_one, skol3 ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (44) {G1,W3,D2,L1,V0,M1} S(19);d(22) { int_leq( int_one, skol2
% 0.73/1.18 ) }.
% 0.73/1.18 parent0: (2217) {G1,W3,D2,L1,V0,M1} { int_leq( int_one, skol2 ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 eqswap: (2218) {G2,W11,D3,L3,V1,M3} { real_one ==> a( X, X ), ! int_leq(
% 0.73/1.18 int_one, X ), ! int_leq( X, n ) }.
% 0.73/1.18 parent0[2]: (35) {G2,W11,D3,L3,V1,M3} F(30);r(24) { ! int_leq( int_one, X )
% 0.73/1.18 , ! int_leq( X, n ), a( X, X ) ==> real_one }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := X
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 resolution: (2220) {G2,W8,D3,L2,V0,M2} { real_one ==> a( skol2, skol2 ), !
% 0.73/1.18 int_leq( skol2, n ) }.
% 0.73/1.18 parent0[1]: (2218) {G2,W11,D3,L3,V1,M3} { real_one ==> a( X, X ), !
% 0.73/1.18 int_leq( int_one, X ), ! int_leq( X, n ) }.
% 0.73/1.18 parent1[0]: (44) {G1,W3,D2,L1,V0,M1} S(19);d(22) { int_leq( int_one, skol2
% 0.73/1.18 ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 X := skol2
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 paramod: (2221) {G2,W6,D2,L2,V0,M2} { real_one ==> real_zero, ! int_leq(
% 0.73/1.18 skol2, n ) }.
% 0.73/1.18 parent0[0]: (23) {G1,W5,D3,L1,V0,M1} I;d(22) { a( skol2, skol2 ) ==>
% 0.73/1.18 real_zero }.
% 0.73/1.18 parent1[0; 2]: (2220) {G2,W8,D3,L2,V0,M2} { real_one ==> a( skol2, skol2 )
% 0.73/1.18 , ! int_leq( skol2, n ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 resolution: (2222) {G1,W3,D2,L1,V0,M1} { real_one ==> real_zero }.
% 0.73/1.18 parent0[1]: (2221) {G2,W6,D2,L2,V0,M2} { real_one ==> real_zero, ! int_leq
% 0.73/1.18 ( skol2, n ) }.
% 0.73/1.18 parent1[0]: (21) {G0,W3,D2,L1,V0,M1} I { int_leq( skol2, n ) }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (888) {G3,W3,D2,L1,V0,M1} R(35,44);d(23);r(21) { real_one ==>
% 0.73/1.18 real_zero }.
% 0.73/1.18 parent0: (2222) {G1,W3,D2,L1,V0,M1} { real_one ==> real_zero }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 0 ==> 0
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 resolution: (2226) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.18 parent0[0]: (15) {G0,W3,D2,L1,V0,M1} I { ! real_one ==> real_zero }.
% 0.73/1.18 parent1[0]: (888) {G3,W3,D2,L1,V0,M1} R(35,44);d(23);r(21) { real_one ==>
% 0.73/1.18 real_zero }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 substitution1:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 subsumption: (889) {G4,W0,D0,L0,V0,M0} S(888);r(15) { }.
% 0.73/1.18 parent0: (2226) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.18 substitution0:
% 0.73/1.18 end
% 0.73/1.18 permutation0:
% 0.73/1.18 end
% 0.73/1.18
% 0.73/1.18 Proof check complete!
% 0.73/1.18
% 0.73/1.18 Memory use:
% 0.73/1.18
% 0.73/1.18 space for terms: 13568
% 0.73/1.18 space for clauses: 44252
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 clauses generated: 3466
% 0.73/1.18 clauses kept: 890
% 0.73/1.18 clauses selected: 109
% 0.73/1.18 clauses deleted: 8
% 0.73/1.18 clauses inuse deleted: 0
% 0.73/1.18
% 0.73/1.18 subsentry: 32883
% 0.73/1.18 literals s-matched: 9925
% 0.73/1.18 literals matched: 8518
% 0.73/1.18 full subsumption: 4107
% 0.73/1.18
% 0.73/1.18 checksum: 799637742
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 Bliksem ended
%------------------------------------------------------------------------------