TSTP Solution File: SWV369+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:37 EDT 2022
% Result : Theorem 0.74s 1.24s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n014.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 : Wed Jun 15 22:08:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.11 *** allocated 10000 integers for termspace/termends
% 0.69/1.11 *** allocated 10000 integers for clauses
% 0.69/1.11 *** allocated 10000 integers for justifications
% 0.69/1.11 Bliksem 1.12
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Automatic Strategy Selection
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Clauses:
% 0.69/1.11
% 0.69/1.11 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.69/1.11 { less_than( X, Y ), less_than( Y, X ) }.
% 0.69/1.11 { less_than( X, X ) }.
% 0.69/1.11 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.69/1.11 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.69/1.11 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.69/1.11 { less_than( bottom, X ) }.
% 0.69/1.11 { ! isnonempty_pq( create_pq ) }.
% 0.69/1.11 { isnonempty_pq( insert_pq( X, Y ) ) }.
% 0.69/1.11 { ! contains_pq( create_pq, X ) }.
% 0.69/1.11 { ! contains_pq( insert_pq( X, Y ), Z ), contains_pq( X, Z ), Y = Z }.
% 0.69/1.11 { ! contains_pq( X, Z ), contains_pq( insert_pq( X, Y ), Z ) }.
% 0.69/1.11 { ! Y = Z, contains_pq( insert_pq( X, Y ), Z ) }.
% 0.69/1.11 { ! issmallestelement_pq( X, Y ), ! contains_pq( X, Z ), less_than( Y, Z )
% 0.69/1.11 }.
% 0.69/1.11 { ! less_than( Y, skol1( Z, Y ) ), issmallestelement_pq( X, Y ) }.
% 0.69/1.11 { contains_pq( X, skol1( X, Y ) ), issmallestelement_pq( X, Y ) }.
% 0.69/1.11 { remove_pq( insert_pq( X, Y ), Y ) = X }.
% 0.69/1.11 { ! contains_pq( X, Z ), Y = Z, remove_pq( insert_pq( X, Y ), Z ) =
% 0.69/1.11 insert_pq( remove_pq( X, Z ), Y ) }.
% 0.69/1.11 { ! contains_pq( X, Y ), ! issmallestelement_pq( X, Y ), findmin_pq_eff( X
% 0.69/1.11 , Y ) = X }.
% 0.69/1.11 { ! contains_pq( X, Y ), ! issmallestelement_pq( X, Y ), findmin_pq_res( X
% 0.69/1.11 , Y ) = Y }.
% 0.69/1.11 { ! contains_pq( X, Y ), ! issmallestelement_pq( X, Y ), removemin_pq_eff(
% 0.69/1.11 X, Y ) = remove_pq( X, Y ) }.
% 0.69/1.11 { ! contains_pq( X, Y ), ! issmallestelement_pq( X, Y ), removemin_pq_res(
% 0.69/1.11 X, Y ) = Y }.
% 0.69/1.11 { insert_pq( insert_pq( X, Y ), Z ) = insert_pq( insert_pq( X, Z ), Y ) }.
% 0.69/1.11 { ! isnonempty_slb( create_slb ) }.
% 0.69/1.11 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.69/1.11 { ! contains_slb( create_slb, X ) }.
% 0.69/1.11 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.69/1.11 , Y = Z }.
% 0.69/1.11 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.69/1.11 }.
% 0.69/1.11 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.69/1.11 { ! pair_in_list( create_slb, X, Y ) }.
% 0.69/1.11 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.69/1.11 , U ), alpha1( Y, Z, T, U ) }.
% 0.69/1.11 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.69/1.11 , U ) }.
% 0.69/1.11 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.69/1.11 ) }.
% 0.69/1.11 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.69/1.11 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.69/1.11 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.69/1.11 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.69/1.11 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.69/1.11 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.69/1.11 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.69/1.11 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.69/1.11 , Z ) = lookup_slb( X, Z ) }.
% 0.69/1.11 { update_slb( create_slb, X ) = create_slb }.
% 0.69/1.11 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.69/1.11 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.69/1.11 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.69/1.11 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.69/1.11 { succ_cpq( X, X ) }.
% 0.69/1.11 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.69/1.11 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.69/1.11 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.69/1.11 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.69/1.11 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.69/1.11 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.69/1.11 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.69/1.11 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.69/1.11 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.69/1.11 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.69/1.11 ( X, Y ) ), U ) ) }.
% 0.69/1.11 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.69/1.11 pair( X, Y ) ), U ) ) }.
% 0.69/1.11 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.69/1.11 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.69/1.11 { ! ok( triple( X, Y, bad ) ) }.
% 0.69/1.11 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.69/1.11 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.69/1.15 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.69/1.15 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.69/1.15 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.69/1.15 bad ) }.
% 0.69/1.15 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.69/1.15 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.69/1.15 , T ) }.
% 0.69/1.15 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.69/1.15 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.69/1.15 remove_slb( X, Y ), bad ) }.
% 0.69/1.15 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.69/1.15 bad ) }.
% 0.69/1.15 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.69/1.15 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.69/1.15 , bad ) }.
% 0.69/1.15 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.69/1.15 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.69/1.15 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.69/1.15 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.69/1.15 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.69/1.15 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 0.69/1.15 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 0.69/1.15 findmin_pqp_res( X ) ), Z ) }.
% 0.69/1.15 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 0.69/1.15 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 0.69/1.15 ) }.
% 0.69/1.15 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 0.69/1.15 findmin_cpq_res( X ) ) }.
% 0.69/1.15 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 0.69/1.15 { i( triple( X, create_slb, Y ) ) = create_pq }.
% 0.69/1.15 { i( triple( X, insert_slb( Y, pair( T, U ) ), Z ) ) = insert_pq( i( triple
% 0.69/1.15 ( X, Y, Z ) ), T ) }.
% 0.69/1.15 { ! pi_sharp_remove( X, Y ), contains_pq( X, Y ) }.
% 0.69/1.15 { ! contains_pq( X, Y ), pi_sharp_remove( X, Y ) }.
% 0.69/1.15 { ! pi_remove( X, Y ), pi_sharp_remove( i( X ), Y ) }.
% 0.69/1.15 { ! pi_sharp_remove( i( X ), Y ), pi_remove( X, Y ) }.
% 0.69/1.15 { ! pi_sharp_find_min( X, Y ), contains_pq( X, Y ) }.
% 0.69/1.15 { ! pi_sharp_find_min( X, Y ), issmallestelement_pq( X, Y ) }.
% 0.69/1.15 { ! contains_pq( X, Y ), ! issmallestelement_pq( X, Y ), pi_sharp_find_min
% 0.69/1.15 ( X, Y ) }.
% 0.69/1.15 { ! pi_find_min( X ), pi_sharp_find_min( i( X ), skol2( X ) ) }.
% 0.69/1.15 { ! pi_sharp_find_min( i( X ), Y ), pi_find_min( X ) }.
% 0.69/1.15 { ! pi_sharp_removemin( X, Y ), contains_pq( X, Y ) }.
% 0.69/1.15 { ! pi_sharp_removemin( X, Y ), issmallestelement_pq( X, Y ) }.
% 0.69/1.15 { ! contains_pq( X, Y ), ! issmallestelement_pq( X, Y ), pi_sharp_removemin
% 0.69/1.15 ( X, Y ) }.
% 0.69/1.15 { ! pi_removemin( X ), pi_sharp_find_min( i( X ), skol3( X ) ) }.
% 0.69/1.15 { ! pi_sharp_find_min( i( X ), Y ), pi_removemin( X ) }.
% 0.69/1.15 { ! phi( X ), alpha2( skol4( Y ) ) }.
% 0.69/1.15 { ! phi( X ), succ_cpq( X, skol4( X ) ) }.
% 0.69/1.15 { ! succ_cpq( X, Y ), ! alpha2( Y ), phi( X ) }.
% 0.69/1.15 { ! alpha2( X ), ok( X ) }.
% 0.69/1.15 { ! alpha2( X ), check_cpq( X ) }.
% 0.69/1.15 { ! ok( X ), ! check_cpq( X ), alpha2( X ) }.
% 0.69/1.15 { alpha3( skol5, skol6, skol7 ), contains_pq( i( triple( skol5, create_slb
% 0.69/1.15 , skol6 ) ), skol7 ) }.
% 0.69/1.15 { alpha3( skol5, skol6, skol7 ), ! contains_cpq( triple( skol5, create_slb
% 0.69/1.15 , skol6 ), skol7 ) }.
% 0.69/1.15 { ! alpha3( X, Y, Z ), contains_cpq( triple( X, create_slb, Y ), Z ) }.
% 0.69/1.15 { ! alpha3( X, Y, Z ), ! contains_pq( i( triple( X, create_slb, Y ) ), Z )
% 0.69/1.15 }.
% 0.69/1.15 { ! contains_cpq( triple( X, create_slb, Y ), Z ), contains_pq( i( triple(
% 0.69/1.15 X, create_slb, Y ) ), Z ), alpha3( X, Y, Z ) }.
% 0.69/1.15
% 0.69/1.15 percentage equality = 0.221106, percentage horn = 0.824742
% 0.69/1.15 This is a problem with some equality
% 0.69/1.15
% 0.69/1.15
% 0.69/1.15
% 0.69/1.15 Options Used:
% 0.69/1.15
% 0.69/1.15 useres = 1
% 0.69/1.15 useparamod = 1
% 0.69/1.15 useeqrefl = 1
% 0.69/1.15 useeqfact = 1
% 0.69/1.15 usefactor = 1
% 0.69/1.15 usesimpsplitting = 0
% 0.69/1.15 usesimpdemod = 5
% 0.69/1.15 usesimpres = 3
% 0.69/1.15
% 0.69/1.15 resimpinuse = 1000
% 0.69/1.15 resimpclauses = 20000
% 0.69/1.15 substype = eqrewr
% 0.69/1.15 backwardsubs = 1
% 0.69/1.15 selectoldest = 5
% 0.69/1.15
% 0.69/1.15 litorderings [0] = split
% 0.69/1.15 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.15
% 0.69/1.15 termordering = kbo
% 0.69/1.15
% 0.69/1.15 litapriori = 0
% 0.69/1.15 termapriori = 1
% 0.69/1.15 litaposteriori = 0
% 0.69/1.15 termaposteriori = 0
% 0.69/1.15 demodaposteriori = 0
% 0.69/1.15 ordereqreflfact = 0
% 0.69/1.15
% 0.69/1.15 litselect = negord
% 0.69/1.15
% 0.69/1.15 maxweight = 15
% 0.69/1.15 maxdepth = 30000
% 0.69/1.15 maxlength = 115
% 0.69/1.15 maxnrvars = 195
% 0.74/1.24 excuselevel = 1
% 0.74/1.24 increasemaxweight = 1
% 0.74/1.24
% 0.74/1.24 maxselected = 10000000
% 0.74/1.24 maxnrclauses = 10000000
% 0.74/1.24
% 0.74/1.24 showgenerated = 0
% 0.74/1.24 showkept = 0
% 0.74/1.24 showselected = 0
% 0.74/1.24 showdeleted = 0
% 0.74/1.24 showresimp = 1
% 0.74/1.24 showstatus = 2000
% 0.74/1.24
% 0.74/1.24 prologoutput = 0
% 0.74/1.24 nrgoals = 5000000
% 0.74/1.24 totalproof = 1
% 0.74/1.24
% 0.74/1.24 Symbols occurring in the translation:
% 0.74/1.24
% 0.74/1.24 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.24 . [1, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.74/1.24 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 0.74/1.24 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.74/1.24 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.24 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.24 less_than [38, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.74/1.24 strictly_less_than [39, 2] (w:1, o:71, a:1, s:1, b:0),
% 0.74/1.24 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.74/1.24 create_pq [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.74/1.24 isnonempty_pq [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.24 insert_pq [43, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.74/1.24 contains_pq [44, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.74/1.24 issmallestelement_pq [45, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.74/1.24 remove_pq [46, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.74/1.24 findmin_pq_eff [47, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.74/1.24 findmin_pq_res [48, 2] (w:1, o:76, a:1, s:1, b:0),
% 0.74/1.24 removemin_pq_eff [49, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.74/1.24 removemin_pq_res [50, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.74/1.24 create_slb [51, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.74/1.24 isnonempty_slb [52, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.24 pair [53, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.74/1.24 insert_slb [54, 2] (w:1, o:78, a:1, s:1, b:0),
% 0.74/1.24 contains_slb [55, 2] (w:1, o:79, a:1, s:1, b:0),
% 0.74/1.24 pair_in_list [57, 3] (w:1, o:91, a:1, s:1, b:0),
% 0.74/1.24 remove_slb [59, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.74/1.24 lookup_slb [60, 2] (w:1, o:80, a:1, s:1, b:0),
% 0.74/1.24 update_slb [61, 2] (w:1, o:81, a:1, s:1, b:0),
% 0.74/1.24 succ_cpq [62, 2] (w:1, o:82, a:1, s:1, b:0),
% 0.74/1.24 insert_cpq [63, 2] (w:1, o:83, a:1, s:1, b:0),
% 0.74/1.24 remove_cpq [64, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.74/1.24 findmin_cpq_eff [65, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.24 removemin_cpq_eff [66, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.74/1.24 triple [67, 3] (w:1, o:92, a:1, s:1, b:0),
% 0.74/1.24 check_cpq [68, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.74/1.24 contains_cpq [69, 2] (w:1, o:84, a:1, s:1, b:0),
% 0.74/1.24 bad [70, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.74/1.24 ok [71, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.74/1.24 insert_pqp [72, 2] (w:1, o:85, a:1, s:1, b:0),
% 0.74/1.24 remove_pqp [73, 2] (w:1, o:70, a:1, s:1, b:0),
% 0.74/1.24 findmin_pqp_res [74, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.74/1.24 findmin_cpq_res [75, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.74/1.24 removemin_cpq_res [76, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.74/1.24 i [77, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.74/1.24 pi_sharp_remove [78, 2] (w:1, o:87, a:1, s:1, b:0),
% 0.74/1.24 pi_remove [79, 2] (w:1, o:86, a:1, s:1, b:0),
% 0.74/1.24 pi_sharp_find_min [80, 2] (w:1, o:88, a:1, s:1, b:0),
% 0.74/1.24 pi_find_min [81, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.74/1.24 pi_sharp_removemin [82, 2] (w:1, o:89, a:1, s:1, b:0),
% 0.74/1.24 pi_removemin [83, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.74/1.24 phi [84, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.74/1.24 alpha1 [85, 4] (w:1, o:94, a:1, s:1, b:1),
% 0.74/1.24 alpha2 [86, 1] (w:1, o:36, a:1, s:1, b:1),
% 0.74/1.24 alpha3 [87, 3] (w:1, o:93, a:1, s:1, b:1),
% 0.74/1.24 skol1 [88, 2] (w:1, o:90, a:1, s:1, b:1),
% 0.74/1.24 skol2 [89, 1] (w:1, o:37, a:1, s:1, b:1),
% 0.74/1.24 skol3 [90, 1] (w:1, o:38, a:1, s:1, b:1),
% 0.74/1.24 skol4 [91, 1] (w:1, o:39, a:1, s:1, b:1),
% 0.74/1.24 skol5 [92, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.74/1.24 skol6 [93, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.74/1.24 skol7 [94, 0] (w:1, o:17, a:1, s:1, b:1).
% 0.74/1.24
% 0.74/1.24
% 0.74/1.24 Starting Search:
% 0.74/1.24
% 0.74/1.24 *** allocated 15000 integers for clauses
% 0.74/1.24 *** allocated 22500 integers for clauses
% 0.74/1.24 *** allocated 33750 integers for clauses
% 0.74/1.24 *** allocated 15000 integers for termspace/termends
% 0.74/1.24 *** allocated 50625 integers for clauses
% 0.74/1.24 *** allocated 22500 integers for termspace/termends
% 0.74/1.24 *** allocated 75937 integers for clauses
% 0.74/1.24 Resimplifying inuse:
% 0.74/1.24 Done
% 0.74/1.24
% 0.74/1.24 *** allocated 33750 integers for termspace/termends
% 0.74/1.24 *** allocated 113905 integers for clauses
% 0.74/1.24 *** allocated 50625 integers for termspace/termends
% 0.74/1.24
% 0.74/1.24 Intermediate Status:
% 0.74/1.24 Generated: 3985
% 0.74/1.24 Kept: 2002
% 0.74/1.24 Inuse: 162
% 0.74/1.24 Deleted: 1
% 0.74/1.24 Deletedinuse: 0
% 0.74/1.24
% 0.74/1.24 Resimplifying inuse:
% 0.74/1.24 Done
% 0.74/1.24
% 0.74/1.24 *** allocated 170857 integers for clauses
% 0.74/1.24 *** allocated 75937 integers for termspace/termends
% 0.74/1.24 Resimplifying inuse:
% 0.74/1.24 Done
% 0.74/1.24
% 0.74/1.24 *** allocated 256285 integers for clauses
% 0.74/1.24 *** allocated 113905 integers for termspace/termends
% 0.74/1.24
% 0.74/1.24 Intermediate Status:
% 0.74/1.24 Generated: 8090
% 0.74/1.24 Kept: 4077
% 0.74/1.24 Inuse: 235
% 0.74/1.24 Deleted: 1
% 0.74/1.24 Deletedinuse: 0
% 0.74/1.24
% 0.74/1.24 Resimplifying inuse:
% 0.74/1.24 Done
% 0.74/1.24
% 0.74/1.24 *** allocated 384427 integers for clauses
% 0.74/1.24 Resimplifying inuse:
% 0.74/1.24 Done
% 0.74/1.24
% 0.74/1.24 *** allocated 170857 integers for termspace/termends
% 0.74/1.24
% 0.74/1.24 Bliksems!, er is een bewijs:
% 0.74/1.24 % SZS status Theorem
% 0.74/1.24 % SZS output start Refutation
% 0.74/1.24
% 0.74/1.24 (9) {G0,W3,D2,L1,V1,M1} I { ! contains_pq( create_pq, X ) }.
% 0.74/1.24 (25) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X ) }.
% 0.74/1.24 (53) {G0,W9,D3,L2,V4,M2} I { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.74/1.24 contains_slb( Y, T ) }.
% 0.74/1.24 (70) {G0,W7,D4,L1,V2,M1} I { i( triple( X, create_slb, Y ) ) ==> create_pq
% 0.74/1.24 }.
% 0.74/1.24 (92) {G1,W4,D2,L1,V0,M1} I;d(70);r(9) { alpha3( skol5, skol6, skol7 ) }.
% 0.74/1.24 (93) {G0,W10,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), contains_cpq( triple( X
% 0.74/1.24 , create_slb, Y ), Z ) }.
% 0.74/1.24 (2666) {G1,W6,D3,L1,V3,M1} R(53,25) { ! contains_cpq( triple( X, create_slb
% 0.74/1.24 , Y ), Z ) }.
% 0.74/1.24 (5557) {G2,W4,D2,L1,V3,M1} S(93);r(2666) { ! alpha3( X, Y, Z ) }.
% 0.74/1.24 (5558) {G3,W0,D0,L0,V0,M0} R(5557,92) { }.
% 0.74/1.24
% 0.74/1.24
% 0.74/1.24 % SZS output end Refutation
% 0.74/1.24 found a proof!
% 0.74/1.24
% 0.74/1.24
% 0.74/1.24 Unprocessed initial clauses:
% 0.74/1.24
% 0.74/1.24 (5560) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.74/1.24 less_than( X, Y ) }.
% 0.74/1.24 (5561) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.74/1.24 (5562) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.74/1.24 (5563) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.74/1.24 ) }.
% 0.74/1.24 (5564) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.74/1.24 , X ) }.
% 0.74/1.24 (5565) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.74/1.24 strictly_less_than( X, Y ) }.
% 0.74/1.24 (5566) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.74/1.24 (5567) {G0,W2,D2,L1,V0,M1} { ! isnonempty_pq( create_pq ) }.
% 0.74/1.24 (5568) {G0,W4,D3,L1,V2,M1} { isnonempty_pq( insert_pq( X, Y ) ) }.
% 0.74/1.24 (5569) {G0,W3,D2,L1,V1,M1} { ! contains_pq( create_pq, X ) }.
% 0.74/1.24 (5570) {G0,W11,D3,L3,V3,M3} { ! contains_pq( insert_pq( X, Y ), Z ),
% 0.74/1.24 contains_pq( X, Z ), Y = Z }.
% 0.74/1.24 (5571) {G0,W8,D3,L2,V3,M2} { ! contains_pq( X, Z ), contains_pq( insert_pq
% 0.74/1.24 ( X, Y ), Z ) }.
% 0.74/1.24 (5572) {G0,W8,D3,L2,V3,M2} { ! Y = Z, contains_pq( insert_pq( X, Y ), Z )
% 0.74/1.24 }.
% 0.74/1.24 (5573) {G0,W9,D2,L3,V3,M3} { ! issmallestelement_pq( X, Y ), ! contains_pq
% 0.74/1.24 ( X, Z ), less_than( Y, Z ) }.
% 0.74/1.24 (5574) {G0,W8,D3,L2,V3,M2} { ! less_than( Y, skol1( Z, Y ) ),
% 0.74/1.24 issmallestelement_pq( X, Y ) }.
% 0.74/1.24 (5575) {G0,W8,D3,L2,V2,M2} { contains_pq( X, skol1( X, Y ) ),
% 0.74/1.24 issmallestelement_pq( X, Y ) }.
% 0.74/1.24 (5576) {G0,W7,D4,L1,V2,M1} { remove_pq( insert_pq( X, Y ), Y ) = X }.
% 0.74/1.24 (5577) {G0,W17,D4,L3,V3,M3} { ! contains_pq( X, Z ), Y = Z, remove_pq(
% 0.74/1.24 insert_pq( X, Y ), Z ) = insert_pq( remove_pq( X, Z ), Y ) }.
% 0.74/1.24 (5578) {G0,W11,D3,L3,V2,M3} { ! contains_pq( X, Y ), !
% 0.74/1.24 issmallestelement_pq( X, Y ), findmin_pq_eff( X, Y ) = X }.
% 0.74/1.24 (5579) {G0,W11,D3,L3,V2,M3} { ! contains_pq( X, Y ), !
% 0.74/1.24 issmallestelement_pq( X, Y ), findmin_pq_res( X, Y ) = Y }.
% 0.74/1.24 (5580) {G0,W13,D3,L3,V2,M3} { ! contains_pq( X, Y ), !
% 0.74/1.24 issmallestelement_pq( X, Y ), removemin_pq_eff( X, Y ) = remove_pq( X, Y
% 0.74/1.24 ) }.
% 0.74/1.24 (5581) {G0,W11,D3,L3,V2,M3} { ! contains_pq( X, Y ), !
% 0.74/1.24 issmallestelement_pq( X, Y ), removemin_pq_res( X, Y ) = Y }.
% 0.74/1.24 (5582) {G0,W11,D4,L1,V3,M1} { insert_pq( insert_pq( X, Y ), Z ) =
% 0.74/1.24 insert_pq( insert_pq( X, Z ), Y ) }.
% 0.74/1.24 (5583) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.74/1.24 (5584) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.74/1.24 ) }.
% 0.74/1.24 (5585) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.74/1.24 (5586) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.74/1.24 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.74/1.24 (5587) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.74/1.24 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.74/1.24 (5588) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.74/1.24 Y, T ) ), Z ) }.
% 0.74/1.24 (5589) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.74/1.24 (5590) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.74/1.24 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.74/1.24 (5591) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.74/1.24 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.74/1.24 (5592) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.74/1.24 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.74/1.24 (5593) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.74/1.24 (5594) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.74/1.24 (5595) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.74/1.24 (5596) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.74/1.24 ) = X }.
% 0.74/1.24 (5597) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.74/1.24 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.74/1.24 ( Y, T ) ) }.
% 0.74/1.24 (5598) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.74/1.24 ) = Z }.
% 0.74/1.24 (5599) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.74/1.24 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.74/1.24 (5600) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.74/1.24 (5601) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.74/1.24 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.74/1.24 ( T, X ) ) }.
% 0.74/1.24 (5602) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.74/1.24 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.74/1.24 }.
% 0.74/1.24 (5603) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 0.74/1.24 (5604) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq(
% 0.74/1.24 Y, Z ) ) }.
% 0.74/1.24 (5605) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq(
% 0.74/1.24 Y, Z ) ) }.
% 0.74/1.24 (5606) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.74/1.24 findmin_cpq_eff( Y ) ) }.
% 0.74/1.24 (5607) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 0.74/1.24 removemin_cpq_eff( Y ) ) }.
% 0.74/1.24 (5608) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.74/1.24 (5609) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.74/1.24 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 0.74/1.24 }.
% 0.74/1.24 (5610) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 0.74/1.24 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 0.74/1.24 }.
% 0.74/1.24 (5611) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 0.74/1.24 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.74/1.24 (5612) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 0.74/1.24 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.74/1.24 (5613) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 0.74/1.24 contains_slb( Y, T ) }.
% 0.74/1.24 (5614) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 0.74/1.24 ( X, Y, Z ), T ) }.
% 0.74/1.24 (5615) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 0.74/1.24 (5616) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.74/1.24 (5617) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 0.74/1.24 (5618) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 0.74/1.24 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.74/1.24 (5619) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 0.74/1.24 , X, T ), Y ) = triple( Z, X, bad ) }.
% 0.74/1.24 (5620) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 0.74/1.24 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.74/1.24 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 0.74/1.24 (5621) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! strictly_less_than
% 0.74/1.24 ( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 0.74/1.24 remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 0.74/1.24 (5622) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 0.74/1.24 ) = triple( X, create_slb, bad ) }.
% 0.74/1.24 (5623) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 0.74/1.24 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 0.74/1.24 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.74/1.24 (5624) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.74/1.24 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 0.74/1.24 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 0.74/1.24 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 0.74/1.24 (5625) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 0.74/1.24 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 0.74/1.24 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 0.74/1.24 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 0.74/1.24 (5626) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y ) )
% 0.74/1.24 = bottom }.
% 0.74/1.24 (5627) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y,
% 0.74/1.24 X, Z ) ) = findmin_pqp_res( Y ) }.
% 0.74/1.24 (5628) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 0.74/1.24 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 0.74/1.24 (5629) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X )
% 0.74/1.24 }.
% 0.74/1.24 (5630) {G0,W7,D4,L1,V2,M1} { i( triple( X, create_slb, Y ) ) = create_pq
% 0.74/1.24 }.
% 0.74/1.24 (5631) {G0,W17,D6,L1,V5,M1} { i( triple( X, insert_slb( Y, pair( T, U ) )
% 0.74/1.24 , Z ) ) = insert_pq( i( triple( X, Y, Z ) ), T ) }.
% 0.74/1.24 (5632) {G0,W6,D2,L2,V2,M2} { ! pi_sharp_remove( X, Y ), contains_pq( X, Y
% 0.74/1.24 ) }.
% 0.74/1.24 (5633) {G0,W6,D2,L2,V2,M2} { ! contains_pq( X, Y ), pi_sharp_remove( X, Y
% 0.74/1.24 ) }.
% 0.74/1.24 (5634) {G0,W7,D3,L2,V2,M2} { ! pi_remove( X, Y ), pi_sharp_remove( i( X )
% 0.74/1.24 , Y ) }.
% 0.74/1.24 (5635) {G0,W7,D3,L2,V2,M2} { ! pi_sharp_remove( i( X ), Y ), pi_remove( X
% 0.74/1.24 , Y ) }.
% 0.74/1.24 (5636) {G0,W6,D2,L2,V2,M2} { ! pi_sharp_find_min( X, Y ), contains_pq( X,
% 0.74/1.24 Y ) }.
% 0.74/1.24 (5637) {G0,W6,D2,L2,V2,M2} { ! pi_sharp_find_min( X, Y ),
% 0.74/1.24 issmallestelement_pq( X, Y ) }.
% 0.74/1.24 (5638) {G0,W9,D2,L3,V2,M3} { ! contains_pq( X, Y ), ! issmallestelement_pq
% 0.74/1.24 ( X, Y ), pi_sharp_find_min( X, Y ) }.
% 0.74/1.24 (5639) {G0,W7,D3,L2,V1,M2} { ! pi_find_min( X ), pi_sharp_find_min( i( X )
% 0.74/1.24 , skol2( X ) ) }.
% 0.74/1.24 (5640) {G0,W6,D3,L2,V2,M2} { ! pi_sharp_find_min( i( X ), Y ), pi_find_min
% 0.74/1.24 ( X ) }.
% 0.74/1.24 (5641) {G0,W6,D2,L2,V2,M2} { ! pi_sharp_removemin( X, Y ), contains_pq( X
% 0.74/1.24 , Y ) }.
% 0.74/1.24 (5642) {G0,W6,D2,L2,V2,M2} { ! pi_sharp_removemin( X, Y ),
% 0.74/1.24 issmallestelement_pq( X, Y ) }.
% 0.74/1.24 (5643) {G0,W9,D2,L3,V2,M3} { ! contains_pq( X, Y ), ! issmallestelement_pq
% 0.74/1.24 ( X, Y ), pi_sharp_removemin( X, Y ) }.
% 0.74/1.24 (5644) {G0,W7,D3,L2,V1,M2} { ! pi_removemin( X ), pi_sharp_find_min( i( X
% 0.74/1.24 ), skol3( X ) ) }.
% 0.74/1.24 (5645) {G0,W6,D3,L2,V2,M2} { ! pi_sharp_find_min( i( X ), Y ),
% 0.74/1.24 pi_removemin( X ) }.
% 0.74/1.24 (5646) {G0,W5,D3,L2,V2,M2} { ! phi( X ), alpha2( skol4( Y ) ) }.
% 0.74/1.24 (5647) {G0,W6,D3,L2,V1,M2} { ! phi( X ), succ_cpq( X, skol4( X ) ) }.
% 0.74/1.24 (5648) {G0,W7,D2,L3,V2,M3} { ! succ_cpq( X, Y ), ! alpha2( Y ), phi( X )
% 0.74/1.24 }.
% 0.74/1.24 (5649) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), ok( X ) }.
% 0.74/1.24 (5650) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), check_cpq( X ) }.
% 0.74/1.24 (5651) {G0,W6,D2,L3,V1,M3} { ! ok( X ), ! check_cpq( X ), alpha2( X ) }.
% 0.74/1.24 (5652) {G0,W11,D4,L2,V0,M2} { alpha3( skol5, skol6, skol7 ), contains_pq(
% 0.74/1.24 i( triple( skol5, create_slb, skol6 ) ), skol7 ) }.
% 0.74/1.24 (5653) {G0,W10,D3,L2,V0,M2} { alpha3( skol5, skol6, skol7 ), !
% 0.74/1.24 contains_cpq( triple( skol5, create_slb, skol6 ), skol7 ) }.
% 0.74/1.24 (5654) {G0,W10,D3,L2,V3,M2} { ! alpha3( X, Y, Z ), contains_cpq( triple( X
% 0.74/1.24 , create_slb, Y ), Z ) }.
% 0.74/1.24 (5655) {G0,W11,D4,L2,V3,M2} { ! alpha3( X, Y, Z ), ! contains_pq( i(
% 0.74/1.24 triple( X, create_slb, Y ) ), Z ) }.
% 0.74/1.24 (5656) {G0,W17,D4,L3,V3,M3} { ! contains_cpq( triple( X, create_slb, Y ),
% 0.74/1.24 Z ), contains_pq( i( triple( X, create_slb, Y ) ), Z ), alpha3( X, Y, Z )
% 0.74/1.24 }.
% 0.74/1.24
% 0.74/1.24
% 0.74/1.24 Total Proof:
% 0.74/1.24
% 0.74/1.24 subsumption: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_pq( create_pq, X ) }.
% 0.74/1.24 parent0: (5569) {G0,W3,D2,L1,V1,M1} { ! contains_pq( create_pq, X ) }.
% 0.74/1.24 substitution0:
% 0.74/1.24 X := X
% 0.74/1.24 end
% 0.74/1.24 permutation0:
% 0.74/1.24 0 ==> 0
% 0.74/1.24 end
% 0.74/1.24
% 0.74/1.24 subsumption: (25) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 0.74/1.24 }.
% 0.74/1.24 parent0: (5585) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.74/1.24 substitution0:
% 0.74/1.24 X := X
% 0.74/1.24 end
% 0.74/1.24 permutation0:
% 0.74/1.24 0 ==> 0
% 0.74/1.24 end
% 0.74/1.24
% 0.74/1.24 subsumption: (53) {G0,W9,D3,L2,V4,M2} I { ! contains_cpq( triple( X, Y, Z )
% 0.74/1.24 , T ), contains_slb( Y, T ) }.
% 0.74/1.24 parent0: (5613) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T
% 0.74/1.24 ), contains_slb( Y, T ) }.
% 0.74/1.24 substitution0:
% 0.74/1.24 X := X
% 0.74/1.24 Y := Y
% 0.74/1.24 Z := Z
% 0.74/1.24 T := T
% 0.74/1.24 end
% 0.74/1.24 permutation0:
% 0.74/1.24 0 ==> 0
% 0.74/1.24 1 ==> 1
% 0.74/1.24 end
% 0.74/1.24
% 0.74/1.24 subsumption: (70) {G0,W7,D4,L1,V2,M1} I { i( triple( X, create_slb, Y ) )
% 0.74/1.25 ==> create_pq }.
% 0.74/1.25 parent0: (5630) {G0,W7,D4,L1,V2,M1} { i( triple( X, create_slb, Y ) ) =
% 0.74/1.25 create_pq }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := X
% 0.74/1.25 Y := Y
% 0.74/1.25 end
% 0.74/1.25 permutation0:
% 0.74/1.25 0 ==> 0
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 paramod: (5913) {G1,W7,D2,L2,V0,M2} { contains_pq( create_pq, skol7 ),
% 0.74/1.25 alpha3( skol5, skol6, skol7 ) }.
% 0.74/1.25 parent0[0]: (70) {G0,W7,D4,L1,V2,M1} I { i( triple( X, create_slb, Y ) )
% 0.74/1.25 ==> create_pq }.
% 0.74/1.25 parent1[1; 1]: (5652) {G0,W11,D4,L2,V0,M2} { alpha3( skol5, skol6, skol7 )
% 0.74/1.25 , contains_pq( i( triple( skol5, create_slb, skol6 ) ), skol7 ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := skol5
% 0.74/1.25 Y := skol6
% 0.74/1.25 end
% 0.74/1.25 substitution1:
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 resolution: (5914) {G1,W4,D2,L1,V0,M1} { alpha3( skol5, skol6, skol7 ) }.
% 0.74/1.25 parent0[0]: (9) {G0,W3,D2,L1,V1,M1} I { ! contains_pq( create_pq, X ) }.
% 0.74/1.25 parent1[0]: (5913) {G1,W7,D2,L2,V0,M2} { contains_pq( create_pq, skol7 ),
% 0.74/1.25 alpha3( skol5, skol6, skol7 ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := skol7
% 0.74/1.25 end
% 0.74/1.25 substitution1:
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 subsumption: (92) {G1,W4,D2,L1,V0,M1} I;d(70);r(9) { alpha3( skol5, skol6,
% 0.74/1.25 skol7 ) }.
% 0.74/1.25 parent0: (5914) {G1,W4,D2,L1,V0,M1} { alpha3( skol5, skol6, skol7 ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 end
% 0.74/1.25 permutation0:
% 0.74/1.25 0 ==> 0
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 subsumption: (93) {G0,W10,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ),
% 0.74/1.25 contains_cpq( triple( X, create_slb, Y ), Z ) }.
% 0.74/1.25 parent0: (5654) {G0,W10,D3,L2,V3,M2} { ! alpha3( X, Y, Z ), contains_cpq(
% 0.74/1.25 triple( X, create_slb, Y ), Z ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := X
% 0.74/1.25 Y := Y
% 0.74/1.25 Z := Z
% 0.74/1.25 end
% 0.74/1.25 permutation0:
% 0.74/1.25 0 ==> 0
% 0.74/1.25 1 ==> 1
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 resolution: (5972) {G1,W6,D3,L1,V3,M1} { ! contains_cpq( triple( Y,
% 0.74/1.25 create_slb, Z ), X ) }.
% 0.74/1.25 parent0[0]: (25) {G0,W3,D2,L1,V1,M1} I { ! contains_slb( create_slb, X )
% 0.74/1.25 }.
% 0.74/1.25 parent1[1]: (53) {G0,W9,D3,L2,V4,M2} I { ! contains_cpq( triple( X, Y, Z )
% 0.74/1.25 , T ), contains_slb( Y, T ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := X
% 0.74/1.25 end
% 0.74/1.25 substitution1:
% 0.74/1.25 X := Y
% 0.74/1.25 Y := create_slb
% 0.74/1.25 Z := Z
% 0.74/1.25 T := X
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 subsumption: (2666) {G1,W6,D3,L1,V3,M1} R(53,25) { ! contains_cpq( triple(
% 0.74/1.25 X, create_slb, Y ), Z ) }.
% 0.74/1.25 parent0: (5972) {G1,W6,D3,L1,V3,M1} { ! contains_cpq( triple( Y,
% 0.74/1.25 create_slb, Z ), X ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := Z
% 0.74/1.25 Y := X
% 0.74/1.25 Z := Y
% 0.74/1.25 end
% 0.74/1.25 permutation0:
% 0.74/1.25 0 ==> 0
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 resolution: (5973) {G1,W4,D2,L1,V3,M1} { ! alpha3( X, Y, Z ) }.
% 0.74/1.25 parent0[0]: (2666) {G1,W6,D3,L1,V3,M1} R(53,25) { ! contains_cpq( triple( X
% 0.74/1.25 , create_slb, Y ), Z ) }.
% 0.74/1.25 parent1[1]: (93) {G0,W10,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), contains_cpq
% 0.74/1.25 ( triple( X, create_slb, Y ), Z ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := X
% 0.74/1.25 Y := Y
% 0.74/1.25 Z := Z
% 0.74/1.25 end
% 0.74/1.25 substitution1:
% 0.74/1.25 X := X
% 0.74/1.25 Y := Y
% 0.74/1.25 Z := Z
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 subsumption: (5557) {G2,W4,D2,L1,V3,M1} S(93);r(2666) { ! alpha3( X, Y, Z )
% 0.74/1.25 }.
% 0.74/1.25 parent0: (5973) {G1,W4,D2,L1,V3,M1} { ! alpha3( X, Y, Z ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := X
% 0.74/1.25 Y := Y
% 0.74/1.25 Z := Z
% 0.74/1.25 end
% 0.74/1.25 permutation0:
% 0.74/1.25 0 ==> 0
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 resolution: (5974) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.25 parent0[0]: (5557) {G2,W4,D2,L1,V3,M1} S(93);r(2666) { ! alpha3( X, Y, Z )
% 0.74/1.25 }.
% 0.74/1.25 parent1[0]: (92) {G1,W4,D2,L1,V0,M1} I;d(70);r(9) { alpha3( skol5, skol6,
% 0.74/1.25 skol7 ) }.
% 0.74/1.25 substitution0:
% 0.74/1.25 X := skol5
% 0.74/1.25 Y := skol6
% 0.74/1.25 Z := skol7
% 0.74/1.25 end
% 0.74/1.25 substitution1:
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 subsumption: (5558) {G3,W0,D0,L0,V0,M0} R(5557,92) { }.
% 0.74/1.25 parent0: (5974) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.25 substitution0:
% 0.74/1.25 end
% 0.74/1.25 permutation0:
% 0.74/1.25 end
% 0.74/1.25
% 0.74/1.25 Proof check complete!
% 0.74/1.25
% 0.74/1.25 Memory use:
% 0.74/1.25
% 0.74/1.25 space for terms: 115783
% 0.74/1.25 space for clauses: 289479
% 0.74/1.25
% 0.74/1.25
% 0.74/1.25 clauses generated: 12032
% 0.74/1.25 clauses kept: 5559
% 0.74/1.25 clauses selected: 275
% 0.74/1.25 clauses deleted: 4
% 0.74/1.25 clauses inuse deleted: 2
% 0.74/1.25
% 0.74/1.25 subsentry: 11848
% 0.74/1.25 literals s-matched: 9308
% 0.74/1.25 literals matched: 8997
% 0.74/1.25 full subsumption: 3078
% 0.74/1.25
% 0.74/1.25 checksum: 1268891829
% 0.74/1.25
% 0.74/1.25
% 0.74/1.25 Bliksem ended
%------------------------------------------------------------------------------