TSTP Solution File: SWV387+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV387+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 16:24:41 EDT 2022
% Result : Theorem 0.72s 1.17s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV387+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Tue Jun 14 15:59:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.08 *** allocated 10000 integers for termspace/termends
% 0.41/1.08 *** allocated 10000 integers for clauses
% 0.41/1.08 *** allocated 10000 integers for justifications
% 0.41/1.08 Bliksem 1.12
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Automatic Strategy Selection
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Clauses:
% 0.41/1.08
% 0.41/1.08 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.41/1.08 { less_than( X, Y ), less_than( Y, X ) }.
% 0.41/1.08 { less_than( X, X ) }.
% 0.41/1.08 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.41/1.08 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.41/1.08 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.41/1.08 { less_than( bottom, X ) }.
% 0.41/1.08 { ! isnonempty_slb( create_slb ) }.
% 0.41/1.08 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.41/1.08 { ! contains_slb( create_slb, X ) }.
% 0.41/1.08 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.41/1.08 , Y = Z }.
% 0.41/1.08 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.41/1.08 }.
% 0.41/1.08 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.41/1.08 { ! pair_in_list( create_slb, X, Y ) }.
% 0.41/1.08 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.41/1.08 , U ), alpha1( Y, Z, T, U ) }.
% 0.41/1.08 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.41/1.08 , U ) }.
% 0.41/1.08 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.41/1.08 ) }.
% 0.41/1.08 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.41/1.08 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.41/1.08 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.41/1.08 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.41/1.08 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.41/1.08 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.41/1.08 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.41/1.08 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.41/1.08 , Z ) = lookup_slb( X, Z ) }.
% 0.41/1.08 { update_slb( create_slb, X ) = create_slb }.
% 0.41/1.08 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.41/1.08 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.41/1.08 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.41/1.08 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.41/1.08 { succ_cpq( X, X ) }.
% 0.41/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.41/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.41/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.41/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.41/1.08 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.41/1.08 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.41/1.08 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.41/1.08 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.41/1.08 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.41/1.08 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.41/1.08 ( X, Y ) ), U ) ) }.
% 0.41/1.08 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.41/1.08 pair( X, Y ) ), U ) ) }.
% 0.41/1.08 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.41/1.08 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.41/1.08 { ! ok( triple( X, Y, bad ) ) }.
% 0.41/1.08 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.41/1.08 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.41/1.08 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.41/1.08 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.41/1.08 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.41/1.08 bad ) }.
% 0.41/1.08 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.41/1.08 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.41/1.08 , T ) }.
% 0.41/1.08 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.41/1.08 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.41/1.08 remove_slb( X, Y ), bad ) }.
% 0.41/1.08 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.41/1.08 bad ) }.
% 0.41/1.08 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.41/1.08 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.41/1.08 , bad ) }.
% 0.41/1.08 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.41/1.08 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.41/1.08 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.41/1.08 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.41/1.08 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.41/1.08 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 0.72/1.16 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 0.72/1.16 findmin_pqp_res( X ) ), Z ) }.
% 0.72/1.16 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 0.72/1.16 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 0.72/1.16 ) }.
% 0.72/1.16 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 0.72/1.16 findmin_cpq_res( X ) ) }.
% 0.72/1.16 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 0.72/1.16 { ! check_cpq( remove_cpq( triple( X, Y, Z ), T ) ), ! ok( remove_cpq(
% 0.72/1.16 triple( X, Y, Z ), T ) ), check_cpq( triple( X, Y, Z ) ) }.
% 0.72/1.16 { ! check_cpq( triple( skol1, skol2, skol3 ) ) }.
% 0.72/1.16 { check_cpq( remove_cpq( triple( skol1, skol2, skol3 ), skol4 ) ) }.
% 0.72/1.16 { ok( remove_cpq( triple( skol1, skol2, skol3 ), skol4 ) ) }.
% 0.72/1.16
% 0.72/1.16 percentage equality = 0.280702, percentage horn = 0.793103
% 0.72/1.16 This is a problem with some equality
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 Options Used:
% 0.72/1.16
% 0.72/1.16 useres = 1
% 0.72/1.16 useparamod = 1
% 0.72/1.16 useeqrefl = 1
% 0.72/1.16 useeqfact = 1
% 0.72/1.16 usefactor = 1
% 0.72/1.16 usesimpsplitting = 0
% 0.72/1.16 usesimpdemod = 5
% 0.72/1.16 usesimpres = 3
% 0.72/1.16
% 0.72/1.16 resimpinuse = 1000
% 0.72/1.16 resimpclauses = 20000
% 0.72/1.16 substype = eqrewr
% 0.72/1.16 backwardsubs = 1
% 0.72/1.16 selectoldest = 5
% 0.72/1.16
% 0.72/1.16 litorderings [0] = split
% 0.72/1.16 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.16
% 0.72/1.16 termordering = kbo
% 0.72/1.16
% 0.72/1.16 litapriori = 0
% 0.72/1.16 termapriori = 1
% 0.72/1.16 litaposteriori = 0
% 0.72/1.16 termaposteriori = 0
% 0.72/1.16 demodaposteriori = 0
% 0.72/1.16 ordereqreflfact = 0
% 0.72/1.16
% 0.72/1.16 litselect = negord
% 0.72/1.16
% 0.72/1.16 maxweight = 15
% 0.72/1.16 maxdepth = 30000
% 0.72/1.16 maxlength = 115
% 0.72/1.16 maxnrvars = 195
% 0.72/1.16 excuselevel = 1
% 0.72/1.16 increasemaxweight = 1
% 0.72/1.16
% 0.72/1.16 maxselected = 10000000
% 0.72/1.16 maxnrclauses = 10000000
% 0.72/1.16
% 0.72/1.16 showgenerated = 0
% 0.72/1.16 showkept = 0
% 0.72/1.16 showselected = 0
% 0.72/1.16 showdeleted = 0
% 0.72/1.16 showresimp = 1
% 0.72/1.16 showstatus = 2000
% 0.72/1.16
% 0.72/1.16 prologoutput = 0
% 0.72/1.16 nrgoals = 5000000
% 0.72/1.16 totalproof = 1
% 0.72/1.16
% 0.72/1.16 Symbols occurring in the translation:
% 0.72/1.16
% 0.72/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.16 . [1, 2] (w:1, o:31, a:1, s:1, b:0),
% 0.72/1.16 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 0.72/1.16 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.72/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.16 less_than [38, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.72/1.16 strictly_less_than [39, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.72/1.16 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.72/1.16 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.72/1.16 isnonempty_slb [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.72/1.16 pair [43, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.72/1.16 insert_slb [44, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.72/1.16 contains_slb [45, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.72/1.16 pair_in_list [47, 3] (w:1, o:69, a:1, s:1, b:0),
% 0.72/1.16 remove_slb [49, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.72/1.16 lookup_slb [50, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.72/1.16 update_slb [51, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.72/1.16 succ_cpq [52, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.72/1.16 insert_cpq [53, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.72/1.16 remove_cpq [54, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.72/1.16 findmin_cpq_eff [55, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.72/1.16 removemin_cpq_eff [56, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.72/1.17 triple [57, 3] (w:1, o:70, a:1, s:1, b:0),
% 0.72/1.17 check_cpq [58, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.72/1.17 contains_cpq [59, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.72/1.17 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.72/1.17 ok [61, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.72/1.17 insert_pqp [62, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.72/1.17 remove_pqp [63, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.72/1.17 findmin_pqp_res [64, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.72/1.17 findmin_cpq_res [65, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.72/1.17 removemin_cpq_res [66, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.72/1.17 alpha1 [67, 4] (w:1, o:71, a:1, s:1, b:1),
% 0.72/1.17 skol1 [68, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.72/1.17 skol2 [69, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.72/1.17 skol3 [70, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.72/1.17 skol4 [71, 0] (w:1, o:17, a:1, s:1, b:1).
% 0.72/1.17
% 0.72/1.17
% 0.72/1.17 Starting Search:
% 0.72/1.17
% 0.72/1.17 *** allocated 15000 integers for clauses
% 0.72/1.17 *** allocated 22500 integers for clauses
% 0.72/1.17 *** allocated 33750 integers for clauses
% 0.72/1.17 *** allocated 15000 integers for termspace/termends
% 0.72/1.17 *** allocated 50625 integers for clauses
% 0.72/1.17 *** allocated 22500 integers for termspace/termends
% 0.72/1.17 *** allocated 75937 integers for clauses
% 0.72/1.17 Resimplifying inuse:
% 0.72/1.17 Done
% 0.72/1.17
% 0.72/1.17 *** allocated 33750 integers for termspace/termends
% 0.72/1.17 *** allocated 113905 integers for clauses
% 0.72/1.17 *** allocated 50625 integers for termspace/termends
% 0.72/1.17 *** allocated 170857 integers for clauses
% 0.72/1.17
% 0.72/1.17 Intermediate Status:
% 0.72/1.17 Generated: 4148
% 0.72/1.17 Kept: 2253
% 0.72/1.17 Inuse: 138
% 0.72/1.17 Deleted: 4
% 0.72/1.17 Deletedinuse: 1
% 0.72/1.17
% 0.72/1.17 Resimplifying inuse:
% 0.72/1.17 Done
% 0.72/1.17
% 0.72/1.17 *** allocated 75937 integers for termspace/termends
% 0.72/1.17 *** allocated 256285 integers for clauses
% 0.72/1.17 Resimplifying inuse:
% 0.72/1.17 Done
% 0.72/1.17
% 0.72/1.17 *** allocated 113905 integers for termspace/termends
% 0.72/1.17
% 0.72/1.17 Bliksems!, er is een bewijs:
% 0.72/1.17 % SZS status Theorem
% 0.72/1.17 % SZS output start Refutation
% 0.72/1.17
% 0.72/1.17 (54) {G0,W19,D4,L3,V4,M3} I { ! check_cpq( remove_cpq( triple( X, Y, Z ), T
% 0.72/1.17 ) ), ! ok( remove_cpq( triple( X, Y, Z ), T ) ), check_cpq( triple( X, Y
% 0.72/1.17 , Z ) ) }.
% 0.72/1.17 (55) {G0,W5,D3,L1,V0,M1} I { ! check_cpq( triple( skol1, skol2, skol3 ) )
% 0.72/1.17 }.
% 0.72/1.17 (56) {G0,W7,D4,L1,V0,M1} I { check_cpq( remove_cpq( triple( skol1, skol2,
% 0.72/1.17 skol3 ), skol4 ) ) }.
% 0.72/1.17 (57) {G0,W7,D4,L1,V0,M1} I { ok( remove_cpq( triple( skol1, skol2, skol3 )
% 0.72/1.17 , skol4 ) ) }.
% 0.72/1.17 (4040) {G1,W5,D3,L1,V0,M1} R(54,56);r(57) { check_cpq( triple( skol1, skol2
% 0.72/1.17 , skol3 ) ) }.
% 0.72/1.17 (4073) {G2,W0,D0,L0,V0,M0} S(4040);r(55) { }.
% 0.72/1.17
% 0.72/1.17
% 0.72/1.17 % SZS output end Refutation
% 0.72/1.17 found a proof!
% 0.72/1.17
% 0.72/1.17
% 0.72/1.17 Unprocessed initial clauses:
% 0.72/1.17
% 0.72/1.17 (4075) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.72/1.17 less_than( X, Y ) }.
% 0.72/1.17 (4076) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.72/1.17 (4077) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.72/1.17 (4078) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.72/1.17 ) }.
% 0.72/1.17 (4079) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.72/1.17 , X ) }.
% 0.72/1.17 (4080) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.72/1.17 strictly_less_than( X, Y ) }.
% 0.72/1.17 (4081) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.72/1.17 (4082) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.72/1.17 (4083) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.72/1.17 ) }.
% 0.72/1.17 (4084) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.72/1.17 (4085) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.72/1.17 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.72/1.17 (4086) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.72/1.17 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.72/1.17 (4087) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.72/1.17 Y, T ) ), Z ) }.
% 0.72/1.17 (4088) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.72/1.17 (4089) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.72/1.17 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.72/1.17 (4090) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.72/1.17 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.72/1.17 (4091) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.72/1.17 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.72/1.17 (4092) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.72/1.17 (4093) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.72/1.17 (4094) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.72/1.17 (4095) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.72/1.17 ) = X }.
% 0.72/1.17 (4096) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.72/1.17 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.72/1.17 ( Y, T ) ) }.
% 0.72/1.17 (4097) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.72/1.17 ) = Z }.
% 0.72/1.17 (4098) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.72/1.17 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.72/1.17 (4099) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.72/1.17 (4100) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.72/1.17 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.72/1.17 ( T, X ) ) }.
% 0.72/1.17 (4101) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.72/1.17 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.72/1.17 }.
% 0.72/1.17 (4102) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 0.72/1.17 (4103) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq(
% 0.72/1.17 Y, Z ) ) }.
% 0.72/1.17 (4104) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq(
% 0.72/1.17 Y, Z ) ) }.
% 0.72/1.17 (4105) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.72/1.17 findmin_cpq_eff( Y ) ) }.
% 0.72/1.17 (4106) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.72/1.17 removemin_cpq_eff( Y ) ) }.
% 0.72/1.17 (4107) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.72/1.17 (4108) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.72/1.17 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 0.72/1.17 }.
% 0.72/1.17 (4109) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.72/1.17 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 0.72/1.17 }.
% 0.72/1.17 (4110) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 0.72/1.17 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.72/1.17 (4111) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 0.72/1.17 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.72/1.17 (4112) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.72/1.17 contains_slb( Y, T ) }.
% 0.72/1.17 (4113) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 0.72/1.17 ( X, Y, Z ), T ) }.
% 0.72/1.17 (4114) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.72/1.17 (4115) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.72/1.17 (4116) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 0.72/1.17 (4117) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 0.72/1.17 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.72/1.17 (4118) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 0.72/1.17 , X, T ), Y ) = triple( Z, X, bad ) }.
% 0.72/1.17 (4119) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 0.72/1.17 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.72/1.17 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 0.72/1.17 (4120) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! strictly_less_than
% 0.72/1.17 ( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.72/1.17 remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 0.72/1.17 (4121) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 0.72/1.17 ) = triple( X, create_slb, bad ) }.
% 0.72/1.17 (4122) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 0.72/1.17 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.72/1.17 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.72/1.17 (4123) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.72/1.17 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 0.72/1.17 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 0.72/1.17 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.72/1.17 (4124) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.72/1.17 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 0.72/1.17 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 0.72/1.17 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 0.72/1.17 (4125) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y ) )
% 0.72/1.17 = bottom }.
% 0.72/1.17 (4126) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y,
% 0.72/1.17 X, Z ) ) = findmin_pqp_res( Y ) }.
% 0.72/1.17 (4127) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 0.72/1.17 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 0.72/1.17 (4128) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X )
% 0.72/1.17 }.
% 0.72/1.17 (4129) {G0,W19,D4,L3,V4,M3} { ! check_cpq( remove_cpq( triple( X, Y, Z ),
% 0.72/1.17 T ) ), ! ok( remove_cpq( triple( X, Y, Z ), T ) ), check_cpq( triple( X,
% 0.72/1.17 Y, Z ) ) }.
% 0.72/1.17 (4130) {G0,W5,D3,L1,V0,M1} { ! check_cpq( triple( skol1, skol2, skol3 ) )
% 0.72/1.17 }.
% 0.72/1.17 (4131) {G0,W7,D4,L1,V0,M1} { check_cpq( remove_cpq( triple( skol1, skol2,
% 0.72/1.17 skol3 ), skol4 ) ) }.
% 0.72/1.17 (4132) {G0,W7,D4,L1,V0,M1} { ok( remove_cpq( triple( skol1, skol2, skol3 )
% 0.72/1.17 , skol4 ) ) }.
% 0.72/1.17
% 0.72/1.17
% 0.72/1.17 Total Proof:
% 0.72/1.17
% 0.72/1.17 subsumption: (54) {G0,W19,D4,L3,V4,M3} I { ! check_cpq( remove_cpq( triple
% 0.72/1.17 ( X, Y, Z ), T ) ), ! ok( remove_cpq( triple( X, Y, Z ), T ) ), check_cpq
% 0.72/1.17 ( triple( X, Y, Z ) ) }.
% 0.72/1.17 parent0: (4129) {G0,W19,D4,L3,V4,M3} { ! check_cpq( remove_cpq( triple( X
% 0.72/1.17 , Y, Z ), T ) ), ! ok( remove_cpq( triple( X, Y, Z ), T ) ), check_cpq(
% 0.72/1.17 triple( X, Y, Z ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 X := X
% 0.72/1.17 Y := Y
% 0.72/1.17 Z := Z
% 0.72/1.17 T := T
% 0.72/1.17 end
% 0.72/1.17 permutation0:
% 0.72/1.17 0 ==> 0
% 0.72/1.17 1 ==> 1
% 0.72/1.17 2 ==> 2
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 subsumption: (55) {G0,W5,D3,L1,V0,M1} I { ! check_cpq( triple( skol1, skol2
% 0.72/1.17 , skol3 ) ) }.
% 0.72/1.17 parent0: (4130) {G0,W5,D3,L1,V0,M1} { ! check_cpq( triple( skol1, skol2,
% 0.72/1.17 skol3 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 permutation0:
% 0.72/1.17 0 ==> 0
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 subsumption: (56) {G0,W7,D4,L1,V0,M1} I { check_cpq( remove_cpq( triple(
% 0.72/1.17 skol1, skol2, skol3 ), skol4 ) ) }.
% 0.72/1.17 parent0: (4131) {G0,W7,D4,L1,V0,M1} { check_cpq( remove_cpq( triple( skol1
% 0.72/1.17 , skol2, skol3 ), skol4 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 permutation0:
% 0.72/1.17 0 ==> 0
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 subsumption: (57) {G0,W7,D4,L1,V0,M1} I { ok( remove_cpq( triple( skol1,
% 0.72/1.17 skol2, skol3 ), skol4 ) ) }.
% 0.72/1.17 parent0: (4132) {G0,W7,D4,L1,V0,M1} { ok( remove_cpq( triple( skol1, skol2
% 0.72/1.17 , skol3 ), skol4 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 permutation0:
% 0.72/1.17 0 ==> 0
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 resolution: (4313) {G1,W12,D4,L2,V0,M2} { ! ok( remove_cpq( triple( skol1
% 0.72/1.17 , skol2, skol3 ), skol4 ) ), check_cpq( triple( skol1, skol2, skol3 ) )
% 0.72/1.17 }.
% 0.72/1.17 parent0[0]: (54) {G0,W19,D4,L3,V4,M3} I { ! check_cpq( remove_cpq( triple(
% 0.72/1.17 X, Y, Z ), T ) ), ! ok( remove_cpq( triple( X, Y, Z ), T ) ), check_cpq(
% 0.72/1.17 triple( X, Y, Z ) ) }.
% 0.72/1.17 parent1[0]: (56) {G0,W7,D4,L1,V0,M1} I { check_cpq( remove_cpq( triple(
% 0.72/1.17 skol1, skol2, skol3 ), skol4 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 X := skol1
% 0.72/1.17 Y := skol2
% 0.72/1.17 Z := skol3
% 0.72/1.17 T := skol4
% 0.72/1.17 end
% 0.72/1.17 substitution1:
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 resolution: (4314) {G1,W5,D3,L1,V0,M1} { check_cpq( triple( skol1, skol2,
% 0.72/1.17 skol3 ) ) }.
% 0.72/1.17 parent0[0]: (4313) {G1,W12,D4,L2,V0,M2} { ! ok( remove_cpq( triple( skol1
% 0.72/1.17 , skol2, skol3 ), skol4 ) ), check_cpq( triple( skol1, skol2, skol3 ) )
% 0.72/1.17 }.
% 0.72/1.17 parent1[0]: (57) {G0,W7,D4,L1,V0,M1} I { ok( remove_cpq( triple( skol1,
% 0.72/1.17 skol2, skol3 ), skol4 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 substitution1:
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 subsumption: (4040) {G1,W5,D3,L1,V0,M1} R(54,56);r(57) { check_cpq( triple
% 0.72/1.17 ( skol1, skol2, skol3 ) ) }.
% 0.72/1.17 parent0: (4314) {G1,W5,D3,L1,V0,M1} { check_cpq( triple( skol1, skol2,
% 0.72/1.17 skol3 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 permutation0:
% 0.72/1.17 0 ==> 0
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 resolution: (4315) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.17 parent0[0]: (55) {G0,W5,D3,L1,V0,M1} I { ! check_cpq( triple( skol1, skol2
% 0.72/1.17 , skol3 ) ) }.
% 0.72/1.17 parent1[0]: (4040) {G1,W5,D3,L1,V0,M1} R(54,56);r(57) { check_cpq( triple(
% 0.72/1.17 skol1, skol2, skol3 ) ) }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 substitution1:
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 subsumption: (4073) {G2,W0,D0,L0,V0,M0} S(4040);r(55) { }.
% 0.72/1.17 parent0: (4315) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.17 substitution0:
% 0.72/1.17 end
% 0.72/1.17 permutation0:
% 0.72/1.17 end
% 0.72/1.17
% 0.72/1.17 Proof check complete!
% 0.72/1.17
% 0.72/1.17 Memory use:
% 0.72/1.17
% 0.72/1.17 space for terms: 84844
% 0.72/1.17 space for clauses: 218088
% 0.72/1.17
% 0.72/1.17
% 0.72/1.17 clauses generated: 9045
% 0.72/1.17 clauses kept: 4074
% 0.72/1.17 clauses selected: 193
% 0.72/1.17 clauses deleted: 6
% 0.72/1.17 clauses inuse deleted: 2
% 0.72/1.17
% 0.72/1.17 subsentry: 9322
% 0.72/1.17 literals s-matched: 7094
% 0.72/1.17 literals matched: 6817
% 0.72/1.17 full subsumption: 2288
% 0.72/1.17
% 0.72/1.17 checksum: 620939351
% 0.72/1.17
% 0.72/1.17
% 0.72/1.17 Bliksem ended
%------------------------------------------------------------------------------