TSTP Solution File: SWV402+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV402+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:44 EDT 2022
% Result : Theorem 0.71s 1.06s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV402+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n014.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 : Thu Jun 16 01:08:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.06 *** allocated 10000 integers for termspace/termends
% 0.71/1.06 *** allocated 10000 integers for clauses
% 0.71/1.06 *** allocated 10000 integers for justifications
% 0.71/1.06 Bliksem 1.12
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Automatic Strategy Selection
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Clauses:
% 0.71/1.06
% 0.71/1.06 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.71/1.06 { less_than( X, Y ), less_than( Y, X ) }.
% 0.71/1.06 { less_than( X, X ) }.
% 0.71/1.06 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.71/1.06 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.71/1.06 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.71/1.06 { less_than( bottom, X ) }.
% 0.71/1.06 { ! isnonempty_slb( create_slb ) }.
% 0.71/1.06 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.71/1.06 { ! contains_slb( create_slb, X ) }.
% 0.71/1.06 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.71/1.06 , Y = Z }.
% 0.71/1.06 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.71/1.06 }.
% 0.71/1.06 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.71/1.06 { ! pair_in_list( create_slb, X, Y ) }.
% 0.71/1.06 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.71/1.06 , U ), alpha1( Y, Z, T, U ) }.
% 0.71/1.06 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.71/1.06 , U ) }.
% 0.71/1.06 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.71/1.06 ) }.
% 0.71/1.06 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.71/1.06 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.71/1.06 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.71/1.06 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.71/1.06 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.71/1.06 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.71/1.06 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.71/1.06 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.71/1.06 , Z ) = lookup_slb( X, Z ) }.
% 0.71/1.06 { update_slb( create_slb, X ) = create_slb }.
% 0.71/1.06 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.71/1.06 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.71/1.06 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.71/1.06 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.71/1.06 { pair_in_list( create_slb, skol1, skol3 ) }.
% 0.71/1.06 { strictly_less_than( skol3, skol2 ) }.
% 0.71/1.06 { ! pair_in_list( update_slb( create_slb, skol2 ), skol1, skol2 ) }.
% 0.71/1.06
% 0.71/1.06 percentage equality = 0.272727, percentage horn = 0.800000
% 0.71/1.06 This is a problem with some equality
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Options Used:
% 0.71/1.06
% 0.71/1.06 useres = 1
% 0.71/1.06 useparamod = 1
% 0.71/1.06 useeqrefl = 1
% 0.71/1.06 useeqfact = 1
% 0.71/1.06 usefactor = 1
% 0.71/1.06 usesimpsplitting = 0
% 0.71/1.06 usesimpdemod = 5
% 0.71/1.06 usesimpres = 3
% 0.71/1.06
% 0.71/1.06 resimpinuse = 1000
% 0.71/1.06 resimpclauses = 20000
% 0.71/1.06 substype = eqrewr
% 0.71/1.06 backwardsubs = 1
% 0.71/1.06 selectoldest = 5
% 0.71/1.06
% 0.71/1.06 litorderings [0] = split
% 0.71/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.06
% 0.71/1.06 termordering = kbo
% 0.71/1.06
% 0.71/1.06 litapriori = 0
% 0.71/1.06 termapriori = 1
% 0.71/1.06 litaposteriori = 0
% 0.71/1.06 termaposteriori = 0
% 0.71/1.06 demodaposteriori = 0
% 0.71/1.06 ordereqreflfact = 0
% 0.71/1.06
% 0.71/1.06 litselect = negord
% 0.71/1.06
% 0.71/1.06 maxweight = 15
% 0.71/1.06 maxdepth = 30000
% 0.71/1.06 maxlength = 115
% 0.71/1.06 maxnrvars = 195
% 0.71/1.06 excuselevel = 1
% 0.71/1.06 increasemaxweight = 1
% 0.71/1.06
% 0.71/1.06 maxselected = 10000000
% 0.71/1.06 maxnrclauses = 10000000
% 0.71/1.06
% 0.71/1.06 showgenerated = 0
% 0.71/1.06 showkept = 0
% 0.71/1.06 showselected = 0
% 0.71/1.06 showdeleted = 0
% 0.71/1.06 showresimp = 1
% 0.71/1.06 showstatus = 2000
% 0.71/1.06
% 0.71/1.06 prologoutput = 0
% 0.71/1.06 nrgoals = 5000000
% 0.71/1.06 totalproof = 1
% 0.71/1.06
% 0.71/1.06 Symbols occurring in the translation:
% 0.71/1.06
% 0.71/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.06 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.06 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.71/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.06 less_than [38, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.06 strictly_less_than [39, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.06 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.06 create_slb [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.06 isnonempty_slb [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.06 pair [43, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.06 insert_slb [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.06 contains_slb [45, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.06 pair_in_list [47, 3] (w:1, o:54, a:1, s:1, b:0),
% 0.71/1.06 remove_slb [49, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.06 lookup_slb [50, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.71/1.06 update_slb [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.71/1.06 alpha1 [52, 4] (w:1, o:55, a:1, s:1, b:1),
% 0.71/1.06 skol1 [53, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.71/1.06 skol2 [54, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.71/1.06 skol3 [55, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Starting Search:
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksems!, er is een bewijs:
% 0.71/1.06 % SZS status Theorem
% 0.71/1.06 % SZS output start Refutation
% 0.71/1.06
% 0.71/1.06 (13) {G0,W4,D2,L1,V2,M1} I { ! pair_in_list( create_slb, X, Y ) }.
% 0.71/1.06 (27) {G1,W0,D0,L0,V0,M0} I;r(13) { }.
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 % SZS output end Refutation
% 0.71/1.06 found a proof!
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Unprocessed initial clauses:
% 0.71/1.06
% 0.71/1.06 (29) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.71/1.06 less_than( X, Y ) }.
% 0.71/1.06 (30) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.71/1.06 (31) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.71/1.06 (32) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y )
% 0.71/1.06 }.
% 0.71/1.06 (33) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y, X
% 0.71/1.06 ) }.
% 0.71/1.06 (34) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.71/1.06 strictly_less_than( X, Y ) }.
% 0.71/1.06 (35) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.71/1.06 (36) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.71/1.06 (37) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) )
% 0.71/1.06 }.
% 0.71/1.06 (38) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.71/1.06 (39) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T ) )
% 0.71/1.06 , Z ), contains_slb( X, Z ), Y = Z }.
% 0.71/1.06 (40) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.71/1.06 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.71/1.06 (41) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair( Y
% 0.71/1.06 , T ) ), Z ) }.
% 0.71/1.06 (42) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.71/1.06 (43) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T ) )
% 0.71/1.06 , Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.71/1.06 (44) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.71/1.06 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.71/1.06 (45) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.71/1.06 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.71/1.06 (46) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.71/1.06 (47) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.71/1.06 (48) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.71/1.06 (49) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y )
% 0.71/1.06 = X }.
% 0.71/1.06 (50) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.71/1.06 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.71/1.06 ( Y, T ) ) }.
% 0.71/1.06 (51) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y )
% 0.71/1.06 = Z }.
% 0.71/1.06 (52) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.71/1.06 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.71/1.06 (53) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.71/1.06 (54) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.71/1.06 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.71/1.06 ( T, X ) ) }.
% 0.71/1.06 (55) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb( Z
% 0.71/1.06 , pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.71/1.06 }.
% 0.71/1.06 (56) {G0,W4,D2,L1,V0,M1} { pair_in_list( create_slb, skol1, skol3 ) }.
% 0.71/1.06 (57) {G0,W3,D2,L1,V0,M1} { strictly_less_than( skol3, skol2 ) }.
% 0.71/1.06 (58) {G0,W6,D3,L1,V0,M1} { ! pair_in_list( update_slb( create_slb, skol2 )
% 0.71/1.06 , skol1, skol2 ) }.
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Total Proof:
% 0.71/1.06
% 0.71/1.06 subsumption: (13) {G0,W4,D2,L1,V2,M1} I { ! pair_in_list( create_slb, X, Y
% 0.71/1.06 ) }.
% 0.71/1.06 parent0: (42) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 X := X
% 0.71/1.06 Y := Y
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 resolution: (87) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.06 parent0[0]: (13) {G0,W4,D2,L1,V2,M1} I { ! pair_in_list( create_slb, X, Y )
% 0.71/1.06 }.
% 0.71/1.06 parent1[0]: (56) {G0,W4,D2,L1,V0,M1} { pair_in_list( create_slb, skol1,
% 0.71/1.06 skol3 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 X := skol1
% 0.71/1.06 Y := skol3
% 0.71/1.06 end
% 0.71/1.06 substitution1:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (27) {G1,W0,D0,L0,V0,M0} I;r(13) { }.
% 0.71/1.06 parent0: (87) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 Proof check complete!
% 0.71/1.06
% 0.71/1.06 Memory use:
% 0.71/1.06
% 0.71/1.06 space for terms: 967
% 0.71/1.06 space for clauses: 2311
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 clauses generated: 28
% 0.71/1.06 clauses kept: 28
% 0.71/1.06 clauses selected: 0
% 0.71/1.06 clauses deleted: 0
% 0.71/1.06 clauses inuse deleted: 0
% 0.71/1.06
% 0.71/1.06 subsentry: 107
% 0.71/1.06 literals s-matched: 77
% 0.71/1.06 literals matched: 73
% 0.71/1.06 full subsumption: 36
% 0.71/1.06
% 0.71/1.06 checksum: -1185194520
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksem ended
%------------------------------------------------------------------------------