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