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