TSTP Solution File: SWV376+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV376+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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.32s 1.75s
% Output : Refutation 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Wed Jun 15 20:43:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.08 *** allocated 10000 integers for termspace/termends
% 0.72/1.08 *** allocated 10000 integers for clauses
% 0.72/1.08 *** allocated 10000 integers for justifications
% 0.72/1.08 Bliksem 1.12
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Automatic Strategy Selection
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Clauses:
% 0.72/1.08
% 0.72/1.08 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.72/1.08 { less_than( X, Y ), less_than( Y, X ) }.
% 0.72/1.08 { less_than( X, X ) }.
% 0.72/1.08 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.72/1.08 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.72/1.08 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.72/1.08 { less_than( bottom, X ) }.
% 0.72/1.08 { ! isnonempty_slb( create_slb ) }.
% 0.72/1.08 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.72/1.08 { ! contains_slb( create_slb, X ) }.
% 0.72/1.08 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.72/1.08 , Y = Z }.
% 0.72/1.08 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.72/1.08 }.
% 0.72/1.08 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.72/1.08 { ! pair_in_list( create_slb, X, Y ) }.
% 0.72/1.08 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.72/1.08 , U ), alpha1( Y, Z, T, U ) }.
% 0.72/1.08 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.72/1.08 , U ) }.
% 0.72/1.08 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.72/1.08 ) }.
% 0.72/1.08 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.72/1.08 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.72/1.08 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.72/1.08 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.72/1.08 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.72/1.08 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.72/1.08 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.72/1.08 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.72/1.08 , Z ) = lookup_slb( X, Z ) }.
% 0.72/1.08 { update_slb( create_slb, X ) = create_slb }.
% 0.72/1.08 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.72/1.08 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.72/1.08 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.72/1.08 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.72/1.08 { succ_cpq( X, X ) }.
% 0.72/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.72/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.72/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.72/1.08 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.72/1.08 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.72/1.08 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.72/1.08 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.72/1.08 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.72/1.08 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.72/1.08 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.72/1.08 ( X, Y ) ), U ) ) }.
% 0.72/1.08 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.72/1.08 pair( X, Y ) ), U ) ) }.
% 0.72/1.08 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.72/1.08 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.72/1.08 { ! ok( triple( X, Y, bad ) ) }.
% 0.72/1.08 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.72/1.08 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.72/1.08 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.72/1.08 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.72/1.08 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.72/1.08 bad ) }.
% 0.72/1.08 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.72/1.08 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.72/1.08 , T ) }.
% 0.72/1.08 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.72/1.08 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.72/1.08 remove_slb( X, Y ), bad ) }.
% 0.72/1.08 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.72/1.08 bad ) }.
% 0.72/1.08 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.72/1.08 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.72/1.08 , bad ) }.
% 0.72/1.08 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.72/1.08 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.72/1.08 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.72/1.08 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.72/1.08 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.72/1.08 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 1.32/1.75 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 1.32/1.75 findmin_pqp_res( X ) ), Z ) }.
% 1.32/1.75 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 1.32/1.75 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 1.32/1.75 ) }.
% 1.32/1.75 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 1.32/1.75 findmin_cpq_res( X ) ) }.
% 1.32/1.75 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 1.32/1.75 { succ_cpq( triple( skol7, skol9, skol11 ), triple( skol1, skol3, skol5 ) )
% 1.32/1.75 , ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T, U, W
% 1.32/1.75 ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 { ! ok( triple( skol1, skol3, skol5 ) ), ok( triple( X, Y, Z ) ), !
% 1.32/1.75 succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W )
% 1.32/1.75 ) }.
% 1.32/1.75 { ok( im_succ_cpq( triple( skol1, skol3, skol5 ) ) ), ok( triple( X, Y, Z )
% 1.32/1.75 ), ! succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T,
% 1.32/1.75 U, W ) ) }.
% 1.32/1.75 { ok( triple( X, Y, Z ) ), ! ok( im_succ_cpq( triple( X, Y, Z ) ) ) }.
% 1.32/1.75 { ! ok( triple( skol2, skol4, skol6 ) ) }.
% 1.32/1.75 { succ_cpq( triple( skol2, skol4, skol6 ), triple( skol8, skol10, skol12 )
% 1.32/1.75 ) }.
% 1.32/1.75 { ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75
% 1.32/1.75 percentage equality = 0.256000, percentage horn = 0.770492
% 1.32/1.75 This is a problem with some equality
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Options Used:
% 1.32/1.75
% 1.32/1.75 useres = 1
% 1.32/1.75 useparamod = 1
% 1.32/1.75 useeqrefl = 1
% 1.32/1.75 useeqfact = 1
% 1.32/1.75 usefactor = 1
% 1.32/1.75 usesimpsplitting = 0
% 1.32/1.75 usesimpdemod = 5
% 1.32/1.75 usesimpres = 3
% 1.32/1.75
% 1.32/1.75 resimpinuse = 1000
% 1.32/1.75 resimpclauses = 20000
% 1.32/1.75 substype = eqrewr
% 1.32/1.75 backwardsubs = 1
% 1.32/1.75 selectoldest = 5
% 1.32/1.75
% 1.32/1.75 litorderings [0] = split
% 1.32/1.75 litorderings [1] = extend the termordering, first sorting on arguments
% 1.32/1.75
% 1.32/1.75 termordering = kbo
% 1.32/1.75
% 1.32/1.75 litapriori = 0
% 1.32/1.75 termapriori = 1
% 1.32/1.75 litaposteriori = 0
% 1.32/1.75 termaposteriori = 0
% 1.32/1.75 demodaposteriori = 0
% 1.32/1.75 ordereqreflfact = 0
% 1.32/1.75
% 1.32/1.75 litselect = negord
% 1.32/1.75
% 1.32/1.75 maxweight = 15
% 1.32/1.75 maxdepth = 30000
% 1.32/1.75 maxlength = 115
% 1.32/1.75 maxnrvars = 195
% 1.32/1.75 excuselevel = 1
% 1.32/1.75 increasemaxweight = 1
% 1.32/1.75
% 1.32/1.75 maxselected = 10000000
% 1.32/1.75 maxnrclauses = 10000000
% 1.32/1.75
% 1.32/1.75 showgenerated = 0
% 1.32/1.75 showkept = 0
% 1.32/1.75 showselected = 0
% 1.32/1.75 showdeleted = 0
% 1.32/1.75 showresimp = 1
% 1.32/1.75 showstatus = 2000
% 1.32/1.75
% 1.32/1.75 prologoutput = 0
% 1.32/1.75 nrgoals = 5000000
% 1.32/1.75 totalproof = 1
% 1.32/1.75
% 1.32/1.75 Symbols occurring in the translation:
% 1.32/1.75
% 1.32/1.75 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.32/1.75 . [1, 2] (w:1, o:47, a:1, s:1, b:0),
% 1.32/1.75 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 1.32/1.75 ! [4, 1] (w:0, o:33, a:1, s:1, b:0),
% 1.32/1.75 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.32/1.75 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.32/1.75 less_than [38, 2] (w:1, o:71, a:1, s:1, b:0),
% 1.32/1.75 strictly_less_than [39, 2] (w:1, o:75, a:1, s:1, b:0),
% 1.32/1.75 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.32/1.75 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 1.32/1.75 isnonempty_slb [42, 1] (w:1, o:38, a:1, s:1, b:0),
% 1.32/1.75 pair [43, 2] (w:1, o:76, a:1, s:1, b:0),
% 1.32/1.75 insert_slb [44, 2] (w:1, o:77, a:1, s:1, b:0),
% 1.32/1.75 contains_slb [45, 2] (w:1, o:78, a:1, s:1, b:0),
% 1.32/1.75 pair_in_list [47, 3] (w:1, o:85, a:1, s:1, b:0),
% 1.32/1.75 remove_slb [49, 2] (w:1, o:72, a:1, s:1, b:0),
% 1.32/1.75 lookup_slb [50, 2] (w:1, o:79, a:1, s:1, b:0),
% 1.32/1.75 update_slb [51, 2] (w:1, o:80, a:1, s:1, b:0),
% 1.32/1.75 succ_cpq [52, 2] (w:1, o:81, a:1, s:1, b:0),
% 1.32/1.75 insert_cpq [53, 2] (w:1, o:82, a:1, s:1, b:0),
% 1.32/1.75 remove_cpq [54, 2] (w:1, o:73, a:1, s:1, b:0),
% 1.32/1.75 findmin_cpq_eff [55, 1] (w:1, o:39, a:1, s:1, b:0),
% 1.32/1.75 removemin_cpq_eff [56, 1] (w:1, o:40, a:1, s:1, b:0),
% 1.32/1.75 triple [57, 3] (w:1, o:86, a:1, s:1, b:0),
% 1.32/1.75 check_cpq [58, 1] (w:1, o:41, a:1, s:1, b:0),
% 1.32/1.75 contains_cpq [59, 2] (w:1, o:83, a:1, s:1, b:0),
% 1.32/1.75 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.32/1.75 ok [61, 1] (w:1, o:42, a:1, s:1, b:0),
% 1.32/1.75 insert_pqp [62, 2] (w:1, o:84, a:1, s:1, b:0),
% 1.32/1.75 remove_pqp [63, 2] (w:1, o:74, a:1, s:1, b:0),
% 1.32/1.75 findmin_pqp_res [64, 1] (w:1, o:43, a:1, s:1, b:0),
% 1.32/1.75 findmin_cpq_res [65, 1] (w:1, o:44, a:1, s:1, b:0),
% 1.32/1.75 removemin_cpq_res [66, 1] (w:1, o:45, a:1, s:1, b:0),
% 1.32/1.75 im_succ_cpq [68, 1] (w:1, o:46, a:1, s:1, b:0),
% 1.32/1.75 alpha1 [75, 4] (w:1, o:87, a:1, s:1, b:1),
% 1.32/1.75 skol1 [76, 0] (w:1, o:21, a:1, s:1, b:1),
% 1.32/1.75 skol2 [77, 0] (w:1, o:25, a:1, s:1, b:1),
% 1.32/1.75 skol3 [78, 0] (w:1, o:26, a:1, s:1, b:1),
% 1.32/1.75 skol4 [79, 0] (w:1, o:27, a:1, s:1, b:1),
% 1.32/1.75 skol5 [80, 0] (w:1, o:28, a:1, s:1, b:1),
% 1.32/1.75 skol6 [81, 0] (w:1, o:29, a:1, s:1, b:1),
% 1.32/1.75 skol7 [82, 0] (w:1, o:30, a:1, s:1, b:1),
% 1.32/1.75 skol8 [83, 0] (w:1, o:31, a:1, s:1, b:1),
% 1.32/1.75 skol9 [84, 0] (w:1, o:32, a:1, s:1, b:1),
% 1.32/1.75 skol10 [85, 0] (w:1, o:22, a:1, s:1, b:1),
% 1.32/1.75 skol11 [86, 0] (w:1, o:23, a:1, s:1, b:1),
% 1.32/1.75 skol12 [87, 0] (w:1, o:24, a:1, s:1, b:1).
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Starting Search:
% 1.32/1.75
% 1.32/1.75 *** allocated 15000 integers for clauses
% 1.32/1.75 *** allocated 22500 integers for clauses
% 1.32/1.75 *** allocated 33750 integers for clauses
% 1.32/1.75 *** allocated 15000 integers for termspace/termends
% 1.32/1.75 *** allocated 50625 integers for clauses
% 1.32/1.75 *** allocated 22500 integers for termspace/termends
% 1.32/1.75 *** allocated 75937 integers for clauses
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 33750 integers for termspace/termends
% 1.32/1.75 *** allocated 113905 integers for clauses
% 1.32/1.75 *** allocated 50625 integers for termspace/termends
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 3778
% 1.32/1.75 Kept: 2005
% 1.32/1.75 Inuse: 130
% 1.32/1.75 Deleted: 4
% 1.32/1.75 Deletedinuse: 1
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 170857 integers for clauses
% 1.32/1.75 *** allocated 75937 integers for termspace/termends
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 256285 integers for clauses
% 1.32/1.75 *** allocated 113905 integers for termspace/termends
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 9115
% 1.32/1.75 Kept: 4064
% 1.32/1.75 Inuse: 180
% 1.32/1.75 Deleted: 6
% 1.32/1.75 Deletedinuse: 3
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 384427 integers for clauses
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 170857 integers for termspace/termends
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 13947
% 1.32/1.75 Kept: 6073
% 1.32/1.75 Inuse: 253
% 1.32/1.75 Deleted: 11
% 1.32/1.75 Deletedinuse: 6
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 576640 integers for clauses
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 25613
% 1.32/1.75 Kept: 8083
% 1.32/1.75 Inuse: 288
% 1.32/1.75 Deleted: 11
% 1.32/1.75 Deletedinuse: 6
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 256285 integers for termspace/termends
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 35311
% 1.32/1.75 Kept: 10089
% 1.32/1.75 Inuse: 345
% 1.32/1.75 Deleted: 16
% 1.32/1.75 Deletedinuse: 6
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 864960 integers for clauses
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 44613
% 1.32/1.75 Kept: 12378
% 1.32/1.75 Inuse: 377
% 1.32/1.75 Deleted: 28
% 1.32/1.75 Deletedinuse: 8
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 60763
% 1.32/1.75 Kept: 14401
% 1.32/1.75 Inuse: 482
% 1.32/1.75 Deleted: 31
% 1.32/1.75 Deletedinuse: 8
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 384427 integers for termspace/termends
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 70412
% 1.32/1.75 Kept: 16412
% 1.32/1.75 Inuse: 516
% 1.32/1.75 Deleted: 31
% 1.32/1.75 Deletedinuse: 8
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 *** allocated 1297440 integers for clauses
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Intermediate Status:
% 1.32/1.75 Generated: 84773
% 1.32/1.75 Kept: 18642
% 1.32/1.75 Inuse: 579
% 1.32/1.75 Deleted: 31
% 1.32/1.75 Deletedinuse: 8
% 1.32/1.75
% 1.32/1.75 Resimplifying inuse:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75 Resimplifying clauses:
% 1.32/1.75 Done
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Bliksems!, er is een bewijs:
% 1.32/1.75 % SZS status Theorem
% 1.32/1.75 % SZS output start Refutation
% 1.32/1.75
% 1.32/1.75 (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad }.
% 1.32/1.75 (55) {G0,W24,D3,L4,V6,M4} I { ! ok( triple( skol1, skol3, skol5 ) ), ok(
% 1.32/1.75 triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ),
% 1.32/1.75 ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 (56) {G0,W25,D4,L4,V6,M4} I { ok( im_succ_cpq( triple( skol1, skol3, skol5
% 1.32/1.75 ) ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T
% 1.32/1.75 , U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 (57) {G0,W11,D4,L2,V3,M2} I { ok( triple( X, Y, Z ) ), ! ok( im_succ_cpq(
% 1.32/1.75 triple( X, Y, Z ) ) ) }.
% 1.32/1.75 (58) {G0,W5,D3,L1,V0,M1} I { ! ok( triple( skol2, skol4, skol6 ) ) }.
% 1.32/1.75 (59) {G0,W9,D3,L1,V0,M1} I { succ_cpq( triple( skol2, skol4, skol6 ),
% 1.32/1.75 triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 (60) {G0,W5,D3,L1,V0,M1} I { ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 (1267) {G1,W3,D2,L1,V0,M1} R(41,58) { skol6 ==> bad }.
% 1.32/1.75 (1438) {G1,W5,D3,L1,V2,M1} P(41,60);r(39) { ok( triple( X, Y, skol12 ) )
% 1.32/1.75 }.
% 1.32/1.75 (4804) {G1,W6,D4,L1,V2,M1} R(57,39) { ! ok( im_succ_cpq( triple( X, Y, bad
% 1.32/1.75 ) ) ) }.
% 1.32/1.75 (4920) {G2,W9,D3,L1,V0,M1} S(59);d(1267) { succ_cpq( triple( skol2, skol4,
% 1.32/1.75 bad ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 (14031) {G3,W11,D4,L2,V0,M2} R(4920,56);r(39) { ok( im_succ_cpq( triple(
% 1.32/1.75 skol1, skol3, skol5 ) ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 (14032) {G3,W10,D3,L2,V0,M2} R(4920,55);r(39) { ! ok( triple( skol1, skol3
% 1.32/1.75 , skol5 ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 (20015) {G4,W6,D4,L1,V0,M1} S(14031);r(1438) { ok( im_succ_cpq( triple(
% 1.32/1.75 skol1, skol3, skol5 ) ) ) }.
% 1.32/1.75 (20016) {G4,W5,D3,L1,V0,M1} S(14032);r(1438) { ! ok( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ) }.
% 1.32/1.75 (20021) {G5,W3,D2,L1,V0,M1} R(20016,41) { skol5 ==> bad }.
% 1.32/1.75 (20022) {G6,W0,D0,L0,V0,M0} S(20015);d(20021);r(4804) { }.
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 % SZS output end Refutation
% 1.32/1.75 found a proof!
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Unprocessed initial clauses:
% 1.32/1.75
% 1.32/1.75 (20024) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 1.32/1.75 less_than( X, Y ) }.
% 1.32/1.75 (20025) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 1.32/1.75 (20026) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 1.32/1.75 (20027) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X,
% 1.32/1.75 Y ) }.
% 1.32/1.75 (20028) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 1.32/1.75 , X ) }.
% 1.32/1.75 (20029) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 1.32/1.75 strictly_less_than( X, Y ) }.
% 1.32/1.75 (20030) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 1.32/1.75 (20031) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 1.32/1.75 (20032) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z )
% 1.32/1.75 ) ) }.
% 1.32/1.75 (20033) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 1.32/1.75 (20034) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 1.32/1.75 ), Z ), contains_slb( X, Z ), Y = Z }.
% 1.32/1.75 (20035) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 1.32/1.75 insert_slb( X, pair( Y, T ) ), Z ) }.
% 1.32/1.75 (20036) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair
% 1.32/1.75 ( Y, T ) ), Z ) }.
% 1.32/1.75 (20037) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 1.32/1.75 (20038) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 1.32/1.75 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 1.32/1.75 (20039) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 1.32/1.75 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.32/1.75 (20040) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 1.32/1.75 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.32/1.75 (20041) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 1.32/1.75 (20042) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 1.32/1.75 (20043) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 1.32/1.75 (20044) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.32/1.75 ) = X }.
% 1.32/1.75 (20045) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 1.32/1.75 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 1.32/1.75 ( Y, T ) ) }.
% 1.32/1.75 (20046) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.32/1.75 ) = Z }.
% 1.32/1.75 (20047) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 1.32/1.75 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 1.32/1.75 (20048) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 1.32/1.75 (20049) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 1.32/1.75 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 1.32/1.75 ( T, X ) ) }.
% 1.32/1.75 (20050) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 1.32/1.75 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 1.32/1.75 }.
% 1.32/1.75 (20051) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 1.32/1.75 (20052) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq
% 1.32/1.75 ( Y, Z ) ) }.
% 1.32/1.75 (20053) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq
% 1.32/1.75 ( Y, Z ) ) }.
% 1.32/1.75 (20054) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.32/1.75 findmin_cpq_eff( Y ) ) }.
% 1.32/1.75 (20055) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.32/1.75 removemin_cpq_eff( Y ) ) }.
% 1.32/1.75 (20056) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 1.32/1.75 (20057) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.32/1.75 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 1.32/1.75 }.
% 1.32/1.75 (20058) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.32/1.75 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 1.32/1.75 }.
% 1.32/1.75 (20059) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 1.32/1.75 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.32/1.75 (20060) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 1.32/1.75 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.32/1.75 (20061) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 1.32/1.75 contains_slb( Y, T ) }.
% 1.32/1.75 (20062) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 1.32/1.75 ( X, Y, Z ), T ) }.
% 1.32/1.75 (20063) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 (20064) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 (20065) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 1.32/1.75 (20066) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 1.32/1.75 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 1.32/1.75 (20067) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 1.32/1.75 , X, T ), Y ) = triple( Z, X, bad ) }.
% 1.32/1.75 (20068) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 1.32/1.75 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 1.32/1.75 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 1.32/1.75 (20069) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), !
% 1.32/1.75 strictly_less_than( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T
% 1.32/1.75 ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 1.32/1.75 (20070) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 1.32/1.75 ) = triple( X, create_slb, bad ) }.
% 1.32/1.75 (20071) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 1.32/1.75 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 1.32/1.75 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.32/1.75 (20072) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.32/1.75 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 1.32/1.75 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 1.32/1.75 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.32/1.75 (20073) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.32/1.75 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 1.32/1.75 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 1.32/1.75 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 1.32/1.75 (20074) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y )
% 1.32/1.75 ) = bottom }.
% 1.32/1.75 (20075) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y
% 1.32/1.75 , X, Z ) ) = findmin_pqp_res( Y ) }.
% 1.32/1.75 (20076) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 1.32/1.75 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 1.32/1.75 (20077) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X
% 1.32/1.75 ) }.
% 1.32/1.75 (20078) {G0,W28,D3,L4,V6,M4} { succ_cpq( triple( skol7, skol9, skol11 ),
% 1.32/1.75 triple( skol1, skol3, skol5 ) ), ok( triple( X, Y, Z ) ), ! succ_cpq(
% 1.32/1.75 triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 (20079) {G0,W24,D3,L4,V6,M4} { ! ok( triple( skol1, skol3, skol5 ) ), ok(
% 1.32/1.75 triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ),
% 1.32/1.75 ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 (20080) {G0,W25,D4,L4,V6,M4} { ok( im_succ_cpq( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ),
% 1.32/1.75 triple( T, U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 (20081) {G0,W11,D4,L2,V3,M2} { ok( triple( X, Y, Z ) ), ! ok( im_succ_cpq
% 1.32/1.75 ( triple( X, Y, Z ) ) ) }.
% 1.32/1.75 (20082) {G0,W5,D3,L1,V0,M1} { ! ok( triple( skol2, skol4, skol6 ) ) }.
% 1.32/1.75 (20083) {G0,W9,D3,L1,V0,M1} { succ_cpq( triple( skol2, skol4, skol6 ),
% 1.32/1.75 triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 (20084) {G0,W5,D3,L1,V0,M1} { ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Total Proof:
% 1.32/1.75
% 1.32/1.75 subsumption: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 parent0: (20063) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 1.32/1.75 }.
% 1.32/1.75 parent0: (20065) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad
% 1.32/1.75 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := Z
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 1 ==> 1
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (55) {G0,W24,D3,L4,V6,M4} I { ! ok( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple
% 1.32/1.75 ( T, U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 parent0: (20079) {G0,W24,D3,L4,V6,M4} { ! ok( triple( skol1, skol3, skol5
% 1.32/1.75 ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T,
% 1.32/1.75 U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := Z
% 1.32/1.75 T := T
% 1.32/1.75 U := U
% 1.32/1.75 W := W
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 1 ==> 1
% 1.32/1.75 2 ==> 2
% 1.32/1.75 3 ==> 3
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (56) {G0,W25,D4,L4,V6,M4} I { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, skol5 ) ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z
% 1.32/1.75 ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 parent0: (20080) {G0,W25,D4,L4,V6,M4} { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, skol5 ) ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z
% 1.32/1.75 ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := Z
% 1.32/1.75 T := T
% 1.32/1.75 U := U
% 1.32/1.75 W := W
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 1 ==> 1
% 1.32/1.75 2 ==> 2
% 1.32/1.75 3 ==> 3
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (57) {G0,W11,D4,L2,V3,M2} I { ok( triple( X, Y, Z ) ), ! ok(
% 1.32/1.75 im_succ_cpq( triple( X, Y, Z ) ) ) }.
% 1.32/1.75 parent0: (20081) {G0,W11,D4,L2,V3,M2} { ok( triple( X, Y, Z ) ), ! ok(
% 1.32/1.75 im_succ_cpq( triple( X, Y, Z ) ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := Z
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 1 ==> 1
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (58) {G0,W5,D3,L1,V0,M1} I { ! ok( triple( skol2, skol4, skol6
% 1.32/1.75 ) ) }.
% 1.32/1.75 parent0: (20082) {G0,W5,D3,L1,V0,M1} { ! ok( triple( skol2, skol4, skol6 )
% 1.32/1.75 ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (59) {G0,W9,D3,L1,V0,M1} I { succ_cpq( triple( skol2, skol4,
% 1.32/1.75 skol6 ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0: (20083) {G0,W9,D3,L1,V0,M1} { succ_cpq( triple( skol2, skol4,
% 1.32/1.75 skol6 ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (60) {G0,W5,D3,L1,V0,M1} I { ok( triple( skol8, skol10, skol12
% 1.32/1.75 ) ) }.
% 1.32/1.75 parent0: (20084) {G0,W5,D3,L1,V0,M1} { ok( triple( skol8, skol10, skol12 )
% 1.32/1.75 ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 eqswap: (20410) {G0,W8,D3,L2,V3,M2} { bad = X, ok( triple( Y, Z, X ) ) }.
% 1.32/1.75 parent0[1]: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 1.32/1.75 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := Z
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20411) {G1,W3,D2,L1,V0,M1} { bad = skol6 }.
% 1.32/1.75 parent0[0]: (58) {G0,W5,D3,L1,V0,M1} I { ! ok( triple( skol2, skol4, skol6
% 1.32/1.75 ) ) }.
% 1.32/1.75 parent1[1]: (20410) {G0,W8,D3,L2,V3,M2} { bad = X, ok( triple( Y, Z, X ) )
% 1.32/1.75 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 X := skol6
% 1.32/1.75 Y := skol2
% 1.32/1.75 Z := skol4
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 eqswap: (20412) {G1,W3,D2,L1,V0,M1} { skol6 = bad }.
% 1.32/1.75 parent0[0]: (20411) {G1,W3,D2,L1,V0,M1} { bad = skol6 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (1267) {G1,W3,D2,L1,V0,M1} R(41,58) { skol6 ==> bad }.
% 1.32/1.75 parent0: (20412) {G1,W3,D2,L1,V0,M1} { skol6 = bad }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 *** allocated 15000 integers for justifications
% 1.32/1.75 *** allocated 22500 integers for justifications
% 1.32/1.75 paramod: (20417) {G1,W10,D3,L2,V2,M2} { ok( triple( skol8, skol10, bad ) )
% 1.32/1.75 , ok( triple( X, Y, skol12 ) ) }.
% 1.32/1.75 parent0[1]: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 1.32/1.75 }.
% 1.32/1.75 parent1[0; 4]: (60) {G0,W5,D3,L1,V0,M1} I { ok( triple( skol8, skol10,
% 1.32/1.75 skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol12
% 1.32/1.75 Y := X
% 1.32/1.75 Z := Y
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20625) {G1,W5,D3,L1,V2,M1} { ok( triple( X, Y, skol12 ) ) }.
% 1.32/1.75 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 parent1[0]: (20417) {G1,W10,D3,L2,V2,M2} { ok( triple( skol8, skol10, bad
% 1.32/1.75 ) ), ok( triple( X, Y, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol8
% 1.32/1.75 Y := skol10
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (1438) {G1,W5,D3,L1,V2,M1} P(41,60);r(39) { ok( triple( X, Y,
% 1.32/1.75 skol12 ) ) }.
% 1.32/1.75 parent0: (20625) {G1,W5,D3,L1,V2,M1} { ok( triple( X, Y, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20626) {G1,W6,D4,L1,V2,M1} { ! ok( im_succ_cpq( triple( X, Y
% 1.32/1.75 , bad ) ) ) }.
% 1.32/1.75 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 parent1[0]: (57) {G0,W11,D4,L2,V3,M2} I { ok( triple( X, Y, Z ) ), ! ok(
% 1.32/1.75 im_succ_cpq( triple( X, Y, Z ) ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := bad
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (4804) {G1,W6,D4,L1,V2,M1} R(57,39) { ! ok( im_succ_cpq(
% 1.32/1.75 triple( X, Y, bad ) ) ) }.
% 1.32/1.75 parent0: (20626) {G1,W6,D4,L1,V2,M1} { ! ok( im_succ_cpq( triple( X, Y,
% 1.32/1.75 bad ) ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 paramod: (20628) {G1,W9,D3,L1,V0,M1} { succ_cpq( triple( skol2, skol4, bad
% 1.32/1.75 ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0[0]: (1267) {G1,W3,D2,L1,V0,M1} R(41,58) { skol6 ==> bad }.
% 1.32/1.75 parent1[0; 4]: (59) {G0,W9,D3,L1,V0,M1} I { succ_cpq( triple( skol2, skol4
% 1.32/1.75 , skol6 ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (4920) {G2,W9,D3,L1,V0,M1} S(59);d(1267) { succ_cpq( triple(
% 1.32/1.75 skol2, skol4, bad ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0: (20628) {G1,W9,D3,L1,V0,M1} { succ_cpq( triple( skol2, skol4, bad
% 1.32/1.75 ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20629) {G1,W16,D4,L3,V0,M3} { ok( im_succ_cpq( triple( skol1
% 1.32/1.75 , skol3, skol5 ) ) ), ok( triple( skol2, skol4, bad ) ), ! ok( triple(
% 1.32/1.75 skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0[2]: (56) {G0,W25,D4,L4,V6,M4} I { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, skol5 ) ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z
% 1.32/1.75 ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 parent1[0]: (4920) {G2,W9,D3,L1,V0,M1} S(59);d(1267) { succ_cpq( triple(
% 1.32/1.75 skol2, skol4, bad ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol2
% 1.32/1.75 Y := skol4
% 1.32/1.75 Z := bad
% 1.32/1.75 T := skol8
% 1.32/1.75 U := skol10
% 1.32/1.75 W := skol12
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20630) {G1,W11,D4,L2,V0,M2} { ok( im_succ_cpq( triple( skol1
% 1.32/1.75 , skol3, skol5 ) ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 parent1[1]: (20629) {G1,W16,D4,L3,V0,M3} { ok( im_succ_cpq( triple( skol1
% 1.32/1.75 , skol3, skol5 ) ) ), ok( triple( skol2, skol4, bad ) ), ! ok( triple(
% 1.32/1.75 skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol2
% 1.32/1.75 Y := skol4
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (14031) {G3,W11,D4,L2,V0,M2} R(4920,56);r(39) { ok(
% 1.32/1.75 im_succ_cpq( triple( skol1, skol3, skol5 ) ) ), ! ok( triple( skol8,
% 1.32/1.75 skol10, skol12 ) ) }.
% 1.32/1.75 parent0: (20630) {G1,W11,D4,L2,V0,M2} { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, skol5 ) ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 1 ==> 1
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20631) {G1,W15,D3,L3,V0,M3} { ! ok( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ), ok( triple( skol2, skol4, bad ) ), ! ok( triple( skol8, skol10
% 1.32/1.75 , skol12 ) ) }.
% 1.32/1.75 parent0[2]: (55) {G0,W24,D3,L4,V6,M4} I { ! ok( triple( skol1, skol3, skol5
% 1.32/1.75 ) ), ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T,
% 1.32/1.75 U, W ) ), ! ok( triple( T, U, W ) ) }.
% 1.32/1.75 parent1[0]: (4920) {G2,W9,D3,L1,V0,M1} S(59);d(1267) { succ_cpq( triple(
% 1.32/1.75 skol2, skol4, bad ), triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol2
% 1.32/1.75 Y := skol4
% 1.32/1.75 Z := bad
% 1.32/1.75 T := skol8
% 1.32/1.75 U := skol10
% 1.32/1.75 W := skol12
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20632) {G1,W10,D3,L2,V0,M2} { ! ok( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.32/1.75 parent1[1]: (20631) {G1,W15,D3,L3,V0,M3} { ! ok( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ), ok( triple( skol2, skol4, bad ) ), ! ok( triple( skol8, skol10
% 1.32/1.75 , skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol2
% 1.32/1.75 Y := skol4
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (14032) {G3,W10,D3,L2,V0,M2} R(4920,55);r(39) { ! ok( triple(
% 1.32/1.75 skol1, skol3, skol5 ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent0: (20632) {G1,W10,D3,L2,V0,M2} { ! ok( triple( skol1, skol3, skol5
% 1.32/1.75 ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 1 ==> 1
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20633) {G2,W6,D4,L1,V0,M1} { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, skol5 ) ) ) }.
% 1.32/1.75 parent0[1]: (14031) {G3,W11,D4,L2,V0,M2} R(4920,56);r(39) { ok( im_succ_cpq
% 1.32/1.75 ( triple( skol1, skol3, skol5 ) ) ), ! ok( triple( skol8, skol10, skol12
% 1.32/1.75 ) ) }.
% 1.32/1.75 parent1[0]: (1438) {G1,W5,D3,L1,V2,M1} P(41,60);r(39) { ok( triple( X, Y,
% 1.32/1.75 skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 X := skol8
% 1.32/1.75 Y := skol10
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (20015) {G4,W6,D4,L1,V0,M1} S(14031);r(1438) { ok( im_succ_cpq
% 1.32/1.75 ( triple( skol1, skol3, skol5 ) ) ) }.
% 1.32/1.75 parent0: (20633) {G2,W6,D4,L1,V0,M1} { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, skol5 ) ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20634) {G2,W5,D3,L1,V0,M1} { ! ok( triple( skol1, skol3,
% 1.32/1.75 skol5 ) ) }.
% 1.32/1.75 parent0[1]: (14032) {G3,W10,D3,L2,V0,M2} R(4920,55);r(39) { ! ok( triple(
% 1.32/1.75 skol1, skol3, skol5 ) ), ! ok( triple( skol8, skol10, skol12 ) ) }.
% 1.32/1.75 parent1[0]: (1438) {G1,W5,D3,L1,V2,M1} P(41,60);r(39) { ok( triple( X, Y,
% 1.32/1.75 skol12 ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 X := skol8
% 1.32/1.75 Y := skol10
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (20016) {G4,W5,D3,L1,V0,M1} S(14032);r(1438) { ! ok( triple(
% 1.32/1.75 skol1, skol3, skol5 ) ) }.
% 1.32/1.75 parent0: (20634) {G2,W5,D3,L1,V0,M1} { ! ok( triple( skol1, skol3, skol5 )
% 1.32/1.75 ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 eqswap: (20635) {G0,W8,D3,L2,V3,M2} { bad = X, ok( triple( Y, Z, X ) ) }.
% 1.32/1.75 parent0[1]: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 1.32/1.75 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := X
% 1.32/1.75 Y := Y
% 1.32/1.75 Z := Z
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20636) {G1,W3,D2,L1,V0,M1} { bad = skol5 }.
% 1.32/1.75 parent0[0]: (20016) {G4,W5,D3,L1,V0,M1} S(14032);r(1438) { ! ok( triple(
% 1.32/1.75 skol1, skol3, skol5 ) ) }.
% 1.32/1.75 parent1[1]: (20635) {G0,W8,D3,L2,V3,M2} { bad = X, ok( triple( Y, Z, X ) )
% 1.32/1.75 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 X := skol5
% 1.32/1.75 Y := skol1
% 1.32/1.75 Z := skol3
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 eqswap: (20637) {G1,W3,D2,L1,V0,M1} { skol5 = bad }.
% 1.32/1.75 parent0[0]: (20636) {G1,W3,D2,L1,V0,M1} { bad = skol5 }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (20021) {G5,W3,D2,L1,V0,M1} R(20016,41) { skol5 ==> bad }.
% 1.32/1.75 parent0: (20637) {G1,W3,D2,L1,V0,M1} { skol5 = bad }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 0 ==> 0
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 paramod: (20639) {G5,W6,D4,L1,V0,M1} { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, bad ) ) ) }.
% 1.32/1.75 parent0[0]: (20021) {G5,W3,D2,L1,V0,M1} R(20016,41) { skol5 ==> bad }.
% 1.32/1.75 parent1[0; 5]: (20015) {G4,W6,D4,L1,V0,M1} S(14031);r(1438) { ok(
% 1.32/1.75 im_succ_cpq( triple( skol1, skol3, skol5 ) ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 resolution: (20640) {G2,W0,D0,L0,V0,M0} { }.
% 1.32/1.75 parent0[0]: (4804) {G1,W6,D4,L1,V2,M1} R(57,39) { ! ok( im_succ_cpq( triple
% 1.32/1.75 ( X, Y, bad ) ) ) }.
% 1.32/1.75 parent1[0]: (20639) {G5,W6,D4,L1,V0,M1} { ok( im_succ_cpq( triple( skol1,
% 1.32/1.75 skol3, bad ) ) ) }.
% 1.32/1.75 substitution0:
% 1.32/1.75 X := skol1
% 1.32/1.75 Y := skol3
% 1.32/1.75 end
% 1.32/1.75 substitution1:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 subsumption: (20022) {G6,W0,D0,L0,V0,M0} S(20015);d(20021);r(4804) { }.
% 1.32/1.75 parent0: (20640) {G2,W0,D0,L0,V0,M0} { }.
% 1.32/1.75 substitution0:
% 1.32/1.75 end
% 1.32/1.75 permutation0:
% 1.32/1.75 end
% 1.32/1.75
% 1.32/1.75 Proof check complete!
% 1.32/1.75
% 1.32/1.75 Memory use:
% 1.32/1.75
% 1.32/1.75 space for terms: 308513
% 1.32/1.75 space for clauses: 984640
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 clauses generated: 89359
% 1.32/1.75 clauses kept: 20023
% 1.32/1.75 clauses selected: 592
% 1.32/1.75 clauses deleted: 1631
% 1.32/1.75 clauses inuse deleted: 8
% 1.32/1.75
% 1.32/1.75 subsentry: 330143
% 1.32/1.75 literals s-matched: 202243
% 1.32/1.75 literals matched: 201447
% 1.32/1.75 full subsumption: 54703
% 1.32/1.75
% 1.32/1.75 checksum: 226907405
% 1.32/1.75
% 1.32/1.75
% 1.32/1.75 Bliksem ended
%------------------------------------------------------------------------------