TSTP Solution File: SWV377+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV377+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:39 EDT 2022
% Result : Theorem 0.74s 1.14s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV377+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Tue Jun 14 14:40:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.13 *** allocated 10000 integers for termspace/termends
% 0.74/1.13 *** allocated 10000 integers for clauses
% 0.74/1.13 *** allocated 10000 integers for justifications
% 0.74/1.13 Bliksem 1.12
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Automatic Strategy Selection
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Clauses:
% 0.74/1.13
% 0.74/1.13 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.74/1.13 { less_than( X, Y ), less_than( Y, X ) }.
% 0.74/1.13 { less_than( X, X ) }.
% 0.74/1.13 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.74/1.13 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.74/1.13 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.74/1.13 { less_than( bottom, X ) }.
% 0.74/1.13 { ! isnonempty_slb( create_slb ) }.
% 0.74/1.13 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.74/1.13 { ! contains_slb( create_slb, X ) }.
% 0.74/1.13 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.74/1.13 , Y = Z }.
% 0.74/1.13 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.74/1.13 }.
% 0.74/1.13 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.74/1.13 { ! pair_in_list( create_slb, X, Y ) }.
% 0.74/1.13 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.74/1.13 , U ), alpha1( Y, Z, T, U ) }.
% 0.74/1.13 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.74/1.13 , U ) }.
% 0.74/1.13 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.74/1.13 ) }.
% 0.74/1.13 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.74/1.13 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.74/1.13 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.74/1.13 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.74/1.13 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.74/1.13 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.74/1.13 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.74/1.13 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.74/1.13 , Z ) = lookup_slb( X, Z ) }.
% 0.74/1.13 { update_slb( create_slb, X ) = create_slb }.
% 0.74/1.13 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.74/1.13 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.74/1.13 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.74/1.13 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.74/1.13 { succ_cpq( X, X ) }.
% 0.74/1.13 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.74/1.13 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.74/1.13 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.74/1.13 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.74/1.13 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.74/1.13 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.74/1.13 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.74/1.13 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.74/1.13 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.74/1.13 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.74/1.13 ( X, Y ) ), U ) ) }.
% 0.74/1.13 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.74/1.13 pair( X, Y ) ), U ) ) }.
% 0.74/1.13 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.74/1.13 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.74/1.13 { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.13 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.74/1.13 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.74/1.13 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.74/1.13 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.74/1.13 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.74/1.13 bad ) }.
% 0.74/1.13 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.74/1.13 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.74/1.13 , T ) }.
% 0.74/1.13 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.74/1.13 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.74/1.13 remove_slb( X, Y ), bad ) }.
% 0.74/1.13 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.74/1.13 bad ) }.
% 0.74/1.13 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.74/1.13 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.74/1.13 , bad ) }.
% 0.74/1.13 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.74/1.13 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.74/1.13 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.74/1.13 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.74/1.13 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.74/1.13 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 0.74/1.14 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 0.74/1.14 findmin_pqp_res( X ) ), Z ) }.
% 0.74/1.14 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 0.74/1.14 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 0.74/1.14 ) }.
% 0.74/1.14 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 0.74/1.14 findmin_cpq_res( X ) ) }.
% 0.74/1.14 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 0.74/1.14 { ! ok( triple( skol1, skol2, skol3 ) ) }.
% 0.74/1.14 { ok( insert_cpq( triple( skol1, skol2, skol3 ), skol4 ) ) }.
% 0.74/1.14
% 0.74/1.14 percentage equality = 0.290909, percentage horn = 0.785714
% 0.74/1.14 This is a problem with some equality
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 Options Used:
% 0.74/1.14
% 0.74/1.14 useres = 1
% 0.74/1.14 useparamod = 1
% 0.74/1.14 useeqrefl = 1
% 0.74/1.14 useeqfact = 1
% 0.74/1.14 usefactor = 1
% 0.74/1.14 usesimpsplitting = 0
% 0.74/1.14 usesimpdemod = 5
% 0.74/1.14 usesimpres = 3
% 0.74/1.14
% 0.74/1.14 resimpinuse = 1000
% 0.74/1.14 resimpclauses = 20000
% 0.74/1.14 substype = eqrewr
% 0.74/1.14 backwardsubs = 1
% 0.74/1.14 selectoldest = 5
% 0.74/1.14
% 0.74/1.14 litorderings [0] = split
% 0.74/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.14
% 0.74/1.14 termordering = kbo
% 0.74/1.14
% 0.74/1.14 litapriori = 0
% 0.74/1.14 termapriori = 1
% 0.74/1.14 litaposteriori = 0
% 0.74/1.14 termaposteriori = 0
% 0.74/1.14 demodaposteriori = 0
% 0.74/1.14 ordereqreflfact = 0
% 0.74/1.14
% 0.74/1.14 litselect = negord
% 0.74/1.14
% 0.74/1.14 maxweight = 15
% 0.74/1.14 maxdepth = 30000
% 0.74/1.14 maxlength = 115
% 0.74/1.14 maxnrvars = 195
% 0.74/1.14 excuselevel = 1
% 0.74/1.14 increasemaxweight = 1
% 0.74/1.14
% 0.74/1.14 maxselected = 10000000
% 0.74/1.14 maxnrclauses = 10000000
% 0.74/1.14
% 0.74/1.14 showgenerated = 0
% 0.74/1.14 showkept = 0
% 0.74/1.14 showselected = 0
% 0.74/1.14 showdeleted = 0
% 0.74/1.14 showresimp = 1
% 0.74/1.14 showstatus = 2000
% 0.74/1.14
% 0.74/1.14 prologoutput = 0
% 0.74/1.14 nrgoals = 5000000
% 0.74/1.14 totalproof = 1
% 0.74/1.14
% 0.74/1.14 Symbols occurring in the translation:
% 0.74/1.14
% 0.74/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.14 . [1, 2] (w:1, o:31, a:1, s:1, b:0),
% 0.74/1.14 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 0.74/1.14 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.74/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.14 less_than [38, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.74/1.14 strictly_less_than [39, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.74/1.14 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.74/1.14 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.74/1.14 isnonempty_slb [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.14 pair [43, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.74/1.14 insert_slb [44, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.74/1.14 contains_slb [45, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.74/1.14 pair_in_list [47, 3] (w:1, o:69, a:1, s:1, b:0),
% 0.74/1.14 remove_slb [49, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.74/1.14 lookup_slb [50, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.74/1.14 update_slb [51, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.74/1.14 succ_cpq [52, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.74/1.14 insert_cpq [53, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.74/1.14 remove_cpq [54, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.74/1.14 findmin_cpq_eff [55, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.14 removemin_cpq_eff [56, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.14 triple [57, 3] (w:1, o:70, a:1, s:1, b:0),
% 0.74/1.14 check_cpq [58, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.74/1.14 contains_cpq [59, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.74/1.14 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.74/1.14 ok [61, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.74/1.14 insert_pqp [62, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.74/1.14 remove_pqp [63, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.74/1.14 findmin_pqp_res [64, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.74/1.14 findmin_cpq_res [65, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.74/1.14 removemin_cpq_res [66, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.74/1.14 alpha1 [67, 4] (w:1, o:71, a:1, s:1, b:1),
% 0.74/1.14 skol1 [68, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.74/1.14 skol2 [69, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.74/1.14 skol3 [70, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.74/1.14 skol4 [71, 0] (w:1, o:17, a:1, s:1, b:1).
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 Starting Search:
% 0.74/1.14
% 0.74/1.14 *** allocated 15000 integers for clauses
% 0.74/1.14 *** allocated 22500 integers for clauses
% 0.74/1.14 *** allocated 33750 integers for clauses
% 0.74/1.14 *** allocated 15000 integers for termspace/termends
% 0.74/1.14 *** allocated 50625 integers for clauses
% 0.74/1.14 *** allocated 22500 integers for termspace/termends
% 0.74/1.14 *** allocated 75937 integers for clauses
% 0.74/1.14 Resimplifying inuse:
% 0.74/1.14 Done
% 0.74/1.14
% 0.74/1.14 *** allocated 33750 integers for termspace/termends
% 0.74/1.14 *** allocated 113905 integers for clauses
% 0.74/1.14 *** allocated 50625 integers for termspace/termends
% 0.74/1.14
% 0.74/1.14 Intermediate Status:
% 0.74/1.14 Generated: 3781
% 0.74/1.14 Kept: 2009
% 0.74/1.14 Inuse: 128
% 0.74/1.14 Deleted: 4
% 0.74/1.14 Deletedinuse: 1
% 0.74/1.14
% 0.74/1.14 Resimplifying inuse:
% 0.74/1.14 Done
% 0.74/1.14
% 0.74/1.14 *** allocated 170857 integers for clauses
% 0.74/1.14
% 0.74/1.14 Bliksems!, er is een bewijs:
% 0.74/1.14 % SZS status Theorem
% 0.74/1.14 % SZS output start Refutation
% 0.74/1.14
% 0.74/1.14 (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.14 (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad }.
% 0.74/1.14 (42) {G0,W17,D5,L1,V4,M1} I { triple( insert_pqp( X, T ), insert_slb( Y,
% 0.74/1.14 pair( T, bottom ) ), Z ) ==> insert_cpq( triple( X, Y, Z ), T ) }.
% 0.74/1.14 (54) {G0,W5,D3,L1,V0,M1} I { ! ok( triple( skol1, skol2, skol3 ) ) }.
% 0.74/1.14 (55) {G0,W7,D4,L1,V0,M1} I { ok( insert_cpq( triple( skol1, skol2, skol3 )
% 0.74/1.14 , skol4 ) ) }.
% 0.74/1.14 (1281) {G1,W3,D2,L1,V0,M1} R(41,54) { skol3 ==> bad }.
% 0.74/1.14 (1392) {G2,W7,D4,L1,V0,M1} P(41,55);d(1281);r(39) { ok( insert_cpq( triple
% 0.74/1.14 ( skol1, skol2, bad ), skol4 ) ) }.
% 0.74/1.14 (2217) {G1,W7,D4,L1,V3,M1} P(42,39) { ! ok( insert_cpq( triple( X, Z, bad )
% 0.74/1.14 , Y ) ) }.
% 0.74/1.14 (2218) {G3,W0,D0,L0,V0,M0} R(2217,1392) { }.
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 % SZS output end Refutation
% 0.74/1.14 found a proof!
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 Unprocessed initial clauses:
% 0.74/1.14
% 0.74/1.14 (2220) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.74/1.14 less_than( X, Y ) }.
% 0.74/1.14 (2221) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.74/1.14 (2222) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.74/1.14 (2223) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.74/1.14 ) }.
% 0.74/1.14 (2224) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.74/1.14 , X ) }.
% 0.74/1.14 (2225) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.74/1.14 strictly_less_than( X, Y ) }.
% 0.74/1.14 (2226) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.74/1.14 (2227) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.74/1.14 (2228) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.74/1.14 ) }.
% 0.74/1.14 (2229) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.74/1.14 (2230) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.74/1.14 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.74/1.14 (2231) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.74/1.14 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.74/1.14 (2232) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.74/1.14 Y, T ) ), Z ) }.
% 0.74/1.14 (2233) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.74/1.14 (2234) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.74/1.14 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.74/1.14 (2235) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.74/1.14 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.74/1.14 (2236) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.74/1.14 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.74/1.14 (2237) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.74/1.14 (2238) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.74/1.14 (2239) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.74/1.14 (2240) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.74/1.14 ) = X }.
% 0.74/1.14 (2241) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.74/1.14 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.74/1.14 ( Y, T ) ) }.
% 0.74/1.14 (2242) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.74/1.14 ) = Z }.
% 0.74/1.14 (2243) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.74/1.14 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.74/1.14 (2244) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.74/1.14 (2245) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.74/1.14 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.74/1.14 ( T, X ) ) }.
% 0.74/1.14 (2246) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.74/1.14 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.74/1.14 }.
% 0.74/1.14 (2247) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 0.74/1.14 (2248) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq(
% 0.74/1.14 Y, Z ) ) }.
% 0.74/1.14 (2249) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq(
% 0.74/1.14 Y, Z ) ) }.
% 0.74/1.14 (2250) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.74/1.14 findmin_cpq_eff( Y ) ) }.
% 0.74/1.14 (2251) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.74/1.14 removemin_cpq_eff( Y ) ) }.
% 0.74/1.14 (2252) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.74/1.14 (2253) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.74/1.14 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 0.74/1.14 }.
% 0.74/1.14 (2254) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.74/1.14 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 0.74/1.14 }.
% 0.74/1.14 (2255) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 0.74/1.14 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.74/1.14 (2256) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 0.74/1.14 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.74/1.14 (2257) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.74/1.14 contains_slb( Y, T ) }.
% 0.74/1.14 (2258) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 0.74/1.14 ( X, Y, Z ), T ) }.
% 0.74/1.14 (2259) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.14 (2260) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.74/1.14 (2261) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 0.74/1.14 (2262) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 0.74/1.14 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.74/1.14 (2263) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 0.74/1.14 , X, T ), Y ) = triple( Z, X, bad ) }.
% 0.74/1.14 (2264) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 0.74/1.14 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.74/1.14 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 0.74/1.14 (2265) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! strictly_less_than
% 0.74/1.14 ( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.74/1.14 remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 0.74/1.14 (2266) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 0.74/1.14 ) = triple( X, create_slb, bad ) }.
% 0.74/1.14 (2267) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 0.74/1.14 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.74/1.14 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.74/1.14 (2268) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.74/1.14 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 0.74/1.14 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 0.74/1.14 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.74/1.14 (2269) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.74/1.14 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 0.74/1.14 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 0.74/1.14 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 0.74/1.14 (2270) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y ) )
% 0.74/1.14 = bottom }.
% 0.74/1.14 (2271) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y,
% 0.74/1.14 X, Z ) ) = findmin_pqp_res( Y ) }.
% 0.74/1.14 (2272) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 0.74/1.14 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 0.74/1.14 (2273) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X )
% 0.74/1.14 }.
% 0.74/1.14 (2274) {G0,W5,D3,L1,V0,M1} { ! ok( triple( skol1, skol2, skol3 ) ) }.
% 0.74/1.14 (2275) {G0,W7,D4,L1,V0,M1} { ok( insert_cpq( triple( skol1, skol2, skol3 )
% 0.74/1.14 , skol4 ) ) }.
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 Total Proof:
% 0.74/1.14
% 0.74/1.14 subsumption: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.14 parent0: (2259) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.14 substitution0:
% 0.74/1.14 X := X
% 0.74/1.14 Y := Y
% 0.74/1.14 end
% 0.74/1.14 permutation0:
% 0.74/1.14 0 ==> 0
% 0.74/1.14 end
% 0.74/1.14
% 0.74/1.14 subsumption: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 0.74/1.14 }.
% 0.74/1.14 parent0: (2261) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 0.74/1.14 substitution0:
% 0.74/1.14 X := X
% 0.74/1.14 Y := Y
% 0.74/1.14 Z := Z
% 0.74/1.14 end
% 0.74/1.14 permutation0:
% 0.74/1.14 0 ==> 0
% 0.74/1.14 1 ==> 1
% 0.74/1.14 end
% 0.74/1.14
% 0.74/1.14 eqswap: (2350) {G0,W17,D5,L1,V4,M1} { triple( insert_pqp( X, T ),
% 0.74/1.14 insert_slb( Y, pair( T, bottom ) ), Z ) = insert_cpq( triple( X, Y, Z ),
% 0.74/1.14 T ) }.
% 0.74/1.14 parent0[0]: (2262) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T
% 0.74/1.14 ) = triple( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z )
% 0.74/1.14 }.
% 0.74/1.14 substitution0:
% 0.74/1.14 X := X
% 0.74/1.14 Y := Y
% 0.74/1.14 Z := Z
% 0.74/1.14 T := T
% 0.74/1.14 end
% 0.74/1.14
% 0.74/1.14 subsumption: (42) {G0,W17,D5,L1,V4,M1} I { triple( insert_pqp( X, T ),
% 0.74/1.14 insert_slb( Y, pair( T, bottom ) ), Z ) ==> insert_cpq( triple( X, Y, Z )
% 0.74/1.17 , T ) }.
% 0.74/1.17 parent0: (2350) {G0,W17,D5,L1,V4,M1} { triple( insert_pqp( X, T ),
% 0.74/1.17 insert_slb( Y, pair( T, bottom ) ), Z ) = insert_cpq( triple( X, Y, Z ),
% 0.74/1.17 T ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Y
% 0.74/1.17 Z := Z
% 0.74/1.17 T := T
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 0 ==> 0
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 subsumption: (54) {G0,W5,D3,L1,V0,M1} I { ! ok( triple( skol1, skol2, skol3
% 0.74/1.17 ) ) }.
% 0.74/1.17 parent0: (2274) {G0,W5,D3,L1,V0,M1} { ! ok( triple( skol1, skol2, skol3 )
% 0.74/1.17 ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 0 ==> 0
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 subsumption: (55) {G0,W7,D4,L1,V0,M1} I { ok( insert_cpq( triple( skol1,
% 0.74/1.17 skol2, skol3 ), skol4 ) ) }.
% 0.74/1.17 parent0: (2275) {G0,W7,D4,L1,V0,M1} { ok( insert_cpq( triple( skol1, skol2
% 0.74/1.17 , skol3 ), skol4 ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 0 ==> 0
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 eqswap: (2441) {G0,W8,D3,L2,V3,M2} { bad = X, ok( triple( Y, Z, X ) ) }.
% 0.74/1.17 parent0[1]: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 0.74/1.17 }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Y
% 0.74/1.17 Z := Z
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 resolution: (2442) {G1,W3,D2,L1,V0,M1} { bad = skol3 }.
% 0.74/1.17 parent0[0]: (54) {G0,W5,D3,L1,V0,M1} I { ! ok( triple( skol1, skol2, skol3
% 0.74/1.17 ) ) }.
% 0.74/1.17 parent1[1]: (2441) {G0,W8,D3,L2,V3,M2} { bad = X, ok( triple( Y, Z, X ) )
% 0.74/1.17 }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 substitution1:
% 0.74/1.17 X := skol3
% 0.74/1.17 Y := skol1
% 0.74/1.17 Z := skol2
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 eqswap: (2443) {G1,W3,D2,L1,V0,M1} { skol3 = bad }.
% 0.74/1.17 parent0[0]: (2442) {G1,W3,D2,L1,V0,M1} { bad = skol3 }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 subsumption: (1281) {G1,W3,D2,L1,V0,M1} R(41,54) { skol3 ==> bad }.
% 0.74/1.17 parent0: (2443) {G1,W3,D2,L1,V0,M1} { skol3 = bad }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 0 ==> 0
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 *** allocated 15000 integers for justifications
% 0.74/1.17 *** allocated 22500 integers for justifications
% 0.74/1.17 *** allocated 75937 integers for termspace/termends
% 0.74/1.17 paramod: (2450) {G1,W12,D4,L2,V2,M2} { ok( insert_cpq( triple( skol1,
% 0.74/1.17 skol2, bad ), skol4 ) ), ok( triple( X, Y, skol3 ) ) }.
% 0.74/1.17 parent0[1]: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 0.74/1.17 }.
% 0.74/1.17 parent1[0; 5]: (55) {G0,W7,D4,L1,V0,M1} I { ok( insert_cpq( triple( skol1,
% 0.74/1.17 skol2, skol3 ), skol4 ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := skol3
% 0.74/1.17 Y := X
% 0.74/1.17 Z := Y
% 0.74/1.17 end
% 0.74/1.17 substitution1:
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 paramod: (4542) {G2,W12,D4,L2,V2,M2} { ok( triple( X, Y, bad ) ), ok(
% 0.74/1.17 insert_cpq( triple( skol1, skol2, bad ), skol4 ) ) }.
% 0.74/1.17 parent0[0]: (1281) {G1,W3,D2,L1,V0,M1} R(41,54) { skol3 ==> bad }.
% 0.74/1.17 parent1[1; 4]: (2450) {G1,W12,D4,L2,V2,M2} { ok( insert_cpq( triple( skol1
% 0.74/1.17 , skol2, bad ), skol4 ) ), ok( triple( X, Y, skol3 ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 substitution1:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Y
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 resolution: (4543) {G1,W7,D4,L1,V0,M1} { ok( insert_cpq( triple( skol1,
% 0.74/1.17 skol2, bad ), skol4 ) ) }.
% 0.74/1.17 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.17 parent1[0]: (4542) {G2,W12,D4,L2,V2,M2} { ok( triple( X, Y, bad ) ), ok(
% 0.74/1.17 insert_cpq( triple( skol1, skol2, bad ), skol4 ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Y
% 0.74/1.17 end
% 0.74/1.17 substitution1:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Y
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 subsumption: (1392) {G2,W7,D4,L1,V0,M1} P(41,55);d(1281);r(39) { ok(
% 0.74/1.17 insert_cpq( triple( skol1, skol2, bad ), skol4 ) ) }.
% 0.74/1.17 parent0: (4543) {G1,W7,D4,L1,V0,M1} { ok( insert_cpq( triple( skol1, skol2
% 0.74/1.17 , bad ), skol4 ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 0 ==> 0
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 paramod: (4545) {G1,W7,D4,L1,V3,M1} { ! ok( insert_cpq( triple( X, Z, bad
% 0.74/1.17 ), Y ) ) }.
% 0.74/1.17 parent0[0]: (42) {G0,W17,D5,L1,V4,M1} I { triple( insert_pqp( X, T ),
% 0.74/1.17 insert_slb( Y, pair( T, bottom ) ), Z ) ==> insert_cpq( triple( X, Y, Z )
% 0.74/1.17 , T ) }.
% 0.74/1.17 parent1[0; 2]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Z
% 0.74/1.17 Z := bad
% 0.74/1.17 T := Y
% 0.74/1.17 end
% 0.74/1.17 substitution1:
% 0.74/1.17 X := insert_pqp( X, Y )
% 0.74/1.17 Y := insert_slb( Z, pair( Y, bottom ) )
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 subsumption: (2217) {G1,W7,D4,L1,V3,M1} P(42,39) { ! ok( insert_cpq( triple
% 0.74/1.17 ( X, Z, bad ), Y ) ) }.
% 0.74/1.17 parent0: (4545) {G1,W7,D4,L1,V3,M1} { ! ok( insert_cpq( triple( X, Z, bad
% 0.74/1.17 ), Y ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := X
% 0.74/1.17 Y := Y
% 0.74/1.17 Z := Z
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 0 ==> 0
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 resolution: (4546) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.17 parent0[0]: (2217) {G1,W7,D4,L1,V3,M1} P(42,39) { ! ok( insert_cpq( triple
% 0.74/1.17 ( X, Z, bad ), Y ) ) }.
% 0.74/1.17 parent1[0]: (1392) {G2,W7,D4,L1,V0,M1} P(41,55);d(1281);r(39) { ok(
% 0.74/1.17 insert_cpq( triple( skol1, skol2, bad ), skol4 ) ) }.
% 0.74/1.17 substitution0:
% 0.74/1.17 X := skol1
% 0.74/1.17 Y := skol4
% 0.74/1.17 Z := skol2
% 0.74/1.17 end
% 0.74/1.17 substitution1:
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 subsumption: (2218) {G3,W0,D0,L0,V0,M0} R(2217,1392) { }.
% 0.74/1.17 parent0: (4546) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.17 substitution0:
% 0.74/1.17 end
% 0.74/1.17 permutation0:
% 0.74/1.17 end
% 0.74/1.17
% 0.74/1.17 Proof check complete!
% 0.74/1.17
% 0.74/1.17 Memory use:
% 0.74/1.17
% 0.74/1.17 space for terms: 38553
% 0.74/1.17 space for clauses: 120160
% 0.74/1.17
% 0.74/1.17
% 0.74/1.17 clauses generated: 4158
% 0.74/1.17 clauses kept: 2219
% 0.74/1.17 clauses selected: 139
% 0.74/1.17 clauses deleted: 6
% 0.74/1.17 clauses inuse deleted: 3
% 0.74/1.17
% 0.74/1.17 subsentry: 13506
% 0.74/1.17 literals s-matched: 7642
% 0.74/1.17 literals matched: 7566
% 0.74/1.17 full subsumption: 1253
% 0.74/1.17
% 0.74/1.17 checksum: 1050224667
% 0.74/1.17
% 0.74/1.17
% 0.74/1.17 Bliksem ended
%------------------------------------------------------------------------------