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