%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET044+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:03 EDT 2022
% Result : Theorem 0.44s 1.08s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET044+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n018.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 : Mon Jul 11 05:33:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.07 *** allocated 10000 integers for termspace/termends
% 0.44/1.07 *** allocated 10000 integers for clauses
% 0.44/1.07 *** allocated 10000 integers for justifications
% 0.44/1.07 Bliksem 1.12
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Automatic Strategy Selection
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Clauses:
% 0.44/1.07
% 0.44/1.07 { ! element( X, skol1 ), element( X, X ) }.
% 0.44/1.07 { ! element( X, X ), element( X, skol1 ) }.
% 0.44/1.07 { ! element( Y, skol2( X ) ), ! element( Y, X ) }.
% 0.44/1.07 { element( Y, X ), element( Y, skol2( X ) ) }.
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 0.750000
% 0.44/1.07 This a non-horn, non-equality problem
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Options Used:
% 0.44/1.07
% 0.44/1.07 useres = 1
% 0.44/1.07 useparamod = 0
% 0.44/1.07 useeqrefl = 0
% 0.44/1.07 useeqfact = 0
% 0.44/1.07 usefactor = 1
% 0.44/1.07 usesimpsplitting = 0
% 0.44/1.07 usesimpdemod = 0
% 0.44/1.07 usesimpres = 3
% 0.44/1.07
% 0.44/1.07 resimpinuse = 1000
% 0.44/1.07 resimpclauses = 20000
% 0.44/1.07 substype = standard
% 0.44/1.07 backwardsubs = 1
% 0.44/1.07 selectoldest = 5
% 0.44/1.07
% 0.44/1.07 litorderings [0] = split
% 0.44/1.07 litorderings [1] = liftord
% 0.44/1.07
% 0.44/1.07 termordering = none
% 0.44/1.07
% 0.44/1.07 litapriori = 1
% 0.44/1.07 termapriori = 0
% 0.44/1.07 litaposteriori = 0
% 0.44/1.07 termaposteriori = 0
% 0.44/1.07 demodaposteriori = 0
% 0.44/1.07 ordereqreflfact = 0
% 0.44/1.07
% 0.44/1.07 litselect = none
% 0.44/1.08
% 0.44/1.08 maxweight = 15
% 0.44/1.08 maxdepth = 30000
% 0.44/1.08 maxlength = 115
% 0.44/1.08 maxnrvars = 195
% 0.44/1.08 excuselevel = 1
% 0.44/1.08 increasemaxweight = 1
% 0.44/1.08
% 0.44/1.08 maxselected = 10000000
% 0.44/1.08 maxnrclauses = 10000000
% 0.44/1.08
% 0.44/1.08 showgenerated = 0
% 0.44/1.08 showkept = 0
% 0.44/1.08 showselected = 0
% 0.44/1.08 showdeleted = 0
% 0.44/1.08 showresimp = 1
% 0.44/1.08 showstatus = 2000
% 0.44/1.08
% 0.44/1.08 prologoutput = 0
% 0.44/1.08 nrgoals = 5000000
% 0.44/1.08 totalproof = 1
% 0.44/1.08
% 0.44/1.08 Symbols occurring in the translation:
% 0.44/1.08
% 0.44/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.08 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.08 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.44/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.08 element [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.44/1.08 skol1 [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.44/1.08 skol2 [42, 1] (w:1, o:17, a:1, s:1, b:0).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Starting Search:
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Bliksems!, er is een bewijs:
% 0.44/1.08 % SZS status Theorem
% 0.44/1.08 % SZS output start Refutation
% 0.44/1.08
% 0.44/1.08 (0) {G0,W6,D2,L2,V1,M2} I { element( X, X ), ! element( X, skol1 ) }.
% 0.44/1.08 (1) {G0,W6,D2,L2,V1,M2} I { element( X, skol1 ), ! element( X, X ) }.
% 0.44/1.08 (2) {G0,W7,D3,L2,V2,M2} I { ! element( Y, X ), ! element( Y, skol2( X ) )
% 0.44/1.08 }.
% 0.44/1.08 (3) {G0,W7,D3,L2,V2,M2} I { element( Y, skol2( X ) ), element( Y, X ) }.
% 0.44/1.08 (4) {G1,W7,D3,L2,V1,M2} R(3,0) { element( X, X ), element( X, skol2( skol1
% 0.44/1.08 ) ) }.
% 0.44/1.08 (5) {G1,W8,D3,L2,V1,M2} R(3,1) { element( skol2( X ), skol1 ), element(
% 0.44/1.08 skol2( X ), X ) }.
% 0.44/1.08 (7) {G2,W4,D3,L1,V0,M1} F(5) { element( skol2( skol1 ), skol1 ) }.
% 0.44/1.08 (8) {G2,W5,D3,L1,V0,M1} F(4) { element( skol2( skol1 ), skol2( skol1 ) )
% 0.44/1.08 }.
% 0.44/1.08 (10) {G3,W0,D0,L0,V0,M0} R(2,8);r(7) { }.
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 % SZS output end Refutation
% 0.44/1.08 found a proof!
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Unprocessed initial clauses:
% 0.44/1.08
% 0.44/1.08 (12) {G0,W6,D2,L2,V1,M2} { ! element( X, skol1 ), element( X, X ) }.
% 0.44/1.08 (13) {G0,W6,D2,L2,V1,M2} { ! element( X, X ), element( X, skol1 ) }.
% 0.44/1.08 (14) {G0,W7,D3,L2,V2,M2} { ! element( Y, skol2( X ) ), ! element( Y, X )
% 0.44/1.08 }.
% 0.44/1.08 (15) {G0,W7,D3,L2,V2,M2} { element( Y, X ), element( Y, skol2( X ) ) }.
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Total Proof:
% 0.44/1.08
% 0.44/1.08 subsumption: (0) {G0,W6,D2,L2,V1,M2} I { element( X, X ), ! element( X,
% 0.44/1.08 skol1 ) }.
% 0.44/1.08 parent0: (12) {G0,W6,D2,L2,V1,M2} { ! element( X, skol1 ), element( X, X )
% 0.44/1.08 }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 1
% 0.44/1.08 1 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (1) {G0,W6,D2,L2,V1,M2} I { element( X, skol1 ), ! element( X
% 0.44/1.08 , X ) }.
% 0.44/1.08 parent0: (13) {G0,W6,D2,L2,V1,M2} { ! element( X, X ), element( X, skol1 )
% 0.44/1.08 }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 1
% 0.44/1.08 1 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (2) {G0,W7,D3,L2,V2,M2} I { ! element( Y, X ), ! element( Y,
% 0.44/1.08 skol2( X ) ) }.
% 0.44/1.08 parent0: (14) {G0,W7,D3,L2,V2,M2} { ! element( Y, skol2( X ) ), ! element
% 0.44/1.08 ( Y, X ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 Y := Y
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 1
% 0.44/1.08 1 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (3) {G0,W7,D3,L2,V2,M2} I { element( Y, skol2( X ) ), element
% 0.44/1.08 ( Y, X ) }.
% 0.44/1.08 parent0: (15) {G0,W7,D3,L2,V2,M2} { element( Y, X ), element( Y, skol2( X
% 0.44/1.08 ) ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 Y := Y
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 1
% 0.44/1.08 1 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (16) {G1,W7,D3,L2,V1,M2} { element( X, X ), element( X, skol2
% 0.44/1.08 ( skol1 ) ) }.
% 0.44/1.08 parent0[1]: (0) {G0,W6,D2,L2,V1,M2} I { element( X, X ), ! element( X,
% 0.44/1.08 skol1 ) }.
% 0.44/1.08 parent1[1]: (3) {G0,W7,D3,L2,V2,M2} I { element( Y, skol2( X ) ), element(
% 0.44/1.08 Y, X ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08 substitution1:
% 0.44/1.08 X := skol1
% 0.44/1.08 Y := X
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (4) {G1,W7,D3,L2,V1,M2} R(3,0) { element( X, X ), element( X,
% 0.44/1.08 skol2( skol1 ) ) }.
% 0.44/1.08 parent0: (16) {G1,W7,D3,L2,V1,M2} { element( X, X ), element( X, skol2(
% 0.44/1.08 skol1 ) ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 0
% 0.44/1.08 1 ==> 1
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (18) {G1,W8,D3,L2,V1,M2} { element( skol2( X ), skol1 ),
% 0.44/1.08 element( skol2( X ), X ) }.
% 0.44/1.08 parent0[1]: (1) {G0,W6,D2,L2,V1,M2} I { element( X, skol1 ), ! element( X,
% 0.44/1.08 X ) }.
% 0.44/1.08 parent1[0]: (3) {G0,W7,D3,L2,V2,M2} I { element( Y, skol2( X ) ), element(
% 0.44/1.08 Y, X ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := skol2( X )
% 0.44/1.08 end
% 0.44/1.08 substitution1:
% 0.44/1.08 X := X
% 0.44/1.08 Y := skol2( X )
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (5) {G1,W8,D3,L2,V1,M2} R(3,1) { element( skol2( X ), skol1 )
% 0.44/1.08 , element( skol2( X ), X ) }.
% 0.44/1.08 parent0: (18) {G1,W8,D3,L2,V1,M2} { element( skol2( X ), skol1 ), element
% 0.44/1.08 ( skol2( X ), X ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 0
% 0.44/1.08 1 ==> 1
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 factor: (21) {G1,W4,D3,L1,V0,M1} { element( skol2( skol1 ), skol1 ) }.
% 0.44/1.08 parent0[0, 1]: (5) {G1,W8,D3,L2,V1,M2} R(3,1) { element( skol2( X ), skol1
% 0.44/1.08 ), element( skol2( X ), X ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := skol1
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (7) {G2,W4,D3,L1,V0,M1} F(5) { element( skol2( skol1 ), skol1
% 0.44/1.08 ) }.
% 0.44/1.08 parent0: (21) {G1,W4,D3,L1,V0,M1} { element( skol2( skol1 ), skol1 ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 factor: (22) {G1,W5,D3,L1,V0,M1} { element( skol2( skol1 ), skol2( skol1 )
% 0.44/1.08 ) }.
% 0.44/1.08 parent0[0, 1]: (4) {G1,W7,D3,L2,V1,M2} R(3,0) { element( X, X ), element( X
% 0.44/1.08 , skol2( skol1 ) ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := skol2( skol1 )
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (8) {G2,W5,D3,L1,V0,M1} F(4) { element( skol2( skol1 ), skol2
% 0.44/1.08 ( skol1 ) ) }.
% 0.44/1.08 parent0: (22) {G1,W5,D3,L1,V0,M1} { element( skol2( skol1 ), skol2( skol1
% 0.44/1.08 ) ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 0 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (24) {G1,W4,D3,L1,V0,M1} { ! element( skol2( skol1 ), skol1 )
% 0.44/1.08 }.
% 0.44/1.08 parent0[1]: (2) {G0,W7,D3,L2,V2,M2} I { ! element( Y, X ), ! element( Y,
% 0.44/1.08 skol2( X ) ) }.
% 0.44/1.08 parent1[0]: (8) {G2,W5,D3,L1,V0,M1} F(4) { element( skol2( skol1 ), skol2(
% 0.44/1.08 skol1 ) ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := skol1
% 0.44/1.08 Y := skol2( skol1 )
% 0.44/1.08 end
% 0.44/1.08 substitution1:
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (25) {G2,W0,D0,L0,V0,M0} { }.
% 0.44/1.08 parent0[0]: (24) {G1,W4,D3,L1,V0,M1} { ! element( skol2( skol1 ), skol1 )
% 0.44/1.08 }.
% 0.44/1.08 parent1[0]: (7) {G2,W4,D3,L1,V0,M1} F(5) { element( skol2( skol1 ), skol1 )
% 0.44/1.08 }.
% 0.44/1.08 substitution0:
% 0.44/1.08 end
% 0.44/1.08 substitution1:
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (10) {G3,W0,D0,L0,V0,M0} R(2,8);r(7) { }.
% 0.44/1.08 parent0: (25) {G2,W0,D0,L0,V0,M0} { }.
% 0.44/1.08 substitution0:
% 0.44/1.08 end
% 0.44/1.08 permutation0:
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 Proof check complete!
% 0.44/1.08
% 0.44/1.08 Memory use:
% 0.44/1.08
% 0.44/1.08 space for terms: 139
% 0.44/1.08 space for clauses: 629
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 clauses generated: 19
% 0.44/1.08 clauses kept: 11
% 0.44/1.08 clauses selected: 6
% 0.44/1.08 clauses deleted: 0
% 0.44/1.08 clauses inuse deleted: 0
% 0.44/1.08
% 0.44/1.08 subsentry: 16
% 0.44/1.08 literals s-matched: 4
% 0.44/1.08 literals matched: 4
% 0.44/1.08 full subsumption: 2
% 0.44/1.08
% 0.44/1.08 checksum: -268446639
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Bliksem ended
%------------------------------------------------------------------------------