TSTP Solution File: SWV383+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:40 EDT 2022
% Result : Theorem 1.55s 1.92s
% Output : Refutation 1.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Wed Jun 15 23:19:54 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.76/1.15 *** allocated 10000 integers for termspace/termends
% 0.76/1.15 *** allocated 10000 integers for clauses
% 0.76/1.15 *** allocated 10000 integers for justifications
% 0.76/1.15 Bliksem 1.12
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Automatic Strategy Selection
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Clauses:
% 0.76/1.15
% 0.76/1.15 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.76/1.15 { less_than( X, Y ), less_than( Y, X ) }.
% 0.76/1.15 { less_than( X, X ) }.
% 0.76/1.15 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.76/1.15 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.76/1.15 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.76/1.15 { less_than( bottom, X ) }.
% 0.76/1.15 { ! isnonempty_slb( create_slb ) }.
% 0.76/1.15 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.76/1.15 { ! contains_slb( create_slb, X ) }.
% 0.76/1.15 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.76/1.15 , Y = Z }.
% 0.76/1.15 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.76/1.15 }.
% 0.76/1.15 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.76/1.15 { ! pair_in_list( create_slb, X, Y ) }.
% 0.76/1.15 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.76/1.15 , U ), alpha1( Y, Z, T, U ) }.
% 0.76/1.15 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.76/1.15 , U ) }.
% 0.76/1.15 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.76/1.15 ) }.
% 0.76/1.15 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.76/1.15 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.76/1.15 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.76/1.15 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.76/1.15 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.76/1.15 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.76/1.15 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.76/1.15 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.76/1.15 , Z ) = lookup_slb( X, Z ) }.
% 0.76/1.15 { update_slb( create_slb, X ) = create_slb }.
% 0.76/1.15 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.76/1.15 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.76/1.15 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.76/1.15 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.76/1.15 { succ_cpq( X, X ) }.
% 0.76/1.15 { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq( Y, Z ) ) }.
% 0.76/1.15 { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq( Y, Z ) ) }.
% 0.76/1.15 { ! succ_cpq( X, Y ), succ_cpq( X, findmin_cpq_eff( Y ) ) }.
% 0.76/1.15 { ! succ_cpq( X, Y ), succ_cpq( X, removemin_cpq_eff( Y ) ) }.
% 0.76/1.15 { check_cpq( triple( X, create_slb, Y ) ) }.
% 0.76/1.15 { ! less_than( Y, X ), ! check_cpq( triple( Z, insert_slb( T, pair( X, Y )
% 0.76/1.15 ), U ) ), check_cpq( triple( Z, T, U ) ) }.
% 0.76/1.15 { ! less_than( Y, X ), ! check_cpq( triple( Z, T, U ) ), check_cpq( triple
% 0.76/1.15 ( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 0.76/1.15 { ! strictly_less_than( X, Y ), ! check_cpq( triple( Z, insert_slb( T, pair
% 0.76/1.15 ( X, Y ) ), U ) ) }.
% 0.76/1.15 { ! strictly_less_than( X, Y ), ! ||, check_cpq( triple( Z, insert_slb( T,
% 0.76/1.15 pair( X, Y ) ), U ) ) }.
% 0.76/1.15 { ! contains_cpq( triple( X, Y, Z ), T ), contains_slb( Y, T ) }.
% 0.76/1.15 { ! contains_slb( Y, T ), contains_cpq( triple( X, Y, Z ), T ) }.
% 0.76/1.15 { ! ok( triple( X, Y, bad ) ) }.
% 0.76/1.15 { ! ||, ok( triple( X, Y, bad ) ) }.
% 0.76/1.15 { ok( triple( Y, Z, X ) ), X = bad }.
% 0.76/1.15 { insert_cpq( triple( X, Y, Z ), T ) = triple( insert_pqp( X, T ),
% 0.76/1.15 insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 0.76/1.15 { contains_slb( X, Y ), remove_cpq( triple( Z, X, T ), Y ) = triple( Z, X,
% 0.76/1.15 bad ) }.
% 0.76/1.15 { ! contains_slb( X, Y ), ! less_than( lookup_slb( X, Y ), Y ), remove_cpq
% 0.76/1.15 ( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y )
% 0.76/1.15 , T ) }.
% 0.76/1.15 { ! contains_slb( X, Y ), ! strictly_less_than( Y, lookup_slb( X, Y ) ),
% 0.76/1.15 remove_cpq( triple( Z, X, T ), Y ) = triple( remove_pqp( Z, Y ),
% 0.76/1.15 remove_slb( X, Y ), bad ) }.
% 0.76/1.15 { findmin_cpq_eff( triple( X, create_slb, Y ) ) = triple( X, create_slb,
% 0.76/1.15 bad ) }.
% 0.76/1.15 { Y = create_slb, contains_slb( Y, findmin_pqp_res( X ) ), findmin_cpq_eff
% 0.76/1.15 ( triple( X, Y, Z ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) )
% 0.76/1.15 , bad ) }.
% 0.76/1.15 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), !
% 0.76/1.15 strictly_less_than( findmin_pqp_res( X ), lookup_slb( Y, findmin_pqp_res
% 0.76/1.15 ( X ) ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb(
% 0.76/1.15 Y, findmin_pqp_res( X ) ), bad ) }.
% 0.76/1.15 { Y = create_slb, ! contains_slb( Y, findmin_pqp_res( X ) ), ! less_than(
% 0.76/1.15 lookup_slb( Y, findmin_pqp_res( X ) ), findmin_pqp_res( X ) ),
% 1.55/1.92 findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X, update_slb( Y,
% 1.55/1.92 findmin_pqp_res( X ) ), Z ) }.
% 1.55/1.92 { findmin_cpq_res( triple( X, create_slb, Y ) ) = bottom }.
% 1.55/1.92 { X = create_slb, findmin_cpq_res( triple( Y, X, Z ) ) = findmin_pqp_res( Y
% 1.55/1.92 ) }.
% 1.55/1.92 { removemin_cpq_eff( X ) = remove_cpq( findmin_cpq_eff( X ),
% 1.55/1.92 findmin_cpq_res( X ) ) }.
% 1.55/1.92 { removemin_cpq_res( X ) = findmin_cpq_res( X ) }.
% 1.55/1.92 { check_cpq( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T
% 1.55/1.92 , U, W ) ), ! ok( triple( T, U, W ) ), ! check_cpq( triple( T, U, W ) ) }
% 1.55/1.92 .
% 1.55/1.92 { ok( triple( X, Y, Z ) ), ! succ_cpq( triple( X, Y, Z ), triple( T, U, W )
% 1.55/1.92 ), ! ok( triple( T, U, W ) ), ! check_cpq( triple( T, U, W ) ) }.
% 1.55/1.92 { ! check_cpq( triple( skol1, skol2, skol3 ) ) }.
% 1.55/1.92 { succ_cpq( triple( skol1, skol2, skol3 ), triple( skol4, skol5, skol6 ) )
% 1.55/1.92 }.
% 1.55/1.92 { ok( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.92 { check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.92
% 1.55/1.92 percentage equality = 0.266667, percentage horn = 0.800000
% 1.55/1.92 This is a problem with some equality
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Options Used:
% 1.55/1.92
% 1.55/1.92 useres = 1
% 1.55/1.92 useparamod = 1
% 1.55/1.92 useeqrefl = 1
% 1.55/1.92 useeqfact = 1
% 1.55/1.92 usefactor = 1
% 1.55/1.92 usesimpsplitting = 0
% 1.55/1.92 usesimpdemod = 5
% 1.55/1.92 usesimpres = 3
% 1.55/1.92
% 1.55/1.92 resimpinuse = 1000
% 1.55/1.92 resimpclauses = 20000
% 1.55/1.92 substype = eqrewr
% 1.55/1.92 backwardsubs = 1
% 1.55/1.92 selectoldest = 5
% 1.55/1.92
% 1.55/1.92 litorderings [0] = split
% 1.55/1.92 litorderings [1] = extend the termordering, first sorting on arguments
% 1.55/1.92
% 1.55/1.92 termordering = kbo
% 1.55/1.92
% 1.55/1.92 litapriori = 0
% 1.55/1.92 termapriori = 1
% 1.55/1.92 litaposteriori = 0
% 1.55/1.92 termaposteriori = 0
% 1.55/1.92 demodaposteriori = 0
% 1.55/1.92 ordereqreflfact = 0
% 1.55/1.92
% 1.55/1.92 litselect = negord
% 1.55/1.92
% 1.55/1.92 maxweight = 15
% 1.55/1.92 maxdepth = 30000
% 1.55/1.92 maxlength = 115
% 1.55/1.92 maxnrvars = 195
% 1.55/1.92 excuselevel = 1
% 1.55/1.92 increasemaxweight = 1
% 1.55/1.92
% 1.55/1.92 maxselected = 10000000
% 1.55/1.92 maxnrclauses = 10000000
% 1.55/1.92
% 1.55/1.92 showgenerated = 0
% 1.55/1.92 showkept = 0
% 1.55/1.92 showselected = 0
% 1.55/1.92 showdeleted = 0
% 1.55/1.92 showresimp = 1
% 1.55/1.92 showstatus = 2000
% 1.55/1.92
% 1.55/1.92 prologoutput = 0
% 1.55/1.92 nrgoals = 5000000
% 1.55/1.92 totalproof = 1
% 1.55/1.92
% 1.55/1.92 Symbols occurring in the translation:
% 1.55/1.92
% 1.55/1.92 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.55/1.92 . [1, 2] (w:1, o:34, a:1, s:1, b:0),
% 1.55/1.92 || [2, 0] (w:1, o:3, a:1, s:1, b:0),
% 1.55/1.92 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 1.55/1.92 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.55/1.92 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.55/1.92 less_than [38, 2] (w:1, o:58, a:1, s:1, b:0),
% 1.55/1.92 strictly_less_than [39, 2] (w:1, o:62, a:1, s:1, b:0),
% 1.55/1.92 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.55/1.92 create_slb [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 1.55/1.92 isnonempty_slb [42, 1] (w:1, o:26, a:1, s:1, b:0),
% 1.55/1.92 pair [43, 2] (w:1, o:63, a:1, s:1, b:0),
% 1.55/1.92 insert_slb [44, 2] (w:1, o:64, a:1, s:1, b:0),
% 1.55/1.92 contains_slb [45, 2] (w:1, o:65, a:1, s:1, b:0),
% 1.55/1.92 pair_in_list [47, 3] (w:1, o:72, a:1, s:1, b:0),
% 1.55/1.92 remove_slb [49, 2] (w:1, o:59, a:1, s:1, b:0),
% 1.55/1.92 lookup_slb [50, 2] (w:1, o:66, a:1, s:1, b:0),
% 1.55/1.92 update_slb [51, 2] (w:1, o:67, a:1, s:1, b:0),
% 1.55/1.92 succ_cpq [52, 2] (w:1, o:68, a:1, s:1, b:0),
% 1.55/1.92 insert_cpq [53, 2] (w:1, o:69, a:1, s:1, b:0),
% 1.55/1.92 remove_cpq [54, 2] (w:1, o:60, a:1, s:1, b:0),
% 1.55/1.92 findmin_cpq_eff [55, 1] (w:1, o:27, a:1, s:1, b:0),
% 1.55/1.92 removemin_cpq_eff [56, 1] (w:1, o:28, a:1, s:1, b:0),
% 1.55/1.92 triple [57, 3] (w:1, o:73, a:1, s:1, b:0),
% 1.55/1.92 check_cpq [58, 1] (w:1, o:29, a:1, s:1, b:0),
% 1.55/1.92 contains_cpq [59, 2] (w:1, o:70, a:1, s:1, b:0),
% 1.55/1.92 bad [60, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.55/1.92 ok [61, 1] (w:1, o:30, a:1, s:1, b:0),
% 1.55/1.92 insert_pqp [62, 2] (w:1, o:71, a:1, s:1, b:0),
% 1.55/1.92 remove_pqp [63, 2] (w:1, o:61, a:1, s:1, b:0),
% 1.55/1.92 findmin_pqp_res [64, 1] (w:1, o:31, a:1, s:1, b:0),
% 1.55/1.92 findmin_cpq_res [65, 1] (w:1, o:32, a:1, s:1, b:0),
% 1.55/1.92 removemin_cpq_res [66, 1] (w:1, o:33, a:1, s:1, b:0),
% 1.55/1.92 alpha1 [68, 4] (w:1, o:74, a:1, s:1, b:1),
% 1.55/1.92 skol1 [69, 0] (w:1, o:15, a:1, s:1, b:1),
% 1.55/1.92 skol2 [70, 0] (w:1, o:16, a:1, s:1, b:1),
% 1.55/1.92 skol3 [71, 0] (w:1, o:17, a:1, s:1, b:1),
% 1.55/1.92 skol4 [72, 0] (w:1, o:18, a:1, s:1, b:1),
% 1.55/1.92 skol5 [73, 0] (w:1, o:19, a:1, s:1, b:1),
% 1.55/1.92 skol6 [74, 0] (w:1, o:20, a:1, s:1, b:1).
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Starting Search:
% 1.55/1.92
% 1.55/1.92 *** allocated 15000 integers for clauses
% 1.55/1.92 *** allocated 22500 integers for clauses
% 1.55/1.92 *** allocated 33750 integers for clauses
% 1.55/1.92 *** allocated 15000 integers for termspace/termends
% 1.55/1.92 *** allocated 50625 integers for clauses
% 1.55/1.92 *** allocated 22500 integers for termspace/termends
% 1.55/1.92 *** allocated 75937 integers for clauses
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 33750 integers for termspace/termends
% 1.55/1.92 *** allocated 113905 integers for clauses
% 1.55/1.92 *** allocated 50625 integers for termspace/termends
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 3707
% 1.55/1.92 Kept: 2002
% 1.55/1.92 Inuse: 126
% 1.55/1.92 Deleted: 3
% 1.55/1.92 Deletedinuse: 0
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 170857 integers for clauses
% 1.55/1.92 *** allocated 75937 integers for termspace/termends
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 256285 integers for clauses
% 1.55/1.92 *** allocated 113905 integers for termspace/termends
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 9108
% 1.55/1.92 Kept: 4135
% 1.55/1.92 Inuse: 178
% 1.55/1.92 Deleted: 4
% 1.55/1.92 Deletedinuse: 1
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 384427 integers for clauses
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 170857 integers for termspace/termends
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 17488
% 1.55/1.92 Kept: 6990
% 1.55/1.92 Inuse: 253
% 1.55/1.92 Deleted: 6
% 1.55/1.92 Deletedinuse: 3
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 576640 integers for clauses
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 31847
% 1.55/1.92 Kept: 8990
% 1.55/1.92 Inuse: 320
% 1.55/1.92 Deleted: 6
% 1.55/1.92 Deletedinuse: 3
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 256285 integers for termspace/termends
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 43132
% 1.55/1.92 Kept: 11414
% 1.55/1.92 Inuse: 381
% 1.55/1.92 Deleted: 15
% 1.55/1.92 Deletedinuse: 3
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 864960 integers for clauses
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 57553
% 1.55/1.92 Kept: 13415
% 1.55/1.92 Inuse: 495
% 1.55/1.92 Deleted: 17
% 1.55/1.92 Deletedinuse: 5
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 77694
% 1.55/1.92 Kept: 15625
% 1.55/1.92 Inuse: 566
% 1.55/1.92 Deleted: 18
% 1.55/1.92 Deletedinuse: 5
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 384427 integers for termspace/termends
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 87652
% 1.55/1.92 Kept: 17656
% 1.55/1.92 Inuse: 605
% 1.55/1.92 Deleted: 18
% 1.55/1.92 Deletedinuse: 5
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 *** allocated 1297440 integers for clauses
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Intermediate Status:
% 1.55/1.92 Generated: 96690
% 1.55/1.92 Kept: 19690
% 1.55/1.92 Inuse: 640
% 1.55/1.92 Deleted: 18
% 1.55/1.92 Deletedinuse: 5
% 1.55/1.92
% 1.55/1.92 Resimplifying inuse:
% 1.55/1.92 Done
% 1.55/1.92
% 1.55/1.92 Resimplifying clauses:
% 1.55/1.92
% 1.55/1.92 Bliksems!, er is een bewijs:
% 1.55/1.92 % SZS status Theorem
% 1.55/1.92 % SZS output start Refutation
% 1.55/1.92
% 1.55/1.92 (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.55/1.92 (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad }.
% 1.55/1.92 (54) {G0,W24,D3,L4,V6,M4} I { check_cpq( triple( X, Y, Z ) ), ! succ_cpq(
% 1.55/1.92 triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ), !
% 1.55/1.92 check_cpq( triple( T, U, W ) ) }.
% 1.55/1.92 (56) {G0,W5,D3,L1,V0,M1} I { ! check_cpq( triple( skol1, skol2, skol3 ) )
% 1.55/1.92 }.
% 1.55/1.92 (57) {G0,W9,D3,L1,V0,M1} I { succ_cpq( triple( skol1, skol2, skol3 ),
% 1.55/1.92 triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.92 (58) {G0,W5,D3,L1,V0,M1} I { ok( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.92 (59) {G0,W5,D3,L1,V0,M1} I { check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.92 (1476) {G1,W5,D3,L1,V2,M1} P(41,58);r(39) { ok( triple( X, Y, skol6 ) ) }.
% 1.55/1.92 (4544) {G1,W10,D3,L2,V0,M2} R(57,54);r(56) { ! ok( triple( skol4, skol5,
% 1.55/1.92 skol6 ) ), ! check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.92 (20192) {G2,W0,D0,L0,V0,M0} S(4544);r(1476);r(59) { }.
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 % SZS output end Refutation
% 1.55/1.92 found a proof!
% 1.55/1.92
% 1.55/1.92
% 1.55/1.92 Unprocessed initial clauses:
% 1.55/1.92
% 1.55/1.92 (20194) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 1.55/1.92 less_than( X, Y ) }.
% 1.55/1.92 (20195) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 1.55/1.92 (20196) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 1.55/1.92 (20197) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X,
% 1.55/1.92 Y ) }.
% 1.55/1.92 (20198) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 1.55/1.92 , X ) }.
% 1.55/1.92 (20199) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 1.55/1.92 strictly_less_than( X, Y ) }.
% 1.55/1.92 (20200) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 1.55/1.92 (20201) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 1.55/1.92 (20202) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z )
% 1.55/1.92 ) ) }.
% 1.55/1.92 (20203) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 1.55/1.92 (20204) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 1.55/1.92 ), Z ), contains_slb( X, Z ), Y = Z }.
% 1.55/1.92 (20205) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 1.55/1.92 insert_slb( X, pair( Y, T ) ), Z ) }.
% 1.55/1.92 (20206) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair
% 1.55/1.92 ( Y, T ) ), Z ) }.
% 1.55/1.92 (20207) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 1.55/1.92 (20208) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 1.55/1.92 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 1.55/1.92 (20209) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 1.55/1.92 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.55/1.92 (20210) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 1.55/1.92 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 1.55/1.92 (20211) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 1.55/1.92 (20212) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 1.55/1.92 (20213) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 1.55/1.92 (20214) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.55/1.92 ) = X }.
% 1.55/1.92 (20215) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 1.55/1.92 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 1.55/1.92 ( Y, T ) ) }.
% 1.55/1.92 (20216) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 1.55/1.92 ) = Z }.
% 1.55/1.92 (20217) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 1.55/1.92 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 1.55/1.92 (20218) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 1.55/1.92 (20219) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 1.55/1.92 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 1.55/1.92 ( T, X ) ) }.
% 1.55/1.92 (20220) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 1.55/1.92 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 1.55/1.92 }.
% 1.55/1.92 (20221) {G0,W3,D2,L1,V1,M1} { succ_cpq( X, X ) }.
% 1.55/1.92 (20222) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, insert_cpq
% 1.55/1.92 ( Y, Z ) ) }.
% 1.55/1.92 (20223) {G0,W8,D3,L2,V3,M2} { ! succ_cpq( X, Y ), succ_cpq( X, remove_cpq
% 1.55/1.92 ( Y, Z ) ) }.
% 1.55/1.92 (20224) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.55/1.92 findmin_cpq_eff( Y ) ) }.
% 1.55/1.92 (20225) {G0,W7,D3,L2,V2,M2} { ! succ_cpq( X, Y ), succ_cpq( X,
% 1.55/1.92 removemin_cpq_eff( Y ) ) }.
% 1.55/1.92 (20226) {G0,W5,D3,L1,V2,M1} { check_cpq( triple( X, create_slb, Y ) ) }.
% 1.55/1.92 (20227) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.55/1.92 , insert_slb( T, pair( X, Y ) ), U ) ), check_cpq( triple( Z, T, U ) )
% 1.55/1.92 }.
% 1.55/1.92 (20228) {G0,W17,D5,L3,V5,M3} { ! less_than( Y, X ), ! check_cpq( triple( Z
% 1.55/1.92 , T, U ) ), check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) )
% 1.55/1.92 }.
% 1.55/1.92 (20229) {G0,W12,D5,L2,V5,M2} { ! strictly_less_than( X, Y ), ! check_cpq(
% 1.55/1.92 triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.55/1.92 (20230) {G0,W13,D5,L3,V5,M3} { ! strictly_less_than( X, Y ), ! ||,
% 1.55/1.92 check_cpq( triple( Z, insert_slb( T, pair( X, Y ) ), U ) ) }.
% 1.55/1.92 (20231) {G0,W9,D3,L2,V4,M2} { ! contains_cpq( triple( X, Y, Z ), T ),
% 1.55/1.92 contains_slb( Y, T ) }.
% 1.55/1.92 (20232) {G0,W9,D3,L2,V4,M2} { ! contains_slb( Y, T ), contains_cpq( triple
% 1.55/1.92 ( X, Y, Z ), T ) }.
% 1.55/1.92 (20233) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 1.55/1.92 (20234) {G0,W6,D3,L2,V2,M2} { ! ||, ok( triple( X, Y, bad ) ) }.
% 1.55/1.92 (20235) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad }.
% 1.55/1.92 (20236) {G0,W17,D5,L1,V4,M1} { insert_cpq( triple( X, Y, Z ), T ) = triple
% 1.55/1.92 ( insert_pqp( X, T ), insert_slb( Y, pair( T, bottom ) ), Z ) }.
% 1.55/1.92 (20237) {G0,W14,D4,L2,V4,M2} { contains_slb( X, Y ), remove_cpq( triple( Z
% 1.55/1.92 , X, T ), Y ) = triple( Z, X, bad ) }.
% 1.55/1.92 (20238) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), ! less_than(
% 1.55/1.92 lookup_slb( X, Y ), Y ), remove_cpq( triple( Z, X, T ), Y ) = triple(
% 1.55/1.92 remove_pqp( Z, Y ), remove_slb( X, Y ), T ) }.
% 1.55/1.93 (20239) {G0,W23,D4,L3,V4,M3} { ! contains_slb( X, Y ), !
% 1.55/1.93 strictly_less_than( Y, lookup_slb( X, Y ) ), remove_cpq( triple( Z, X, T
% 1.55/1.93 ), Y ) = triple( remove_pqp( Z, Y ), remove_slb( X, Y ), bad ) }.
% 1.55/1.93 (20240) {G0,W10,D4,L1,V2,M1} { findmin_cpq_eff( triple( X, create_slb, Y )
% 1.55/1.93 ) = triple( X, create_slb, bad ) }.
% 1.55/1.93 (20241) {G0,W20,D5,L3,V3,M3} { Y = create_slb, contains_slb( Y,
% 1.55/1.93 findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple( X
% 1.55/1.93 , update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.55/1.93 (20242) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.55/1.93 findmin_pqp_res( X ) ), ! strictly_less_than( findmin_pqp_res( X ),
% 1.55/1.93 lookup_slb( Y, findmin_pqp_res( X ) ) ), findmin_cpq_eff( triple( X, Y, Z
% 1.55/1.93 ) ) = triple( X, update_slb( Y, findmin_pqp_res( X ) ), bad ) }.
% 1.55/1.93 (20243) {G0,W27,D5,L4,V3,M4} { Y = create_slb, ! contains_slb( Y,
% 1.55/1.93 findmin_pqp_res( X ) ), ! less_than( lookup_slb( Y, findmin_pqp_res( X )
% 1.55/1.93 ), findmin_pqp_res( X ) ), findmin_cpq_eff( triple( X, Y, Z ) ) = triple
% 1.55/1.93 ( X, update_slb( Y, findmin_pqp_res( X ) ), Z ) }.
% 1.55/1.93 (20244) {G0,W7,D4,L1,V2,M1} { findmin_cpq_res( triple( X, create_slb, Y )
% 1.55/1.93 ) = bottom }.
% 1.55/1.93 (20245) {G0,W11,D4,L2,V3,M2} { X = create_slb, findmin_cpq_res( triple( Y
% 1.55/1.93 , X, Z ) ) = findmin_pqp_res( Y ) }.
% 1.55/1.93 (20246) {G0,W8,D4,L1,V1,M1} { removemin_cpq_eff( X ) = remove_cpq(
% 1.55/1.93 findmin_cpq_eff( X ), findmin_cpq_res( X ) ) }.
% 1.55/1.93 (20247) {G0,W5,D3,L1,V1,M1} { removemin_cpq_res( X ) = findmin_cpq_res( X
% 1.55/1.93 ) }.
% 1.55/1.93 (20248) {G0,W24,D3,L4,V6,M4} { check_cpq( triple( X, Y, Z ) ), ! succ_cpq
% 1.55/1.93 ( triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ), !
% 1.55/1.93 check_cpq( triple( T, U, W ) ) }.
% 1.55/1.93 (20249) {G0,W24,D3,L4,V6,M4} { ok( triple( X, Y, Z ) ), ! succ_cpq( triple
% 1.55/1.93 ( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W ) ), ! check_cpq
% 1.55/1.93 ( triple( T, U, W ) ) }.
% 1.55/1.93 (20250) {G0,W5,D3,L1,V0,M1} { ! check_cpq( triple( skol1, skol2, skol3 ) )
% 1.55/1.93 }.
% 1.55/1.93 (20251) {G0,W9,D3,L1,V0,M1} { succ_cpq( triple( skol1, skol2, skol3 ),
% 1.55/1.93 triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 (20252) {G0,W5,D3,L1,V0,M1} { ok( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 (20253) {G0,W5,D3,L1,V0,M1} { check_cpq( triple( skol4, skol5, skol6 ) )
% 1.55/1.93 }.
% 1.55/1.93
% 1.55/1.93
% 1.55/1.93 Total Proof:
% 1.55/1.93
% 1.55/1.93 subsumption: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.55/1.93 parent0: (20233) {G0,W5,D3,L1,V2,M1} { ! ok( triple( X, Y, bad ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := X
% 1.55/1.93 Y := Y
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 1.55/1.93 }.
% 1.55/1.93 parent0: (20235) {G0,W8,D3,L2,V3,M2} { ok( triple( Y, Z, X ) ), X = bad
% 1.55/1.93 }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := X
% 1.55/1.93 Y := Y
% 1.55/1.93 Z := Z
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 1 ==> 1
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (54) {G0,W24,D3,L4,V6,M4} I { check_cpq( triple( X, Y, Z ) ),
% 1.55/1.93 ! succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W
% 1.55/1.93 ) ), ! check_cpq( triple( T, U, W ) ) }.
% 1.55/1.93 parent0: (20248) {G0,W24,D3,L4,V6,M4} { check_cpq( triple( X, Y, Z ) ), !
% 1.55/1.93 succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W )
% 1.55/1.93 ), ! check_cpq( triple( T, U, W ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := X
% 1.55/1.93 Y := Y
% 1.55/1.93 Z := Z
% 1.55/1.93 T := T
% 1.55/1.93 U := U
% 1.55/1.93 W := W
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 1 ==> 1
% 1.55/1.93 2 ==> 2
% 1.55/1.93 3 ==> 3
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (56) {G0,W5,D3,L1,V0,M1} I { ! check_cpq( triple( skol1, skol2
% 1.55/1.93 , skol3 ) ) }.
% 1.55/1.93 parent0: (20250) {G0,W5,D3,L1,V0,M1} { ! check_cpq( triple( skol1, skol2,
% 1.55/1.93 skol3 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (57) {G0,W9,D3,L1,V0,M1} I { succ_cpq( triple( skol1, skol2,
% 1.55/1.93 skol3 ), triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 parent0: (20251) {G0,W9,D3,L1,V0,M1} { succ_cpq( triple( skol1, skol2,
% 1.55/1.93 skol3 ), triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (58) {G0,W5,D3,L1,V0,M1} I { ok( triple( skol4, skol5, skol6 )
% 1.55/1.93 ) }.
% 1.55/1.93 parent0: (20252) {G0,W5,D3,L1,V0,M1} { ok( triple( skol4, skol5, skol6 ) )
% 1.55/1.93 }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (59) {G0,W5,D3,L1,V0,M1} I { check_cpq( triple( skol4, skol5,
% 1.55/1.93 skol6 ) ) }.
% 1.55/1.93 parent0: (20253) {G0,W5,D3,L1,V0,M1} { check_cpq( triple( skol4, skol5,
% 1.55/1.93 skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 *** allocated 15000 integers for justifications
% 1.55/1.93 *** allocated 22500 integers for justifications
% 1.55/1.93 paramod: (20532) {G1,W10,D3,L2,V2,M2} { ok( triple( skol4, skol5, bad ) )
% 1.55/1.93 , ok( triple( X, Y, skol6 ) ) }.
% 1.55/1.93 parent0[1]: (41) {G0,W8,D3,L2,V3,M2} I { ok( triple( Y, Z, X ) ), X = bad
% 1.55/1.93 }.
% 1.55/1.93 parent1[0; 4]: (58) {G0,W5,D3,L1,V0,M1} I { ok( triple( skol4, skol5, skol6
% 1.55/1.93 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := skol6
% 1.55/1.93 Y := X
% 1.55/1.93 Z := Y
% 1.55/1.93 end
% 1.55/1.93 substitution1:
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 resolution: (20740) {G1,W5,D3,L1,V2,M1} { ok( triple( X, Y, skol6 ) ) }.
% 1.55/1.93 parent0[0]: (39) {G0,W5,D3,L1,V2,M1} I { ! ok( triple( X, Y, bad ) ) }.
% 1.55/1.93 parent1[0]: (20532) {G1,W10,D3,L2,V2,M2} { ok( triple( skol4, skol5, bad )
% 1.55/1.93 ), ok( triple( X, Y, skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := skol4
% 1.55/1.93 Y := skol5
% 1.55/1.93 end
% 1.55/1.93 substitution1:
% 1.55/1.93 X := X
% 1.55/1.93 Y := Y
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (1476) {G1,W5,D3,L1,V2,M1} P(41,58);r(39) { ok( triple( X, Y,
% 1.55/1.93 skol6 ) ) }.
% 1.55/1.93 parent0: (20740) {G1,W5,D3,L1,V2,M1} { ok( triple( X, Y, skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := X
% 1.55/1.93 Y := Y
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 resolution: (20741) {G1,W15,D3,L3,V0,M3} { check_cpq( triple( skol1, skol2
% 1.55/1.93 , skol3 ) ), ! ok( triple( skol4, skol5, skol6 ) ), ! check_cpq( triple(
% 1.55/1.93 skol4, skol5, skol6 ) ) }.
% 1.55/1.93 parent0[1]: (54) {G0,W24,D3,L4,V6,M4} I { check_cpq( triple( X, Y, Z ) ), !
% 1.55/1.93 succ_cpq( triple( X, Y, Z ), triple( T, U, W ) ), ! ok( triple( T, U, W
% 1.55/1.93 ) ), ! check_cpq( triple( T, U, W ) ) }.
% 1.55/1.93 parent1[0]: (57) {G0,W9,D3,L1,V0,M1} I { succ_cpq( triple( skol1, skol2,
% 1.55/1.93 skol3 ), triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 X := skol1
% 1.55/1.93 Y := skol2
% 1.55/1.93 Z := skol3
% 1.55/1.93 T := skol4
% 1.55/1.93 U := skol5
% 1.55/1.93 W := skol6
% 1.55/1.93 end
% 1.55/1.93 substitution1:
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 resolution: (20742) {G1,W10,D3,L2,V0,M2} { ! ok( triple( skol4, skol5,
% 1.55/1.93 skol6 ) ), ! check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 parent0[0]: (56) {G0,W5,D3,L1,V0,M1} I { ! check_cpq( triple( skol1, skol2
% 1.55/1.93 , skol3 ) ) }.
% 1.55/1.93 parent1[0]: (20741) {G1,W15,D3,L3,V0,M3} { check_cpq( triple( skol1, skol2
% 1.55/1.93 , skol3 ) ), ! ok( triple( skol4, skol5, skol6 ) ), ! check_cpq( triple(
% 1.55/1.93 skol4, skol5, skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 substitution1:
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (4544) {G1,W10,D3,L2,V0,M2} R(57,54);r(56) { ! ok( triple(
% 1.55/1.93 skol4, skol5, skol6 ) ), ! check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 parent0: (20742) {G1,W10,D3,L2,V0,M2} { ! ok( triple( skol4, skol5, skol6
% 1.55/1.93 ) ), ! check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 0 ==> 0
% 1.55/1.93 1 ==> 1
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 resolution: (20743) {G2,W5,D3,L1,V0,M1} { ! check_cpq( triple( skol4,
% 1.55/1.93 skol5, skol6 ) ) }.
% 1.55/1.93 parent0[0]: (4544) {G1,W10,D3,L2,V0,M2} R(57,54);r(56) { ! ok( triple(
% 1.55/1.93 skol4, skol5, skol6 ) ), ! check_cpq( triple( skol4, skol5, skol6 ) ) }.
% 1.55/1.93 parent1[0]: (1476) {G1,W5,D3,L1,V2,M1} P(41,58);r(39) { ok( triple( X, Y,
% 1.55/1.93 skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 substitution1:
% 1.55/1.93 X := skol4
% 1.55/1.93 Y := skol5
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 resolution: (20744) {G1,W0,D0,L0,V0,M0} { }.
% 1.55/1.93 parent0[0]: (20743) {G2,W5,D3,L1,V0,M1} { ! check_cpq( triple( skol4,
% 1.55/1.93 skol5, skol6 ) ) }.
% 1.55/1.93 parent1[0]: (59) {G0,W5,D3,L1,V0,M1} I { check_cpq( triple( skol4, skol5,
% 1.55/1.93 skol6 ) ) }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 substitution1:
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 subsumption: (20192) {G2,W0,D0,L0,V0,M0} S(4544);r(1476);r(59) { }.
% 1.55/1.93 parent0: (20744) {G1,W0,D0,L0,V0,M0} { }.
% 1.55/1.93 substitution0:
% 1.55/1.93 end
% 1.55/1.93 permutation0:
% 1.55/1.93 end
% 1.55/1.93
% 1.55/1.93 Proof check complete!
% 1.55/1.93
% 1.55/1.93 Memory use:
% 1.55/1.93
% 1.55/1.93 space for terms: 306136
% 1.55/1.93 space for clauses: 986002
% 1.55/1.93
% 1.55/1.93
% 1.55/1.93 clauses generated: 97747
% 1.55/1.93 clauses kept: 20193
% 1.55/1.93 clauses selected: 642
% 1.55/1.93 clauses deleted: 1225
% 1.55/1.93 clauses inuse deleted: 5
% 1.55/1.93
% 1.55/1.93 subsentry: 306895
% 1.55/1.93 literals s-matched: 192915
% 1.55/1.93 literals matched: 192533
% 1.55/1.93 full subsumption: 52600
% 1.55/1.93
% 1.55/1.93 checksum: 1865844833
% 1.55/1.93
% 1.55/1.93
% 1.55/1.93 Bliksem ended
%------------------------------------------------------------------------------