%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE089+1 : TPTP v8.1.0. Released v4.0.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 01:37:07 EDT 2022
% Result : Theorem 0.83s 1.19s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE089+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n022.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.36 % CPULimit : 300
% 0.13/0.36 % DateTime : Thu Jun 16 10:03:02 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.83/1.19 *** allocated 10000 integers for termspace/termends
% 0.83/1.19 *** allocated 10000 integers for clauses
% 0.83/1.19 *** allocated 10000 integers for justifications
% 0.83/1.19 Bliksem 1.12
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Automatic Strategy Selection
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Clauses:
% 0.83/1.19
% 0.83/1.19 { addition( X, Y ) = addition( Y, X ) }.
% 0.83/1.19 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.83/1.19 { addition( X, zero ) = X }.
% 0.83/1.19 { addition( X, X ) = X }.
% 0.83/1.19 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.83/1.19 multiplication( X, Y ), Z ) }.
% 0.83/1.19 { multiplication( X, one ) = X }.
% 0.83/1.19 { multiplication( one, X ) = X }.
% 0.83/1.19 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.83/1.19 , multiplication( X, Z ) ) }.
% 0.83/1.19 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.83/1.19 , multiplication( Y, Z ) ) }.
% 0.83/1.19 { multiplication( X, zero ) = zero }.
% 0.83/1.19 { multiplication( zero, X ) = zero }.
% 0.83/1.19 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.83/1.19 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.83/1.19 { multiplication( antidomain( X ), X ) = zero }.
% 0.83/1.19 { addition( antidomain( multiplication( X, Y ) ), antidomain(
% 0.83/1.19 multiplication( X, antidomain( antidomain( Y ) ) ) ) ) = antidomain(
% 0.83/1.19 multiplication( X, antidomain( antidomain( Y ) ) ) ) }.
% 0.83/1.19 { addition( antidomain( antidomain( X ) ), antidomain( X ) ) = one }.
% 0.83/1.19 { domain( X ) = antidomain( antidomain( X ) ) }.
% 0.83/1.19 { multiplication( X, coantidomain( X ) ) = zero }.
% 0.83/1.19 { addition( coantidomain( multiplication( X, Y ) ), coantidomain(
% 0.83/1.19 multiplication( coantidomain( coantidomain( X ) ), Y ) ) ) = coantidomain
% 0.83/1.19 ( multiplication( coantidomain( coantidomain( X ) ), Y ) ) }.
% 0.83/1.19 { addition( coantidomain( coantidomain( X ) ), coantidomain( X ) ) = one }
% 0.83/1.19 .
% 0.83/1.19 { codomain( X ) = coantidomain( coantidomain( X ) ) }.
% 0.83/1.19 { addition( domain( skol1 ), antidomain( skol2 ) ) = antidomain( skol2 ) }
% 0.83/1.19 .
% 0.83/1.19 { ! multiplication( domain( skol1 ), skol2 ) = zero }.
% 0.83/1.19
% 0.83/1.19 percentage equality = 0.920000, percentage horn = 1.000000
% 0.83/1.19 This is a pure equality problem
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Options Used:
% 0.83/1.19
% 0.83/1.19 useres = 1
% 0.83/1.19 useparamod = 1
% 0.83/1.19 useeqrefl = 1
% 0.83/1.19 useeqfact = 1
% 0.83/1.19 usefactor = 1
% 0.83/1.19 usesimpsplitting = 0
% 0.83/1.19 usesimpdemod = 5
% 0.83/1.19 usesimpres = 3
% 0.83/1.19
% 0.83/1.19 resimpinuse = 1000
% 0.83/1.19 resimpclauses = 20000
% 0.83/1.19 substype = eqrewr
% 0.83/1.19 backwardsubs = 1
% 0.83/1.19 selectoldest = 5
% 0.83/1.19
% 0.83/1.19 litorderings [0] = split
% 0.83/1.19 litorderings [1] = extend the termordering, first sorting on arguments
% 0.83/1.19
% 0.83/1.19 termordering = kbo
% 0.83/1.19
% 0.83/1.19 litapriori = 0
% 0.83/1.19 termapriori = 1
% 0.83/1.19 litaposteriori = 0
% 0.83/1.19 termaposteriori = 0
% 0.83/1.19 demodaposteriori = 0
% 0.83/1.19 ordereqreflfact = 0
% 0.83/1.19
% 0.83/1.19 litselect = negord
% 0.83/1.19
% 0.83/1.19 maxweight = 15
% 0.83/1.19 maxdepth = 30000
% 0.83/1.19 maxlength = 115
% 0.83/1.19 maxnrvars = 195
% 0.83/1.19 excuselevel = 1
% 0.83/1.19 increasemaxweight = 1
% 0.83/1.19
% 0.83/1.19 maxselected = 10000000
% 0.83/1.19 maxnrclauses = 10000000
% 0.83/1.19
% 0.83/1.19 showgenerated = 0
% 0.83/1.19 showkept = 0
% 0.83/1.19 showselected = 0
% 0.83/1.19 showdeleted = 0
% 0.83/1.19 showresimp = 1
% 0.83/1.19 showstatus = 2000
% 0.83/1.19
% 0.83/1.19 prologoutput = 0
% 0.83/1.19 nrgoals = 5000000
% 0.83/1.19 totalproof = 1
% 0.83/1.19
% 0.83/1.19 Symbols occurring in the translation:
% 0.83/1.19
% 0.83/1.19 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.83/1.19 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.83/1.19 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.83/1.19 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.83/1.19 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.83/1.19 addition [37, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.83/1.19 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.83/1.19 multiplication [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.83/1.19 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.83/1.19 leq [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.83/1.19 antidomain [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.83/1.19 domain [46, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.83/1.19 coantidomain [47, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.83/1.19 codomain [48, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.83/1.19 skol1 [49, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.83/1.19 skol2 [50, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Starting Search:
% 0.83/1.19
% 0.83/1.19 *** allocated 15000 integers for clauses
% 0.83/1.19 *** allocated 22500 integers for clauses
% 0.83/1.19 *** allocated 33750 integers for clauses
% 0.83/1.19 *** allocated 50625 integers for clauses
% 0.83/1.19 *** allocated 75937 integers for clauses
% 0.83/1.19 *** allocated 15000 integers for termspace/termends
% 0.83/1.19 Resimplifying inuse:
% 0.83/1.19 Done
% 0.83/1.19
% 0.83/1.19 *** allocated 113905 integers for clauses
% 0.83/1.19
% 0.83/1.19 Bliksems!, er is een bewijs:
% 0.83/1.19 % SZS status Theorem
% 0.83/1.19 % SZS output start Refutation
% 0.83/1.19
% 0.83/1.19 (2) {G0,W5,D3,L1,V1,M1} I { addition( X, zero ) ==> X }.
% 0.83/1.19 (8) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Z ),
% 0.83/1.19 multiplication( Y, Z ) ) ==> multiplication( addition( X, Y ), Z ) }.
% 0.83/1.19 (13) {G0,W6,D4,L1,V1,M1} I { multiplication( antidomain( X ), X ) ==> zero
% 0.83/1.19 }.
% 0.83/1.19 (21) {G0,W8,D4,L1,V0,M1} I { addition( domain( skol1 ), antidomain( skol2 )
% 0.83/1.19 ) ==> antidomain( skol2 ) }.
% 0.83/1.19 (22) {G0,W6,D4,L1,V0,M1} I { ! multiplication( domain( skol1 ), skol2 ) ==>
% 0.83/1.19 zero }.
% 0.83/1.19 (67) {G1,W10,D5,L1,V2,M1} P(13,8);d(2) { multiplication( addition( Y,
% 0.83/1.19 antidomain( X ) ), X ) ==> multiplication( Y, X ) }.
% 0.83/1.19 (1220) {G2,W6,D4,L1,V0,M1} P(21,67);d(13) { multiplication( domain( skol1 )
% 0.83/1.19 , skol2 ) ==> zero }.
% 0.83/1.19 (1225) {G3,W0,D0,L0,V0,M0} S(1220);r(22) { }.
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 % SZS output end Refutation
% 0.83/1.19 found a proof!
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Unprocessed initial clauses:
% 0.83/1.19
% 0.83/1.19 (1227) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.83/1.19 (1228) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.83/1.19 addition( Z, Y ), X ) }.
% 0.83/1.19 (1229) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.83/1.19 (1230) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.83/1.19 (1231) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) )
% 0.83/1.19 = multiplication( multiplication( X, Y ), Z ) }.
% 0.83/1.19 (1232) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.83/1.19 (1233) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.83/1.19 (1234) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.83/1.19 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.83/1.19 (1235) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.83/1.19 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.83/1.19 (1236) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.83/1.19 (1237) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.83/1.19 (1238) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.83/1.19 (1239) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.83/1.19 (1240) {G0,W6,D4,L1,V1,M1} { multiplication( antidomain( X ), X ) = zero
% 0.83/1.19 }.
% 0.83/1.19 (1241) {G0,W18,D7,L1,V2,M1} { addition( antidomain( multiplication( X, Y )
% 0.83/1.19 ), antidomain( multiplication( X, antidomain( antidomain( Y ) ) ) ) ) =
% 0.83/1.19 antidomain( multiplication( X, antidomain( antidomain( Y ) ) ) ) }.
% 0.83/1.19 (1242) {G0,W8,D5,L1,V1,M1} { addition( antidomain( antidomain( X ) ),
% 0.83/1.19 antidomain( X ) ) = one }.
% 0.83/1.19 (1243) {G0,W6,D4,L1,V1,M1} { domain( X ) = antidomain( antidomain( X ) )
% 0.83/1.19 }.
% 0.83/1.19 (1244) {G0,W6,D4,L1,V1,M1} { multiplication( X, coantidomain( X ) ) = zero
% 0.83/1.19 }.
% 0.83/1.19 (1245) {G0,W18,D7,L1,V2,M1} { addition( coantidomain( multiplication( X, Y
% 0.83/1.19 ) ), coantidomain( multiplication( coantidomain( coantidomain( X ) ), Y
% 0.83/1.19 ) ) ) = coantidomain( multiplication( coantidomain( coantidomain( X ) )
% 0.83/1.19 , Y ) ) }.
% 0.83/1.19 (1246) {G0,W8,D5,L1,V1,M1} { addition( coantidomain( coantidomain( X ) ),
% 0.83/1.19 coantidomain( X ) ) = one }.
% 0.83/1.19 (1247) {G0,W6,D4,L1,V1,M1} { codomain( X ) = coantidomain( coantidomain( X
% 0.83/1.19 ) ) }.
% 0.83/1.19 (1248) {G0,W8,D4,L1,V0,M1} { addition( domain( skol1 ), antidomain( skol2
% 0.83/1.19 ) ) = antidomain( skol2 ) }.
% 0.83/1.19 (1249) {G0,W6,D4,L1,V0,M1} { ! multiplication( domain( skol1 ), skol2 ) =
% 0.83/1.19 zero }.
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Total Proof:
% 0.83/1.19
% 0.83/1.19 subsumption: (2) {G0,W5,D3,L1,V1,M1} I { addition( X, zero ) ==> X }.
% 0.83/1.19 parent0: (1229) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 eqswap: (1259) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Z ),
% 0.83/1.19 multiplication( Y, Z ) ) = multiplication( addition( X, Y ), Z ) }.
% 0.83/1.19 parent0[0]: (1235) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y )
% 0.83/1.19 , Z ) = addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Y
% 0.83/1.19 Z := Z
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (8) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Z )
% 0.83/1.19 , multiplication( Y, Z ) ) ==> multiplication( addition( X, Y ), Z ) }.
% 0.83/1.19 parent0: (1259) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Z ),
% 0.83/1.19 multiplication( Y, Z ) ) = multiplication( addition( X, Y ), Z ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Y
% 0.83/1.19 Z := Z
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (13) {G0,W6,D4,L1,V1,M1} I { multiplication( antidomain( X ),
% 0.83/1.19 X ) ==> zero }.
% 0.83/1.19 parent0: (1240) {G0,W6,D4,L1,V1,M1} { multiplication( antidomain( X ), X )
% 0.83/1.19 = zero }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (21) {G0,W8,D4,L1,V0,M1} I { addition( domain( skol1 ),
% 0.83/1.19 antidomain( skol2 ) ) ==> antidomain( skol2 ) }.
% 0.83/1.19 parent0: (1248) {G0,W8,D4,L1,V0,M1} { addition( domain( skol1 ),
% 0.83/1.19 antidomain( skol2 ) ) = antidomain( skol2 ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (22) {G0,W6,D4,L1,V0,M1} I { ! multiplication( domain( skol1 )
% 0.83/1.19 , skol2 ) ==> zero }.
% 0.83/1.19 parent0: (1249) {G0,W6,D4,L1,V0,M1} { ! multiplication( domain( skol1 ),
% 0.83/1.19 skol2 ) = zero }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 eqswap: (1317) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Z ), Y
% 0.83/1.19 ) ==> addition( multiplication( X, Y ), multiplication( Z, Y ) ) }.
% 0.83/1.19 parent0[0]: (8) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Z ),
% 0.83/1.19 multiplication( Y, Z ) ) ==> multiplication( addition( X, Y ), Z ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Z
% 0.83/1.19 Z := Y
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 paramod: (1320) {G1,W12,D5,L1,V2,M1} { multiplication( addition( X,
% 0.83/1.19 antidomain( Y ) ), Y ) ==> addition( multiplication( X, Y ), zero ) }.
% 0.83/1.19 parent0[0]: (13) {G0,W6,D4,L1,V1,M1} I { multiplication( antidomain( X ), X
% 0.83/1.19 ) ==> zero }.
% 0.83/1.19 parent1[0; 11]: (1317) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X
% 0.83/1.19 , Z ), Y ) ==> addition( multiplication( X, Y ), multiplication( Z, Y ) )
% 0.83/1.19 }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := Y
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Y
% 0.83/1.19 Z := antidomain( Y )
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 paramod: (1321) {G1,W10,D5,L1,V2,M1} { multiplication( addition( X,
% 0.83/1.19 antidomain( Y ) ), Y ) ==> multiplication( X, Y ) }.
% 0.83/1.19 parent0[0]: (2) {G0,W5,D3,L1,V1,M1} I { addition( X, zero ) ==> X }.
% 0.83/1.19 parent1[0; 7]: (1320) {G1,W12,D5,L1,V2,M1} { multiplication( addition( X,
% 0.83/1.19 antidomain( Y ) ), Y ) ==> addition( multiplication( X, Y ), zero ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := multiplication( X, Y )
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Y
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (67) {G1,W10,D5,L1,V2,M1} P(13,8);d(2) { multiplication(
% 0.83/1.19 addition( Y, antidomain( X ) ), X ) ==> multiplication( Y, X ) }.
% 0.83/1.19 parent0: (1321) {G1,W10,D5,L1,V2,M1} { multiplication( addition( X,
% 0.83/1.19 antidomain( Y ) ), Y ) ==> multiplication( X, Y ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := Y
% 0.83/1.19 Y := X
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 eqswap: (1324) {G1,W10,D5,L1,V2,M1} { multiplication( X, Y ) ==>
% 0.83/1.19 multiplication( addition( X, antidomain( Y ) ), Y ) }.
% 0.83/1.19 parent0[0]: (67) {G1,W10,D5,L1,V2,M1} P(13,8);d(2) { multiplication(
% 0.83/1.19 addition( Y, antidomain( X ) ), X ) ==> multiplication( Y, X ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := Y
% 0.83/1.19 Y := X
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 paramod: (1326) {G1,W9,D4,L1,V0,M1} { multiplication( domain( skol1 ),
% 0.83/1.19 skol2 ) ==> multiplication( antidomain( skol2 ), skol2 ) }.
% 0.83/1.19 parent0[0]: (21) {G0,W8,D4,L1,V0,M1} I { addition( domain( skol1 ),
% 0.83/1.19 antidomain( skol2 ) ) ==> antidomain( skol2 ) }.
% 0.83/1.19 parent1[0; 6]: (1324) {G1,W10,D5,L1,V2,M1} { multiplication( X, Y ) ==>
% 0.83/1.19 multiplication( addition( X, antidomain( Y ) ), Y ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 X := domain( skol1 )
% 0.83/1.19 Y := skol2
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 paramod: (1327) {G1,W6,D4,L1,V0,M1} { multiplication( domain( skol1 ),
% 0.83/1.19 skol2 ) ==> zero }.
% 0.83/1.19 parent0[0]: (13) {G0,W6,D4,L1,V1,M1} I { multiplication( antidomain( X ), X
% 0.83/1.19 ) ==> zero }.
% 0.83/1.19 parent1[0; 5]: (1326) {G1,W9,D4,L1,V0,M1} { multiplication( domain( skol1
% 0.83/1.19 ), skol2 ) ==> multiplication( antidomain( skol2 ), skol2 ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := skol2
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (1220) {G2,W6,D4,L1,V0,M1} P(21,67);d(13) { multiplication(
% 0.83/1.19 domain( skol1 ), skol2 ) ==> zero }.
% 0.83/1.19 parent0: (1327) {G1,W6,D4,L1,V0,M1} { multiplication( domain( skol1 ),
% 0.83/1.19 skol2 ) ==> zero }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 0 ==> 0
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 resolution: (1331) {G1,W0,D0,L0,V0,M0} { }.
% 0.83/1.19 parent0[0]: (22) {G0,W6,D4,L1,V0,M1} I { ! multiplication( domain( skol1 )
% 0.83/1.19 , skol2 ) ==> zero }.
% 0.83/1.19 parent1[0]: (1220) {G2,W6,D4,L1,V0,M1} P(21,67);d(13) { multiplication(
% 0.83/1.19 domain( skol1 ), skol2 ) ==> zero }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (1225) {G3,W0,D0,L0,V0,M0} S(1220);r(22) { }.
% 0.83/1.19 parent0: (1331) {G1,W0,D0,L0,V0,M0} { }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19 permutation0:
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 Proof check complete!
% 0.83/1.19
% 0.83/1.19 Memory use:
% 0.83/1.19
% 0.83/1.19 space for terms: 14095
% 0.83/1.19 space for clauses: 79920
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 clauses generated: 7874
% 0.83/1.19 clauses kept: 1226
% 0.83/1.19 clauses selected: 207
% 0.83/1.19 clauses deleted: 13
% 0.83/1.19 clauses inuse deleted: 3
% 0.83/1.19
% 0.83/1.19 subsentry: 9394
% 0.83/1.19 literals s-matched: 6556
% 0.83/1.19 literals matched: 6494
% 0.83/1.19 full subsumption: 312
% 0.83/1.19
% 0.83/1.19 checksum: -1004615695
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Bliksem ended
%------------------------------------------------------------------------------