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