TSTP Solution File: KLE006+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE006+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n003.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 01:36:31 EDT 2022
% Result : Theorem 0.78s 1.14s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : KLE006+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Thu Jun 16 10:27:11 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.78/1.14 *** allocated 10000 integers for termspace/termends
% 0.78/1.14 *** allocated 10000 integers for clauses
% 0.78/1.14 *** allocated 10000 integers for justifications
% 0.78/1.14 Bliksem 1.12
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Automatic Strategy Selection
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Clauses:
% 0.78/1.14
% 0.78/1.14 { addition( X, Y ) = addition( Y, X ) }.
% 0.78/1.14 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.78/1.14 { addition( X, zero ) = X }.
% 0.78/1.14 { addition( X, X ) = X }.
% 0.78/1.14 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.78/1.14 multiplication( X, Y ), Z ) }.
% 0.78/1.14 { multiplication( X, one ) = X }.
% 0.78/1.14 { multiplication( one, X ) = X }.
% 0.78/1.14 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.78/1.14 , multiplication( X, Z ) ) }.
% 0.78/1.14 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.78/1.14 , multiplication( Y, Z ) ) }.
% 0.78/1.14 { multiplication( X, zero ) = zero }.
% 0.78/1.14 { multiplication( zero, X ) = zero }.
% 0.78/1.14 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.78/1.14 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.78/1.14 { ! test( X ), complement( skol1( X ), X ) }.
% 0.78/1.14 { ! complement( Y, X ), test( X ) }.
% 0.78/1.14 { ! complement( Y, X ), multiplication( X, Y ) = zero }.
% 0.78/1.14 { ! complement( Y, X ), alpha1( X, Y ) }.
% 0.78/1.14 { ! multiplication( X, Y ) = zero, ! alpha1( X, Y ), complement( Y, X ) }.
% 0.78/1.14 { ! alpha1( X, Y ), multiplication( Y, X ) = zero }.
% 0.78/1.14 { ! alpha1( X, Y ), addition( X, Y ) = one }.
% 0.78/1.14 { ! multiplication( Y, X ) = zero, ! addition( X, Y ) = one, alpha1( X, Y )
% 0.78/1.14 }.
% 0.78/1.14 { ! test( X ), ! c( X ) = Y, complement( X, Y ) }.
% 0.78/1.14 { ! test( X ), ! complement( X, Y ), c( X ) = Y }.
% 0.78/1.14 { test( X ), c( X ) = zero }.
% 0.78/1.14 { test( skol2 ) }.
% 0.78/1.14 { ! one = addition( skol2, c( skol2 ) ) }.
% 0.78/1.14
% 0.78/1.14 percentage equality = 0.534884, percentage horn = 0.961538
% 0.78/1.14 This is a problem with some equality
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Options Used:
% 0.78/1.14
% 0.78/1.14 useres = 1
% 0.78/1.14 useparamod = 1
% 0.78/1.14 useeqrefl = 1
% 0.78/1.14 useeqfact = 1
% 0.78/1.14 usefactor = 1
% 0.78/1.14 usesimpsplitting = 0
% 0.78/1.14 usesimpdemod = 5
% 0.78/1.14 usesimpres = 3
% 0.78/1.14
% 0.78/1.14 resimpinuse = 1000
% 0.78/1.14 resimpclauses = 20000
% 0.78/1.14 substype = eqrewr
% 0.78/1.14 backwardsubs = 1
% 0.78/1.14 selectoldest = 5
% 0.78/1.14
% 0.78/1.14 litorderings [0] = split
% 0.78/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.78/1.14
% 0.78/1.14 termordering = kbo
% 0.78/1.14
% 0.78/1.14 litapriori = 0
% 0.78/1.14 termapriori = 1
% 0.78/1.14 litaposteriori = 0
% 0.78/1.14 termaposteriori = 0
% 0.78/1.14 demodaposteriori = 0
% 0.78/1.14 ordereqreflfact = 0
% 0.78/1.14
% 0.78/1.14 litselect = negord
% 0.78/1.14
% 0.78/1.14 maxweight = 15
% 0.78/1.14 maxdepth = 30000
% 0.78/1.14 maxlength = 115
% 0.78/1.14 maxnrvars = 195
% 0.78/1.14 excuselevel = 1
% 0.78/1.14 increasemaxweight = 1
% 0.78/1.14
% 0.78/1.14 maxselected = 10000000
% 0.78/1.14 maxnrclauses = 10000000
% 0.78/1.14
% 0.78/1.14 showgenerated = 0
% 0.78/1.14 showkept = 0
% 0.78/1.14 showselected = 0
% 0.78/1.14 showdeleted = 0
% 0.78/1.14 showresimp = 1
% 0.78/1.14 showstatus = 2000
% 0.78/1.14
% 0.78/1.14 prologoutput = 0
% 0.78/1.14 nrgoals = 5000000
% 0.78/1.14 totalproof = 1
% 0.78/1.14
% 0.78/1.14 Symbols occurring in the translation:
% 0.78/1.14
% 0.78/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.78/1.14 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.78/1.14 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.78/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.78/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.78/1.14 addition [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.78/1.14 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.78/1.14 multiplication [40, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.78/1.14 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.78/1.14 leq [42, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.78/1.14 test [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.78/1.14 complement [46, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.78/1.14 c [47, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.78/1.14 alpha1 [48, 2] (w:1, o:50, a:1, s:1, b:1),
% 0.78/1.14 skol1 [49, 1] (w:1, o:19, a:1, s:1, b:1),
% 0.78/1.14 skol2 [50, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Starting Search:
% 0.78/1.14
% 0.78/1.14 *** allocated 15000 integers for clauses
% 0.78/1.14 *** allocated 22500 integers for clauses
% 0.78/1.14 *** allocated 33750 integers for clauses
% 0.78/1.14
% 0.78/1.14 Bliksems!, er is een bewijs:
% 0.78/1.14 % SZS status Theorem
% 0.78/1.14 % SZS output start Refutation
% 0.78/1.14
% 0.78/1.14 (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X ) }.
% 0.78/1.14 (16) {G0,W6,D2,L2,V2,M2} I { ! complement( Y, X ), alpha1( X, Y ) }.
% 0.78/1.14 (19) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), addition( X, Y ) ==> one }.
% 0.78/1.14 (21) {G0,W9,D3,L3,V2,M3} I { ! test( X ), ! c( X ) = Y, complement( X, Y )
% 0.78/1.14 }.
% 0.78/1.14 (24) {G0,W2,D2,L1,V0,M1} I { test( skol2 ) }.
% 0.78/1.14 (25) {G0,W6,D4,L1,V0,M1} I { ! addition( skol2, c( skol2 ) ) ==> one }.
% 0.78/1.14 (26) {G1,W6,D3,L2,V1,M2} Q(21) { ! test( X ), complement( X, c( X ) ) }.
% 0.78/1.14 (36) {G2,W4,D3,L1,V0,M1} R(26,24) { complement( skol2, c( skol2 ) ) }.
% 0.78/1.14 (37) {G3,W4,D3,L1,V0,M1} R(36,16) { alpha1( c( skol2 ), skol2 ) }.
% 0.78/1.14 (267) {G4,W6,D4,L1,V0,M1} R(19,37) { addition( c( skol2 ), skol2 ) ==> one
% 0.78/1.14 }.
% 0.78/1.14 (443) {G5,W0,D0,L0,V0,M0} P(0,25);d(267);q { }.
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 % SZS output end Refutation
% 0.78/1.14 found a proof!
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Unprocessed initial clauses:
% 0.78/1.14
% 0.78/1.14 (445) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.78/1.14 (446) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.78/1.14 addition( Z, Y ), X ) }.
% 0.78/1.14 (447) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.78/1.14 (448) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.78/1.14 (449) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.78/1.14 multiplication( multiplication( X, Y ), Z ) }.
% 0.78/1.14 (450) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.78/1.14 (451) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.78/1.14 (452) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.78/1.14 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.78/1.14 (453) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.78/1.14 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.78/1.14 (454) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.78/1.14 (455) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.78/1.14 (456) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.78/1.14 (457) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.78/1.14 (458) {G0,W6,D3,L2,V1,M2} { ! test( X ), complement( skol1( X ), X ) }.
% 0.78/1.14 (459) {G0,W5,D2,L2,V2,M2} { ! complement( Y, X ), test( X ) }.
% 0.78/1.14 (460) {G0,W8,D3,L2,V2,M2} { ! complement( Y, X ), multiplication( X, Y ) =
% 0.78/1.14 zero }.
% 0.78/1.14 (461) {G0,W6,D2,L2,V2,M2} { ! complement( Y, X ), alpha1( X, Y ) }.
% 0.78/1.14 (462) {G0,W11,D3,L3,V2,M3} { ! multiplication( X, Y ) = zero, ! alpha1( X
% 0.78/1.14 , Y ), complement( Y, X ) }.
% 0.78/1.14 (463) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), multiplication( Y, X ) =
% 0.78/1.14 zero }.
% 0.78/1.14 (464) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), addition( X, Y ) = one }.
% 0.78/1.14 (465) {G0,W13,D3,L3,V2,M3} { ! multiplication( Y, X ) = zero, ! addition(
% 0.78/1.14 X, Y ) = one, alpha1( X, Y ) }.
% 0.78/1.14 (466) {G0,W9,D3,L3,V2,M3} { ! test( X ), ! c( X ) = Y, complement( X, Y )
% 0.78/1.14 }.
% 0.78/1.14 (467) {G0,W9,D3,L3,V2,M3} { ! test( X ), ! complement( X, Y ), c( X ) = Y
% 0.78/1.14 }.
% 0.78/1.14 (468) {G0,W6,D3,L2,V1,M2} { test( X ), c( X ) = zero }.
% 0.78/1.14 (469) {G0,W2,D2,L1,V0,M1} { test( skol2 ) }.
% 0.78/1.14 (470) {G0,W6,D4,L1,V0,M1} { ! one = addition( skol2, c( skol2 ) ) }.
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Total Proof:
% 0.78/1.14
% 0.78/1.14 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X
% 0.78/1.14 ) }.
% 0.78/1.14 parent0: (445) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X )
% 0.78/1.14 }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := Y
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (16) {G0,W6,D2,L2,V2,M2} I { ! complement( Y, X ), alpha1( X,
% 0.78/1.14 Y ) }.
% 0.78/1.14 parent0: (461) {G0,W6,D2,L2,V2,M2} { ! complement( Y, X ), alpha1( X, Y )
% 0.78/1.14 }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := Y
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 1 ==> 1
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (19) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), addition( X, Y
% 0.78/1.14 ) ==> one }.
% 0.78/1.14 parent0: (464) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), addition( X, Y ) =
% 0.78/1.14 one }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := Y
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 1 ==> 1
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (21) {G0,W9,D3,L3,V2,M3} I { ! test( X ), ! c( X ) = Y,
% 0.78/1.14 complement( X, Y ) }.
% 0.78/1.14 parent0: (466) {G0,W9,D3,L3,V2,M3} { ! test( X ), ! c( X ) = Y, complement
% 0.78/1.14 ( X, Y ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := Y
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 1 ==> 1
% 0.78/1.14 2 ==> 2
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (24) {G0,W2,D2,L1,V0,M1} I { test( skol2 ) }.
% 0.78/1.14 parent0: (469) {G0,W2,D2,L1,V0,M1} { test( skol2 ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqswap: (564) {G0,W6,D4,L1,V0,M1} { ! addition( skol2, c( skol2 ) ) = one
% 0.78/1.14 }.
% 0.78/1.14 parent0[0]: (470) {G0,W6,D4,L1,V0,M1} { ! one = addition( skol2, c( skol2
% 0.78/1.14 ) ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (25) {G0,W6,D4,L1,V0,M1} I { ! addition( skol2, c( skol2 ) )
% 0.78/1.14 ==> one }.
% 0.78/1.14 parent0: (564) {G0,W6,D4,L1,V0,M1} { ! addition( skol2, c( skol2 ) ) = one
% 0.78/1.14 }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqswap: (565) {G0,W9,D3,L3,V2,M3} { ! Y = c( X ), ! test( X ), complement
% 0.78/1.14 ( X, Y ) }.
% 0.78/1.14 parent0[1]: (21) {G0,W9,D3,L3,V2,M3} I { ! test( X ), ! c( X ) = Y,
% 0.78/1.14 complement( X, Y ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := Y
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqrefl: (566) {G0,W6,D3,L2,V1,M2} { ! test( X ), complement( X, c( X ) )
% 0.78/1.14 }.
% 0.78/1.14 parent0[0]: (565) {G0,W9,D3,L3,V2,M3} { ! Y = c( X ), ! test( X ),
% 0.78/1.14 complement( X, Y ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := c( X )
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (26) {G1,W6,D3,L2,V1,M2} Q(21) { ! test( X ), complement( X, c
% 0.78/1.14 ( X ) ) }.
% 0.78/1.14 parent0: (566) {G0,W6,D3,L2,V1,M2} { ! test( X ), complement( X, c( X ) )
% 0.78/1.14 }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 1 ==> 1
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 resolution: (567) {G1,W4,D3,L1,V0,M1} { complement( skol2, c( skol2 ) )
% 0.78/1.14 }.
% 0.78/1.14 parent0[0]: (26) {G1,W6,D3,L2,V1,M2} Q(21) { ! test( X ), complement( X, c
% 0.78/1.14 ( X ) ) }.
% 0.78/1.14 parent1[0]: (24) {G0,W2,D2,L1,V0,M1} I { test( skol2 ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := skol2
% 0.78/1.14 end
% 0.78/1.14 substitution1:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (36) {G2,W4,D3,L1,V0,M1} R(26,24) { complement( skol2, c(
% 0.78/1.14 skol2 ) ) }.
% 0.78/1.14 parent0: (567) {G1,W4,D3,L1,V0,M1} { complement( skol2, c( skol2 ) ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 resolution: (568) {G1,W4,D3,L1,V0,M1} { alpha1( c( skol2 ), skol2 ) }.
% 0.78/1.14 parent0[0]: (16) {G0,W6,D2,L2,V2,M2} I { ! complement( Y, X ), alpha1( X, Y
% 0.78/1.14 ) }.
% 0.78/1.14 parent1[0]: (36) {G2,W4,D3,L1,V0,M1} R(26,24) { complement( skol2, c( skol2
% 0.78/1.14 ) ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := c( skol2 )
% 0.78/1.14 Y := skol2
% 0.78/1.14 end
% 0.78/1.14 substitution1:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (37) {G3,W4,D3,L1,V0,M1} R(36,16) { alpha1( c( skol2 ), skol2
% 0.78/1.14 ) }.
% 0.78/1.14 parent0: (568) {G1,W4,D3,L1,V0,M1} { alpha1( c( skol2 ), skol2 ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqswap: (569) {G0,W8,D3,L2,V2,M2} { one ==> addition( X, Y ), ! alpha1( X
% 0.78/1.14 , Y ) }.
% 0.78/1.14 parent0[1]: (19) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), addition( X, Y )
% 0.78/1.14 ==> one }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := X
% 0.78/1.14 Y := Y
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 resolution: (570) {G1,W6,D4,L1,V0,M1} { one ==> addition( c( skol2 ),
% 0.78/1.14 skol2 ) }.
% 0.78/1.14 parent0[1]: (569) {G0,W8,D3,L2,V2,M2} { one ==> addition( X, Y ), ! alpha1
% 0.78/1.14 ( X, Y ) }.
% 0.78/1.14 parent1[0]: (37) {G3,W4,D3,L1,V0,M1} R(36,16) { alpha1( c( skol2 ), skol2 )
% 0.78/1.14 }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := c( skol2 )
% 0.78/1.14 Y := skol2
% 0.78/1.14 end
% 0.78/1.14 substitution1:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqswap: (571) {G1,W6,D4,L1,V0,M1} { addition( c( skol2 ), skol2 ) ==> one
% 0.78/1.14 }.
% 0.78/1.14 parent0[0]: (570) {G1,W6,D4,L1,V0,M1} { one ==> addition( c( skol2 ),
% 0.78/1.14 skol2 ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (267) {G4,W6,D4,L1,V0,M1} R(19,37) { addition( c( skol2 ),
% 0.78/1.14 skol2 ) ==> one }.
% 0.78/1.14 parent0: (571) {G1,W6,D4,L1,V0,M1} { addition( c( skol2 ), skol2 ) ==> one
% 0.78/1.14 }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 0 ==> 0
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqswap: (572) {G0,W6,D4,L1,V0,M1} { ! one ==> addition( skol2, c( skol2 )
% 0.78/1.14 ) }.
% 0.78/1.14 parent0[0]: (25) {G0,W6,D4,L1,V0,M1} I { ! addition( skol2, c( skol2 ) )
% 0.78/1.14 ==> one }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 paramod: (574) {G1,W6,D4,L1,V0,M1} { ! one ==> addition( c( skol2 ), skol2
% 0.78/1.14 ) }.
% 0.78/1.14 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X )
% 0.78/1.14 }.
% 0.78/1.14 parent1[0; 3]: (572) {G0,W6,D4,L1,V0,M1} { ! one ==> addition( skol2, c(
% 0.78/1.14 skol2 ) ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 X := skol2
% 0.78/1.14 Y := c( skol2 )
% 0.78/1.14 end
% 0.78/1.14 substitution1:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 paramod: (576) {G2,W3,D2,L1,V0,M1} { ! one ==> one }.
% 0.78/1.14 parent0[0]: (267) {G4,W6,D4,L1,V0,M1} R(19,37) { addition( c( skol2 ),
% 0.78/1.14 skol2 ) ==> one }.
% 0.78/1.14 parent1[0; 3]: (574) {G1,W6,D4,L1,V0,M1} { ! one ==> addition( c( skol2 )
% 0.78/1.14 , skol2 ) }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 substitution1:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 eqrefl: (577) {G0,W0,D0,L0,V0,M0} { }.
% 0.78/1.14 parent0[0]: (576) {G2,W3,D2,L1,V0,M1} { ! one ==> one }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 subsumption: (443) {G5,W0,D0,L0,V0,M0} P(0,25);d(267);q { }.
% 0.78/1.14 parent0: (577) {G0,W0,D0,L0,V0,M0} { }.
% 0.78/1.14 substitution0:
% 0.78/1.14 end
% 0.78/1.14 permutation0:
% 0.78/1.14 end
% 0.78/1.14
% 0.78/1.14 Proof check complete!
% 0.78/1.14
% 0.78/1.14 Memory use:
% 0.78/1.14
% 0.78/1.14 space for terms: 4882
% 0.78/1.14 space for clauses: 25229
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 clauses generated: 1603
% 0.78/1.14 clauses kept: 444
% 0.78/1.14 clauses selected: 76
% 0.78/1.14 clauses deleted: 0
% 0.78/1.14 clauses inuse deleted: 0
% 0.78/1.14
% 0.78/1.14 subsentry: 2492
% 0.78/1.14 literals s-matched: 1594
% 0.78/1.14 literals matched: 1594
% 0.78/1.14 full subsumption: 90
% 0.78/1.14
% 0.78/1.14 checksum: -407882675
% 0.78/1.14
% 0.78/1.14
% 0.78/1.14 Bliksem ended
%------------------------------------------------------------------------------