%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.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:43 EDT 2022
% Result : Theorem 0.82s 1.18s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Wed Jun 15 18:48:47 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.17 *** allocated 10000 integers for termspace/termends
% 0.49/1.17 *** allocated 10000 integers for clauses
% 0.49/1.17 *** allocated 10000 integers for justifications
% 0.49/1.17 Bliksem 1.12
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 Automatic Strategy Selection
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 Clauses:
% 0.49/1.17
% 0.49/1.17 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.49/1.17 { less_than( X, Y ), less_than( Y, X ) }.
% 0.49/1.17 { less_than( X, X ) }.
% 0.49/1.17 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.49/1.17 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.49/1.17 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.49/1.17 { less_than( bottom, X ) }.
% 0.49/1.17 { ! isnonempty_slb( create_slb ) }.
% 0.49/1.17 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.49/1.17 { ! contains_slb( create_slb, X ) }.
% 0.49/1.17 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.49/1.17 , Y = Z }.
% 0.49/1.17 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.49/1.17 }.
% 0.49/1.17 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.49/1.17 { ! pair_in_list( create_slb, X, Y ) }.
% 0.49/1.17 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.49/1.17 , U ), alpha1( Y, Z, T, U ) }.
% 0.49/1.17 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.49/1.17 , U ) }.
% 0.49/1.17 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.49/1.17 ) }.
% 0.49/1.17 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.49/1.17 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.49/1.17 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.49/1.17 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.49/1.17 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.49/1.17 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.49/1.17 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.49/1.17 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.49/1.17 , Z ) = lookup_slb( X, Z ) }.
% 0.49/1.17 { update_slb( create_slb, X ) = create_slb }.
% 0.49/1.17 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.49/1.17 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.49/1.17 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.49/1.17 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.49/1.17 { succ_cpq( X, X ) }.
% 0.49/1.17 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.49/1.17 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.49/1.17 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.49/1.17 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.49/1.17 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.49/1.17 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.49/1.17 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.49/1.17 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.49/1.17 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.49/1.17 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.49/1.17 ( X, Y ) ), U ) ) }.
% 0.49/1.17 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.49/1.17 pair( X, Y ) ), U ) ) }.
% 0.49/1.17 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.49/1.17 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.49/1.17 { ! ok( triple( X, Y, bad ) ) }.
% 0.49/1.17 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.49/1.17 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.49/1.17 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.49/1.17 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.49/1.17 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.49/1.17 bad ) }.
% 0.49/1.17 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.49/1.17 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.49/1.17 , T ) }.
% 0.49/1.17 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.49/1.17 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.49/1.17 remove_slb( X, Y ), bad ) }.
% 0.49/1.17 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.49/1.17 bad ) }.
% 0.49/1.17 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.49/1.17 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.49/1.17 , bad ) }.
% 0.49/1.17 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.49/1.17 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.49/1.17 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.49/1.17 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.49/1.17 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.49/1.17 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 0.82/1.18 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 0.82/1.18 findmin_pqp_res( X ) ), Z ) }.
% 0.82/1.18 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 0.82/1.18 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 0.82/1.18 ) }.
% 0.82/1.18 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 0.82/1.18 findmin_cpq_res( X ) ) }.
% 0.82/1.18 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 0.82/1.18 { ok( remove_cpq( triple( skol3, skol1, skol4 ), skol2 ) ) }.
% 0.82/1.18 { ! contains_slb( skol1, skol2 ) }.
% 0.82/1.18
% 0.82/1.18 percentage equality = 0.290909, percentage horn = 0.785714
% 0.82/1.18 This is a problem with some equality
% 0.82/1.18
% 0.82/1.18
% 0.82/1.18
% 0.82/1.18 Options Used:
% 0.82/1.18
% 0.82/1.18 useres = 1
% 0.82/1.18 useparamod = 1
% 0.82/1.18 useeqrefl = 1
% 0.82/1.18 useeqfact = 1
% 0.82/1.18 usefactor = 1
% 0.82/1.18 usesimpsplitting = 0
% 0.82/1.18 usesimpdemod = 5
% 0.82/1.18 usesimpres = 3
% 0.82/1.18
% 0.82/1.18 resimpinuse = 1000
% 0.82/1.18 resimpclauses = 20000
% 0.82/1.18 substype = eqrewr
% 0.82/1.18 backwardsubs = 1
% 0.82/1.18 selectoldest = 5
% 0.82/1.18
% 0.82/1.18 litorderings [0] = split
% 0.82/1.18 litorderings [1] = extend the termordering, first sorting on arguments
% 0.82/1.18
% 0.82/1.18 termordering = kbo
% 0.82/1.18
% 0.82/1.18 litapriori = 0
% 0.82/1.18 termapriori = 1
% 0.82/1.18 litaposteriori = 0
% 0.82/1.18 termaposteriori = 0
% 0.82/1.18 demodaposteriori = 0
% 0.82/1.18 ordereqreflfact = 0
% 0.82/1.18
% 0.82/1.18 litselect = negord
% 0.82/1.18
% 0.82/1.18 maxweight = 15
% 0.82/1.18 maxdepth = 30000
% 0.82/1.18 maxlength = 115
% 0.82/1.18 maxnrvars = 195
% 0.82/1.18 excuselevel = 1
% 0.82/1.18 increasemaxweight = 1
% 0.82/1.18
% 0.82/1.18 maxselected = 10000000
% 0.82/1.18 maxnrclauses = 10000000
% 0.82/1.18
% 0.82/1.18 showgenerated = 0
% 0.82/1.18 showkept = 0
% 0.82/1.18 showselected = 0
% 0.82/1.18 showdeleted = 0
% 0.82/1.18 showresimp = 1
% 0.82/1.18 showstatus = 2000
% 0.82/1.18
% 0.82/1.18 prologoutput = 0
% 0.82/1.18 nrgoals = 5000000
% 0.82/1.18 totalproof = 1
% 0.82/1.18
% 0.82/1.18 Symbols occurring in the translation:
% 0.82/1.18
% 0.82/1.18 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.82/1.18 . [1, 2] (w:1, o:31, a:1, s:1, b:0),
% 0.82/1.18 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 0.82/1.18 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.82/1.18 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.82/1.18 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.82/1.18 less_than [38, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.82/1.18 strictly_less_than [39, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.82/1.18 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.82/1.18 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.82/1.18 isnonempty_slb [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.82/1.18 pair [43, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.82/1.18 insert_slb [44, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.82/1.18 contains_slb [45, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.82/1.18 pair_in_list [47, 3] (w:1, o:69, a:1, s:1, b:0),
% 0.82/1.18 remove_slb [49, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.82/1.18 lookup_slb [50, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.82/1.18 update_slb [51, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.82/1.18 succ_cpq [52, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.82/1.18 insert_cpq [53, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.82/1.18 remove_cpq [54, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.82/1.18 findmin_cpq_eff [55, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.82/1.18 removemin_cpq_eff [56, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.82/1.18 triple [57, 3] (w:1, o:70, a:1, s:1, b:0),
% 0.82/1.18 check_cpq [58, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.82/1.18 contains_cpq [59, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.82/1.18 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.82/1.18 ok [61, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.82/1.18 insert_pqp [62, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.82/1.18 remove_pqp [63, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.82/1.18 findmin_pqp_res [64, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.82/1.18 findmin_cpq_res [65, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.82/1.18 removemin_cpq_res [66, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.82/1.18 alpha1 [67, 4] (w:1, o:71, a:1, s:1, b:1),
% 0.82/1.18 skol1 [68, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.82/1.18 skol2 [69, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.82/1.18 skol3 [70, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.82/1.18 skol4 [71, 0] (w:1, o:17, a:1, s:1, b:1).
% 0.82/1.18
% 0.82/1.18
% 0.82/1.18 Starting Search:
% 0.82/1.18
% 0.82/1.18 *** allocated 15000 integers for clauses
% 0.82/1.18 *** allocated 22500 integers for clauses
% 0.82/1.18 *** allocated 33750 integers for clauses
% 0.82/1.18 *** allocated 50625 integers for clauses
% 0.82/1.18 *** allocated 15000 integers for termspace/termends
% 0.82/1.18 *** allocated 22500 integers for termspace/termends
% 0.82/1.18 *** allocated 75937 integers for clauses
% 0.82/1.18 Resimplifying inuse:
% 0.82/1.18 Done
% 0.82/1.18
% 0.82/1.18 *** allocated 33750 integers for termspace/termends
% 0.82/1.18 *** allocated 113905 integers for clauses
% 0.82/1.18 *** allocated 50625 integers for termspace/termends
% 0.82/1.18 *** allocated 170857 integers for clauses
% 0.82/1.18
% 0.82/1.18 Intermediate Status:
% 0.82/1.18 Generated: 4146
% 0.82/1.18 Kept: 2222
% 0.82/1.18 Inuse: 139
% 0.82/1.18 Deleted: 3
% 0.82/1.18 Deletedinuse: 1
% 0.82/1.18
% 0.82/1.18 Resimplifying inuse:
% 0.82/1.18 Done
% 0.82/1.18
% 0.82/1.18
% 0.82/1.18 Bliksems!, er is een bewijs:
% 0.82/1.18 % SZS status Theorem
% 0.82/1.18 % SZS output start Refutation
% 0.82/1.18
% 0.82/1.18 (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.82/1.18 (43) {G0,W14,D4,L2,V4,M2} I { contains_slb( X, Y ), remove_cpq( triple( Z,
% 0.82/1.18 X, T ), Y ) ==> triple( Z, X, bad ) }.
% 0.82/1.18 (54) {G0,W7,D4,L1,V0,M1} I { ok( remove_cpq( triple( skol3, skol1, skol4 )
% 0.82/1.18 , skol2 ) ) }.
% 0.82/1.18 (55) {G0,W3,D2,L1,V0,M1} I { ! contains_slb( skol1, skol2 ) }.
% 0.82/1.18 (2450) {G1,W3,D2,L1,V0,M1} P(43,54);r(39) { contains_slb( skol1, skol2 )
% 0.82/1.18 }.
% 0.82/1.18 (2453) {G2,W0,D0,L0,V0,M0} S(2450);r(55) { }.
% 0.82/1.18
% 0.82/1.18
% 0.82/1.18 % SZS output end Refutation
% 0.82/1.18 found a proof!
% 0.82/1.18
% 0.82/1.18
% 0.82/1.18 Unprocessed initial clauses:
% 0.82/1.18
% 0.82/1.18 (2455) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.82/1.18 less_than( X, Y ) }.
% 0.82/1.18 (2456) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.82/1.18 (2457) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.82/1.18 (2458) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.82/1.18 ) }.
% 0.82/1.18 (2459) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.82/1.18 , X ) }.
% 0.82/1.18 (2460) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.82/1.18 strictly_less_than( X, Y ) }.
% 0.82/1.18 (2461) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.82/1.18 (2462) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.82/1.18 (2463) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.82/1.18 ) }.
% 0.82/1.18 (2464) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.82/1.18 (2465) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.82/1.18 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.82/1.18 (2466) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.82/1.18 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.82/1.18 (2467) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.82/1.18 Y, T ) ), Z ) }.
% 0.82/1.18 (2468) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.82/1.18 (2469) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.82/1.18 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.82/1.18 (2470) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.82/1.18 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.82/1.18 (2471) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.82/1.18 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.82/1.18 (2472) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.82/1.18 (2473) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.82/1.18 (2474) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.82/1.18 (2475) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.82/1.18 ) = X }.
% 0.82/1.18 (2476) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.82/1.18 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.82/1.18 ( Y, T ) ) }.
% 0.82/1.18 (2477) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.82/1.18 ) = Z }.
% 0.82/1.18 (2478) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.82/1.18 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.82/1.18 (2479) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.82/1.18 (2480) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.82/1.18 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.82/1.18 ( T, X ) ) }.
% 0.82/1.18 (2481) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.82/1.18 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.82/1.18 }.
% 0.82/1.18 (2482) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 0.82/1.18 (2483) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq(
% 0.82/1.18 Y, Z ) ) }.
% 0.82/1.18 (2484) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq(
% 0.82/1.18 Y, Z ) ) }.
% 0.82/1.18 (2485) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.82/1.18 findmin_cpq_eff( Y ) ) }.
% 0.82/1.18 (2486) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.82/1.18 removemin_cpq_eff( Y ) ) }.
% 0.82/1.18 (2487) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.82/1.18 (2488) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.82/1.18 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 0.82/1.19 }.
% 0.82/1.19 (2489) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.82/1.19 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 0.82/1.19 }.
% 0.82/1.19 (2490) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 0.82/1.19 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.82/1.19 (2491) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 0.82/1.19 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.82/1.19 (2492) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.82/1.19 contains_slb( Y, T ) }.
% 0.82/1.19 (2493) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 0.82/1.19 ( X, Y, Z ), T ) }.
% 0.82/1.19 (2494) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.82/1.19 (2495) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.82/1.19 (2496) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 0.82/1.19 (2497) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 0.82/1.19 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.82/1.19 (2498) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 0.82/1.19 , X, T ), Y ) = triple( Z, X, bad ) }.
% 0.82/1.19 (2499) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 0.82/1.19 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.82/1.19 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 0.82/1.19 (2500) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! strictly_less_than
% 0.82/1.19 ( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.82/1.19 remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 0.82/1.19 (2501) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 0.82/1.19 ) = triple( X, create_slb, bad ) }.
% 0.82/1.19 (2502) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 0.82/1.19 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.82/1.19 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.82/1.19 (2503) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.82/1.19 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 0.82/1.19 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 0.82/1.19 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.82/1.19 (2504) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.82/1.19 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 0.82/1.19 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 0.82/1.19 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 0.82/1.19 (2505) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y ) )
% 0.82/1.19 = bottom }.
% 0.82/1.19 (2506) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y,
% 0.82/1.19 X, Z ) ) = findmin_pqp_res( Y ) }.
% 0.82/1.19 (2507) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 0.82/1.19 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 0.82/1.19 (2508) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X )
% 0.82/1.19 }.
% 0.82/1.19 (2509) {G0,W7,D4,L1,V0,M1} { ok( remove_cpq( triple( skol3, skol1, skol4 )
% 0.82/1.19 , skol2 ) ) }.
% 0.82/1.19 (2510) {G0,W3,D2,L1,V0,M1} { ! contains_slb( skol1, skol2 ) }.
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Total Proof:
% 0.82/1.19
% 0.82/1.19 subsumption: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.82/1.19 parent0: (2494) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 Y := Y
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (43) {G0,W14,D4,L2,V4,M2} I { contains_slb( X, Y ), remove_cpq
% 0.82/1.19 ( triple( Z, X, T ), Y ) ==> triple( Z, X, bad ) }.
% 0.82/1.19 parent0: (2498) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq(
% 0.82/1.19 triple( Z, X, T ), Y ) = triple( Z, X, bad ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 Y := Y
% 0.82/1.19 Z := Z
% 0.82/1.19 T := T
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (54) {G0,W7,D4,L1,V0,M1} I { ok( remove_cpq( triple( skol3,
% 0.82/1.19 skol1, skol4 ), skol2 ) ) }.
% 0.82/1.19 parent0: (2509) {G0,W7,D4,L1,V0,M1} { ok( remove_cpq( triple( skol3, skol1
% 0.82/1.19 , skol4 ), skol2 ) ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (55) {G0,W3,D2,L1,V0,M1} I { ! contains_slb( skol1, skol2 )
% 0.82/1.19 }.
% 0.82/1.19 parent0: (2510) {G0,W3,D2,L1,V0,M1} { ! contains_slb( skol1, skol2 ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 paramod: (2653) {G1,W8,D3,L2,V0,M2} { ok( triple( skol3, skol1, bad ) ),
% 0.82/1.19 contains_slb( skol1, skol2 ) }.
% 0.82/1.19 parent0[1]: (43) {G0,W14,D4,L2,V4,M2} I { contains_slb( X, Y ), remove_cpq
% 0.82/1.19 ( triple( Z, X, T ), Y ) ==> triple( Z, X, bad ) }.
% 0.82/1.19 parent1[0; 1]: (54) {G0,W7,D4,L1,V0,M1} I { ok( remove_cpq( triple( skol3,
% 0.82/1.19 skol1, skol4 ), skol2 ) ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := skol1
% 0.82/1.19 Y := skol2
% 0.82/1.19 Z := skol3
% 0.82/1.19 T := skol4
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (2654) {G1,W3,D2,L1,V0,M1} { contains_slb( skol1, skol2 ) }.
% 0.82/1.19 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.82/1.19 parent1[0]: (2653) {G1,W8,D3,L2,V0,M2} { ok( triple( skol3, skol1, bad ) )
% 0.82/1.19 , contains_slb( skol1, skol2 ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := skol3
% 0.82/1.19 Y := skol1
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (2450) {G1,W3,D2,L1,V0,M1} P(43,54);r(39) { contains_slb(
% 0.82/1.19 skol1, skol2 ) }.
% 0.82/1.19 parent0: (2654) {G1,W3,D2,L1,V0,M1} { contains_slb( skol1, skol2 ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (2655) {G1,W0,D0,L0,V0,M0} { }.
% 0.82/1.19 parent0[0]: (55) {G0,W3,D2,L1,V0,M1} I { ! contains_slb( skol1, skol2 ) }.
% 0.82/1.19 parent1[0]: (2450) {G1,W3,D2,L1,V0,M1} P(43,54);r(39) { contains_slb( skol1
% 0.82/1.19 , skol2 ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (2453) {G2,W0,D0,L0,V0,M0} S(2450);r(55) { }.
% 0.82/1.19 parent0: (2655) {G1,W0,D0,L0,V0,M0} { }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 Proof check complete!
% 0.82/1.19
% 0.82/1.19 Memory use:
% 0.82/1.19
% 0.82/1.19 space for terms: 41571
% 0.82/1.19 space for clauses: 132821
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 clauses generated: 4570
% 0.82/1.19 clauses kept: 2454
% 0.82/1.19 clauses selected: 149
% 0.82/1.19 clauses deleted: 4
% 0.82/1.19 clauses inuse deleted: 1
% 0.82/1.19
% 0.82/1.19 subsentry: 4795
% 0.82/1.19 literals s-matched: 3830
% 0.82/1.19 literals matched: 3773
% 0.82/1.19 full subsumption: 1200
% 0.82/1.19
% 0.82/1.19 checksum: -1900310295
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Bliksem ended
%------------------------------------------------------------------------------