TSTP Solution File: KRS091+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KRS091+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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 : Sun Jul 17 02:42:12 EDT 2022
% Result : Unsatisfiable 0.42s 1.06s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS091+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Tue Jun 7 14:32:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06
% 0.42/1.06 { cowlThing( X ) }.
% 0.42/1.06 { ! cowlNothing( X ) }.
% 0.42/1.06 { ! xsd_string( X ), ! xsd_integer( X ) }.
% 0.42/1.06 { xsd_integer( X ), xsd_string( X ) }.
% 0.42/1.06 { ! cUnsatisfiable( X ), cd( X ) }.
% 0.42/1.06 { ! cUnsatisfiable( X ), cc( X ) }.
% 0.42/1.06 { ! cd( X ), ! cc( X ), cUnsatisfiable( X ) }.
% 0.42/1.06 { ! cc( X ), ! cd( X ) }.
% 0.42/1.06 { ! cc1( X ), ! cd1( X ) }.
% 0.42/1.06 { ! cc1( X ), cd1( X ) }.
% 0.42/1.06 { ! ce3( X ), cc( X ) }.
% 0.42/1.06 { ! cf( X ), cd( X ) }.
% 0.42/1.06 { cUnsatisfiable( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06
% 0.42/1.06 percentage equality = 0.000000, percentage horn = 0.923077
% 0.42/1.06 This is a near-Horn, non-equality problem
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 0
% 0.42/1.06 useeqrefl = 0
% 0.42/1.06 useeqfact = 0
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 0
% 0.42/1.06 usesimpres = 4
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = standard
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = liftord
% 0.42/1.06
% 0.42/1.06 termordering = none
% 0.42/1.06
% 0.42/1.06 litapriori = 1
% 0.42/1.06 termapriori = 0
% 0.42/1.06 litaposteriori = 0
% 0.42/1.06 termaposteriori = 0
% 0.42/1.06 demodaposteriori = 0
% 0.42/1.06 ordereqreflfact = 0
% 0.42/1.06
% 0.42/1.06 litselect = negative
% 0.42/1.06
% 0.42/1.06 maxweight = 30000
% 0.42/1.06 maxdepth = 30000
% 0.42/1.06 maxlength = 115
% 0.42/1.06 maxnrvars = 195
% 0.42/1.06 excuselevel = 0
% 0.42/1.06 increasemaxweight = 0
% 0.42/1.06
% 0.42/1.06 maxselected = 10000000
% 0.42/1.06 maxnrclauses = 10000000
% 0.42/1.06
% 0.42/1.06 showgenerated = 0
% 0.42/1.06 showkept = 0
% 0.42/1.06 showselected = 0
% 0.42/1.06 showdeleted = 0
% 0.42/1.06 showresimp = 1
% 0.42/1.06 showstatus = 2000
% 0.42/1.06
% 0.42/1.06 prologoutput = 0
% 0.42/1.06 nrgoals = 5000000
% 0.42/1.06 totalproof = 1
% 0.42/1.06
% 0.42/1.06 Symbols occurring in the translation:
% 0.42/1.06
% 0.42/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.06 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.42/1.06 ! [4, 1] (w:1, o:8, a:1, s:1, b:0),
% 0.42/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 cowlThing [36, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.42/1.06 cowlNothing [37, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.42/1.06 xsd_string [38, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.42/1.06 xsd_integer [39, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.42/1.06 cUnsatisfiable [40, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.42/1.06 cd [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.06 cc [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.06 cc1 [43, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.06 cd1 [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.06 ce3 [45, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.06 cf [46, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.42/1.06 i2003_11_14_17_20_00819 [47, 0] (w:1, o:7, a:1, s:1, b:0).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Starting Search:
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksems!, er is een bewijs:
% 0.42/1.06 % SZS status Unsatisfiable
% 0.42/1.06 % SZS output start Refutation
% 0.42/1.06
% 0.42/1.06 (4) {G0,W5,D2,L2,V1,M1} I { cd( X ), ! cUnsatisfiable( X ) }.
% 0.42/1.06 (5) {G0,W5,D2,L2,V1,M1} I { cc( X ), ! cUnsatisfiable( X ) }.
% 0.42/1.06 (7) {G0,W6,D2,L2,V1,M1} I { ! cc( X ), ! cd( X ) }.
% 0.42/1.06 (12) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 (13) {G1,W2,D2,L1,V0,M1} R(5,12) { cc( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 (14) {G1,W2,D2,L1,V0,M1} R(4,12) { cd( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 (15) {G2,W0,D0,L0,V0,M0} R(7,14);r(13) { }.
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 % SZS output end Refutation
% 0.42/1.06 found a proof!
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Unprocessed initial clauses:
% 0.42/1.06
% 0.42/1.06 (17) {G0,W2,D2,L1,V1,M1} { cowlThing( X ) }.
% 0.42/1.06 (18) {G0,W3,D2,L1,V1,M1} { ! cowlNothing( X ) }.
% 0.42/1.06 (19) {G0,W6,D2,L2,V1,M2} { ! xsd_string( X ), ! xsd_integer( X ) }.
% 0.42/1.06 (20) {G0,W4,D2,L2,V1,M2} { xsd_integer( X ), xsd_string( X ) }.
% 0.42/1.06 (21) {G0,W5,D2,L2,V1,M2} { ! cUnsatisfiable( X ), cd( X ) }.
% 0.42/1.06 (22) {G0,W5,D2,L2,V1,M2} { ! cUnsatisfiable( X ), cc( X ) }.
% 0.42/1.06 (23) {G0,W8,D2,L3,V1,M3} { ! cd( X ), ! cc( X ), cUnsatisfiable( X ) }.
% 0.42/1.06 (24) {G0,W6,D2,L2,V1,M2} { ! cc( X ), ! cd( X ) }.
% 0.42/1.06 (25) {G0,W6,D2,L2,V1,M2} { ! cc1( X ), ! cd1( X ) }.
% 0.42/1.06 (26) {G0,W5,D2,L2,V1,M2} { ! cc1( X ), cd1( X ) }.
% 0.42/1.06 (27) {G0,W5,D2,L2,V1,M2} { ! ce3( X ), cc( X ) }.
% 0.42/1.06 (28) {G0,W5,D2,L2,V1,M2} { ! cf( X ), cd( X ) }.
% 0.42/1.06 (29) {G0,W2,D2,L1,V0,M1} { cUnsatisfiable( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Total Proof:
% 0.42/1.06
% 0.42/1.06 subsumption: (4) {G0,W5,D2,L2,V1,M1} I { cd( X ), ! cUnsatisfiable( X ) }.
% 0.42/1.06 parent0: (21) {G0,W5,D2,L2,V1,M2} { ! cUnsatisfiable( X ), cd( X ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 1
% 0.42/1.06 1 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (5) {G0,W5,D2,L2,V1,M1} I { cc( X ), ! cUnsatisfiable( X ) }.
% 0.42/1.06 parent0: (22) {G0,W5,D2,L2,V1,M2} { ! cUnsatisfiable( X ), cc( X ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 1
% 0.42/1.06 1 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (7) {G0,W6,D2,L2,V1,M1} I { ! cc( X ), ! cd( X ) }.
% 0.42/1.06 parent0: (24) {G0,W6,D2,L2,V1,M2} { ! cc( X ), ! cd( X ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 1 ==> 1
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (12) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable(
% 0.42/1.06 i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 parent0: (29) {G0,W2,D2,L1,V0,M1} { cUnsatisfiable(
% 0.42/1.06 i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (30) {G1,W2,D2,L1,V0,M1} { cc( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 parent0[1]: (5) {G0,W5,D2,L2,V1,M1} I { cc( X ), ! cUnsatisfiable( X ) }.
% 0.42/1.06 parent1[0]: (12) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable(
% 0.42/1.06 i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := i2003_11_14_17_20_00819
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (13) {G1,W2,D2,L1,V0,M1} R(5,12) { cc( i2003_11_14_17_20_00819
% 0.42/1.06 ) }.
% 0.42/1.06 parent0: (30) {G1,W2,D2,L1,V0,M1} { cc( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (31) {G1,W2,D2,L1,V0,M1} { cd( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 parent0[1]: (4) {G0,W5,D2,L2,V1,M1} I { cd( X ), ! cUnsatisfiable( X ) }.
% 0.42/1.06 parent1[0]: (12) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable(
% 0.42/1.06 i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := i2003_11_14_17_20_00819
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (14) {G1,W2,D2,L1,V0,M1} R(4,12) { cd( i2003_11_14_17_20_00819
% 0.42/1.06 ) }.
% 0.42/1.06 parent0: (31) {G1,W2,D2,L1,V0,M1} { cd( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (32) {G1,W3,D2,L1,V0,M1} { ! cc( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 parent0[1]: (7) {G0,W6,D2,L2,V1,M1} I { ! cc( X ), ! cd( X ) }.
% 0.42/1.06 parent1[0]: (14) {G1,W2,D2,L1,V0,M1} R(4,12) { cd( i2003_11_14_17_20_00819
% 0.42/1.06 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := i2003_11_14_17_20_00819
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (33) {G2,W0,D0,L0,V0,M0} { }.
% 0.42/1.06 parent0[0]: (32) {G1,W3,D2,L1,V0,M1} { ! cc( i2003_11_14_17_20_00819 ) }.
% 0.42/1.06 parent1[0]: (13) {G1,W2,D2,L1,V0,M1} R(5,12) { cc( i2003_11_14_17_20_00819
% 0.42/1.06 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (15) {G2,W0,D0,L0,V0,M0} R(7,14);r(13) { }.
% 0.42/1.06 parent0: (33) {G2,W0,D0,L0,V0,M0} { }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 Proof check complete!
% 0.42/1.06
% 0.42/1.06 Memory use:
% 0.42/1.06
% 0.42/1.06 space for terms: 229
% 0.42/1.06 space for clauses: 837
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 clauses generated: 16
% 0.42/1.06 clauses kept: 16
% 0.42/1.06 clauses selected: 13
% 0.42/1.06 clauses deleted: 1
% 0.42/1.06 clauses inuse deleted: 0
% 0.42/1.06
% 0.42/1.06 subsentry: 1
% 0.42/1.06 literals s-matched: 1
% 0.42/1.06 literals matched: 1
% 0.42/1.06 full subsumption: 0
% 0.42/1.06
% 0.42/1.06 checksum: 8783967
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksem ended
%------------------------------------------------------------------------------