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