TSTP Solution File: SWV374+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV374+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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 1.62s 2.04s
% Output : Refutation 1.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV374+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Wed Jun 15 18:19:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.12 *** allocated 10000 integers for termspace/termends
% 0.70/1.12 *** allocated 10000 integers for clauses
% 0.70/1.12 *** allocated 10000 integers for justifications
% 0.70/1.12 Bliksem 1.12
% 0.70/1.12
% 0.70/1.12
% 0.70/1.12 Automatic Strategy Selection
% 0.70/1.12
% 0.70/1.12
% 0.70/1.12 Clauses:
% 0.70/1.12
% 0.70/1.12 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.70/1.12 { less_than( X, Y ), less_than( Y, X ) }.
% 0.70/1.12 { less_than( X, X ) }.
% 0.70/1.12 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.70/1.12 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.70/1.12 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.70/1.12 { less_than( bottom, X ) }.
% 0.70/1.12 { ! isnonempty_slb( create_slb ) }.
% 0.70/1.12 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.70/1.12 { ! contains_slb( create_slb, X ) }.
% 0.70/1.12 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.70/1.12 , Y = Z }.
% 0.70/1.12 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.70/1.12 }.
% 0.70/1.12 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.70/1.12 { ! pair_in_list( create_slb, X, Y ) }.
% 0.70/1.12 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.70/1.12 , U ), alpha1( Y, Z, T, U ) }.
% 0.70/1.12 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.70/1.12 , U ) }.
% 0.70/1.12 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.70/1.12 ) }.
% 0.70/1.12 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.70/1.12 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.70/1.12 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.70/1.12 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.70/1.12 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.70/1.12 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.70/1.12 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.70/1.12 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.70/1.12 , Z ) = lookup_slb( X, Z ) }.
% 0.70/1.12 { update_slb( create_slb, X ) = create_slb }.
% 0.70/1.12 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.70/1.12 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.70/1.12 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.70/1.12 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.70/1.12 { succ_cpq( X, X ) }.
% 0.70/1.12 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.70/1.12 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.70/1.12 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.70/1.12 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.70/1.12 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.70/1.12 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.70/1.12 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.70/1.12 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.70/1.12 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.70/1.12 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.70/1.12 ( X, Y ) ), U ) ) }.
% 0.70/1.12 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.70/1.12 pair( X, Y ) ), U ) ) }.
% 0.70/1.12 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.70/1.12 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.70/1.12 { ! ok( triple( X, Y, bad ) ) }.
% 0.70/1.12 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.70/1.12 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.70/1.12 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.70/1.12 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.70/1.12 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.70/1.12 bad ) }.
% 0.70/1.12 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.70/1.12 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.70/1.12 , T ) }.
% 0.70/1.12 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.70/1.12 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.70/1.12 remove_slb( X, Y ), bad ) }.
% 0.70/1.12 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.70/1.12 bad ) }.
% 0.70/1.12 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.70/1.12 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.70/1.12 , bad ) }.
% 0.70/1.12 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.70/1.12 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.70/1.12 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.70/1.12 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.70/1.12 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.70/1.12 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 1.62/2.03 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 1.62/2.03 findmin_pqp_res( X ) ), Z ) }.
% 1.62/2.03 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 1.62/2.03 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 1.62/2.03 ) }.
% 1.62/2.03 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 1.62/2.03 findmin_cpq_res( X ) ) }.
% 1.62/2.03 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 1.62/2.03 { ok( findmin_cpq_eff( triple( skol1, skol2, skol3 ) ) ) }.
% 1.62/2.03 { skol2 = create_slb, ! contains_slb( skol2, findmin_pqp_res( skol1 ) ), !
% 1.62/2.03 less_than( lookup_slb( skol2, findmin_pqp_res( skol1 ) ), findmin_pqp_res
% 1.62/2.03 ( skol1 ) ) }.
% 1.62/2.03
% 1.62/2.03 percentage equality = 0.294643, percentage horn = 0.785714
% 1.62/2.03 This is a problem with some equality
% 1.62/2.03
% 1.62/2.03
% 1.62/2.03
% 1.62/2.03 Options Used:
% 1.62/2.03
% 1.62/2.03 useres = 1
% 1.62/2.03 useparamod = 1
% 1.62/2.03 useeqrefl = 1
% 1.62/2.03 useeqfact = 1
% 1.62/2.03 usefactor = 1
% 1.62/2.03 usesimpsplitting = 0
% 1.62/2.03 usesimpdemod = 5
% 1.62/2.03 usesimpres = 3
% 1.62/2.03
% 1.62/2.03 resimpinuse = 1000
% 1.62/2.03 resimpclauses = 20000
% 1.62/2.03 substype = eqrewr
% 1.62/2.03 backwardsubs = 1
% 1.62/2.03 selectoldest = 5
% 1.62/2.03
% 1.62/2.03 litorderings [0] = split
% 1.62/2.03 litorderings [1] = extend the termordering, first sorting on arguments
% 1.62/2.03
% 1.62/2.03 termordering = kbo
% 1.62/2.03
% 1.62/2.03 litapriori = 0
% 1.62/2.03 termapriori = 1
% 1.62/2.03 litaposteriori = 0
% 1.62/2.03 termaposteriori = 0
% 1.62/2.03 demodaposteriori = 0
% 1.62/2.03 ordereqreflfact = 0
% 1.62/2.03
% 1.62/2.03 litselect = negord
% 1.62/2.03
% 1.62/2.03 maxweight = 15
% 1.62/2.03 maxdepth = 30000
% 1.62/2.03 maxlength = 115
% 1.62/2.03 maxnrvars = 195
% 1.62/2.03 excuselevel = 1
% 1.62/2.03 increasemaxweight = 1
% 1.62/2.03
% 1.62/2.03 maxselected = 10000000
% 1.62/2.03 maxnrclauses = 10000000
% 1.62/2.03
% 1.62/2.03 showgenerated = 0
% 1.62/2.03 showkept = 0
% 1.62/2.03 showselected = 0
% 1.62/2.03 showdeleted = 0
% 1.62/2.03 showresimp = 1
% 1.62/2.03 showstatus = 2000
% 1.62/2.03
% 1.62/2.03 prologoutput = 0
% 1.62/2.03 nrgoals = 5000000
% 1.62/2.03 totalproof = 1
% 1.62/2.03
% 1.62/2.03 Symbols occurring in the translation:
% 1.62/2.03
% 1.62/2.03 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.62/2.03 . [1, 2] (w:1, o:30, a:1, s:1, b:0),
% 1.62/2.03 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 1.62/2.03 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 1.62/2.03 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.62/2.03 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.62/2.03 less_than [38, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.62/2.03 strictly_less_than [39, 2] (w:1, o:58, a:1, s:1, b:0),
% 1.62/2.03 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.62/2.03 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 1.62/2.03 isnonempty_slb [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.62/2.03 pair [43, 2] (w:1, o:59, a:1, s:1, b:0),
% 1.62/2.03 insert_slb [44, 2] (w:1, o:60, a:1, s:1, b:0),
% 1.62/2.03 contains_slb [45, 2] (w:1, o:61, a:1, s:1, b:0),
% 1.62/2.03 pair_in_list [47, 3] (w:1, o:68, a:1, s:1, b:0),
% 1.62/2.03 remove_slb [49, 2] (w:1, o:55, a:1, s:1, b:0),
% 1.62/2.03 lookup_slb [50, 2] (w:1, o:62, a:1, s:1, b:0),
% 1.62/2.03 update_slb [51, 2] (w:1, o:63, a:1, s:1, b:0),
% 1.62/2.03 succ_cpq [52, 2] (w:1, o:64, a:1, s:1, b:0),
% 1.62/2.03 insert_cpq [53, 2] (w:1, o:65, a:1, s:1, b:0),
% 1.62/2.03 remove_cpq [54, 2] (w:1, o:56, a:1, s:1, b:0),
% 1.62/2.03 findmin_cpq_eff [55, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.62/2.03 removemin_cpq_eff [56, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.62/2.03 triple [57, 3] (w:1, o:69, a:1, s:1, b:0),
% 1.62/2.03 check_cpq [58, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.62/2.03 contains_cpq [59, 2] (w:1, o:66, a:1, s:1, b:0),
% 1.62/2.03 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.62/2.03 ok [61, 1] (w:1, o:26, a:1, s:1, b:0),
% 1.62/2.03 insert_pqp [62, 2] (w:1, o:67, a:1, s:1, b:0),
% 1.62/2.03 remove_pqp [63, 2] (w:1, o:57, a:1, s:1, b:0),
% 1.62/2.03 findmin_pqp_res [64, 1] (w:1, o:27, a:1, s:1, b:0),
% 1.62/2.03 findmin_cpq_res [65, 1] (w:1, o:28, a:1, s:1, b:0),
% 1.62/2.03 removemin_cpq_res [66, 1] (w:1, o:29, a:1, s:1, b:0),
% 1.62/2.03 alpha1 [67, 4] (w:1, o:70, a:1, s:1, b:1),
% 1.62/2.03 skol1 [68, 0] (w:1, o:14, a:1, s:1, b:1),
% 1.62/2.03 skol2 [69, 0] (w:1, o:15, a:1, s:1, b:1),
% 1.62/2.03 skol3 [70, 0] (w:1, o:16, a:1, s:1, b:1).
% 1.62/2.03
% 1.62/2.03
% 1.62/2.03 Starting Search:
% 1.62/2.03
% 1.62/2.03 *** allocated 15000 integers for clauses
% 1.62/2.03 *** allocated 22500 integers for clauses
% 1.62/2.03 *** allocated 33750 integers for clauses
% 1.62/2.03 *** allocated 50625 integers for clauses
% 1.62/2.03 *** allocated 15000 integers for termspace/termends
% 1.62/2.03 *** allocated 22500 integers for termspace/termends
% 1.62/2.03 *** allocated 75937 integers for clauses
% 1.62/2.03 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 33750 integers for termspace/termends
% 1.62/2.04 *** allocated 113905 integers for clauses
% 1.62/2.04 *** allocated 50625 integers for termspace/termends
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 3815
% 1.62/2.04 Kept: 2013
% 1.62/2.04 Inuse: 130
% 1.62/2.04 Deleted: 4
% 1.62/2.04 Deletedinuse: 1
% 1.62/2.04
% 1.62/2.04 *** allocated 170857 integers for clauses
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 75937 integers for termspace/termends
% 1.62/2.04 *** allocated 256285 integers for clauses
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 113905 integers for termspace/termends
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 9122
% 1.62/2.04 Kept: 4025
% 1.62/2.04 Inuse: 186
% 1.62/2.04 Deleted: 8
% 1.62/2.04 Deletedinuse: 3
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 384427 integers for clauses
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 18459
% 1.62/2.04 Kept: 6048
% 1.62/2.04 Inuse: 259
% 1.62/2.04 Deleted: 10
% 1.62/2.04 Deletedinuse: 4
% 1.62/2.04
% 1.62/2.04 *** allocated 170857 integers for termspace/termends
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 576640 integers for clauses
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 31396
% 1.62/2.04 Kept: 8053
% 1.62/2.04 Inuse: 333
% 1.62/2.04 Deleted: 10
% 1.62/2.04 Deletedinuse: 4
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 41022
% 1.62/2.04 Kept: 10062
% 1.62/2.04 Inuse: 397
% 1.62/2.04 Deleted: 10
% 1.62/2.04 Deletedinuse: 4
% 1.62/2.04
% 1.62/2.04 *** allocated 256285 integers for termspace/termends
% 1.62/2.04 *** allocated 864960 integers for clauses
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 54398
% 1.62/2.04 Kept: 12858
% 1.62/2.04 Inuse: 446
% 1.62/2.04 Deleted: 15
% 1.62/2.04 Deletedinuse: 7
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 77072
% 1.62/2.04 Kept: 14867
% 1.62/2.04 Inuse: 544
% 1.62/2.04 Deleted: 18
% 1.62/2.04 Deletedinuse: 7
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 384427 integers for termspace/termends
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 97620
% 1.62/2.04 Kept: 16868
% 1.62/2.04 Inuse: 659
% 1.62/2.04 Deleted: 18
% 1.62/2.04 Deletedinuse: 7
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 *** allocated 1297440 integers for clauses
% 1.62/2.04
% 1.62/2.04 Intermediate Status:
% 1.62/2.04 Generated: 110025
% 1.62/2.04 Kept: 19060
% 1.62/2.04 Inuse: 702
% 1.62/2.04 Deleted: 22
% 1.62/2.04 Deletedinuse: 7
% 1.62/2.04
% 1.62/2.04 Resimplifying inuse:
% 1.62/2.04 Done
% 1.62/2.04
% 1.62/2.04 Resimplifying clauses:
% 1.62/2.04
% 1.62/2.04 Bliksems!, er is een bewijs:
% 1.62/2.04 % SZS status Theorem
% 1.62/2.04 % SZS output start Refutation
% 1.62/2.04
% 1.62/2.04 (1) {G0,W6,D2,L2,V2,M2} I { less_than( X, Y ), less_than( Y, X ) }.
% 1.62/2.04 (5) {G1,W6,D2,L2,V2,M2} I;r(1) { less_than( Y, X ), strictly_less_than( X,
% 1.62/2.04 Y ) }.
% 1.62/2.04 (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X ) }.
% 1.62/2.04 (18) {G0,W8,D2,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), Z = T }.
% 1.62/2.04 (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 1.62/2.04 (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.62/2.04 (46) {G0,W10,D4,L1,V2,M1} I { findmin_cpq_eff( triple( X, create_slb, Y ) )
% 1.62/2.04 ==> triple( X, create_slb, bad ) }.
% 1.62/2.04 (47) {G0,W20,D5,L3,V3,M3} I { Y = create_slb, contains_slb( Y,
% 1.62/2.04 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 1.62/2.04 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.62/2.04 (48) {G0,W27,D5,L4,V3,M4} I { Y = create_slb, ! contains_slb( Y,
% 1.62/2.04 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 1.62/2.04 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 1.62/2.04 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.62/2.04 (54) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple( skol1, skol2,
% 1.62/2.04 skol3 ) ) ) }.
% 1.62/2.04 (55) {G0,W14,D4,L3,V0,M3} I { skol2 ==> create_slb, ! contains_slb( skol2,
% 1.62/2.04 findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb( skol2,
% 1.62/2.04 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 1.62/2.04 (667) {G1,W8,D2,L2,V4,M2} P(18,9) { ! contains_slb( X, Y ), ! alpha1( Z, T
% 1.62/2.04 , create_slb, X ) }.
% 1.62/2.04 (981) {G2,W9,D2,L3,V4,M3} R(667,19) { ! contains_slb( X, Y ), ! Z = T, !
% 1.62/2.04 create_slb = X }.
% 1.62/2.04 (984) {G3,W6,D2,L2,V2,M2} F(981) { ! contains_slb( X, Y ), ! create_slb = X
% 1.62/2.04 }.
% 1.62/2.04 (2953) {G1,W7,D3,L2,V0,M2} P(47,54);r(39) { skol2 ==> create_slb,
% 1.62/2.04 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 1.62/2.04 (2984) {G2,W4,D3,L1,V0,M1} P(2953,54);d(46);r(39) { contains_slb( skol2,
% 1.62/2.04 findmin_pqp_res( skol1 ) ) }.
% 1.62/2.04 (2989) {G4,W3,D2,L1,V0,M1} R(2984,984) { ! skol2 ==> create_slb }.
% 1.62/2.04 (3233) {G1,W14,D4,L3,V0,M3} P(48,54);r(39) { skol2 ==> create_slb, !
% 1.62/2.04 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 1.62/2.04 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 1.62/2.04 }.
% 1.62/2.04 (3950) {G5,W7,D4,L1,V0,M1} S(55);r(2989);r(2984) { ! less_than( lookup_slb
% 1.62/2.04 ( skol2, findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 1.62/2.04 (3977) {G6,W7,D4,L1,V0,M1} R(3950,5) { strictly_less_than( findmin_pqp_res
% 1.62/2.04 ( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) ) }.
% 1.62/2.04 (20011) {G7,W0,D0,L0,V0,M0} S(3233);r(2989);r(2984);r(3977) { }.
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 % SZS output end Refutation
% 1.62/2.04 found a proof!
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Unprocessed initial clauses:
% 1.62/2.04
% 1.62/2.04 (20013) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 1.62/2.04 less_than( X, Y ) }.
% 1.62/2.04 (20014) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 1.62/2.04 (20015) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 1.62/2.04 (20016) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X,
% 1.62/2.04 Y ) }.
% 1.62/2.04 (20017) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 1.62/2.04 , X ) }.
% 1.62/2.04 (20018) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 1.62/2.04 strictly_less_than( X, Y ) }.
% 1.62/2.04 (20019) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 1.62/2.04 (20020) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 1.62/2.04 (20021) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z )
% 1.62/2.04 ) ) }.
% 1.62/2.04 (20022) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 1.62/2.04 (20023) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 1.62/2.04 ), Z ), contains_slb( X, Z ), Y = Z }.
% 1.62/2.04 (20024) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 1.62/2.04 insert_slb( X, pair( Y, T ) ), Z ) }.
% 1.62/2.04 (20025) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair
% 1.62/2.04 ( Y, T ) ), Z ) }.
% 1.62/2.04 (20026) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 1.62/2.04 (20027) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 1.62/2.04 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 1.62/2.04 (20028) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 1.62/2.04 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.62/2.04 (20029) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 1.62/2.04 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.62/2.04 (20030) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 1.62/2.04 (20031) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 1.62/2.04 (20032) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 1.62/2.04 (20033) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.62/2.04 ) = X }.
% 1.62/2.04 (20034) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 1.62/2.04 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 1.62/2.04 ( Y, T ) ) }.
% 1.62/2.04 (20035) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.62/2.04 ) = Z }.
% 1.62/2.04 (20036) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 1.62/2.04 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 1.62/2.04 (20037) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 1.62/2.04 (20038) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 1.62/2.04 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 1.62/2.04 ( T, X ) ) }.
% 1.62/2.04 (20039) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 1.62/2.04 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 1.62/2.04 }.
% 1.62/2.04 (20040) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 1.62/2.04 (20041) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq
% 1.62/2.04 ( Y, Z ) ) }.
% 1.62/2.04 (20042) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq
% 1.62/2.04 ( Y, Z ) ) }.
% 1.62/2.04 (20043) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.62/2.04 findmin_cpq_eff( Y ) ) }.
% 1.62/2.04 (20044) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.62/2.04 removemin_cpq_eff( Y ) ) }.
% 1.62/2.04 (20045) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 1.62/2.04 (20046) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.62/2.04 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 1.62/2.04 }.
% 1.62/2.04 (20047) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.62/2.04 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 1.62/2.04 }.
% 1.62/2.04 (20048) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 1.62/2.04 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.62/2.04 (20049) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 1.62/2.04 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.62/2.04 (20050) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 1.62/2.04 contains_slb( Y, T ) }.
% 1.62/2.04 (20051) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 1.62/2.04 ( X, Y, Z ), T ) }.
% 1.62/2.04 (20052) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 1.62/2.04 (20053) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 1.62/2.04 (20054) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 1.62/2.04 (20055) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 1.62/2.04 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 1.62/2.04 (20056) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 1.62/2.04 , X, T ), Y ) = triple( Z, X, bad ) }.
% 1.62/2.04 (20057) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 1.62/2.04 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 1.62/2.04 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 1.62/2.04 (20058) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), !
% 1.62/2.04 strictly_less_than( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T
% 1.62/2.04 ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 1.62/2.04 (20059) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 1.62/2.04 ) = triple( X, create_slb, bad ) }.
% 1.62/2.04 (20060) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 1.62/2.04 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 1.62/2.04 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.62/2.04 (20061) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.62/2.04 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 1.62/2.04 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 1.62/2.04 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.62/2.04 (20062) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.62/2.04 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 1.62/2.04 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 1.62/2.04 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 1.62/2.04 (20063) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y )
% 1.62/2.04 ) = bottom }.
% 1.62/2.04 (20064) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y
% 1.62/2.04 , X, Z ) ) = findmin_pqp_res( Y ) }.
% 1.62/2.04 (20065) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 1.62/2.04 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 1.62/2.04 (20066) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X
% 1.62/2.04 ) }.
% 1.62/2.04 (20067) {G0,W6,D4,L1,V0,M1} { ok( findmin_cpq_eff( triple( skol1, skol2,
% 1.62/2.04 skol3 ) ) ) }.
% 1.62/2.04 (20068) {G0,W14,D4,L3,V0,M3} { skol2 = create_slb, ! contains_slb( skol2,
% 1.62/2.04 findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb( skol2,
% 1.62/2.04 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 1.62/2.04
% 1.62/2.04
% 1.62/2.04 Total Proof:
% 1.62/2.04
% 1.62/2.04 subsumption: (1) {G0,W6,D2,L2,V2,M2} I { less_than( X, Y ), less_than( Y, X
% 1.62/2.04 ) }.
% 1.62/2.04 parent0: (20014) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X
% 1.62/2.04 ) }.
% 1.62/2.04 substitution0:
% 1.62/2.04 X := X
% 1.62/2.04 Y := Y
% 1.62/2.04 end
% 1.62/2.04 permutation0:
% 1.62/2.04 0 ==> 0
% 1.62/2.04 1 ==> 1
% 1.62/2.04 end
% 1.62/2.04
% 1.62/2.04 resolution: (20078) {G1,W9,D2,L3,V2,M3} { less_than( Y, X ),
% 1.62/2.04 strictly_less_than( X, Y ), less_than( Y, X ) }.
% 1.62/2.04 parent0[0]: (20018) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than(
% 1.62/2.04 Y, X ), strictly_less_than( X, Y ) }.
% 1.62/2.04 parent1[0]: (1) {G0,W6,D2,L2,V2,M2} I { less_than( X, Y ), less_than( Y, X
% 1.62/2.04 ) }.
% 1.62/2.04 substitution0:
% 1.62/2.04 X := X
% 1.62/2.04 Y := Y
% 1.62/2.04 end
% 1.62/2.04 substitution1:
% 1.62/2.04 X := X
% 1.62/2.04 Y := Y
% 1.62/2.04 end
% 1.62/2.04
% 1.62/2.04 factor: (20079) {G1,W6,D2,L2,V2,M2} { less_than( X, Y ),
% 1.62/2.04 strictly_less_than( Y, X ) }.
% 1.62/2.04 parent0[0, 2]: (20078) {G1,W9,D2,L3,V2,M3} { less_than( Y, X ),
% 1.62/2.04 strictly_less_than( X, Y ), less_than( Y, X ) }.
% 1.62/2.04 substitution0:
% 1.62/2.04 X := Y
% 1.62/2.04 Y := X
% 1.62/2.04 end
% 1.62/2.04
% 1.62/2.04 subsumption: (5) {G1,W6,D2,L2,V2,M2} I;r(1) { less_than( Y, X ),
% 1.62/2.04 strictly_less_than( X, Y ) }.
% 1.62/2.04 parent0: (20079) {G1,W6,D2,L2,V2,M2} { less_than( X, Y ),
% 1.62/2.04 strictly_less_than( Y, X ) }.
% 1.62/2.04 substitution0:
% 1.62/2.04 X := Y
% 1.62/2.04 Y := X
% 1.62/2.04 end
% 1.62/2.04 permutation0:
% 1.62/2.04 0 ==> 0
% 1.62/2.04 1 ==> 1
% 1.62/2.04 end
% 1.62/2.04
% 1.62/2.04 subsumption: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 1.62/2.04 }.
% 1.62/2.04 parent0: (20022) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (18) {G0,W8,D2,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), Z = T }.
% 7.15/7.51 parent0: (20031) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := Z
% 7.15/7.51 T := T
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y,
% 7.15/7.51 Z, T ) }.
% 7.15/7.51 parent0: (20032) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z
% 7.15/7.51 , T ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := Z
% 7.15/7.51 T := T
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 2 ==> 2
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 7.15/7.51 parent0: (20052) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (46) {G0,W10,D4,L1,V2,M1} I { findmin_cpq_eff( triple( X,
% 7.15/7.51 create_slb, Y ) ) ==> triple( X, create_slb, bad ) }.
% 7.15/7.51 parent0: (20059) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X,
% 7.15/7.51 create_slb, Y ) ) = triple( X, create_slb, bad ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (47) {G0,W20,D5,L3,V3,M3} I { Y = create_slb, contains_slb( Y
% 7.15/7.51 , findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple(
% 7.15/7.51 X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 7.15/7.51 parent0: (20060) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 7.15/7.51 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 7.15/7.51 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := Z
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 2 ==> 2
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (48) {G0,W27,D5,L4,V3,M4} I { Y = create_slb, ! contains_slb(
% 7.15/7.51 Y, findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 7.15/7.51 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 7.15/7.51 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 7.15/7.51 parent0: (20061) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y
% 7.15/7.51 , findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 7.15/7.51 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 7.15/7.51 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := Z
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 2 ==> 2
% 7.15/7.51 3 ==> 3
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (54) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 7.15/7.51 skol1, skol2, skol3 ) ) ) }.
% 7.15/7.51 parent0: (20067) {G0,W6,D4,L1,V0,M1} { ok( findmin_cpq_eff( triple( skol1
% 7.15/7.51 , skol2, skol3 ) ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (55) {G0,W14,D4,L3,V0,M3} I { skol2 ==> create_slb, !
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0: (20068) {G0,W14,D4,L3,V0,M3} { skol2 = create_slb, ! contains_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 2 ==> 2
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 *** allocated 15000 integers for justifications
% 7.15/7.51 *** allocated 22500 integers for justifications
% 7.15/7.51 *** allocated 33750 integers for justifications
% 7.15/7.51 *** allocated 50625 integers for justifications
% 7.15/7.51 *** allocated 75937 integers for justifications
% 7.15/7.51 paramod: (20770) {G1,W8,D2,L2,V4,M2} { ! contains_slb( Y, X ), ! alpha1( Z
% 7.15/7.51 , T, create_slb, Y ) }.
% 7.15/7.51 parent0[1]: (18) {G0,W8,D2,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), Z = T }.
% 7.15/7.51 parent1[0; 2]: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 7.15/7.51 }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := Z
% 7.15/7.51 Y := T
% 7.15/7.51 Z := create_slb
% 7.15/7.51 T := Y
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 X := X
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (667) {G1,W8,D2,L2,V4,M2} P(18,9) { ! contains_slb( X, Y ), !
% 7.15/7.51 alpha1( Z, T, create_slb, X ) }.
% 7.15/7.51 parent0: (20770) {G1,W8,D2,L2,V4,M2} { ! contains_slb( Y, X ), ! alpha1( Z
% 7.15/7.51 , T, create_slb, Y ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := Y
% 7.15/7.51 Y := X
% 7.15/7.51 Z := Z
% 7.15/7.51 T := T
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 eqswap: (21224) {G0,W11,D2,L3,V4,M3} { ! Y = X, ! Z = T, alpha1( X, Y, Z,
% 7.15/7.51 T ) }.
% 7.15/7.51 parent0[0]: (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y, Z
% 7.15/7.51 , T ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := Z
% 7.15/7.51 T := T
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21227) {G1,W9,D2,L3,V4,M3} { ! contains_slb( X, Y ), ! T = Z
% 7.15/7.51 , ! create_slb = X }.
% 7.15/7.51 parent0[1]: (667) {G1,W8,D2,L2,V4,M2} P(18,9) { ! contains_slb( X, Y ), !
% 7.15/7.51 alpha1( Z, T, create_slb, X ) }.
% 7.15/7.51 parent1[2]: (21224) {G0,W11,D2,L3,V4,M3} { ! Y = X, ! Z = T, alpha1( X, Y
% 7.15/7.51 , Z, T ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := Z
% 7.15/7.51 T := T
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 X := Z
% 7.15/7.51 Y := T
% 7.15/7.51 Z := create_slb
% 7.15/7.51 T := X
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (981) {G2,W9,D2,L3,V4,M3} R(667,19) { ! contains_slb( X, Y ),
% 7.15/7.51 ! Z = T, ! create_slb = X }.
% 7.15/7.51 parent0: (21227) {G1,W9,D2,L3,V4,M3} { ! contains_slb( X, Y ), ! T = Z, !
% 7.15/7.51 create_slb = X }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := T
% 7.15/7.51 T := Z
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 2 ==> 2
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 factor: (21232) {G2,W6,D2,L2,V2,M2} { ! contains_slb( X, Y ), ! create_slb
% 7.15/7.51 = X }.
% 7.15/7.51 parent0[1, 2]: (981) {G2,W9,D2,L3,V4,M3} R(667,19) { ! contains_slb( X, Y )
% 7.15/7.51 , ! Z = T, ! create_slb = X }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 Z := create_slb
% 7.15/7.51 T := X
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (984) {G3,W6,D2,L2,V2,M2} F(981) { ! contains_slb( X, Y ), !
% 7.15/7.51 create_slb = X }.
% 7.15/7.51 parent0: (21232) {G2,W6,D2,L2,V2,M2} { ! contains_slb( X, Y ), !
% 7.15/7.51 create_slb = X }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 eqswap: (21234) {G0,W20,D5,L3,V3,M3} { create_slb = X, contains_slb( X,
% 7.15/7.51 findmin_pqp_res( Y ) ), findmin_cpq_eff( triple( Y, X, Z ) ) = triple( Y
% 7.15/7.51 , update_slb( X, findmin_pqp_res( Y ) ), bad ) }.
% 7.15/7.51 parent0[0]: (47) {G0,W20,D5,L3,V3,M3} I { Y = create_slb, contains_slb( Y,
% 7.15/7.51 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 7.15/7.51 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := Y
% 7.15/7.51 Y := X
% 7.15/7.51 Z := Z
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 paramod: (21237) {G1,W15,D5,L3,V0,M3} { ok( triple( skol1, update_slb(
% 7.15/7.51 skol2, findmin_pqp_res( skol1 ) ), bad ) ), create_slb = skol2,
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[2]: (21234) {G0,W20,D5,L3,V3,M3} { create_slb = X, contains_slb( X
% 7.15/7.51 , findmin_pqp_res( Y ) ), findmin_cpq_eff( triple( Y, X, Z ) ) = triple(
% 7.15/7.51 Y, update_slb( X, findmin_pqp_res( Y ) ), bad ) }.
% 7.15/7.51 parent1[0; 1]: (54) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 7.15/7.51 skol1, skol2, skol3 ) ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol2
% 7.15/7.51 Y := skol1
% 7.15/7.51 Z := skol3
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21372) {G1,W7,D3,L2,V0,M2} { create_slb = skol2, contains_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 7.15/7.51 parent1[0]: (21237) {G1,W15,D5,L3,V0,M3} { ok( triple( skol1, update_slb(
% 7.15/7.51 skol2, findmin_pqp_res( skol1 ) ), bad ) ), create_slb = skol2,
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol1
% 7.15/7.51 Y := update_slb( skol2, findmin_pqp_res( skol1 ) )
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 eqswap: (21373) {G1,W7,D3,L2,V0,M2} { skol2 = create_slb, contains_slb(
% 7.15/7.51 skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[0]: (21372) {G1,W7,D3,L2,V0,M2} { create_slb = skol2, contains_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (2953) {G1,W7,D3,L2,V0,M2} P(47,54);r(39) { skol2 ==>
% 7.15/7.51 create_slb, contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0: (21373) {G1,W7,D3,L2,V0,M2} { skol2 = create_slb, contains_slb(
% 7.15/7.51 skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 paramod: (21376) {G1,W10,D4,L2,V0,M2} { ok( findmin_cpq_eff( triple( skol1
% 7.15/7.51 , create_slb, skol3 ) ) ), contains_slb( skol2, findmin_pqp_res( skol1 )
% 7.15/7.51 ) }.
% 7.15/7.51 parent0[0]: (2953) {G1,W7,D3,L2,V0,M2} P(47,54);r(39) { skol2 ==>
% 7.15/7.51 create_slb, contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent1[0; 4]: (54) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 7.15/7.51 skol1, skol2, skol3 ) ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 paramod: (21387) {G1,W9,D3,L2,V0,M2} { ok( triple( skol1, create_slb, bad
% 7.15/7.51 ) ), contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[0]: (46) {G0,W10,D4,L1,V2,M1} I { findmin_cpq_eff( triple( X,
% 7.15/7.51 create_slb, Y ) ) ==> triple( X, create_slb, bad ) }.
% 7.15/7.51 parent1[0; 1]: (21376) {G1,W10,D4,L2,V0,M2} { ok( findmin_cpq_eff( triple
% 7.15/7.51 ( skol1, create_slb, skol3 ) ) ), contains_slb( skol2, findmin_pqp_res(
% 7.15/7.51 skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol1
% 7.15/7.51 Y := skol3
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21388) {G1,W4,D3,L1,V0,M1} { contains_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 7.15/7.51 parent1[0]: (21387) {G1,W9,D3,L2,V0,M2} { ok( triple( skol1, create_slb,
% 7.15/7.51 bad ) ), contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol1
% 7.15/7.51 Y := create_slb
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (2984) {G2,W4,D3,L1,V0,M1} P(2953,54);d(46);r(39) {
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0: (21388) {G1,W4,D3,L1,V0,M1} { contains_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 eqswap: (21389) {G3,W6,D2,L2,V2,M2} { ! X = create_slb, ! contains_slb( X
% 7.15/7.51 , Y ) }.
% 7.15/7.51 parent0[1]: (984) {G3,W6,D2,L2,V2,M2} F(981) { ! contains_slb( X, Y ), !
% 7.15/7.51 create_slb = X }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := X
% 7.15/7.51 Y := Y
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21390) {G3,W3,D2,L1,V0,M1} { ! skol2 = create_slb }.
% 7.15/7.51 parent0[1]: (21389) {G3,W6,D2,L2,V2,M2} { ! X = create_slb, ! contains_slb
% 7.15/7.51 ( X, Y ) }.
% 7.15/7.51 parent1[0]: (2984) {G2,W4,D3,L1,V0,M1} P(2953,54);d(46);r(39) {
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol2
% 7.15/7.51 Y := findmin_pqp_res( skol1 )
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (2989) {G4,W3,D2,L1,V0,M1} R(2984,984) { ! skol2 ==>
% 7.15/7.51 create_slb }.
% 7.15/7.51 parent0: (21390) {G3,W3,D2,L1,V0,M1} { ! skol2 = create_slb }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 eqswap: (21392) {G0,W27,D5,L4,V3,M4} { create_slb = X, ! contains_slb( X,
% 7.15/7.51 findmin_pqp_res( Y ) ), ! strictly_less_than( findmin_pqp_res( Y ),
% 7.15/7.51 lookup_slb( X, findmin_pqp_res( Y ) ) ), findmin_cpq_eff( triple( Y, X, Z
% 7.15/7.51 ) ) = triple( Y, update_slb( X, findmin_pqp_res( Y ) ), bad ) }.
% 7.15/7.51 parent0[0]: (48) {G0,W27,D5,L4,V3,M4} I { Y = create_slb, ! contains_slb( Y
% 7.15/7.51 , findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 7.15/7.51 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 7.15/7.51 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := Y
% 7.15/7.51 Y := X
% 7.15/7.51 Z := Z
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 paramod: (21395) {G1,W22,D5,L4,V0,M4} { ok( triple( skol1, update_slb(
% 7.15/7.51 skol2, findmin_pqp_res( skol1 ) ), bad ) ), create_slb = skol2, !
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent0[3]: (21392) {G0,W27,D5,L4,V3,M4} { create_slb = X, ! contains_slb
% 7.15/7.51 ( X, findmin_pqp_res( Y ) ), ! strictly_less_than( findmin_pqp_res( Y ),
% 7.15/7.51 lookup_slb( X, findmin_pqp_res( Y ) ) ), findmin_cpq_eff( triple( Y, X, Z
% 7.15/7.51 ) ) = triple( Y, update_slb( X, findmin_pqp_res( Y ) ), bad ) }.
% 7.15/7.51 parent1[0; 1]: (54) {G0,W6,D4,L1,V0,M1} I { ok( findmin_cpq_eff( triple(
% 7.15/7.51 skol1, skol2, skol3 ) ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol2
% 7.15/7.51 Y := skol1
% 7.15/7.51 Z := skol3
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21444) {G1,W14,D4,L3,V0,M3} { create_slb = skol2, !
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 7.15/7.51 parent1[0]: (21395) {G1,W22,D5,L4,V0,M4} { ok( triple( skol1, update_slb(
% 7.15/7.51 skol2, findmin_pqp_res( skol1 ) ), bad ) ), create_slb = skol2, !
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 substitution0:
% 7.15/7.51 X := skol1
% 7.15/7.51 Y := update_slb( skol2, findmin_pqp_res( skol1 ) )
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 eqswap: (21445) {G1,W14,D4,L3,V0,M3} { skol2 = create_slb, ! contains_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent0[0]: (21444) {G1,W14,D4,L3,V0,M3} { create_slb = skol2, !
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (3233) {G1,W14,D4,L3,V0,M3} P(48,54);r(39) { skol2 ==>
% 7.15/7.51 create_slb, ! contains_slb( skol2, findmin_pqp_res( skol1 ) ), !
% 7.15/7.51 strictly_less_than( findmin_pqp_res( skol1 ), lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ) ) }.
% 7.15/7.51 parent0: (21445) {G1,W14,D4,L3,V0,M3} { skol2 = create_slb, ! contains_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ), ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 1 ==> 1
% 7.15/7.51 2 ==> 2
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21448) {G1,W11,D4,L2,V0,M2} { ! contains_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[0]: (2989) {G4,W3,D2,L1,V0,M1} R(2984,984) { ! skol2 ==> create_slb
% 7.15/7.51 }.
% 7.15/7.51 parent1[0]: (55) {G0,W14,D4,L3,V0,M3} I { skol2 ==> create_slb, !
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb
% 7.15/7.51 ( skol2, findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21449) {G2,W7,D4,L1,V0,M1} { ! less_than( lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent0[0]: (21448) {G1,W11,D4,L2,V0,M2} { ! contains_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), ! less_than( lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 parent1[0]: (2984) {G2,W4,D3,L1,V0,M1} P(2953,54);d(46);r(39) {
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (3950) {G5,W7,D4,L1,V0,M1} S(55);r(2989);r(2984) { ! less_than
% 7.15/7.51 ( lookup_slb( skol2, findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 )
% 7.15/7.51 ) }.
% 7.15/7.51 parent0: (21449) {G2,W7,D4,L1,V0,M1} { ! less_than( lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21450) {G2,W7,D4,L1,V0,M1} { strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent0[0]: (3950) {G5,W7,D4,L1,V0,M1} S(55);r(2989);r(2984) { ! less_than
% 7.15/7.51 ( lookup_slb( skol2, findmin_pqp_res( skol1 ) ), findmin_pqp_res( skol1 )
% 7.15/7.51 ) }.
% 7.15/7.51 parent1[0]: (5) {G1,W6,D2,L2,V2,M2} I;r(1) { less_than( Y, X ),
% 7.15/7.51 strictly_less_than( X, Y ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 X := findmin_pqp_res( skol1 )
% 7.15/7.51 Y := lookup_slb( skol2, findmin_pqp_res( skol1 ) )
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (3977) {G6,W7,D4,L1,V0,M1} R(3950,5) { strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent0: (21450) {G2,W7,D4,L1,V0,M1} { strictly_less_than( findmin_pqp_res
% 7.15/7.51 ( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 0 ==> 0
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21453) {G2,W11,D4,L2,V0,M2} { ! contains_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), ! strictly_less_than( findmin_pqp_res( skol1
% 7.15/7.51 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) ) }.
% 7.15/7.51 parent0[0]: (2989) {G4,W3,D2,L1,V0,M1} R(2984,984) { ! skol2 ==> create_slb
% 7.15/7.51 }.
% 7.15/7.51 parent1[0]: (3233) {G1,W14,D4,L3,V0,M3} P(48,54);r(39) { skol2 ==>
% 7.15/7.51 create_slb, ! contains_slb( skol2, findmin_pqp_res( skol1 ) ), !
% 7.15/7.51 strictly_less_than( findmin_pqp_res( skol1 ), lookup_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21454) {G3,W7,D4,L1,V0,M1} { ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent0[0]: (21453) {G2,W11,D4,L2,V0,M2} { ! contains_slb( skol2,
% 7.15/7.51 findmin_pqp_res( skol1 ) ), ! strictly_less_than( findmin_pqp_res( skol1
% 7.15/7.51 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) ) }.
% 7.15/7.51 parent1[0]: (2984) {G2,W4,D3,L1,V0,M1} P(2953,54);d(46);r(39) {
% 7.15/7.51 contains_slb( skol2, findmin_pqp_res( skol1 ) ) }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 resolution: (21455) {G4,W0,D0,L0,V0,M0} { }.
% 7.15/7.51 parent0[0]: (21454) {G3,W7,D4,L1,V0,M1} { ! strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 parent1[0]: (3977) {G6,W7,D4,L1,V0,M1} R(3950,5) { strictly_less_than(
% 7.15/7.51 findmin_pqp_res( skol1 ), lookup_slb( skol2, findmin_pqp_res( skol1 ) ) )
% 7.15/7.51 }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 substitution1:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 subsumption: (20011) {G7,W0,D0,L0,V0,M0} S(3233);r(2989);r(2984);r(3977) {
% 7.15/7.51 }.
% 7.15/7.51 parent0: (21455) {G4,W0,D0,L0,V0,M0} { }.
% 7.15/7.51 substitution0:
% 7.15/7.51 end
% 7.15/7.51 permutation0:
% 7.15/7.51 end
% 7.15/7.51
% 7.15/7.51 Proof check complete!
% 7.15/7.51
% 7.15/7.51 Memory use:
% 7.15/7.51
% 7.15/7.51 space for terms: 305301
% 7.15/7.51 space for clauses: 940424
% 7.15/7.51
% 7.15/7.51
% 7.15/7.51 clauses generated: 116117
% 7.15/7.51 clauses kept: 20012
% 7.15/7.51 clauses selected: 736
% 7.15/7.51 clauses deleted: 1532
% 7.15/7.51 clauses inuse deleted: 7
% 7.15/7.51
% 7.15/7.51 subsentry: 946615
% 7.15/7.51 literals s-matched: 722286
% 7.15/7.51 literals matched: 721647
% 7.15/7.51 full subsumption: 579985
% 7.15/7.51
% 7.15/7.51 checksum: -1968699632
% 7.15/7.51
% 7.15/7.51
% 7.15/7.51 Bliksem ended
%------------------------------------------------------------------------------