%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET045+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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 : Mon Jul 18 22:46:04 EDT 2022
% Result : Theorem 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET045+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sun Jul 10 04:03:13 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.70/1.10 *** allocated 10000 integers for termspace/termends
% 0.70/1.10 *** allocated 10000 integers for clauses
% 0.70/1.10 *** allocated 10000 integers for justifications
% 0.70/1.10 Bliksem 1.12
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Automatic Strategy Selection
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Clauses:
% 0.70/1.10
% 0.70/1.10 { ! element( Y, skol1( X ) ), element( Y, X ) }.
% 0.70/1.10 { ! element( Y, skol1( X ) ), ! element( Y, Y ) }.
% 0.70/1.10 { ! element( Y, X ), element( Y, Y ), element( Y, skol1( X ) ) }.
% 0.70/1.10 { element( X, skol2 ) }.
% 0.70/1.10
% 0.70/1.10 percentage equality = 0.000000, percentage horn = 0.750000
% 0.70/1.10 This a non-horn, non-equality problem
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Options Used:
% 0.70/1.10
% 0.70/1.10 useres = 1
% 0.70/1.10 useparamod = 0
% 0.70/1.10 useeqrefl = 0
% 0.70/1.10 useeqfact = 0
% 0.70/1.10 usefactor = 1
% 0.70/1.10 usesimpsplitting = 0
% 0.70/1.10 usesimpdemod = 0
% 0.70/1.10 usesimpres = 3
% 0.70/1.10
% 0.70/1.10 resimpinuse = 1000
% 0.70/1.10 resimpclauses = 20000
% 0.70/1.10 substype = standard
% 0.70/1.10 backwardsubs = 1
% 0.70/1.10 selectoldest = 5
% 0.70/1.10
% 0.70/1.10 litorderings [0] = split
% 0.70/1.10 litorderings [1] = liftord
% 0.70/1.10
% 0.70/1.10 termordering = none
% 0.70/1.10
% 0.70/1.10 litapriori = 1
% 0.70/1.10 termapriori = 0
% 0.70/1.10 litaposteriori = 0
% 0.70/1.10 termaposteriori = 0
% 0.70/1.10 demodaposteriori = 0
% 0.70/1.10 ordereqreflfact = 0
% 0.70/1.10
% 0.70/1.10 litselect = none
% 0.70/1.10
% 0.70/1.10 maxweight = 15
% 0.70/1.10 maxdepth = 30000
% 0.70/1.10 maxlength = 115
% 0.70/1.10 maxnrvars = 195
% 0.70/1.10 excuselevel = 1
% 0.70/1.10 increasemaxweight = 1
% 0.70/1.10
% 0.70/1.10 maxselected = 10000000
% 0.70/1.10 maxnrclauses = 10000000
% 0.70/1.10
% 0.70/1.10 showgenerated = 0
% 0.70/1.10 showkept = 0
% 0.70/1.10 showselected = 0
% 0.70/1.10 showdeleted = 0
% 0.70/1.10 showresimp = 1
% 0.70/1.10 showstatus = 2000
% 0.70/1.10
% 0.70/1.10 prologoutput = 0
% 0.70/1.10 nrgoals = 5000000
% 0.70/1.10 totalproof = 1
% 0.70/1.10
% 0.70/1.10 Symbols occurring in the translation:
% 0.70/1.10
% 0.70/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.10 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.70/1.10 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.70/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 element [38, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.70/1.10 skol1 [39, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.70/1.10 skol2 [40, 0] (w:1, o:9, a:1, s:1, b:0).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Starting Search:
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksems!, er is een bewijs:
% 0.70/1.10 % SZS status Theorem
% 0.70/1.10 % SZS output start Refutation
% 0.70/1.10
% 0.70/1.10 (1) {G0,W7,D3,L2,V2,M2} I { ! element( Y, Y ), ! element( Y, skol1( X ) )
% 0.70/1.10 }.
% 0.70/1.10 (2) {G0,W10,D3,L3,V2,M3} I { element( Y, Y ), element( Y, skol1( X ) ), !
% 0.70/1.10 element( Y, X ) }.
% 0.70/1.10 (3) {G0,W3,D2,L1,V1,M1} I { element( X, skol2 ) }.
% 0.70/1.10 (4) {G1,W5,D3,L1,V1,M1} F(1) { ! element( skol1( X ), skol1( X ) ) }.
% 0.70/1.10 (5) {G2,W4,D3,L1,V1,M1} F(2);r(4) { ! element( skol1( X ), X ) }.
% 0.70/1.10 (6) {G3,W0,D0,L0,V0,M0} R(5,3) { }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 % SZS output end Refutation
% 0.70/1.10 found a proof!
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Unprocessed initial clauses:
% 0.70/1.10
% 0.70/1.10 (8) {G0,W7,D3,L2,V2,M2} { ! element( Y, skol1( X ) ), element( Y, X ) }.
% 0.70/1.10 (9) {G0,W7,D3,L2,V2,M2} { ! element( Y, skol1( X ) ), ! element( Y, Y )
% 0.70/1.10 }.
% 0.70/1.10 (10) {G0,W10,D3,L3,V2,M3} { ! element( Y, X ), element( Y, Y ), element( Y
% 0.70/1.10 , skol1( X ) ) }.
% 0.70/1.10 (11) {G0,W3,D2,L1,V1,M1} { element( X, skol2 ) }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Total Proof:
% 0.70/1.10
% 0.70/1.10 subsumption: (1) {G0,W7,D3,L2,V2,M2} I { ! element( Y, Y ), ! element( Y,
% 0.70/1.10 skol1( X ) ) }.
% 0.70/1.10 parent0: (9) {G0,W7,D3,L2,V2,M2} { ! element( Y, skol1( X ) ), ! element(
% 0.70/1.10 Y, Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 1
% 0.70/1.10 1 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (2) {G0,W10,D3,L3,V2,M3} I { element( Y, Y ), element( Y,
% 0.70/1.10 skol1( X ) ), ! element( Y, X ) }.
% 0.70/1.10 parent0: (10) {G0,W10,D3,L3,V2,M3} { ! element( Y, X ), element( Y, Y ),
% 0.70/1.10 element( Y, skol1( X ) ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 2
% 0.70/1.10 1 ==> 0
% 0.70/1.10 2 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (3) {G0,W3,D2,L1,V1,M1} I { element( X, skol2 ) }.
% 0.70/1.10 parent0: (11) {G0,W3,D2,L1,V1,M1} { element( X, skol2 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 factor: (17) {G0,W5,D3,L1,V1,M1} { ! element( skol1( X ), skol1( X ) ) }.
% 0.70/1.10 parent0[0, 1]: (1) {G0,W7,D3,L2,V2,M2} I { ! element( Y, Y ), ! element( Y
% 0.70/1.10 , skol1( X ) ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := skol1( X )
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (4) {G1,W5,D3,L1,V1,M1} F(1) { ! element( skol1( X ), skol1( X
% 0.70/1.10 ) ) }.
% 0.70/1.10 parent0: (17) {G0,W5,D3,L1,V1,M1} { ! element( skol1( X ), skol1( X ) )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 factor: (18) {G0,W9,D3,L2,V1,M2} { element( skol1( X ), skol1( X ) ), !
% 0.70/1.10 element( skol1( X ), X ) }.
% 0.70/1.10 parent0[0, 1]: (2) {G0,W10,D3,L3,V2,M3} I { element( Y, Y ), element( Y,
% 0.70/1.10 skol1( X ) ), ! element( Y, X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := skol1( X )
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (19) {G1,W4,D3,L1,V1,M1} { ! element( skol1( X ), X ) }.
% 0.70/1.10 parent0[0]: (4) {G1,W5,D3,L1,V1,M1} F(1) { ! element( skol1( X ), skol1( X
% 0.70/1.10 ) ) }.
% 0.70/1.10 parent1[0]: (18) {G0,W9,D3,L2,V1,M2} { element( skol1( X ), skol1( X ) ),
% 0.70/1.10 ! element( skol1( X ), X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (5) {G2,W4,D3,L1,V1,M1} F(2);r(4) { ! element( skol1( X ), X )
% 0.70/1.10 }.
% 0.70/1.10 parent0: (19) {G1,W4,D3,L1,V1,M1} { ! element( skol1( X ), X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (20) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 parent0[0]: (5) {G2,W4,D3,L1,V1,M1} F(2);r(4) { ! element( skol1( X ), X )
% 0.70/1.10 }.
% 0.70/1.10 parent1[0]: (3) {G0,W3,D2,L1,V1,M1} I { element( X, skol2 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := skol2
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 X := skol1( skol2 )
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (6) {G3,W0,D0,L0,V0,M0} R(5,3) { }.
% 0.70/1.10 parent0: (20) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 Proof check complete!
% 0.70/1.10
% 0.70/1.10 Memory use:
% 0.70/1.10
% 0.70/1.10 space for terms: 113
% 0.70/1.10 space for clauses: 372
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 clauses generated: 7
% 0.70/1.10 clauses kept: 7
% 0.70/1.10 clauses selected: 2
% 0.70/1.10 clauses deleted: 0
% 0.70/1.10 clauses inuse deleted: 0
% 0.70/1.10
% 0.70/1.10 subsentry: 1
% 0.70/1.10 literals s-matched: 0
% 0.70/1.10 literals matched: 0
% 0.70/1.10 full subsumption: 0
% 0.70/1.10
% 0.70/1.10 checksum: 805307414
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksem ended
%------------------------------------------------------------------------------