TSTP Solution File: SWW469+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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 : Wed Jul 20 23:22:10 EDT 2022
% Result : Theorem 0.47s 1.13s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Sat Jun 4 12:32:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.13 *** allocated 10000 integers for termspace/termends
% 0.47/1.13 *** allocated 10000 integers for clauses
% 0.47/1.13 *** allocated 10000 integers for justifications
% 0.47/1.13 Bliksem 1.12
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Automatic Strategy Selection
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Clauses:
% 0.47/1.13
% 0.47/1.13 { is_state( undefined_state( state ) ) }.
% 0.47/1.13 { ! hoare_165779456gleton, is_state( skol1 ) }.
% 0.47/1.13 { ! hoare_165779456gleton, alpha1( skol1 ) }.
% 0.47/1.13 { ! is_state( X ), ! alpha1( X ), hoare_165779456gleton }.
% 0.47/1.13 { ! alpha1( X ), is_state( skol2( Y ) ) }.
% 0.47/1.13 { ! alpha1( X ), ! X = skol2( X ) }.
% 0.47/1.13 { ! is_state( Y ), X = Y, alpha1( X ) }.
% 0.47/1.13 { ! induct_false }.
% 0.47/1.13 { induct_true }.
% 0.47/1.13 { induct_true }.
% 0.47/1.13 { hoare_165779456gleton }.
% 0.47/1.13 { is_state( skol3 ) }.
% 0.47/1.13 { ! is_state( X ), X = skol3 }.
% 0.47/1.13
% 0.47/1.13 percentage equality = 0.142857, percentage horn = 0.916667
% 0.47/1.13 This is a problem with some equality
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Options Used:
% 0.47/1.13
% 0.47/1.13 useres = 1
% 0.47/1.13 useparamod = 1
% 0.47/1.13 useeqrefl = 1
% 0.47/1.13 useeqfact = 1
% 0.47/1.13 usefactor = 1
% 0.47/1.13 usesimpsplitting = 0
% 0.47/1.13 usesimpdemod = 5
% 0.47/1.13 usesimpres = 3
% 0.47/1.13
% 0.47/1.13 resimpinuse = 1000
% 0.47/1.13 resimpclauses = 20000
% 0.47/1.13 substype = eqrewr
% 0.47/1.13 backwardsubs = 1
% 0.47/1.13 selectoldest = 5
% 0.47/1.13
% 0.47/1.13 litorderings [0] = split
% 0.47/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.47/1.13
% 0.47/1.13 termordering = kbo
% 0.47/1.13
% 0.47/1.13 litapriori = 0
% 0.47/1.13 termapriori = 1
% 0.47/1.13 litaposteriori = 0
% 0.47/1.13 termaposteriori = 0
% 0.47/1.13 demodaposteriori = 0
% 0.47/1.13 ordereqreflfact = 0
% 0.47/1.13
% 0.47/1.13 litselect = negord
% 0.47/1.13
% 0.47/1.13 maxweight = 15
% 0.47/1.13 maxdepth = 30000
% 0.47/1.13 maxlength = 115
% 0.47/1.13 maxnrvars = 195
% 0.47/1.13 excuselevel = 1
% 0.47/1.13 increasemaxweight = 1
% 0.47/1.13
% 0.47/1.13 maxselected = 10000000
% 0.47/1.13 maxnrclauses = 10000000
% 0.47/1.13
% 0.47/1.13 showgenerated = 0
% 0.47/1.13 showkept = 0
% 0.47/1.13 showselected = 0
% 0.47/1.13 showdeleted = 0
% 0.47/1.13 showresimp = 1
% 0.47/1.13 showstatus = 2000
% 0.47/1.13
% 0.47/1.13 prologoutput = 0
% 0.47/1.13 nrgoals = 5000000
% 0.47/1.13 totalproof = 1
% 0.47/1.13
% 0.47/1.13 Symbols occurring in the translation:
% 0.47/1.13
% 0.47/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.13 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.47/1.13 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.47/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 state [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.47/1.13 undefined_state [36, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.47/1.13 is_state [37, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.47/1.13 hoare_165779456gleton [38, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.47/1.13 induct_false [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.47/1.13 induct_true [42, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.47/1.13 alpha1 [43, 1] (w:1, o:21, a:1, s:1, b:1),
% 0.47/1.13 skol1 [44, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.47/1.13 skol2 [45, 1] (w:1, o:22, a:1, s:1, b:1),
% 0.47/1.13 skol3 [46, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Starting Search:
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksems!, er is een bewijs:
% 0.47/1.13 % SZS status Theorem
% 0.47/1.13 % SZS output start Refutation
% 0.47/1.13
% 0.47/1.13 (1) {G0,W3,D2,L2,V0,M2} I { ! hoare_165779456gleton, is_state( skol1 ) }.
% 0.47/1.13 (2) {G0,W3,D2,L2,V0,M2} I { ! hoare_165779456gleton, alpha1( skol1 ) }.
% 0.47/1.13 (4) {G0,W5,D3,L2,V2,M2} I { ! alpha1( X ), is_state( skol2( Y ) ) }.
% 0.47/1.13 (5) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), ! skol2( X ) ==> X }.
% 0.47/1.13 (9) {G0,W1,D1,L1,V0,M1} I { hoare_165779456gleton }.
% 0.47/1.13 (11) {G0,W5,D2,L2,V1,M2} I { ! is_state( X ), X = skol3 }.
% 0.47/1.13 (12) {G1,W2,D2,L1,V0,M1} S(2);r(9) { alpha1( skol1 ) }.
% 0.47/1.13 (13) {G1,W2,D2,L1,V0,M1} S(1);r(9) { is_state( skol1 ) }.
% 0.47/1.13 (14) {G2,W3,D2,L1,V0,M1} R(11,13) { skol3 ==> skol1 }.
% 0.47/1.13 (16) {G3,W5,D2,L2,V1,M2} P(11,11);d(14);d(14);r(13) { ! is_state( X ), X =
% 0.47/1.13 skol1 }.
% 0.47/1.13 (21) {G2,W3,D3,L1,V1,M1} R(4,12) { is_state( skol2( X ) ) }.
% 0.47/1.13 (23) {G4,W5,D2,L2,V1,M2} P(16,5);r(21) { ! alpha1( X ), ! skol1 = X }.
% 0.47/1.13 (24) {G5,W0,D0,L0,V0,M0} Q(23);r(12) { }.
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 % SZS output end Refutation
% 0.47/1.13 found a proof!
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Unprocessed initial clauses:
% 0.47/1.13
% 0.47/1.13 (26) {G0,W3,D3,L1,V0,M1} { is_state( undefined_state( state ) ) }.
% 0.47/1.13 (27) {G0,W3,D2,L2,V0,M2} { ! hoare_165779456gleton, is_state( skol1 ) }.
% 0.47/1.13 (28) {G0,W3,D2,L2,V0,M2} { ! hoare_165779456gleton, alpha1( skol1 ) }.
% 0.47/1.13 (29) {G0,W5,D2,L3,V1,M3} { ! is_state( X ), ! alpha1( X ),
% 0.47/1.13 hoare_165779456gleton }.
% 0.47/1.13 (30) {G0,W5,D3,L2,V2,M2} { ! alpha1( X ), is_state( skol2( Y ) ) }.
% 0.47/1.13 (31) {G0,W6,D3,L2,V1,M2} { ! alpha1( X ), ! X = skol2( X ) }.
% 0.47/1.13 (32) {G0,W7,D2,L3,V2,M3} { ! is_state( Y ), X = Y, alpha1( X ) }.
% 0.47/1.13 (33) {G0,W1,D1,L1,V0,M1} { ! induct_false }.
% 0.47/1.13 (34) {G0,W1,D1,L1,V0,M1} { induct_true }.
% 0.47/1.13 (35) {G0,W1,D1,L1,V0,M1} { induct_true }.
% 0.47/1.13 (36) {G0,W1,D1,L1,V0,M1} { hoare_165779456gleton }.
% 0.47/1.13 (37) {G0,W2,D2,L1,V0,M1} { is_state( skol3 ) }.
% 0.47/1.13 (38) {G0,W5,D2,L2,V1,M2} { ! is_state( X ), X = skol3 }.
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Total Proof:
% 0.47/1.13
% 0.47/1.13 subsumption: (1) {G0,W3,D2,L2,V0,M2} I { ! hoare_165779456gleton, is_state
% 0.47/1.13 ( skol1 ) }.
% 0.47/1.13 parent0: (27) {G0,W3,D2,L2,V0,M2} { ! hoare_165779456gleton, is_state(
% 0.47/1.13 skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 1 ==> 1
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (2) {G0,W3,D2,L2,V0,M2} I { ! hoare_165779456gleton, alpha1(
% 0.47/1.13 skol1 ) }.
% 0.47/1.13 parent0: (28) {G0,W3,D2,L2,V0,M2} { ! hoare_165779456gleton, alpha1( skol1
% 0.47/1.13 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 1 ==> 1
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (4) {G0,W5,D3,L2,V2,M2} I { ! alpha1( X ), is_state( skol2( Y
% 0.47/1.13 ) ) }.
% 0.47/1.13 parent0: (30) {G0,W5,D3,L2,V2,M2} { ! alpha1( X ), is_state( skol2( Y ) )
% 0.47/1.13 }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 1 ==> 1
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (39) {G0,W6,D3,L2,V1,M2} { ! skol2( X ) = X, ! alpha1( X ) }.
% 0.47/1.13 parent0[1]: (31) {G0,W6,D3,L2,V1,M2} { ! alpha1( X ), ! X = skol2( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (5) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), ! skol2( X ) ==> X
% 0.47/1.13 }.
% 0.47/1.13 parent0: (39) {G0,W6,D3,L2,V1,M2} { ! skol2( X ) = X, ! alpha1( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 1
% 0.47/1.13 1 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (9) {G0,W1,D1,L1,V0,M1} I { hoare_165779456gleton }.
% 0.47/1.13 parent0: (36) {G0,W1,D1,L1,V0,M1} { hoare_165779456gleton }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (11) {G0,W5,D2,L2,V1,M2} I { ! is_state( X ), X = skol3 }.
% 0.47/1.13 parent0: (38) {G0,W5,D2,L2,V1,M2} { ! is_state( X ), X = skol3 }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 1 ==> 1
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (45) {G1,W2,D2,L1,V0,M1} { alpha1( skol1 ) }.
% 0.47/1.13 parent0[0]: (2) {G0,W3,D2,L2,V0,M2} I { ! hoare_165779456gleton, alpha1(
% 0.47/1.13 skol1 ) }.
% 0.47/1.13 parent1[0]: (9) {G0,W1,D1,L1,V0,M1} I { hoare_165779456gleton }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (12) {G1,W2,D2,L1,V0,M1} S(2);r(9) { alpha1( skol1 ) }.
% 0.47/1.13 parent0: (45) {G1,W2,D2,L1,V0,M1} { alpha1( skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (46) {G1,W2,D2,L1,V0,M1} { is_state( skol1 ) }.
% 0.47/1.13 parent0[0]: (1) {G0,W3,D2,L2,V0,M2} I { ! hoare_165779456gleton, is_state(
% 0.47/1.13 skol1 ) }.
% 0.47/1.13 parent1[0]: (9) {G0,W1,D1,L1,V0,M1} I { hoare_165779456gleton }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (13) {G1,W2,D2,L1,V0,M1} S(1);r(9) { is_state( skol1 ) }.
% 0.47/1.13 parent0: (46) {G1,W2,D2,L1,V0,M1} { is_state( skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (47) {G0,W5,D2,L2,V1,M2} { skol3 = X, ! is_state( X ) }.
% 0.47/1.13 parent0[1]: (11) {G0,W5,D2,L2,V1,M2} I { ! is_state( X ), X = skol3 }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (48) {G1,W3,D2,L1,V0,M1} { skol3 = skol1 }.
% 0.47/1.13 parent0[1]: (47) {G0,W5,D2,L2,V1,M2} { skol3 = X, ! is_state( X ) }.
% 0.47/1.13 parent1[0]: (13) {G1,W2,D2,L1,V0,M1} S(1);r(9) { is_state( skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := skol1
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (14) {G2,W3,D2,L1,V0,M1} R(11,13) { skol3 ==> skol1 }.
% 0.47/1.13 parent0: (48) {G1,W3,D2,L1,V0,M1} { skol3 = skol1 }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (50) {G0,W5,D2,L2,V1,M2} { skol3 = X, ! is_state( X ) }.
% 0.47/1.13 parent0[1]: (11) {G0,W5,D2,L2,V1,M2} I { ! is_state( X ), X = skol3 }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 paramod: (60) {G1,W7,D2,L3,V1,M3} { skol3 = X, ! is_state( skol3 ), !
% 0.47/1.13 is_state( X ) }.
% 0.47/1.13 parent0[1]: (11) {G0,W5,D2,L2,V1,M2} I { ! is_state( X ), X = skol3 }.
% 0.47/1.13 parent1[0; 1]: (50) {G0,W5,D2,L2,V1,M2} { skol3 = X, ! is_state( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := skol3
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 paramod: (106) {G2,W7,D2,L3,V1,M3} { ! is_state( skol1 ), skol3 = X, !
% 0.47/1.13 is_state( X ) }.
% 0.47/1.13 parent0[0]: (14) {G2,W3,D2,L1,V0,M1} R(11,13) { skol3 ==> skol1 }.
% 0.47/1.13 parent1[1; 2]: (60) {G1,W7,D2,L3,V1,M3} { skol3 = X, ! is_state( skol3 ),
% 0.47/1.13 ! is_state( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 paramod: (113) {G3,W7,D2,L3,V1,M3} { skol1 = X, ! is_state( skol1 ), !
% 0.47/1.13 is_state( X ) }.
% 0.47/1.13 parent0[0]: (14) {G2,W3,D2,L1,V0,M1} R(11,13) { skol3 ==> skol1 }.
% 0.47/1.13 parent1[1; 1]: (106) {G2,W7,D2,L3,V1,M3} { ! is_state( skol1 ), skol3 = X
% 0.47/1.13 , ! is_state( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (116) {G2,W5,D2,L2,V1,M2} { skol1 = X, ! is_state( X ) }.
% 0.47/1.13 parent0[1]: (113) {G3,W7,D2,L3,V1,M3} { skol1 = X, ! is_state( skol1 ), !
% 0.47/1.13 is_state( X ) }.
% 0.47/1.13 parent1[0]: (13) {G1,W2,D2,L1,V0,M1} S(1);r(9) { is_state( skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (117) {G2,W5,D2,L2,V1,M2} { X = skol1, ! is_state( X ) }.
% 0.47/1.13 parent0[0]: (116) {G2,W5,D2,L2,V1,M2} { skol1 = X, ! is_state( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (16) {G3,W5,D2,L2,V1,M2} P(11,11);d(14);d(14);r(13) { !
% 0.47/1.13 is_state( X ), X = skol1 }.
% 0.47/1.13 parent0: (117) {G2,W5,D2,L2,V1,M2} { X = skol1, ! is_state( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 1
% 0.47/1.13 1 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (118) {G1,W3,D3,L1,V1,M1} { is_state( skol2( X ) ) }.
% 0.47/1.13 parent0[0]: (4) {G0,W5,D3,L2,V2,M2} I { ! alpha1( X ), is_state( skol2( Y )
% 0.47/1.13 ) }.
% 0.47/1.13 parent1[0]: (12) {G1,W2,D2,L1,V0,M1} S(2);r(9) { alpha1( skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := skol1
% 0.47/1.13 Y := X
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (21) {G2,W3,D3,L1,V1,M1} R(4,12) { is_state( skol2( X ) ) }.
% 0.47/1.13 parent0: (118) {G1,W3,D3,L1,V1,M1} { is_state( skol2( X ) ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (120) {G0,W6,D3,L2,V1,M2} { ! X ==> skol2( X ), ! alpha1( X ) }.
% 0.47/1.13 parent0[1]: (5) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), ! skol2( X ) ==> X
% 0.47/1.13 }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 paramod: (121) {G1,W8,D3,L3,V1,M3} { ! X ==> skol1, ! is_state( skol2( X )
% 0.47/1.13 ), ! alpha1( X ) }.
% 0.47/1.13 parent0[1]: (16) {G3,W5,D2,L2,V1,M2} P(11,11);d(14);d(14);r(13) { !
% 0.47/1.13 is_state( X ), X = skol1 }.
% 0.47/1.13 parent1[0; 3]: (120) {G0,W6,D3,L2,V1,M2} { ! X ==> skol2( X ), ! alpha1( X
% 0.47/1.13 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := skol2( X )
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (132) {G2,W5,D2,L2,V1,M2} { ! X ==> skol1, ! alpha1( X ) }.
% 0.47/1.13 parent0[1]: (121) {G1,W8,D3,L3,V1,M3} { ! X ==> skol1, ! is_state( skol2(
% 0.47/1.13 X ) ), ! alpha1( X ) }.
% 0.47/1.13 parent1[0]: (21) {G2,W3,D3,L1,V1,M1} R(4,12) { is_state( skol2( X ) ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (133) {G2,W5,D2,L2,V1,M2} { ! skol1 ==> X, ! alpha1( X ) }.
% 0.47/1.13 parent0[0]: (132) {G2,W5,D2,L2,V1,M2} { ! X ==> skol1, ! alpha1( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (23) {G4,W5,D2,L2,V1,M2} P(16,5);r(21) { ! alpha1( X ), !
% 0.47/1.13 skol1 = X }.
% 0.47/1.13 parent0: (133) {G2,W5,D2,L2,V1,M2} { ! skol1 ==> X, ! alpha1( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 1
% 0.47/1.13 1 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (134) {G4,W5,D2,L2,V1,M2} { ! X = skol1, ! alpha1( X ) }.
% 0.47/1.13 parent0[1]: (23) {G4,W5,D2,L2,V1,M2} P(16,5);r(21) { ! alpha1( X ), ! skol1
% 0.47/1.13 = X }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqrefl: (135) {G0,W2,D2,L1,V0,M1} { ! alpha1( skol1 ) }.
% 0.47/1.13 parent0[0]: (134) {G4,W5,D2,L2,V1,M2} { ! X = skol1, ! alpha1( X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := skol1
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (136) {G1,W0,D0,L0,V0,M0} { }.
% 0.47/1.13 parent0[0]: (135) {G0,W2,D2,L1,V0,M1} { ! alpha1( skol1 ) }.
% 0.47/1.13 parent1[0]: (12) {G1,W2,D2,L1,V0,M1} S(2);r(9) { alpha1( skol1 ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (24) {G5,W0,D0,L0,V0,M0} Q(23);r(12) { }.
% 0.47/1.13 parent0: (136) {G1,W0,D0,L0,V0,M0} { }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 Proof check complete!
% 0.47/1.13
% 0.47/1.13 Memory use:
% 0.47/1.13
% 0.47/1.13 space for terms: 241
% 0.47/1.13 space for clauses: 1246
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 clauses generated: 65
% 0.47/1.13 clauses kept: 25
% 0.47/1.13 clauses selected: 13
% 0.47/1.13 clauses deleted: 3
% 0.47/1.13 clauses inuse deleted: 0
% 0.47/1.13
% 0.47/1.13 subsentry: 742
% 0.47/1.13 literals s-matched: 642
% 0.47/1.13 literals matched: 642
% 0.47/1.13 full subsumption: 279
% 0.47/1.13
% 0.47/1.13 checksum: 268468300
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksem ended
%------------------------------------------------------------------------------