TSTP Solution File: SEU303+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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 : Tue Jul 19 07:12:17 EDT 2022
% Result : Theorem 0.43s 1.09s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n012.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 : Sat Jun 18 19:22:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.09 *** allocated 10000 integers for termspace/termends
% 0.43/1.09 *** allocated 10000 integers for clauses
% 0.43/1.09 *** allocated 10000 integers for justifications
% 0.43/1.09 Bliksem 1.12
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Automatic Strategy Selection
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Clauses:
% 0.43/1.09
% 0.43/1.09 { && }.
% 0.43/1.09 { && }.
% 0.43/1.09 { && }.
% 0.43/1.09 { ! relation( X ), ! function( X ), ! finite( Y ), finite( relation_image(
% 0.43/1.09 X, Y ) ) }.
% 0.43/1.09 { relation( skol1 ) }.
% 0.43/1.09 { function( skol1 ) }.
% 0.43/1.09 { ! relation( X ), relation_image( X, relation_dom( X ) ) = relation_rng( X
% 0.43/1.09 ) }.
% 0.43/1.09 { ! relation( X ), ! function( X ), ! finite( Y ), finite( relation_image(
% 0.43/1.09 X, Y ) ) }.
% 0.43/1.09 { relation( skol2 ) }.
% 0.43/1.09 { function( skol2 ) }.
% 0.43/1.09 { finite( relation_dom( skol2 ) ) }.
% 0.43/1.09 { ! finite( relation_rng( skol2 ) ) }.
% 0.43/1.09
% 0.43/1.09 percentage equality = 0.076923, percentage horn = 1.000000
% 0.43/1.09 This is a problem with some equality
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Options Used:
% 0.43/1.09
% 0.43/1.09 useres = 1
% 0.43/1.09 useparamod = 1
% 0.43/1.09 useeqrefl = 1
% 0.43/1.09 useeqfact = 1
% 0.43/1.09 usefactor = 1
% 0.43/1.09 usesimpsplitting = 0
% 0.43/1.09 usesimpdemod = 5
% 0.43/1.09 usesimpres = 3
% 0.43/1.09
% 0.43/1.09 resimpinuse = 1000
% 0.43/1.09 resimpclauses = 20000
% 0.43/1.09 substype = eqrewr
% 0.43/1.09 backwardsubs = 1
% 0.43/1.09 selectoldest = 5
% 0.43/1.09
% 0.43/1.09 litorderings [0] = split
% 0.43/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.09
% 0.43/1.09 termordering = kbo
% 0.43/1.09
% 0.43/1.09 litapriori = 0
% 0.43/1.09 termapriori = 1
% 0.43/1.09 litaposteriori = 0
% 0.43/1.09 termaposteriori = 0
% 0.43/1.09 demodaposteriori = 0
% 0.43/1.09 ordereqreflfact = 0
% 0.43/1.09
% 0.43/1.09 litselect = negord
% 0.43/1.09
% 0.43/1.09 maxweight = 15
% 0.43/1.09 maxdepth = 30000
% 0.43/1.09 maxlength = 115
% 0.43/1.09 maxnrvars = 195
% 0.43/1.09 excuselevel = 1
% 0.43/1.09 increasemaxweight = 1
% 0.43/1.09
% 0.43/1.09 maxselected = 10000000
% 0.43/1.09 maxnrclauses = 10000000
% 0.43/1.09
% 0.43/1.09 showgenerated = 0
% 0.43/1.09 showkept = 0
% 0.43/1.09 showselected = 0
% 0.43/1.09 showdeleted = 0
% 0.43/1.09 showresimp = 1
% 0.43/1.09 showstatus = 2000
% 0.43/1.09
% 0.43/1.09 prologoutput = 0
% 0.43/1.09 nrgoals = 5000000
% 0.43/1.09 totalproof = 1
% 0.43/1.09
% 0.43/1.09 Symbols occurring in the translation:
% 0.43/1.09
% 0.43/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.09 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.43/1.09 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.43/1.09 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.43/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.09 relation [37, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.43/1.09 function [38, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.43/1.09 finite [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.09 relation_image [40, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.43/1.09 relation_dom [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.43/1.09 relation_rng [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.43/1.09 skol1 [43, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.43/1.09 skol2 [44, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Starting Search:
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Bliksems!, er is een bewijs:
% 0.43/1.09 % SZS status Theorem
% 0.43/1.09 % SZS output start Refutation
% 0.43/1.09
% 0.43/1.09 (1) {G0,W10,D3,L4,V2,M4} I { ! relation( X ), ! function( X ), ! finite( Y
% 0.43/1.09 ), finite( relation_image( X, Y ) ) }.
% 0.43/1.09 (4) {G0,W9,D4,L2,V1,M2} I { ! relation( X ), relation_image( X,
% 0.43/1.09 relation_dom( X ) ) ==> relation_rng( X ) }.
% 0.43/1.09 (5) {G0,W2,D2,L1,V0,M1} I { relation( skol2 ) }.
% 0.43/1.09 (6) {G0,W2,D2,L1,V0,M1} I { function( skol2 ) }.
% 0.43/1.09 (7) {G0,W3,D3,L1,V0,M1} I { finite( relation_dom( skol2 ) ) }.
% 0.43/1.09 (8) {G0,W3,D3,L1,V0,M1} I { ! finite( relation_rng( skol2 ) ) }.
% 0.43/1.09 (11) {G1,W6,D3,L2,V1,M2} R(1,5);r(6) { ! finite( X ), finite(
% 0.43/1.09 relation_image( skol2, X ) ) }.
% 0.43/1.09 (21) {G1,W7,D4,L1,V0,M1} R(4,5) { relation_image( skol2, relation_dom(
% 0.43/1.09 skol2 ) ) ==> relation_rng( skol2 ) }.
% 0.43/1.09 (28) {G2,W0,D0,L0,V0,M0} R(11,7);d(21);r(8) { }.
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 % SZS output end Refutation
% 0.43/1.09 found a proof!
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Unprocessed initial clauses:
% 0.43/1.09
% 0.43/1.09 (30) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.09 (31) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.09 (32) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.09 (33) {G0,W10,D3,L4,V2,M4} { ! relation( X ), ! function( X ), ! finite( Y
% 0.43/1.09 ), finite( relation_image( X, Y ) ) }.
% 0.43/1.09 (34) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.43/1.09 (35) {G0,W2,D2,L1,V0,M1} { function( skol1 ) }.
% 0.43/1.09 (36) {G0,W9,D4,L2,V1,M2} { ! relation( X ), relation_image( X,
% 0.43/1.09 relation_dom( X ) ) = relation_rng( X ) }.
% 0.43/1.09 (37) {G0,W10,D3,L4,V2,M4} { ! relation( X ), ! function( X ), ! finite( Y
% 0.43/1.09 ), finite( relation_image( X, Y ) ) }.
% 0.43/1.09 (38) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.43/1.09 (39) {G0,W2,D2,L1,V0,M1} { function( skol2 ) }.
% 0.43/1.09 (40) {G0,W3,D3,L1,V0,M1} { finite( relation_dom( skol2 ) ) }.
% 0.43/1.09 (41) {G0,W3,D3,L1,V0,M1} { ! finite( relation_rng( skol2 ) ) }.
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Total Proof:
% 0.43/1.09
% 0.43/1.09 subsumption: (1) {G0,W10,D3,L4,V2,M4} I { ! relation( X ), ! function( X )
% 0.43/1.09 , ! finite( Y ), finite( relation_image( X, Y ) ) }.
% 0.43/1.09 parent0: (33) {G0,W10,D3,L4,V2,M4} { ! relation( X ), ! function( X ), !
% 0.43/1.09 finite( Y ), finite( relation_image( X, Y ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := X
% 0.43/1.09 Y := Y
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 1 ==> 1
% 0.43/1.09 2 ==> 2
% 0.43/1.09 3 ==> 3
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (4) {G0,W9,D4,L2,V1,M2} I { ! relation( X ), relation_image( X
% 0.43/1.09 , relation_dom( X ) ) ==> relation_rng( X ) }.
% 0.43/1.09 parent0: (36) {G0,W9,D4,L2,V1,M2} { ! relation( X ), relation_image( X,
% 0.43/1.09 relation_dom( X ) ) = relation_rng( X ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := X
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 1 ==> 1
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { relation( skol2 ) }.
% 0.43/1.09 parent0: (38) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (6) {G0,W2,D2,L1,V0,M1} I { function( skol2 ) }.
% 0.43/1.09 parent0: (39) {G0,W2,D2,L1,V0,M1} { function( skol2 ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (7) {G0,W3,D3,L1,V0,M1} I { finite( relation_dom( skol2 ) )
% 0.43/1.09 }.
% 0.43/1.09 parent0: (40) {G0,W3,D3,L1,V0,M1} { finite( relation_dom( skol2 ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (8) {G0,W3,D3,L1,V0,M1} I { ! finite( relation_rng( skol2 ) )
% 0.43/1.09 }.
% 0.43/1.09 parent0: (41) {G0,W3,D3,L1,V0,M1} { ! finite( relation_rng( skol2 ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 resolution: (47) {G1,W8,D3,L3,V1,M3} { ! function( skol2 ), ! finite( X )
% 0.43/1.09 , finite( relation_image( skol2, X ) ) }.
% 0.43/1.09 parent0[0]: (1) {G0,W10,D3,L4,V2,M4} I { ! relation( X ), ! function( X ),
% 0.43/1.09 ! finite( Y ), finite( relation_image( X, Y ) ) }.
% 0.43/1.09 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { relation( skol2 ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := skol2
% 0.43/1.09 Y := X
% 0.43/1.09 end
% 0.43/1.09 substitution1:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 resolution: (48) {G1,W6,D3,L2,V1,M2} { ! finite( X ), finite(
% 0.43/1.09 relation_image( skol2, X ) ) }.
% 0.43/1.09 parent0[0]: (47) {G1,W8,D3,L3,V1,M3} { ! function( skol2 ), ! finite( X )
% 0.43/1.09 , finite( relation_image( skol2, X ) ) }.
% 0.43/1.09 parent1[0]: (6) {G0,W2,D2,L1,V0,M1} I { function( skol2 ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := X
% 0.43/1.09 end
% 0.43/1.09 substitution1:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (11) {G1,W6,D3,L2,V1,M2} R(1,5);r(6) { ! finite( X ), finite(
% 0.43/1.09 relation_image( skol2, X ) ) }.
% 0.43/1.09 parent0: (48) {G1,W6,D3,L2,V1,M2} { ! finite( X ), finite( relation_image
% 0.43/1.09 ( skol2, X ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := X
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 1 ==> 1
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 eqswap: (49) {G0,W9,D4,L2,V1,M2} { relation_rng( X ) ==> relation_image( X
% 0.43/1.09 , relation_dom( X ) ), ! relation( X ) }.
% 0.43/1.09 parent0[1]: (4) {G0,W9,D4,L2,V1,M2} I { ! relation( X ), relation_image( X
% 0.43/1.09 , relation_dom( X ) ) ==> relation_rng( X ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := X
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 resolution: (50) {G1,W7,D4,L1,V0,M1} { relation_rng( skol2 ) ==>
% 0.43/1.09 relation_image( skol2, relation_dom( skol2 ) ) }.
% 0.43/1.09 parent0[1]: (49) {G0,W9,D4,L2,V1,M2} { relation_rng( X ) ==>
% 0.43/1.09 relation_image( X, relation_dom( X ) ), ! relation( X ) }.
% 0.43/1.09 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { relation( skol2 ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := skol2
% 0.43/1.09 end
% 0.43/1.09 substitution1:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 eqswap: (51) {G1,W7,D4,L1,V0,M1} { relation_image( skol2, relation_dom(
% 0.43/1.09 skol2 ) ) ==> relation_rng( skol2 ) }.
% 0.43/1.09 parent0[0]: (50) {G1,W7,D4,L1,V0,M1} { relation_rng( skol2 ) ==>
% 0.43/1.09 relation_image( skol2, relation_dom( skol2 ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (21) {G1,W7,D4,L1,V0,M1} R(4,5) { relation_image( skol2,
% 0.43/1.09 relation_dom( skol2 ) ) ==> relation_rng( skol2 ) }.
% 0.43/1.09 parent0: (51) {G1,W7,D4,L1,V0,M1} { relation_image( skol2, relation_dom(
% 0.43/1.09 skol2 ) ) ==> relation_rng( skol2 ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 0 ==> 0
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 resolution: (53) {G1,W5,D4,L1,V0,M1} { finite( relation_image( skol2,
% 0.43/1.09 relation_dom( skol2 ) ) ) }.
% 0.43/1.09 parent0[0]: (11) {G1,W6,D3,L2,V1,M2} R(1,5);r(6) { ! finite( X ), finite(
% 0.43/1.09 relation_image( skol2, X ) ) }.
% 0.43/1.09 parent1[0]: (7) {G0,W3,D3,L1,V0,M1} I { finite( relation_dom( skol2 ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 X := relation_dom( skol2 )
% 0.43/1.09 end
% 0.43/1.09 substitution1:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 paramod: (54) {G2,W3,D3,L1,V0,M1} { finite( relation_rng( skol2 ) ) }.
% 0.43/1.09 parent0[0]: (21) {G1,W7,D4,L1,V0,M1} R(4,5) { relation_image( skol2,
% 0.43/1.09 relation_dom( skol2 ) ) ==> relation_rng( skol2 ) }.
% 0.43/1.09 parent1[0; 1]: (53) {G1,W5,D4,L1,V0,M1} { finite( relation_image( skol2,
% 0.43/1.09 relation_dom( skol2 ) ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 substitution1:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 resolution: (55) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.09 parent0[0]: (8) {G0,W3,D3,L1,V0,M1} I { ! finite( relation_rng( skol2 ) )
% 0.43/1.09 }.
% 0.43/1.09 parent1[0]: (54) {G2,W3,D3,L1,V0,M1} { finite( relation_rng( skol2 ) ) }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 substitution1:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 subsumption: (28) {G2,W0,D0,L0,V0,M0} R(11,7);d(21);r(8) { }.
% 0.43/1.09 parent0: (55) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.09 substitution0:
% 0.43/1.09 end
% 0.43/1.09 permutation0:
% 0.43/1.09 end
% 0.43/1.09
% 0.43/1.09 Proof check complete!
% 0.43/1.09
% 0.43/1.09 Memory use:
% 0.43/1.09
% 0.43/1.09 space for terms: 390
% 0.43/1.09 space for clauses: 1646
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 clauses generated: 40
% 0.43/1.09 clauses kept: 29
% 0.43/1.09 clauses selected: 12
% 0.43/1.09 clauses deleted: 0
% 0.43/1.09 clauses inuse deleted: 0
% 0.43/1.09
% 0.43/1.09 subsentry: 65
% 0.43/1.09 literals s-matched: 40
% 0.43/1.09 literals matched: 40
% 0.43/1.09 full subsumption: 3
% 0.43/1.09
% 0.43/1.09 checksum: 1962976732
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Bliksem ended
%------------------------------------------------------------------------------