TSTP Solution File: SWV408+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV408+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Wed Jul 20 16:24:45 EDT 2022
% Result : Theorem 1.87s 2.26s
% Output : Refutation 1.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV408+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % DateTime : Wed Jun 15 23:15:17 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.51/1.16 *** allocated 10000 integers for termspace/termends
% 0.51/1.16 *** allocated 10000 integers for clauses
% 0.51/1.16 *** allocated 10000 integers for justifications
% 0.51/1.16 Bliksem 1.12
% 0.51/1.16
% 0.51/1.16
% 0.51/1.16 Automatic Strategy Selection
% 0.51/1.16
% 0.51/1.16
% 0.51/1.16 Clauses:
% 0.51/1.16
% 0.51/1.16 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.51/1.16 { less_than( X, Y ), less_than( Y, X ) }.
% 0.51/1.16 { less_than( X, X ) }.
% 0.51/1.16 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.51/1.16 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.51/1.16 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.51/1.16 { less_than( bottom, X ) }.
% 0.51/1.16 { ! isnonempty_slb( create_slb ) }.
% 0.51/1.16 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.51/1.16 { ! contains_slb( create_slb, X ) }.
% 0.51/1.16 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.51/1.16 , Y = Z }.
% 0.51/1.16 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.51/1.16 }.
% 0.51/1.16 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.51/1.16 { ! pair_in_list( create_slb, X, Y ) }.
% 0.51/1.16 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.51/1.16 , U ), alpha1( Y, Z, T, U ) }.
% 0.51/1.16 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.51/1.16 , U ) }.
% 0.51/1.16 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.51/1.16 ) }.
% 0.51/1.16 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.51/1.16 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.51/1.16 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.51/1.16 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.51/1.16 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.51/1.16 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.51/1.16 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.51/1.16 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.51/1.16 , Z ) = lookup_slb( X, Z ) }.
% 0.51/1.16 { update_slb( create_slb, X ) = create_slb }.
% 0.51/1.16 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.51/1.16 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.51/1.16 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.51/1.16 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.51/1.16 { succ_cpq( X, X ) }.
% 0.51/1.16 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.51/1.16 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.51/1.16 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.51/1.16 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.51/1.16 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.51/1.16 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.51/1.16 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.51/1.16 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.51/1.16 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.51/1.16 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.51/1.16 ( X, Y ) ), U ) ) }.
% 0.51/1.16 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.51/1.16 pair( X, Y ) ), U ) ) }.
% 0.51/1.16 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.51/1.16 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.51/1.16 { ! ok( triple( X, Y, bad ) ) }.
% 0.51/1.16 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.51/1.16 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.51/1.16 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.51/1.16 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.51/1.16 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.51/1.16 bad ) }.
% 0.51/1.16 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.51/1.16 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.51/1.16 , T ) }.
% 0.51/1.16 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.51/1.16 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.51/1.16 remove_slb( X, Y ), bad ) }.
% 0.51/1.16 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.51/1.16 bad ) }.
% 0.51/1.16 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.51/1.16 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.51/1.16 , bad ) }.
% 0.51/1.16 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.51/1.16 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.51/1.16 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.51/1.16 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.51/1.16 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.51/1.16 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 1.87/2.26 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 1.87/2.26 findmin_pqp_res( X ) ), Z ) }.
% 1.87/2.26 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 1.87/2.26 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 1.87/2.26 ) }.
% 1.87/2.26 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 1.87/2.26 findmin_cpq_res( X ) ) }.
% 1.87/2.26 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 1.87/2.26 { ! contains_slb( X, Y ), ! strictly_less_than( Y, Z ), pair_in_list(
% 1.87/2.26 update_slb( X, Z ), Y, Z ), less_than( Z, skol1( T, U, Z ) ) }.
% 1.87/2.26 { ! contains_slb( X, Y ), ! strictly_less_than( Y, Z ), pair_in_list(
% 1.87/2.26 update_slb( X, Z ), Y, Z ), pair_in_list( update_slb( X, Z ), Y, skol1( X
% 1.87/2.26 , Y, Z ) ) }.
% 1.87/2.26 { contains_slb( skol3, skol4 ) }.
% 1.87/2.26 { strictly_less_than( skol4, findmin_cpq_res( triple( skol2, skol3, skol5 )
% 1.87/2.26 ) ) }.
% 1.87/2.26 { ! pair_in_list( update_slb( skol3, findmin_pqp_res( skol2 ) ), skol4,
% 1.87/2.26 findmin_pqp_res( skol2 ) ) }.
% 1.87/2.26 { ! pair_in_list( update_slb( skol3, findmin_pqp_res( skol2 ) ), skol4, X )
% 1.87/2.26 , ! less_than( findmin_pqp_res( skol2 ), X ) }.
% 1.87/2.26
% 1.87/2.26 percentage equality = 0.264463, percentage horn = 0.766667
% 1.87/2.26 This is a problem with some equality
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 Options Used:
% 1.87/2.26
% 1.87/2.26 useres = 1
% 1.87/2.26 useparamod = 1
% 1.87/2.26 useeqrefl = 1
% 1.87/2.26 useeqfact = 1
% 1.87/2.26 usefactor = 1
% 1.87/2.26 usesimpsplitting = 0
% 1.87/2.26 usesimpdemod = 5
% 1.87/2.26 usesimpres = 3
% 1.87/2.26
% 1.87/2.26 resimpinuse = 1000
% 1.87/2.26 resimpclauses = 20000
% 1.87/2.26 substype = eqrewr
% 1.87/2.26 backwardsubs = 1
% 1.87/2.26 selectoldest = 5
% 1.87/2.26
% 1.87/2.26 litorderings [0] = split
% 1.87/2.26 litorderings [1] = extend the termordering, first sorting on arguments
% 1.87/2.26
% 1.87/2.26 termordering = kbo
% 1.87/2.26
% 1.87/2.26 litapriori = 0
% 1.87/2.26 termapriori = 1
% 1.87/2.26 litaposteriori = 0
% 1.87/2.26 termaposteriori = 0
% 1.87/2.26 demodaposteriori = 0
% 1.87/2.26 ordereqreflfact = 0
% 1.87/2.26
% 1.87/2.26 litselect = negord
% 1.87/2.26
% 1.87/2.26 maxweight = 15
% 1.87/2.26 maxdepth = 30000
% 1.87/2.26 maxlength = 115
% 1.87/2.26 maxnrvars = 195
% 1.87/2.26 excuselevel = 1
% 1.87/2.26 increasemaxweight = 1
% 1.87/2.26
% 1.87/2.26 maxselected = 10000000
% 1.87/2.26 maxnrclauses = 10000000
% 1.87/2.26
% 1.87/2.26 showgenerated = 0
% 1.87/2.26 showkept = 0
% 1.87/2.26 showselected = 0
% 1.87/2.26 showdeleted = 0
% 1.87/2.26 showresimp = 1
% 1.87/2.26 showstatus = 2000
% 1.87/2.26
% 1.87/2.26 prologoutput = 0
% 1.87/2.26 nrgoals = 5000000
% 1.87/2.26 totalproof = 1
% 1.87/2.26
% 1.87/2.26 Symbols occurring in the translation:
% 1.87/2.26
% 1.87/2.26 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.87/2.26 . [1, 2] (w:1, o:31, a:1, s:1, b:0),
% 1.87/2.26 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 1.87/2.26 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.87/2.26 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.87/2.26 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.87/2.26 less_than [38, 2] (w:1, o:55, a:1, s:1, b:0),
% 1.87/2.26 strictly_less_than [39, 2] (w:1, o:59, a:1, s:1, b:0),
% 1.87/2.26 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.87/2.26 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 1.87/2.26 isnonempty_slb [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.87/2.26 pair [43, 2] (w:1, o:60, a:1, s:1, b:0),
% 1.87/2.26 insert_slb [44, 2] (w:1, o:61, a:1, s:1, b:0),
% 1.87/2.26 contains_slb [45, 2] (w:1, o:62, a:1, s:1, b:0),
% 1.87/2.26 pair_in_list [47, 3] (w:1, o:69, a:1, s:1, b:0),
% 1.87/2.26 remove_slb [49, 2] (w:1, o:56, a:1, s:1, b:0),
% 1.87/2.26 lookup_slb [50, 2] (w:1, o:63, a:1, s:1, b:0),
% 1.87/2.26 update_slb [51, 2] (w:1, o:64, a:1, s:1, b:0),
% 1.87/2.26 succ_cpq [52, 2] (w:1, o:65, a:1, s:1, b:0),
% 1.87/2.26 insert_cpq [53, 2] (w:1, o:66, a:1, s:1, b:0),
% 1.87/2.26 remove_cpq [54, 2] (w:1, o:57, a:1, s:1, b:0),
% 1.87/2.26 findmin_cpq_eff [55, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.87/2.26 removemin_cpq_eff [56, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.87/2.26 triple [57, 3] (w:1, o:71, a:1, s:1, b:0),
% 1.87/2.26 check_cpq [58, 1] (w:1, o:26, a:1, s:1, b:0),
% 1.87/2.26 contains_cpq [59, 2] (w:1, o:67, a:1, s:1, b:0),
% 1.87/2.26 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.87/2.26 ok [61, 1] (w:1, o:27, a:1, s:1, b:0),
% 1.87/2.26 insert_pqp [62, 2] (w:1, o:68, a:1, s:1, b:0),
% 1.87/2.26 remove_pqp [63, 2] (w:1, o:58, a:1, s:1, b:0),
% 1.87/2.26 findmin_pqp_res [64, 1] (w:1, o:28, a:1, s:1, b:0),
% 1.87/2.26 findmin_cpq_res [65, 1] (w:1, o:29, a:1, s:1, b:0),
% 1.87/2.26 removemin_cpq_res [66, 1] (w:1, o:30, a:1, s:1, b:0),
% 1.87/2.26 alpha1 [67, 4] (w:1, o:72, a:1, s:1, b:1),
% 1.87/2.26 skol1 [68, 3] (w:1, o:70, a:1, s:1, b:1),
% 1.87/2.26 skol2 [69, 0] (w:1, o:14, a:1, s:1, b:1),
% 1.87/2.26 skol3 [70, 0] (w:1, o:15, a:1, s:1, b:1),
% 1.87/2.26 skol4 [71, 0] (w:1, o:16, a:1, s:1, b:1),
% 1.87/2.26 skol5 [72, 0] (w:1, o:17, a:1, s:1, b:1).
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 Starting Search:
% 1.87/2.26
% 1.87/2.26 *** allocated 15000 integers for clauses
% 1.87/2.26 *** allocated 22500 integers for clauses
% 1.87/2.26 *** allocated 33750 integers for clauses
% 1.87/2.26 *** allocated 15000 integers for termspace/termends
% 1.87/2.26 *** allocated 50625 integers for clauses
% 1.87/2.26 *** allocated 22500 integers for termspace/termends
% 1.87/2.26 *** allocated 75937 integers for clauses
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 33750 integers for termspace/termends
% 1.87/2.26 *** allocated 113905 integers for clauses
% 1.87/2.26 *** allocated 50625 integers for termspace/termends
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 3930
% 1.87/2.26 Kept: 2000
% 1.87/2.26 Inuse: 133
% 1.87/2.26 Deleted: 4
% 1.87/2.26 Deletedinuse: 1
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 170857 integers for clauses
% 1.87/2.26 *** allocated 75937 integers for termspace/termends
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 256285 integers for clauses
% 1.87/2.26 *** allocated 113905 integers for termspace/termends
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 8914
% 1.87/2.26 Kept: 4012
% 1.87/2.26 Inuse: 184
% 1.87/2.26 Deleted: 5
% 1.87/2.26 Deletedinuse: 1
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 384427 integers for clauses
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 170857 integers for termspace/termends
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 17609
% 1.87/2.26 Kept: 6460
% 1.87/2.26 Inuse: 284
% 1.87/2.26 Deleted: 22
% 1.87/2.26 Deletedinuse: 10
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 576640 integers for clauses
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 34199
% 1.87/2.26 Kept: 8490
% 1.87/2.26 Inuse: 400
% 1.87/2.26 Deleted: 23
% 1.87/2.26 Deletedinuse: 10
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 256285 integers for termspace/termends
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 43286
% 1.87/2.26 Kept: 10503
% 1.87/2.26 Inuse: 461
% 1.87/2.26 Deleted: 23
% 1.87/2.26 Deletedinuse: 10
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 864960 integers for clauses
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 50838
% 1.87/2.26 Kept: 12641
% 1.87/2.26 Inuse: 469
% 1.87/2.26 Deleted: 25
% 1.87/2.26 Deletedinuse: 12
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 68826
% 1.87/2.26 Kept: 14654
% 1.87/2.26 Inuse: 556
% 1.87/2.26 Deleted: 30
% 1.87/2.26 Deletedinuse: 12
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 384427 integers for termspace/termends
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 81581
% 1.87/2.26 Kept: 16660
% 1.87/2.26 Inuse: 618
% 1.87/2.26 Deleted: 32
% 1.87/2.26 Deletedinuse: 12
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 Intermediate Status:
% 1.87/2.26 Generated: 102231
% 1.87/2.26 Kept: 18666
% 1.87/2.26 Inuse: 694
% 1.87/2.26 Deleted: 40
% 1.87/2.26 Deletedinuse: 12
% 1.87/2.26
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 *** allocated 1297440 integers for clauses
% 1.87/2.26 Resimplifying inuse:
% 1.87/2.26 Done
% 1.87/2.26
% 1.87/2.26 Resimplifying clauses:
% 1.87/2.26
% 1.87/2.26 Bliksems!, er is een bewijs:
% 1.87/2.26 % SZS status Theorem
% 1.87/2.26 % SZS output start Refutation
% 1.87/2.26
% 1.87/2.26 (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X ) }.
% 1.87/2.26 (18) {G0,W8,D2,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), Z = T }.
% 1.87/2.26 (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 1.87/2.26 (51) {G0,W11,D4,L2,V3,M2} I { X = create_slb, findmin_cpq_res( triple( Y, X
% 1.87/2.26 , Z ) ) ==> findmin_pqp_res( Y ) }.
% 1.87/2.26 (54) {G0,W18,D3,L4,V5,M4} I { ! contains_slb( X, Y ), ! strictly_less_than
% 1.87/2.26 ( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ), less_than( Z, skol1(
% 1.87/2.26 T, U, Z ) ) }.
% 1.87/2.26 (55) {G0,W21,D3,L4,V3,M4} I { ! contains_slb( X, Y ), ! strictly_less_than
% 1.87/2.26 ( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ), pair_in_list(
% 1.87/2.26 update_slb( X, Z ), Y, skol1( X, Y, Z ) ) }.
% 1.87/2.26 (56) {G0,W3,D2,L1,V0,M1} I { contains_slb( skol3, skol4 ) }.
% 1.87/2.26 (57) {G0,W7,D4,L1,V0,M1} I { strictly_less_than( skol4, findmin_cpq_res(
% 1.87/2.26 triple( skol2, skol3, skol5 ) ) ) }.
% 1.87/2.26 (58) {G0,W8,D4,L1,V0,M1} I { ! pair_in_list( update_slb( skol3,
% 1.87/2.26 findmin_pqp_res( skol2 ) ), skol4, findmin_pqp_res( skol2 ) ) }.
% 1.87/2.26 (59) {G0,W11,D4,L2,V1,M2} I { ! pair_in_list( update_slb( skol3,
% 1.87/2.26 findmin_pqp_res( skol2 ) ), skol4, X ), ! less_than( findmin_pqp_res(
% 1.87/2.26 skol2 ), X ) }.
% 1.87/2.26 (712) {G1,W8,D2,L2,V4,M2} P(18,9) { ! contains_slb( X, Y ), ! alpha1( Z, T
% 1.87/2.26 , create_slb, X ) }.
% 1.87/2.26 (1386) {G2,W5,D2,L1,V2,M1} R(712,56) { ! alpha1( X, Y, create_slb, skol3 )
% 1.87/2.26 }.
% 1.87/2.26 (1388) {G3,W6,D2,L2,V2,M2} R(1386,19) { ! X = Y, ! skol3 ==> create_slb }.
% 1.87/2.26 (1390) {G4,W3,D2,L1,V0,M1} Q(1388) { ! skol3 ==> create_slb }.
% 1.87/2.26 (1391) {G5,W8,D2,L2,V3,M2} P(18,1390) { ! X = create_slb, ! alpha1( Y, Z,
% 1.87/2.26 skol3, X ) }.
% 1.87/2.26 (2922) {G6,W9,D2,L3,V3,M3} R(1391,19) { ! X = create_slb, ! Y = Z, ! skol3
% 1.87/2.26 = X }.
% 1.87/2.26 (2939) {G7,W6,D2,L2,V1,M2} F(2922) { ! X = create_slb, ! skol3 = X }.
% 1.87/2.26 (3603) {G8,W8,D4,L1,V2,M1} R(51,2939);q { findmin_cpq_res( triple( X, skol3
% 1.87/2.26 , Y ) ) ==> findmin_pqp_res( X ) }.
% 1.87/2.26 (4101) {G1,W15,D3,L3,V3,M3} R(54,56) { ! strictly_less_than( skol4, X ),
% 1.87/2.26 pair_in_list( update_slb( skol3, X ), skol4, X ), less_than( X, skol1( Y
% 1.87/2.26 , Z, X ) ) }.
% 1.87/2.26 (4157) {G9,W4,D3,L1,V0,M1} S(57);d(3603) { strictly_less_than( skol4,
% 1.87/2.26 findmin_pqp_res( skol2 ) ) }.
% 1.87/2.26 (4495) {G2,W15,D4,L3,V0,M3} R(59,55);r(4101) { ! contains_slb( skol3, skol4
% 1.87/2.26 ), ! strictly_less_than( skol4, findmin_pqp_res( skol2 ) ), pair_in_list
% 1.87/2.26 ( update_slb( skol3, findmin_pqp_res( skol2 ) ), skol4, findmin_pqp_res(
% 1.87/2.26 skol2 ) ) }.
% 1.87/2.26 (20002) {G10,W0,D0,L0,V0,M0} S(4495);r(56);r(4157);r(58) { }.
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 % SZS output end Refutation
% 1.87/2.26 found a proof!
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 Unprocessed initial clauses:
% 1.87/2.26
% 1.87/2.26 (20004) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 1.87/2.26 less_than( X, Y ) }.
% 1.87/2.26 (20005) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 1.87/2.26 (20006) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 1.87/2.26 (20007) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X,
% 1.87/2.26 Y ) }.
% 1.87/2.26 (20008) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 1.87/2.26 , X ) }.
% 1.87/2.26 (20009) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 1.87/2.26 strictly_less_than( X, Y ) }.
% 1.87/2.26 (20010) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 1.87/2.26 (20011) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 1.87/2.26 (20012) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z )
% 1.87/2.26 ) ) }.
% 1.87/2.26 (20013) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 1.87/2.26 (20014) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 1.87/2.26 ), Z ), contains_slb( X, Z ), Y = Z }.
% 1.87/2.26 (20015) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 1.87/2.26 insert_slb( X, pair( Y, T ) ), Z ) }.
% 1.87/2.26 (20016) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair
% 1.87/2.26 ( Y, T ) ), Z ) }.
% 1.87/2.26 (20017) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 1.87/2.26 (20018) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 1.87/2.26 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 1.87/2.26 (20019) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 1.87/2.26 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.87/2.26 (20020) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 1.87/2.26 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.87/2.26 (20021) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 1.87/2.26 (20022) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 1.87/2.26 (20023) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 1.87/2.26 (20024) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.87/2.26 ) = X }.
% 1.87/2.26 (20025) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 1.87/2.26 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 1.87/2.26 ( Y, T ) ) }.
% 1.87/2.26 (20026) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.87/2.26 ) = Z }.
% 1.87/2.26 (20027) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 1.87/2.26 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 1.87/2.26 (20028) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 1.87/2.26 (20029) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 1.87/2.26 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 1.87/2.26 ( T, X ) ) }.
% 1.87/2.26 (20030) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 1.87/2.26 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 1.87/2.26 }.
% 1.87/2.26 (20031) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 1.87/2.26 (20032) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq
% 1.87/2.26 ( Y, Z ) ) }.
% 1.87/2.26 (20033) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq
% 1.87/2.26 ( Y, Z ) ) }.
% 1.87/2.26 (20034) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.87/2.26 findmin_cpq_eff( Y ) ) }.
% 1.87/2.26 (20035) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.87/2.26 removemin_cpq_eff( Y ) ) }.
% 1.87/2.26 (20036) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 1.87/2.26 (20037) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.87/2.26 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 1.87/2.26 }.
% 1.87/2.26 (20038) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.87/2.26 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 1.87/2.26 }.
% 1.87/2.26 (20039) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 1.87/2.26 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.87/2.26 (20040) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 1.87/2.26 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.87/2.26 (20041) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 1.87/2.26 contains_slb( Y, T ) }.
% 1.87/2.26 (20042) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 1.87/2.26 ( X, Y, Z ), T ) }.
% 1.87/2.26 (20043) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 1.87/2.26 (20044) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 1.87/2.26 (20045) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 1.87/2.26 (20046) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 1.87/2.26 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 1.87/2.26 (20047) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 1.87/2.26 , X, T ), Y ) = triple( Z, X, bad ) }.
% 1.87/2.26 (20048) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 1.87/2.26 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 1.87/2.26 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 1.87/2.26 (20049) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), !
% 1.87/2.26 strictly_less_than( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T
% 1.87/2.26 ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 1.87/2.26 (20050) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 1.87/2.26 ) = triple( X, create_slb, bad ) }.
% 1.87/2.26 (20051) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 1.87/2.26 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 1.87/2.26 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.87/2.26 (20052) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.87/2.26 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 1.87/2.26 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 1.87/2.26 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.87/2.26 (20053) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.87/2.26 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 1.87/2.26 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 1.87/2.26 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 1.87/2.26 (20054) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y )
% 1.87/2.26 ) = bottom }.
% 1.87/2.26 (20055) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y
% 1.87/2.26 , X, Z ) ) = findmin_pqp_res( Y ) }.
% 1.87/2.26 (20056) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 1.87/2.26 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 1.87/2.26 (20057) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X
% 1.87/2.26 ) }.
% 1.87/2.26 (20058) {G0,W18,D3,L4,V5,M4} { ! contains_slb( X, Y ), !
% 1.87/2.26 strictly_less_than( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ),
% 1.87/2.26 less_than( Z, skol1( T, U, Z ) ) }.
% 1.87/2.26 (20059) {G0,W21,D3,L4,V3,M4} { ! contains_slb( X, Y ), !
% 1.87/2.26 strictly_less_than( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ),
% 1.87/2.26 pair_in_list( update_slb( X, Z ), Y, skol1( X, Y, Z ) ) }.
% 1.87/2.26 (20060) {G0,W3,D2,L1,V0,M1} { contains_slb( skol3, skol4 ) }.
% 1.87/2.26 (20061) {G0,W7,D4,L1,V0,M1} { strictly_less_than( skol4, findmin_cpq_res(
% 1.87/2.26 triple( skol2, skol3, skol5 ) ) ) }.
% 1.87/2.26 (20062) {G0,W8,D4,L1,V0,M1} { ! pair_in_list( update_slb( skol3,
% 1.87/2.26 findmin_pqp_res( skol2 ) ), skol4, findmin_pqp_res( skol2 ) ) }.
% 1.87/2.26 (20063) {G0,W11,D4,L2,V1,M2} { ! pair_in_list( update_slb( skol3,
% 1.87/2.26 findmin_pqp_res( skol2 ) ), skol4, X ), ! less_than( findmin_pqp_res(
% 1.87/2.26 skol2 ), X ) }.
% 1.87/2.26
% 1.87/2.26
% 1.87/2.26 Total Proof:
% 1.87/2.26
% 1.87/2.26 subsumption: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 1.87/2.26 }.
% 1.87/2.26 parent0: (20013) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 1.87/2.26 substitution0:
% 1.87/2.26 X := X
% 1.87/2.26 end
% 1.87/2.26 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (18) {G0,W8,D2,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), Z = T }.
% 7.59/7.99 parent0: (20022) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := X
% 7.59/7.99 Y := Y
% 7.59/7.99 Z := Z
% 7.59/7.99 T := T
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y,
% 7.59/7.99 Z, T ) }.
% 7.59/7.99 parent0: (20023) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z
% 7.59/7.99 , T ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := X
% 7.59/7.99 Y := Y
% 7.59/7.99 Z := Z
% 7.59/7.99 T := T
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 2 ==> 2
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (51) {G0,W11,D4,L2,V3,M2} I { X = create_slb, findmin_cpq_res
% 7.59/7.99 ( triple( Y, X, Z ) ) ==> findmin_pqp_res( Y ) }.
% 7.59/7.99 parent0: (20055) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res(
% 7.59/7.99 triple( Y, X, Z ) ) = findmin_pqp_res( Y ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := X
% 7.59/7.99 Y := Y
% 7.59/7.99 Z := Z
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (54) {G0,W18,D3,L4,V5,M4} I { ! contains_slb( X, Y ), !
% 7.59/7.99 strictly_less_than( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ),
% 7.59/7.99 less_than( Z, skol1( T, U, Z ) ) }.
% 7.59/7.99 parent0: (20058) {G0,W18,D3,L4,V5,M4} { ! contains_slb( X, Y ), !
% 7.59/7.99 strictly_less_than( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ),
% 7.59/7.99 less_than( Z, skol1( T, U, Z ) ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := X
% 7.59/7.99 Y := Y
% 7.59/7.99 Z := Z
% 7.59/7.99 T := T
% 7.59/7.99 U := U
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 2 ==> 2
% 7.59/7.99 3 ==> 3
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (55) {G0,W21,D3,L4,V3,M4} I { ! contains_slb( X, Y ), !
% 7.59/7.99 strictly_less_than( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ),
% 7.59/7.99 pair_in_list( update_slb( X, Z ), Y, skol1( X, Y, Z ) ) }.
% 7.59/7.99 parent0: (20059) {G0,W21,D3,L4,V3,M4} { ! contains_slb( X, Y ), !
% 7.59/7.99 strictly_less_than( Y, Z ), pair_in_list( update_slb( X, Z ), Y, Z ),
% 7.59/7.99 pair_in_list( update_slb( X, Z ), Y, skol1( X, Y, Z ) ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := X
% 7.59/7.99 Y := Y
% 7.59/7.99 Z := Z
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 2 ==> 2
% 7.59/7.99 3 ==> 3
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (56) {G0,W3,D2,L1,V0,M1} I { contains_slb( skol3, skol4 ) }.
% 7.59/7.99 parent0: (20060) {G0,W3,D2,L1,V0,M1} { contains_slb( skol3, skol4 ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (57) {G0,W7,D4,L1,V0,M1} I { strictly_less_than( skol4,
% 7.59/7.99 findmin_cpq_res( triple( skol2, skol3, skol5 ) ) ) }.
% 7.59/7.99 parent0: (20061) {G0,W7,D4,L1,V0,M1} { strictly_less_than( skol4,
% 7.59/7.99 findmin_cpq_res( triple( skol2, skol3, skol5 ) ) ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (58) {G0,W8,D4,L1,V0,M1} I { ! pair_in_list( update_slb( skol3
% 7.59/7.99 , findmin_pqp_res( skol2 ) ), skol4, findmin_pqp_res( skol2 ) ) }.
% 7.59/7.99 parent0: (20062) {G0,W8,D4,L1,V0,M1} { ! pair_in_list( update_slb( skol3,
% 7.59/7.99 findmin_pqp_res( skol2 ) ), skol4, findmin_pqp_res( skol2 ) ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (59) {G0,W11,D4,L2,V1,M2} I { ! pair_in_list( update_slb(
% 7.59/7.99 skol3, findmin_pqp_res( skol2 ) ), skol4, X ), ! less_than(
% 7.59/7.99 findmin_pqp_res( skol2 ), X ) }.
% 7.59/7.99 parent0: (20063) {G0,W11,D4,L2,V1,M2} { ! pair_in_list( update_slb( skol3
% 7.59/7.99 , findmin_pqp_res( skol2 ) ), skol4, X ), ! less_than( findmin_pqp_res(
% 7.59/7.99 skol2 ), X ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := X
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 *** allocated 15000 integers for justifications
% 7.59/7.99 *** allocated 22500 integers for justifications
% 7.59/7.99 *** allocated 33750 integers for justifications
% 7.59/7.99 *** allocated 50625 integers for justifications
% 7.59/7.99 *** allocated 75937 integers for justifications
% 7.59/7.99 paramod: (20853) {G1,W8,D2,L2,V4,M2} { ! contains_slb( Y, X ), ! alpha1( Z
% 7.59/7.99 , T, create_slb, Y ) }.
% 7.59/7.99 parent0[1]: (18) {G0,W8,D2,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), Z = T }.
% 7.59/7.99 parent1[0; 2]: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 7.59/7.99 }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := Z
% 7.59/7.99 Y := T
% 7.59/7.99 Z := create_slb
% 7.59/7.99 T := Y
% 7.59/7.99 end
% 7.59/7.99 substitution1:
% 7.59/7.99 X := X
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 subsumption: (712) {G1,W8,D2,L2,V4,M2} P(18,9) { ! contains_slb( X, Y ), !
% 7.59/7.99 alpha1( Z, T, create_slb, X ) }.
% 7.59/7.99 parent0: (20853) {G1,W8,D2,L2,V4,M2} { ! contains_slb( Y, X ), ! alpha1( Z
% 7.59/7.99 , T, create_slb, Y ) }.
% 7.59/7.99 substitution0:
% 7.59/7.99 X := Y
% 7.59/7.99 Y := X
% 7.59/7.99 Z := Z
% 7.59/7.99 T := T
% 7.59/7.99 end
% 7.59/7.99 permutation0:
% 7.59/7.99 0 ==> 0
% 7.59/7.99 1 ==> 1
% 7.59/7.99 end
% 7.59/7.99
% 7.59/7.99 resolution: (21307) {G1,W5,D2,L1,V2,M1} { ! alCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------