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