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