TSTP Solution File: SYN944+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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.79s 1.17s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n013.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 : Tue Jul 12 08:41:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.79/1.17 *** allocated 10000 integers for termspace/termends
% 0.79/1.17 *** allocated 10000 integers for clauses
% 0.79/1.17 *** allocated 10000 integers for justifications
% 0.79/1.17 Bliksem 1.12
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Automatic Strategy Selection
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Clauses:
% 0.79/1.17
% 0.79/1.17 { s( skol1 ) }.
% 0.79/1.17 { s( skol2 ) }.
% 0.79/1.17 { r( skol2, skol3 ) }.
% 0.79/1.17 { ! s( X ), p( X ) }.
% 0.79/1.17 { ! r( X, Y ), q( X, Y ) }.
% 0.79/1.17 { ! p( X ), ! q( X, Y ) }.
% 0.79/1.17
% 0.79/1.17 percentage equality = 0.000000, percentage horn = 1.000000
% 0.79/1.17 This is a near-Horn, non-equality problem
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Options Used:
% 0.79/1.17
% 0.79/1.17 useres = 1
% 0.79/1.17 useparamod = 0
% 0.79/1.17 useeqrefl = 0
% 0.79/1.17 useeqfact = 0
% 0.79/1.17 usefactor = 1
% 0.79/1.17 usesimpsplitting = 0
% 0.79/1.17 usesimpdemod = 0
% 0.79/1.17 usesimpres = 4
% 0.79/1.17
% 0.79/1.17 resimpinuse = 1000
% 0.79/1.17 resimpclauses = 20000
% 0.79/1.17 substype = standard
% 0.79/1.17 backwardsubs = 1
% 0.79/1.17 selectoldest = 5
% 0.79/1.17
% 0.79/1.17 litorderings [0] = split
% 0.79/1.17 litorderings [1] = liftord
% 0.79/1.17
% 0.79/1.17 termordering = none
% 0.79/1.17
% 0.79/1.17 litapriori = 1
% 0.79/1.17 termapriori = 0
% 0.79/1.17 litaposteriori = 0
% 0.79/1.17 termaposteriori = 0
% 0.79/1.17 demodaposteriori = 0
% 0.79/1.17 ordereqreflfact = 0
% 0.79/1.17
% 0.79/1.17 litselect = negative
% 0.79/1.17
% 0.79/1.17 maxweight = 30000
% 0.79/1.17 maxdepth = 30000
% 0.79/1.17 maxlength = 115
% 0.79/1.17 maxnrvars = 195
% 0.79/1.17 excuselevel = 0
% 0.79/1.17 increasemaxweight = 0
% 0.79/1.17
% 0.79/1.17 maxselected = 10000000
% 0.79/1.17 maxnrclauses = 10000000
% 0.79/1.17
% 0.79/1.17 showgenerated = 0
% 0.79/1.17 showkept = 0
% 0.79/1.17 showselected = 0
% 0.79/1.17 showdeleted = 0
% 0.79/1.17 showresimp = 1
% 0.79/1.17 showstatus = 2000
% 0.79/1.17
% 0.79/1.17 prologoutput = 0
% 0.79/1.17 nrgoals = 5000000
% 0.79/1.17 totalproof = 1
% 0.79/1.17
% 0.79/1.17 Symbols occurring in the translation:
% 0.79/1.17
% 0.79/1.17 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.79/1.17 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.79/1.17 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.79/1.17 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.79/1.17 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.79/1.17 s [38, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.79/1.17 r [39, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.79/1.17 p [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.79/1.17 q [43, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.79/1.17 skol1 [44, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.79/1.17 skol2 [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.79/1.17 skol3 [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Starting Search:
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Bliksems!, er is een bewijs:
% 0.79/1.17 % SZS status Theorem
% 0.79/1.17 % SZS output start Refutation
% 0.79/1.17
% 0.79/1.17 (1) {G0,W2,D2,L1,V0,M1} I { s( skol2 ) }.
% 0.79/1.17 (2) {G0,W3,D2,L1,V0,M1} I { r( skol2, skol3 ) }.
% 0.79/1.17 (3) {G0,W5,D2,L2,V1,M1} I { p( X ), ! s( X ) }.
% 0.79/1.17 (4) {G0,W7,D2,L2,V2,M1} I { q( X, Y ), ! r( X, Y ) }.
% 0.79/1.17 (5) {G0,W7,D2,L2,V2,M1} I { ! q( X, Y ), ! p( X ) }.
% 0.79/1.17 (7) {G1,W2,D2,L1,V0,M1} R(3,1) { p( skol2 ) }.
% 0.79/1.17 (8) {G1,W3,D2,L1,V0,M1} R(4,2) { q( skol2, skol3 ) }.
% 0.79/1.17 (9) {G2,W4,D2,L1,V1,M1} R(5,7) { ! q( skol2, X ) }.
% 0.79/1.17 (11) {G3,W0,D0,L0,V0,M0} R(9,8) { }.
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 % SZS output end Refutation
% 0.79/1.17 found a proof!
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Unprocessed initial clauses:
% 0.79/1.17
% 0.79/1.17 (13) {G0,W2,D2,L1,V0,M1} { s( skol1 ) }.
% 0.79/1.17 (14) {G0,W2,D2,L1,V0,M1} { s( skol2 ) }.
% 0.79/1.17 (15) {G0,W3,D2,L1,V0,M1} { r( skol2, skol3 ) }.
% 0.79/1.17 (16) {G0,W5,D2,L2,V1,M2} { ! s( X ), p( X ) }.
% 0.79/1.17 (17) {G0,W7,D2,L2,V2,M2} { ! r( X, Y ), q( X, Y ) }.
% 0.79/1.17 (18) {G0,W7,D2,L2,V2,M2} { ! p( X ), ! q( X, Y ) }.
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Total Proof:
% 0.79/1.17
% 0.79/1.17 subsumption: (1) {G0,W2,D2,L1,V0,M1} I { s( skol2 ) }.
% 0.79/1.17 parent0: (14) {G0,W2,D2,L1,V0,M1} { s( skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (2) {G0,W3,D2,L1,V0,M1} I { r( skol2, skol3 ) }.
% 0.79/1.17 parent0: (15) {G0,W3,D2,L1,V0,M1} { r( skol2, skol3 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (3) {G0,W5,D2,L2,V1,M1} I { p( X ), ! s( X ) }.
% 0.79/1.17 parent0: (16) {G0,W5,D2,L2,V1,M2} { ! s( X ), p( X ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (4) {G0,W7,D2,L2,V2,M1} I { q( X, Y ), ! r( X, Y ) }.
% 0.79/1.17 parent0: (17) {G0,W7,D2,L2,V2,M2} { ! r( X, Y ), q( X, Y ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (5) {G0,W7,D2,L2,V2,M1} I { ! q( X, Y ), ! p( X ) }.
% 0.79/1.17 parent0: (18) {G0,W7,D2,L2,V2,M2} { ! p( X ), ! q( X, Y ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (19) {G1,W2,D2,L1,V0,M1} { p( skol2 ) }.
% 0.79/1.17 parent0[1]: (3) {G0,W5,D2,L2,V1,M1} I { p( X ), ! s( X ) }.
% 0.79/1.17 parent1[0]: (1) {G0,W2,D2,L1,V0,M1} I { s( skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol2
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (7) {G1,W2,D2,L1,V0,M1} R(3,1) { p( skol2 ) }.
% 0.79/1.17 parent0: (19) {G1,W2,D2,L1,V0,M1} { p( skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (20) {G1,W3,D2,L1,V0,M1} { q( skol2, skol3 ) }.
% 0.79/1.17 parent0[1]: (4) {G0,W7,D2,L2,V2,M1} I { q( X, Y ), ! r( X, Y ) }.
% 0.79/1.17 parent1[0]: (2) {G0,W3,D2,L1,V0,M1} I { r( skol2, skol3 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol2
% 0.79/1.17 Y := skol3
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (8) {G1,W3,D2,L1,V0,M1} R(4,2) { q( skol2, skol3 ) }.
% 0.79/1.17 parent0: (20) {G1,W3,D2,L1,V0,M1} { q( skol2, skol3 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (21) {G1,W4,D2,L1,V1,M1} { ! q( skol2, X ) }.
% 0.79/1.17 parent0[1]: (5) {G0,W7,D2,L2,V2,M1} I { ! q( X, Y ), ! p( X ) }.
% 0.79/1.17 parent1[0]: (7) {G1,W2,D2,L1,V0,M1} R(3,1) { p( skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol2
% 0.79/1.17 Y := X
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (9) {G2,W4,D2,L1,V1,M1} R(5,7) { ! q( skol2, X ) }.
% 0.79/1.17 parent0: (21) {G1,W4,D2,L1,V1,M1} { ! q( skol2, X ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (22) {G2,W0,D0,L0,V0,M0} { }.
% 0.79/1.17 parent0[0]: (9) {G2,W4,D2,L1,V1,M1} R(5,7) { ! q( skol2, X ) }.
% 0.79/1.17 parent1[0]: (8) {G1,W3,D2,L1,V0,M1} R(4,2) { q( skol2, skol3 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol3
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (11) {G3,W0,D0,L0,V0,M0} R(9,8) { }.
% 0.79/1.17 parent0: (22) {G2,W0,D0,L0,V0,M0} { }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 Proof check complete!
% 0.79/1.17
% 0.79/1.17 Memory use:
% 0.79/1.17
% 0.79/1.17 space for terms: 130
% 0.79/1.17 space for clauses: 611
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 clauses generated: 12
% 0.79/1.17 clauses kept: 12
% 0.79/1.17 clauses selected: 10
% 0.79/1.17 clauses deleted: 0
% 0.79/1.17 clauses inuse deleted: 0
% 0.79/1.17
% 0.79/1.17 subsentry: 0
% 0.79/1.17 literals s-matched: 0
% 0.79/1.17 literals matched: 0
% 0.79/1.17 full subsumption: 0
% 0.79/1.17
% 0.79/1.17 checksum: -52566
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Bliksem ended
%------------------------------------------------------------------------------