%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN943+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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 : Thu Jul 21 02:58:18 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.07/0.12 % Problem : SYN943+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n016.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 : Mon Jul 11 12:04:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.08 *** allocated 10000 integers for termspace/termends
% 0.44/1.08 *** allocated 10000 integers for clauses
% 0.44/1.08 *** allocated 10000 integers for justifications
% 0.44/1.08 Bliksem 1.12
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Automatic Strategy Selection
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Clauses:
% 0.44/1.08
% 0.44/1.08 { p( skol1 ) }.
% 0.44/1.08 { e( skol1 ) }.
% 0.44/1.08 { ! e( X ), g( X ), s( X, f( X ) ) }.
% 0.44/1.08 { ! e( X ), g( X ), c( f( X ) ) }.
% 0.44/1.08 { ! s( skol1, X ), p( X ) }.
% 0.44/1.08 { ! p( X ), ! g( X ) }.
% 0.44/1.08 { ! p( X ), ! c( X ) }.
% 0.44/1.08
% 0.44/1.08 percentage equality = 0.000000, percentage horn = 0.714286
% 0.44/1.08 This a non-horn, non-equality problem
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Options Used:
% 0.44/1.08
% 0.44/1.08 useres = 1
% 0.44/1.08 useparamod = 0
% 0.44/1.08 useeqrefl = 0
% 0.44/1.08 useeqfact = 0
% 0.44/1.08 usefactor = 1
% 0.44/1.08 usesimpsplitting = 0
% 0.44/1.08 usesimpdemod = 0
% 0.44/1.08 usesimpres = 3
% 0.44/1.08
% 0.44/1.08 resimpinuse = 1000
% 0.44/1.08 resimpclauses = 20000
% 0.44/1.08 substype = standard
% 0.44/1.08 backwardsubs = 1
% 0.44/1.08 selectoldest = 5
% 0.44/1.08
% 0.44/1.08 litorderings [0] = split
% 0.44/1.08 litorderings [1] = liftord
% 0.44/1.08
% 0.44/1.08 termordering = none
% 0.44/1.08
% 0.44/1.08 litapriori = 1
% 0.44/1.08 termapriori = 0
% 0.44/1.08 litaposteriori = 0
% 0.44/1.08 termaposteriori = 0
% 0.44/1.08 demodaposteriori = 0
% 0.44/1.08 ordereqreflfact = 0
% 0.44/1.08
% 0.44/1.08 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:23, a:1, s:1, b:0),
% 0.44/1.08 ! [4, 1] (w:0, o:13, 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 p [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.08 e [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.08 g [43, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.08 f [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.08 s [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.08 c [46, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.08 skol1 [47, 0] (w:1, o:12, 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,W2,D2,L1,V0,M1} I { p( skol1 ) }.
% 0.44/1.08 (1) {G0,W2,D2,L1,V0,M1} I { e( skol1 ) }.
% 0.44/1.08 (2) {G0,W8,D3,L3,V1,M1} I { ! e( X ), g( X ), s( X, f( X ) ) }.
% 0.44/1.08 (3) {G0,W7,D3,L3,V1,M1} I { ! e( X ), g( X ), c( f( X ) ) }.
% 0.44/1.08 (4) {G0,W5,D2,L2,V1,M1} I { p( X ), ! s( skol1, X ) }.
% 0.44/1.08 (5) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! g( X ) }.
% 0.44/1.08 (6) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! c( X ) }.
% 0.44/1.08 (7) {G1,W5,D3,L2,V0,M1} R(2,4);r(1) { p( f( skol1 ) ), g( skol1 ) }.
% 0.44/1.08 (8) {G2,W3,D3,L1,V0,M1} R(7,5);r(0) { p( f( skol1 ) ) }.
% 0.44/1.08 (9) {G1,W7,D3,L3,V1,M1} R(3,6) { ! e( X ), ! p( f( X ) ), g( X ) }.
% 0.44/1.08 (10) {G2,W7,D3,L3,V1,M1} R(9,5) { ! p( f( X ) ), ! p( X ), ! e( X ) }.
% 0.44/1.08 (11) {G3,W2,D2,L1,V0,M1} R(10,1);r(8) { ! p( skol1 ) }.
% 0.44/1.08 (12) {G4,W0,D0,L0,V0,M0} S(11);r(0) { }.
% 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 (14) {G0,W2,D2,L1,V0,M1} { p( skol1 ) }.
% 0.44/1.08 (15) {G0,W2,D2,L1,V0,M1} { e( skol1 ) }.
% 0.44/1.08 (16) {G0,W8,D3,L3,V1,M3} { ! e( X ), g( X ), s( X, f( X ) ) }.
% 0.44/1.08 (17) {G0,W7,D3,L3,V1,M3} { ! e( X ), g( X ), c( f( X ) ) }.
% 0.44/1.08 (18) {G0,W5,D2,L2,V1,M2} { ! s( skol1, X ), p( X ) }.
% 0.44/1.08 (19) {G0,W4,D2,L2,V1,M2} { ! p( X ), ! g( X ) }.
% 0.44/1.08 (20) {G0,W4,D2,L2,V1,M2} { ! p( X ), ! c( 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,W2,D2,L1,V0,M1} I { p( skol1 ) }.
% 0.44/1.08 parent0: (14) {G0,W2,D2,L1,V0,M1} { p( 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 subsumption: (1) {G0,W2,D2,L1,V0,M1} I { e( skol1 ) }.
% 0.44/1.08 parent0: (15) {G0,W2,D2,L1,V0,M1} { e( 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 subsumption: (2) {G0,W8,D3,L3,V1,M1} I { ! e( X ), g( X ), s( X, f( X ) )
% 0.44/1.08 }.
% 0.44/1.08 parent0: (16) {G0,W8,D3,L3,V1,M3} { ! e( X ), g( X ), s( X, f( 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 2 ==> 2
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (3) {G0,W7,D3,L3,V1,M1} I { ! e( X ), g( X ), c( f( X ) ) }.
% 0.44/1.08 parent0: (17) {G0,W7,D3,L3,V1,M3} { ! e( X ), g( X ), c( f( 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 2 ==> 2
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (4) {G0,W5,D2,L2,V1,M1} I { p( X ), ! s( skol1, X ) }.
% 0.44/1.08 parent0: (18) {G0,W5,D2,L2,V1,M2} { ! s( skol1, X ), p( 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 ==> 1
% 0.44/1.08 1 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (5) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! g( X ) }.
% 0.44/1.08 parent0: (19) {G0,W4,D2,L2,V1,M2} { ! p( X ), ! g( 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 subsumption: (6) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! c( X ) }.
% 0.44/1.08 parent0: (20) {G0,W4,D2,L2,V1,M2} { ! p( X ), ! c( 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 resolution: (21) {G1,W7,D3,L3,V0,M3} { p( f( skol1 ) ), ! e( skol1 ), g(
% 0.44/1.08 skol1 ) }.
% 0.44/1.08 parent0[1]: (4) {G0,W5,D2,L2,V1,M1} I { p( X ), ! s( skol1, X ) }.
% 0.44/1.08 parent1[2]: (2) {G0,W8,D3,L3,V1,M1} I { ! e( X ), g( X ), s( X, f( X ) )
% 0.44/1.08 }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := f( skol1 )
% 0.44/1.08 end
% 0.44/1.08 substitution1:
% 0.44/1.08 X := skol1
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (22) {G1,W5,D3,L2,V0,M2} { p( f( skol1 ) ), g( skol1 ) }.
% 0.44/1.08 parent0[1]: (21) {G1,W7,D3,L3,V0,M3} { p( f( skol1 ) ), ! e( skol1 ), g(
% 0.44/1.08 skol1 ) }.
% 0.44/1.08 parent1[0]: (1) {G0,W2,D2,L1,V0,M1} I { e( skol1 ) }.
% 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: (7) {G1,W5,D3,L2,V0,M1} R(2,4);r(1) { p( f( skol1 ) ), g(
% 0.44/1.08 skol1 ) }.
% 0.44/1.08 parent0: (22) {G1,W5,D3,L2,V0,M2} { p( f( skol1 ) ), g( 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 1 ==> 1
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (24) {G1,W5,D3,L2,V0,M2} { ! p( skol1 ), p( f( skol1 ) ) }.
% 0.44/1.08 parent0[1]: (5) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! g( X ) }.
% 0.44/1.08 parent1[1]: (7) {G1,W5,D3,L2,V0,M1} R(2,4);r(1) { p( f( skol1 ) ), g( skol1
% 0.44/1.08 ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := 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) {G1,W3,D3,L1,V0,M1} { p( f( skol1 ) ) }.
% 0.44/1.08 parent0[0]: (24) {G1,W5,D3,L2,V0,M2} { ! p( skol1 ), p( f( skol1 ) ) }.
% 0.44/1.08 parent1[0]: (0) {G0,W2,D2,L1,V0,M1} I { p( skol1 ) }.
% 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: (8) {G2,W3,D3,L1,V0,M1} R(7,5);r(0) { p( f( skol1 ) ) }.
% 0.44/1.08 parent0: (25) {G1,W3,D3,L1,V0,M1} { p( f( 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 resolution: (26) {G1,W7,D3,L3,V1,M3} { ! p( f( X ) ), ! e( X ), g( X ) }.
% 0.44/1.08 parent0[1]: (6) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! c( X ) }.
% 0.44/1.08 parent1[2]: (3) {G0,W7,D3,L3,V1,M1} I { ! e( X ), g( X ), c( f( X ) ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := f( X )
% 0.44/1.08 end
% 0.44/1.08 substitution1:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (9) {G1,W7,D3,L3,V1,M1} R(3,6) { ! e( X ), ! p( f( X ) ), g( X
% 0.44/1.08 ) }.
% 0.44/1.08 parent0: (26) {G1,W7,D3,L3,V1,M3} { ! p( f( X ) ), ! e( X ), g( 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 ==> 1
% 0.44/1.08 1 ==> 0
% 0.44/1.08 2 ==> 2
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (27) {G1,W7,D3,L3,V1,M3} { ! p( X ), ! e( X ), ! p( f( X ) )
% 0.44/1.08 }.
% 0.44/1.08 parent0[1]: (5) {G0,W4,D2,L2,V1,M1} I { ! p( X ), ! g( X ) }.
% 0.44/1.08 parent1[2]: (9) {G1,W7,D3,L3,V1,M1} R(3,6) { ! e( X ), ! p( f( X ) ), g( 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 substitution1:
% 0.44/1.08 X := X
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 subsumption: (10) {G2,W7,D3,L3,V1,M1} R(9,5) { ! p( f( X ) ), ! p( X ), ! e
% 0.44/1.08 ( X ) }.
% 0.44/1.08 parent0: (27) {G1,W7,D3,L3,V1,M3} { ! p( X ), ! e( X ), ! p( f( 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 ==> 1
% 0.44/1.08 1 ==> 2
% 0.44/1.08 2 ==> 0
% 0.44/1.08 end
% 0.44/1.08
% 0.44/1.08 resolution: (28) {G1,W5,D3,L2,V0,M2} { ! p( f( skol1 ) ), ! p( skol1 ) }.
% 0.44/1.08 parent0[2]: (10) {G2,W7,D3,L3,V1,M1} R(9,5) { ! p( f( X ) ), ! p( X ), ! e
% 0.44/1.08 ( X ) }.
% 0.44/1.08 parent1[0]: (1) {G0,W2,D2,L1,V0,M1} I { e( skol1 ) }.
% 0.44/1.08 substitution0:
% 0.44/1.08 X := 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: (29) {G2,W2,D2,L1,V0,M1} { ! p( skol1 ) }.
% 0.44/1.08 parent0[0]: (28) {G1,W5,D3,L2,V0,M2} { ! p( f( skol1 ) ), ! p( skol1 ) }.
% 0.44/1.08 parent1[0]: (8) {G2,W3,D3,L1,V0,M1} R(7,5);r(0) { p( f( skol1 ) ) }.
% 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: (11) {G3,W2,D2,L1,V0,M1} R(10,1);r(8) { ! p( skol1 ) }.
% 0.44/1.08 parent0: (29) {G2,W2,D2,L1,V0,M1} { ! p( 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 resolution: (30) {G1,W0,D0,L0,V0,M0} { }.
% 0.44/1.08 parent0[0]: (11) {G3,W2,D2,L1,V0,M1} R(10,1);r(8) { ! p( skol1 ) }.
% 0.44/1.08 parent1[0]: (0) {G0,W2,D2,L1,V0,M1} I { p( skol1 ) }.
% 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: (12) {G4,W0,D0,L0,V0,M0} S(11);r(0) { }.
% 0.44/1.08 parent0: (30) {G1,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: 188
% 0.44/1.08 space for clauses: 716
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 clauses generated: 13
% 0.44/1.08 clauses kept: 13
% 0.44/1.08 clauses selected: 11
% 0.44/1.08 clauses deleted: 1
% 0.44/1.08 clauses inuse deleted: 0
% 0.44/1.08
% 0.44/1.08 subsentry: 1
% 0.44/1.08 literals s-matched: 0
% 0.44/1.08 literals matched: 0
% 0.44/1.08 full subsumption: 0
% 0.44/1.08
% 0.44/1.08 checksum: -18268610
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Bliksem ended
%------------------------------------------------------------------------------