TSTP Solution File: SWV373+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:38 EDT 2022
% Result : Theorem 0.78s 1.23s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Wed Jun 15 10:37:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.14 *** allocated 10000 integers for termspace/termends
% 0.75/1.14 *** allocated 10000 integers for clauses
% 0.75/1.14 *** allocated 10000 integers for justifications
% 0.75/1.14 Bliksem 1.12
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Automatic Strategy Selection
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Clauses:
% 0.75/1.14
% 0.75/1.14 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.75/1.14 { less_than( X, Y ), less_than( Y, X ) }.
% 0.75/1.14 { less_than( X, X ) }.
% 0.75/1.14 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.75/1.14 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.75/1.14 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.75/1.14 { less_than( bottom, X ) }.
% 0.75/1.14 { ! isnonempty_slb( create_slb ) }.
% 0.75/1.14 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.75/1.14 { ! contains_slb( create_slb, X ) }.
% 0.75/1.14 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.75/1.14 , Y = Z }.
% 0.75/1.14 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.75/1.14 }.
% 0.75/1.14 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.75/1.14 { ! pair_in_list( create_slb, X, Y ) }.
% 0.75/1.14 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.75/1.14 , U ), alpha1( Y, Z, T, U ) }.
% 0.75/1.14 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.75/1.14 , U ) }.
% 0.75/1.14 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.75/1.14 ) }.
% 0.75/1.14 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.75/1.14 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.75/1.14 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.75/1.14 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.75/1.14 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.75/1.14 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.75/1.14 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.75/1.14 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.75/1.14 , Z ) = lookup_slb( X, Z ) }.
% 0.75/1.14 { update_slb( create_slb, X ) = create_slb }.
% 0.75/1.14 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.75/1.14 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.75/1.14 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.75/1.14 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.75/1.14 { succ_cpq( X, X ) }.
% 0.75/1.14 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.75/1.14 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.75/1.14 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.75/1.14 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.75/1.14 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.75/1.14 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.75/1.14 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.75/1.14 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.75/1.14 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.75/1.14 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.75/1.14 ( X, Y ) ), U ) ) }.
% 0.75/1.14 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.75/1.14 pair( X, Y ) ), U ) ) }.
% 0.75/1.14 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.75/1.14 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.75/1.14 { ! ok( triple( X, Y, bad ) ) }.
% 0.75/1.14 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.75/1.14 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.75/1.14 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.75/1.14 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.75/1.14 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.75/1.14 bad ) }.
% 0.75/1.14 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.75/1.14 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.75/1.14 , T ) }.
% 0.75/1.14 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.75/1.14 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.75/1.14 remove_slb( X, Y ), bad ) }.
% 0.75/1.14 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.75/1.14 bad ) }.
% 0.75/1.14 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.75/1.14 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.75/1.14 , bad ) }.
% 0.75/1.14 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.75/1.14 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.75/1.14 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.75/1.14 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.75/1.14 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.75/1.14 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 0.78/1.23 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ), Z ) }.
% 0.78/1.23 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 0.78/1.23 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 0.78/1.23 ) }.
% 0.78/1.23 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 0.78/1.23 findmin_cpq_res( X ) ) }.
% 0.78/1.23 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 0.78/1.23 { ! ok( findmin_cpq_eff( triple( X, Y, Z ) ) ), ! Y = create_slb }.
% 0.78/1.23 { ! ok( findmin_cpq_eff( triple( X, Y, Z ) ) ), contains_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ) }.
% 0.78/1.23 { ! ok( findmin_cpq_eff( triple( X, Y, Z ) ) ), less_than( lookup_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ), findmin_pqp_res( X ) ) }.
% 0.78/1.23 { ! contains_cpq( triple( skol1, skol2, skol3 ), findmin_cpq_res( triple(
% 0.78/1.23 skol1, skol2, skol3 ) ) ) }.
% 0.78/1.23 { ok( findmin_cpq_eff( triple( skol1, skol2, skol3 ) ) ) }.
% 0.78/1.23
% 0.78/1.23 percentage equality = 0.284483, percentage horn = 0.796610
% 0.78/1.23 This is a problem with some equality
% 0.78/1.23
% 0.78/1.23
% 0.78/1.23
% 0.78/1.23 Options Used:
% 0.78/1.23
% 0.78/1.23 useres = 1
% 0.78/1.23 useparamod = 1
% 0.78/1.23 useeqrefl = 1
% 0.78/1.23 useeqfact = 1
% 0.78/1.23 usefactor = 1
% 0.78/1.23 usesimpsplitting = 0
% 0.78/1.23 usesimpdemod = 5
% 0.78/1.23 usesimpres = 3
% 0.78/1.23
% 0.78/1.23 resimpinuse = 1000
% 0.78/1.23 resimpclauses = 20000
% 0.78/1.23 substype = eqrewr
% 0.78/1.23 backwardsubs = 1
% 0.78/1.23 selectoldest = 5
% 0.78/1.23
% 0.78/1.23 litorderings [0] = split
% 0.78/1.23 litorderings [1] = extend the termordering, first sorting on arguments
% 0.78/1.23
% 0.78/1.23 termordering = kbo
% 0.78/1.23
% 0.78/1.23 litapriori = 0
% 0.78/1.23 termapriori = 1
% 0.78/1.23 litaposteriori = 0
% 0.78/1.23 termaposteriori = 0
% 0.78/1.23 demodaposteriori = 0
% 0.78/1.23 ordereqreflfact = 0
% 0.78/1.23
% 0.78/1.23 litselect = negord
% 0.78/1.23
% 0.78/1.23 maxweight = 15
% 0.78/1.23 maxdepth = 30000
% 0.78/1.23 maxlength = 115
% 0.78/1.23 maxnrvars = 195
% 0.78/1.23 excuselevel = 1
% 0.78/1.23 increasemaxweight = 1
% 0.78/1.23
% 0.78/1.23 maxselected = 10000000
% 0.78/1.23 maxnrclauses = 10000000
% 0.78/1.23
% 0.78/1.23 showgenerated = 0
% 0.78/1.23 showkept = 0
% 0.78/1.23 showselected = 0
% 0.78/1.23 showdeleted = 0
% 0.78/1.23 showresimp = 1
% 0.78/1.23 showstatus = 2000
% 0.78/1.23
% 0.78/1.23 prologoutput = 0
% 0.78/1.23 nrgoals = 5000000
% 0.78/1.23 totalproof = 1
% 0.78/1.23
% 0.78/1.23 Symbols occurring in the translation:
% 0.78/1.23
% 0.78/1.23 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.78/1.23 . [1, 2] (w:1, o:30, a:1, s:1, b:0),
% 0.78/1.23 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 0.78/1.23 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.78/1.23 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.78/1.23 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.78/1.23 less_than [38, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.78/1.23 strictly_less_than [39, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.78/1.23 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.78/1.23 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.78/1.23 isnonempty_slb [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.78/1.23 pair [43, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.78/1.23 insert_slb [44, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.78/1.23 contains_slb [45, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.78/1.23 pair_in_list [47, 3] (w:1, o:68, a:1, s:1, b:0),
% 0.78/1.23 remove_slb [49, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.78/1.23 lookup_slb [50, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.78/1.23 update_slb [51, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.78/1.23 succ_cpq [52, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.78/1.23 insert_cpq [53, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.78/1.23 remove_cpq [54, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.78/1.23 findmin_cpq_eff [55, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.78/1.23 removemin_cpq_eff [56, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.78/1.23 triple [57, 3] (w:1, o:69, a:1, s:1, b:0),
% 0.78/1.23 check_cpq [58, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.78/1.23 contains_cpq [59, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.78/1.23 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.78/1.23 ok [61, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.78/1.23 insert_pqp [62, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.78/1.23 remove_pqp [63, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.78/1.23 findmin_pqp_res [64, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.78/1.23 findmin_cpq_res [65, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.78/1.23 removemin_cpq_res [66, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.78/1.23 alpha1 [67, 4] (w:1, o:70, a:1, s:1, b:1),
% 0.78/1.23 skol1 [68, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.78/1.23 skol2 [69, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.78/1.23 skol3 [70, 0] (w:1, o:16, a:1, s:1, b:1).
% 0.78/1.23
% 0.78/1.23
% 0.78/1.23 Starting Search:
% 0.78/1.23
% 0.78/1.23 *** allocated 15000 integers for clauses
% 0.78/1.23 *** allocated 22500 integers for clauses
% 0.78/1.23 *** allocated 33750 integers for clauses
% 0.78/1.23 *** allocated 15000 integers for termspace/termends
% 0.78/1.23 *** allocated 50625 integers for clauses
% 0.78/1.23 *** allocated 22500 integers for termspace/termends
% 0.78/1.23 *** allocated 75937 integers for clauses
% 0.78/1.23 Resimplifying inuse:
% 0.78/1.23 Done
% 0.78/1.23
% 0.78/1.23 *** allocated 33750 integers for termspace/termends
% 0.78/1.23 *** allocated 113905 integers for clauses
% 0.78/1.23 *** allocated 50625 integers for termspace/termends
% 0.78/1.23
% 0.78/1.23 Intermediate Status:
% 0.78/1.23 Generated: 3819
% 0.78/1.23 Kept: 2016
% 0.78/1.23 Inuse: 130
% 0.78/1.23 Deleted: 4
% 0.78/1.23 Deletedinuse: 1
% 0.78/1.23
% 0.78/1.23 *** allocated 170857 integers for clauses
% 0.78/1.23 Resimplifying inuse:
% 0.78/1.23 Done
% 0.78/1.23
% 0.78/1.23 *** allocated 75937 integers for termspace/termends
% 0.78/1.23 *** allocated 256285 integers for clauses
% 0.78/1.23 Resimplifying inuse:
% 0.78/1.23 Done
% 0.78/1.23
% 0.78/1.23 *** allocated 113905 integers for termspace/termends
% 0.78/1.23
% 0.78/1.23 Intermediate Status:
% 0.78/1.23 Generated: 9031
% 0.78/1.23 Kept: 4031
% 0.78/1.23 Inuse: 185
% 0.78/1.23 Deleted: 7
% 0.78/1.23 Deletedinuse: 3
% 0.78/1.23
% 0.78/1.23
% 0.78/1.23 Bliksems!, er is een bewijs:
% 0.78/1.23 % SZS status Theorem
% 0.78/1.23 % SZS output start Refutation
% 0.78/1.23
% 0.78/1.23 (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X ) }.
% 0.78/1.23 (37) {G0,W9,D3,L2,V4,M2} I { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.78/1.23 contains_slb( Y, T ) }.
% 0.78/1.23 (38) {G0,W9,D3,L2,V4,M2} I { ! contains_slb( Y, T ), contains_cpq( triple(
% 0.78/1.23 X, Y, Z ), T ) }.
% 0.78/1.23 (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.78/1.23 (46) {G0,W10,D4,L1,V2,M1} I { findmin_cpq_eff( triple( X, create_slb, Y ) )
% 0.78/1.23 ==> triple( X, create_slb, bad ) }.
% 0.78/1.23 (47) {G0,W20,D5,L3,V3,M3} I { Y = create_slb, contains_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.78/1.23 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.78/1.23 (51) {G0,W11,D4,L2,V3,M2} I { X = create_slb, findmin_cpq_res( triple( Y, X
% 0.78/1.23 , Z ) ) ==> findmin_pqp_res( Y ) }.
% 0.78/1.23 (57) {G0,W10,D4,L1,V0,M1} I { ! contains_cpq( triple( skol1, skol2, skol3 )
% 0.78/1.23 , findmin_cpq_res( triple( skol1, skol2, skol3 ) ) ) }.
% 0.78/1.23 (58) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple( skol1, skol2,
% 0.78/1.23 skol3 ) ) ) }.
% 0.78/1.23 (1979) {G1,W6,D3,L1,V3,M1} R(37,9) { ! contains_cpq( triple( X, create_slb
% 0.78/1.23 , Y ), Z ) }.
% 0.78/1.23 (2956) {G1,W7,D3,L2,V0,M2} P(47,58);r(39) { skol2 ==> create_slb,
% 0.78/1.23 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.23 (2986) {G2,W4,D3,L1,V0,M1} P(2956,58);d(46);r(39) { contains_slb( skol2,
% 0.78/1.23 findmin_pqp_res( skol1 ) ) }.
% 0.78/1.23 (2987) {G3,W7,D3,L1,V2,M1} R(2986,38) { contains_cpq( triple( X, skol2, Y )
% 0.78/1.23 , findmin_pqp_res( skol1 ) ) }.
% 0.78/1.23 (3518) {G4,W8,D4,L1,V2,M1} P(51,2987);r(1979) { findmin_cpq_res( triple( Z
% 0.78/1.23 , skol2, T ) ) ==> findmin_pqp_res( Z ) }.
% 0.78/1.23 (4244) {G5,W0,D0,L0,V0,M0} S(57);d(3518);r(2987) { }.
% 0.78/1.23
% 0.78/1.23
% 0.78/1.23 % SZS output end Refutation
% 0.78/1.23 found a proof!
% 0.78/1.23
% 0.78/1.23
% 0.78/1.23 Unprocessed initial clauses:
% 0.78/1.23
% 0.78/1.23 (4246) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.78/1.23 less_than( X, Y ) }.
% 0.78/1.23 (4247) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.78/1.23 (4248) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.78/1.23 (4249) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.78/1.23 ) }.
% 0.78/1.23 (4250) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.78/1.23 , X ) }.
% 0.78/1.23 (4251) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.78/1.23 strictly_less_than( X, Y ) }.
% 0.78/1.23 (4252) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.78/1.23 (4253) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.78/1.23 (4254) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.78/1.23 ) }.
% 0.78/1.23 (4255) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.78/1.23 (4256) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.78/1.23 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.78/1.23 (4257) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.78/1.23 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.78/1.23 (4258) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.78/1.23 Y, T ) ), Z ) }.
% 0.78/1.23 (4259) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.78/1.23 (4260) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.78/1.23 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.78/1.23 (4261) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.78/1.23 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.78/1.23 (4262) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.78/1.23 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.78/1.23 (4263) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.78/1.23 (4264) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.78/1.23 (4265) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.78/1.23 (4266) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.78/1.23 ) = X }.
% 0.78/1.23 (4267) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.78/1.23 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.78/1.23 ( Y, T ) ) }.
% 0.78/1.23 (4268) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.78/1.23 ) = Z }.
% 0.78/1.23 (4269) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.78/1.23 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.78/1.23 (4270) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.78/1.23 (4271) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.78/1.23 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.78/1.23 ( T, X ) ) }.
% 0.78/1.23 (4272) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.78/1.23 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.78/1.23 }.
% 0.78/1.23 (4273) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 0.78/1.23 (4274) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq(
% 0.78/1.23 Y, Z ) ) }.
% 0.78/1.23 (4275) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq(
% 0.78/1.23 Y, Z ) ) }.
% 0.78/1.23 (4276) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.78/1.23 findmin_cpq_eff( Y ) ) }.
% 0.78/1.23 (4277) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.78/1.23 removemin_cpq_eff( Y ) ) }.
% 0.78/1.23 (4278) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.78/1.23 (4279) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.78/1.23 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 0.78/1.23 }.
% 0.78/1.23 (4280) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.78/1.23 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 0.78/1.23 }.
% 0.78/1.23 (4281) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 0.78/1.23 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.78/1.23 (4282) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 0.78/1.23 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.78/1.23 (4283) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.78/1.23 contains_slb( Y, T ) }.
% 0.78/1.23 (4284) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 0.78/1.23 ( X, Y, Z ), T ) }.
% 0.78/1.23 (4285) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.78/1.23 (4286) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.78/1.23 (4287) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 0.78/1.23 (4288) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 0.78/1.23 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.78/1.23 (4289) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 0.78/1.23 , X, T ), Y ) = triple( Z, X, bad ) }.
% 0.78/1.23 (4290) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 0.78/1.23 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.78/1.23 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 0.78/1.23 (4291) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! strictly_less_than
% 0.78/1.23 ( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.78/1.23 remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 0.78/1.23 (4292) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 0.78/1.23 ) = triple( X, create_slb, bad ) }.
% 0.78/1.23 (4293) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.78/1.23 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.78/1.23 (4294) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 0.78/1.23 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 0.78/1.23 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.78/1.23 (4295) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.78/1.23 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 0.78/1.23 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 0.78/1.23 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 0.78/1.23 (4296) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y ) )
% 0.78/1.23 = bottom }.
% 0.78/1.24 (4297) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y,
% 0.78/1.24 X, Z ) ) = findmin_pqp_res( Y ) }.
% 0.78/1.24 (4298) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 0.78/1.24 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 0.78/1.24 (4299) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X )
% 0.78/1.24 }.
% 0.78/1.24 (4300) {G0,W9,D4,L2,V3,M2} { ! ok( findmin_cpq_eff( triple( X, Y, Z ) ) )
% 0.78/1.24 , ! Y = create_slb }.
% 0.78/1.24 (4301) {G0,W10,D4,L2,V3,M2} { ! ok( findmin_cpq_eff( triple( X, Y, Z ) ) )
% 0.78/1.24 , contains_slb( Y, findmin_pqp_res( X ) ) }.
% 0.78/1.24 (4302) {G0,W13,D4,L2,V3,M2} { ! ok( findmin_cpq_eff( triple( X, Y, Z ) ) )
% 0.78/1.24 , less_than( lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X )
% 0.78/1.24 ) }.
% 0.78/1.24 (4303) {G0,W10,D4,L1,V0,M1} { ! contains_cpq( triple( skol1, skol2, skol3
% 0.78/1.24 ), findmin_cpq_res( triple( skol1, skol2, skol3 ) ) ) }.
% 0.78/1.24 (4304) {G0,W6,D4,L1,V0,M1} { ok( findmin_cpq_eff( triple( skol1, skol2,
% 0.78/1.24 skol3 ) ) ) }.
% 0.78/1.24
% 0.78/1.24
% 0.78/1.24 Total Proof:
% 0.78/1.24
% 0.78/1.24 subsumption: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 0.78/1.24 }.
% 0.78/1.24 parent0: (4255) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (37) {G0,W9,D3,L2,V4,M2} I { ! contains_cpq( triple( X, Y, Z )
% 0.78/1.24 , T ), contains_slb( Y, T ) }.
% 0.78/1.24 parent0: (4283) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T
% 0.78/1.24 ), contains_slb( Y, T ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 Y := Y
% 0.78/1.24 Z := Z
% 0.78/1.24 T := T
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 1 ==> 1
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (38) {G0,W9,D3,L2,V4,M2} I { ! contains_slb( Y, T ),
% 0.78/1.24 contains_cpq( triple( X, Y, Z ), T ) }.
% 0.78/1.24 parent0: (4284) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq
% 0.78/1.24 ( triple( X, Y, Z ), T ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 Y := Y
% 0.78/1.24 Z := Z
% 0.78/1.24 T := T
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 1 ==> 1
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.78/1.24 parent0: (4285) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 Y := Y
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (46) {G0,W10,D4,L1,V2,M1} I { findmin_cpq_eff( triple( X,
% 0.78/1.24 create_slb, Y ) ) ==> triple( X, create_slb, bad ) }.
% 0.78/1.24 parent0: (4292) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X,
% 0.78/1.24 create_slb, Y ) ) = triple( X, create_slb, bad ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 Y := Y
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (47) {G0,W20,D5,L3,V3,M3} I { Y = create_slb, contains_slb( Y
% 0.78/1.24 , findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple(
% 0.78/1.24 X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.78/1.24 parent0: (4293) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 0.78/1.24 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.78/1.24 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 Y := Y
% 0.78/1.24 Z := Z
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 1 ==> 1
% 0.78/1.24 2 ==> 2
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (51) {G0,W11,D4,L2,V3,M2} I { X = create_slb, findmin_cpq_res
% 0.78/1.24 ( triple( Y, X, Z ) ) ==> findmin_pqp_res( Y ) }.
% 0.78/1.24 parent0: (4297) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res(
% 0.78/1.24 triple( Y, X, Z ) ) = findmin_pqp_res( Y ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 Y := Y
% 0.78/1.24 Z := Z
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 1 ==> 1
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (57) {G0,W10,D4,L1,V0,M1} I { ! contains_cpq( triple( skol1,
% 0.78/1.24 skol2, skol3 ), findmin_cpq_res( triple( skol1, skol2, skol3 ) ) ) }.
% 0.78/1.24 parent0: (4303) {G0,W10,D4,L1,V0,M1} { ! contains_cpq( triple( skol1,
% 0.78/1.24 skol2, skol3 ), findmin_cpq_res( triple( skol1, skol2, skol3 ) ) ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 subsumption: (58) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 0.78/1.24 skol1, skol2, skol3 ) ) ) }.
% 0.78/1.24 parent0: (4304) {G0,W6,D4,L1,V0,M1} { ok( findmin_cpq_eff( triple( skol1,
% 0.78/1.24 skol2, skol3 ) ) ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 end
% 0.78/1.24 permutation0:
% 0.78/1.24 0 ==> 0
% 0.78/1.24 end
% 0.78/1.24
% 0.78/1.24 resolution: (4577) {G1,W6,D3,L1,V3,M1} { ! contains_cpq( triple( Y,
% 0.78/1.24 create_slb, Z ), X ) }.
% 0.78/1.24 parent0[0]: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X ) }.
% 0.78/1.24 parent1[1]: (37) {G0,W9,D3,L2,V4,M2} I { ! contains_cpq( triple( X, Y, Z )
% 0.78/1.24 , T ), contains_slb( Y, T ) }.
% 0.78/1.24 substitution0:
% 0.78/1.24 X := X
% 0.78/1.24 end
% 0.78/1.24 substitution1:
% 0.78/1.24 X := Y
% 0.78/1.24 Y := create_slb
% 0.78/1.25 Z := Z
% 0.78/1.25 T := X
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 subsumption: (1979) {G1,W6,D3,L1,V3,M1} R(37,9) { ! contains_cpq( triple( X
% 0.78/1.25 , create_slb, Y ), Z ) }.
% 0.78/1.25 parent0: (4577) {G1,W6,D3,L1,V3,M1} { ! contains_cpq( triple( Y,
% 0.78/1.25 create_slb, Z ), X ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 X := Z
% 0.78/1.25 Y := X
% 0.78/1.25 Z := Y
% 0.78/1.25 end
% 0.78/1.25 permutation0:
% 0.78/1.25 0 ==> 0
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 eqswap: (4578) {G0,W20,D5,L3,V3,M3} { create_slb = X, contains_slb( X,
% 0.78/1.25 findmin_pqp_res( Y ) ), findmin_cpq_eff( triple( Y, X, Z ) ) = triple( Y
% 0.78/1.25 , update_slb( X, findmin_pqp_res( Y ) ), bad ) }.
% 0.78/1.25 parent0[0]: (47) {G0,W20,D5,L3,V3,M3} I { Y = create_slb, contains_slb( Y,
% 0.78/1.25 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.78/1.25 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 X := Y
% 0.78/1.25 Y := X
% 0.78/1.25 Z := Z
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 paramod: (4581) {G1,W15,D5,L3,V0,M3} { ok( triple( skol1, update_slb(
% 0.78/1.25 skol2, findmin_pqp_res( skol1 ) ), bad ) ), create_slb = skol2,
% 0.78/1.25 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0[2]: (4578) {G0,W20,D5,L3,V3,M3} { create_slb = X, contains_slb( X
% 0.78/1.25 , findmin_pqp_res( Y ) ), findmin_cpq_eff( triple( Y, X, Z ) ) = triple(
% 0.78/1.25 Y, update_slb( X, findmin_pqp_res( Y ) ), bad ) }.
% 0.78/1.25 parent1[0; 1]: (58) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 0.78/1.25 skol1, skol2, skol3 ) ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 X := skol2
% 0.78/1.25 Y := skol1
% 0.78/1.25 Z := skol3
% 0.78/1.25 end
% 0.78/1.25 substitution1:
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 resolution: (4716) {G1,W7,D3,L2,V0,M2} { create_slb = skol2, contains_slb
% 0.78/1.25 ( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.78/1.25 parent1[0]: (4581) {G1,W15,D5,L3,V0,M3} { ok( triple( skol1, update_slb(
% 0.78/1.25 skol2, findmin_pqp_res( skol1 ) ), bad ) ), create_slb = skol2,
% 0.78/1.25 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 X := skol1
% 0.78/1.25 Y := update_slb( skol2, findmin_pqp_res( skol1 ) )
% 0.78/1.25 end
% 0.78/1.25 substitution1:
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 eqswap: (4717) {G1,W7,D3,L2,V0,M2} { skol2 = create_slb, contains_slb(
% 0.78/1.25 skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0[0]: (4716) {G1,W7,D3,L2,V0,M2} { create_slb = skol2, contains_slb
% 0.78/1.25 ( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 subsumption: (2956) {G1,W7,D3,L2,V0,M2} P(47,58);r(39) { skol2 ==>
% 0.78/1.25 create_slb, contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0: (4717) {G1,W7,D3,L2,V0,M2} { skol2 = create_slb, contains_slb(
% 0.78/1.25 skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 end
% 0.78/1.25 permutation0:
% 0.78/1.25 0 ==> 0
% 0.78/1.25 1 ==> 1
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 paramod: (4720) {G1,W10,D4,L2,V0,M2} { ok( findmin_cpq_eff( triple( skol1
% 0.78/1.25 , create_slb, skol3 ) ) ), contains_slb( skol2, findmin_pqp_res( skol1 )
% 0.78/1.25 ) }.
% 0.78/1.25 parent0[0]: (2956) {G1,W7,D3,L2,V0,M2} P(47,58);r(39) { skol2 ==>
% 0.78/1.25 create_slb, contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent1[0; 4]: (58) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 0.78/1.25 skol1, skol2, skol3 ) ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 end
% 0.78/1.25 substitution1:
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 paramod: (4731) {G1,W9,D3,L2,V0,M2} { ok( triple( skol1, create_slb, bad )
% 0.78/1.25 ), contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0[0]: (46) {G0,W10,D4,L1,V2,M1} I { findmin_cpq_eff( triple( X,
% 0.78/1.25 create_slb, Y ) ) ==> triple( X, create_slb, bad ) }.
% 0.78/1.25 parent1[0; 1]: (4720) {G1,W10,D4,L2,V0,M2} { ok( findmin_cpq_eff( triple(
% 0.78/1.25 skol1, create_slb, skol3 ) ) ), contains_slb( skol2, findmin_pqp_res(
% 0.78/1.25 skol1 ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 X := skol1
% 0.78/1.25 Y := skol3
% 0.78/1.25 end
% 0.78/1.25 substitution1:
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 resolution: (4732) {G1,W4,D3,L1,V0,M1} { contains_slb( skol2,
% 0.78/1.25 findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.78/1.25 parent1[0]: (4731) {G1,W9,D3,L2,V0,M2} { ok( triple( skol1, create_slb,
% 0.78/1.25 bad ) ), contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 X := skol1
% 0.78/1.25 Y := create_slb
% 0.78/1.25 end
% 0.78/1.25 substitution1:
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 subsumption: (2986) {G2,W4,D3,L1,V0,M1} P(2956,58);d(46);r(39) {
% 0.78/1.25 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0: (4732) {G1,W4,D3,L1,V0,M1} { contains_slb( skol2, findmin_pqp_res
% 0.78/1.25 ( skol1 ) ) }.
% 0.78/1.25 substitution0:
% 0.78/1.25 end
% 0.78/1.25 permutation0:
% 0.78/1.25 0 ==> 0
% 0.78/1.25 end
% 0.78/1.25
% 0.78/1.25 resolution: (4733) {G1,W7,D3,L1,V2,M1} { contains_cpq( triple( X, skol2, Y
% 0.78/1.25 ), findmin_pqp_res( skol1 ) ) }.
% 0.78/1.25 parent0[0]: (38) {G0,W9,D3,L2,VCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------