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