TSTP Solution File: PUZ132+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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 : Mon Jul 18 17:58:33 EDT 2022
% Result : Theorem 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n024.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 : Sun May 29 02:19:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { capital( skol1 ) }.
% 0.69/1.10 { city( skol2 ) }.
% 0.69/1.10 { ! capital( X ), city( X ) }.
% 0.69/1.10 { country( skol3 ) }.
% 0.69/1.10 { capital( washington ) }.
% 0.69/1.10 { country( usa ) }.
% 0.69/1.10 { ! country( X ), capital( capital_city( X ) ) }.
% 0.69/1.10 { ! city( X ), has_crime( X ) }.
% 0.69/1.10 { capital_city( usa ) = washington }.
% 0.69/1.10 { ! country( X ), beautiful( capital_city( X ) ) }.
% 0.69/1.10 { ! beautiful( washington ), ! has_crime( washington ) }.
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.062500, percentage horn = 1.000000
% 0.69/1.10 This is a problem with some equality
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 1
% 0.69/1.10 useeqrefl = 1
% 0.69/1.10 useeqfact = 1
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 5
% 0.69/1.10 usesimpres = 3
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = eqrewr
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.10
% 0.69/1.10 termordering = kbo
% 0.69/1.10
% 0.69/1.10 litapriori = 0
% 0.69/1.10 termapriori = 1
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negord
% 0.69/1.10
% 0.69/1.10 maxweight = 15
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 1
% 0.69/1.10 increasemaxweight = 1
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 0
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 capital [36, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.10 city [37, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.10 country [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.10 washington [39, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.69/1.10 usa [40, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.69/1.10 capital_city [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.10 has_crime [43, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.10 beautiful [44, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.69/1.10 skol1 [45, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.69/1.10 skol2 [46, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.69/1.10 skol3 [47, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Theorem
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 (2) {G0,W4,D2,L2,V1,M2} I { ! capital( X ), city( X ) }.
% 0.69/1.10 (4) {G0,W2,D2,L1,V0,M1} I { capital( washington ) }.
% 0.69/1.10 (5) {G0,W2,D2,L1,V0,M1} I { country( usa ) }.
% 0.69/1.10 (7) {G0,W4,D2,L2,V1,M2} I { ! city( X ), has_crime( X ) }.
% 0.69/1.10 (8) {G0,W4,D3,L1,V0,M1} I { capital_city( usa ) ==> washington }.
% 0.69/1.10 (9) {G0,W5,D3,L2,V1,M2} I { ! country( X ), beautiful( capital_city( X ) )
% 0.69/1.10 }.
% 0.69/1.10 (10) {G0,W4,D2,L2,V0,M2} I { ! beautiful( washington ), ! has_crime(
% 0.69/1.10 washington ) }.
% 0.69/1.10 (12) {G1,W2,D2,L1,V0,M1} R(2,4) { city( washington ) }.
% 0.69/1.10 (13) {G2,W2,D2,L1,V0,M1} R(7,12) { has_crime( washington ) }.
% 0.69/1.10 (22) {G3,W2,D2,L1,V0,M1} S(10);r(13) { ! beautiful( washington ) }.
% 0.69/1.10 (24) {G4,W0,D0,L0,V0,M0} R(9,5);d(8);r(22) { }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Unprocessed initial clauses:
% 0.69/1.10
% 0.69/1.10 (26) {G0,W2,D2,L1,V0,M1} { capital( skol1 ) }.
% 0.69/1.10 (27) {G0,W2,D2,L1,V0,M1} { city( skol2 ) }.
% 0.69/1.10 (28) {G0,W4,D2,L2,V1,M2} { ! capital( X ), city( X ) }.
% 0.69/1.10 (29) {G0,W2,D2,L1,V0,M1} { country( skol3 ) }.
% 0.69/1.10 (30) {G0,W2,D2,L1,V0,M1} { capital( washington ) }.
% 0.69/1.10 (31) {G0,W2,D2,L1,V0,M1} { country( usa ) }.
% 0.69/1.10 (32) {G0,W5,D3,L2,V1,M2} { ! country( X ), capital( capital_city( X ) )
% 0.69/1.10 }.
% 0.69/1.10 (33) {G0,W4,D2,L2,V1,M2} { ! city( X ), has_crime( X ) }.
% 0.69/1.10 (34) {G0,W4,D3,L1,V0,M1} { capital_city( usa ) = washington }.
% 0.69/1.10 (35) {G0,W5,D3,L2,V1,M2} { ! country( X ), beautiful( capital_city( X ) )
% 0.69/1.10 }.
% 0.69/1.10 (36) {G0,W4,D2,L2,V0,M2} { ! beautiful( washington ), ! has_crime(
% 0.69/1.10 washington ) }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Total Proof:
% 0.69/1.10
% 0.69/1.10 subsumption: (2) {G0,W4,D2,L2,V1,M2} I { ! capital( X ), city( X ) }.
% 0.69/1.10 parent0: (28) {G0,W4,D2,L2,V1,M2} { ! capital( X ), city( X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (4) {G0,W2,D2,L1,V0,M1} I { capital( washington ) }.
% 0.69/1.10 parent0: (30) {G0,W2,D2,L1,V0,M1} { capital( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { country( usa ) }.
% 0.69/1.10 parent0: (31) {G0,W2,D2,L1,V0,M1} { country( usa ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (7) {G0,W4,D2,L2,V1,M2} I { ! city( X ), has_crime( X ) }.
% 0.69/1.10 parent0: (33) {G0,W4,D2,L2,V1,M2} { ! city( X ), has_crime( X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (8) {G0,W4,D3,L1,V0,M1} I { capital_city( usa ) ==> washington
% 0.69/1.10 }.
% 0.69/1.10 parent0: (34) {G0,W4,D3,L1,V0,M1} { capital_city( usa ) = washington }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (9) {G0,W5,D3,L2,V1,M2} I { ! country( X ), beautiful(
% 0.69/1.10 capital_city( X ) ) }.
% 0.69/1.10 parent0: (35) {G0,W5,D3,L2,V1,M2} { ! country( X ), beautiful(
% 0.69/1.10 capital_city( X ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (10) {G0,W4,D2,L2,V0,M2} I { ! beautiful( washington ), !
% 0.69/1.10 has_crime( washington ) }.
% 0.69/1.10 parent0: (36) {G0,W4,D2,L2,V0,M2} { ! beautiful( washington ), ! has_crime
% 0.69/1.10 ( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (40) {G1,W2,D2,L1,V0,M1} { city( washington ) }.
% 0.69/1.10 parent0[0]: (2) {G0,W4,D2,L2,V1,M2} I { ! capital( X ), city( X ) }.
% 0.69/1.10 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { capital( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := washington
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (12) {G1,W2,D2,L1,V0,M1} R(2,4) { city( washington ) }.
% 0.69/1.10 parent0: (40) {G1,W2,D2,L1,V0,M1} { city( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (41) {G1,W2,D2,L1,V0,M1} { has_crime( washington ) }.
% 0.69/1.10 parent0[0]: (7) {G0,W4,D2,L2,V1,M2} I { ! city( X ), has_crime( X ) }.
% 0.69/1.10 parent1[0]: (12) {G1,W2,D2,L1,V0,M1} R(2,4) { city( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := washington
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (13) {G2,W2,D2,L1,V0,M1} R(7,12) { has_crime( washington ) }.
% 0.69/1.10 parent0: (41) {G1,W2,D2,L1,V0,M1} { has_crime( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (42) {G1,W2,D2,L1,V0,M1} { ! beautiful( washington ) }.
% 0.69/1.10 parent0[1]: (10) {G0,W4,D2,L2,V0,M2} I { ! beautiful( washington ), !
% 0.69/1.10 has_crime( washington ) }.
% 0.69/1.10 parent1[0]: (13) {G2,W2,D2,L1,V0,M1} R(7,12) { has_crime( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (22) {G3,W2,D2,L1,V0,M1} S(10);r(13) { ! beautiful( washington
% 0.69/1.10 ) }.
% 0.69/1.10 parent0: (42) {G1,W2,D2,L1,V0,M1} { ! beautiful( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (44) {G1,W3,D3,L1,V0,M1} { beautiful( capital_city( usa ) )
% 0.69/1.10 }.
% 0.69/1.10 parent0[0]: (9) {G0,W5,D3,L2,V1,M2} I { ! country( X ), beautiful(
% 0.69/1.10 capital_city( X ) ) }.
% 0.69/1.10 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { country( usa ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := usa
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (45) {G1,W2,D2,L1,V0,M1} { beautiful( washington ) }.
% 0.69/1.10 parent0[0]: (8) {G0,W4,D3,L1,V0,M1} I { capital_city( usa ) ==> washington
% 0.69/1.10 }.
% 0.69/1.10 parent1[0; 1]: (44) {G1,W3,D3,L1,V0,M1} { beautiful( capital_city( usa ) )
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (46) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 parent0[0]: (22) {G3,W2,D2,L1,V0,M1} S(10);r(13) { ! beautiful( washington
% 0.69/1.10 ) }.
% 0.69/1.10 parent1[0]: (45) {G1,W2,D2,L1,V0,M1} { beautiful( washington ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (24) {G4,W0,D0,L0,V0,M0} R(9,5);d(8);r(22) { }.
% 0.69/1.10 parent0: (46) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 Proof check complete!
% 0.69/1.10
% 0.69/1.10 Memory use:
% 0.69/1.10
% 0.69/1.10 space for terms: 210
% 0.69/1.10 space for clauses: 1215
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 clauses generated: 32
% 0.69/1.10 clauses kept: 25
% 0.69/1.10 clauses selected: 20
% 0.69/1.10 clauses deleted: 1
% 0.69/1.10 clauses inuse deleted: 0
% 0.69/1.10
% 0.69/1.10 subsentry: 26
% 0.69/1.10 literals s-matched: 15
% 0.69/1.10 literals matched: 15
% 0.69/1.10 full subsumption: 0
% 0.69/1.10
% 0.69/1.10 checksum: 336785630
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksem ended
%------------------------------------------------------------------------------