TSTP Solution File: KLE070+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:00 EDT 2022
% Result : Theorem 0.85s 1.22s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % DateTime : Thu Jun 16 12:18:08 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.85/1.22 *** allocated 10000 integers for termspace/termends
% 0.85/1.22 *** allocated 10000 integers for clauses
% 0.85/1.22 *** allocated 10000 integers for justifications
% 0.85/1.22 Bliksem 1.12
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Automatic Strategy Selection
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Clauses:
% 0.85/1.22
% 0.85/1.22 { addition( X, Y ) = addition( Y, X ) }.
% 0.85/1.22 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.85/1.22 { addition( X, zero ) = X }.
% 0.85/1.22 { addition( X, X ) = X }.
% 0.85/1.22 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.85/1.22 multiplication( X, Y ), Z ) }.
% 0.85/1.22 { multiplication( X, one ) = X }.
% 0.85/1.22 { multiplication( one, X ) = X }.
% 0.85/1.22 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.85/1.22 , multiplication( X, Z ) ) }.
% 0.85/1.22 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.85/1.22 , multiplication( Y, Z ) ) }.
% 0.85/1.22 { multiplication( X, zero ) = zero }.
% 0.85/1.22 { multiplication( zero, X ) = zero }.
% 0.85/1.22 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.85/1.22 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.85/1.22 { addition( X, multiplication( domain( X ), X ) ) = multiplication( domain
% 0.85/1.22 ( X ), X ) }.
% 0.85/1.22 { domain( multiplication( X, Y ) ) = domain( multiplication( X, domain( Y )
% 0.85/1.22 ) ) }.
% 0.85/1.22 { addition( domain( X ), one ) = one }.
% 0.85/1.22 { domain( zero ) = zero }.
% 0.85/1.22 { domain( addition( X, Y ) ) = addition( domain( X ), domain( Y ) ) }.
% 0.85/1.22 { ! addition( domain( skol1 ), multiplication( domain( skol1 ), domain(
% 0.85/1.22 skol2 ) ) ) = domain( skol1 ) }.
% 0.85/1.22
% 0.85/1.22 percentage equality = 0.904762, percentage horn = 1.000000
% 0.85/1.22 This is a pure equality problem
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Options Used:
% 0.85/1.22
% 0.85/1.22 useres = 1
% 0.85/1.22 useparamod = 1
% 0.85/1.22 useeqrefl = 1
% 0.85/1.22 useeqfact = 1
% 0.85/1.22 usefactor = 1
% 0.85/1.22 usesimpsplitting = 0
% 0.85/1.22 usesimpdemod = 5
% 0.85/1.22 usesimpres = 3
% 0.85/1.22
% 0.85/1.22 resimpinuse = 1000
% 0.85/1.22 resimpclauses = 20000
% 0.85/1.22 substype = eqrewr
% 0.85/1.22 backwardsubs = 1
% 0.85/1.22 selectoldest = 5
% 0.85/1.22
% 0.85/1.22 litorderings [0] = split
% 0.85/1.22 litorderings [1] = extend the termordering, first sorting on arguments
% 0.85/1.22
% 0.85/1.22 termordering = kbo
% 0.85/1.22
% 0.85/1.22 litapriori = 0
% 0.85/1.22 termapriori = 1
% 0.85/1.22 litaposteriori = 0
% 0.85/1.22 termaposteriori = 0
% 0.85/1.22 demodaposteriori = 0
% 0.85/1.22 ordereqreflfact = 0
% 0.85/1.22
% 0.85/1.22 litselect = negord
% 0.85/1.22
% 0.85/1.22 maxweight = 15
% 0.85/1.22 maxdepth = 30000
% 0.85/1.22 maxlength = 115
% 0.85/1.22 maxnrvars = 195
% 0.85/1.22 excuselevel = 1
% 0.85/1.22 increasemaxweight = 1
% 0.85/1.22
% 0.85/1.22 maxselected = 10000000
% 0.85/1.22 maxnrclauses = 10000000
% 0.85/1.22
% 0.85/1.22 showgenerated = 0
% 0.85/1.22 showkept = 0
% 0.85/1.22 showselected = 0
% 0.85/1.22 showdeleted = 0
% 0.85/1.22 showresimp = 1
% 0.85/1.22 showstatus = 2000
% 0.85/1.22
% 0.85/1.22 prologoutput = 0
% 0.85/1.22 nrgoals = 5000000
% 0.85/1.22 totalproof = 1
% 0.85/1.22
% 0.85/1.22 Symbols occurring in the translation:
% 0.85/1.22
% 0.85/1.22 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.85/1.22 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.85/1.22 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.85/1.22 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.85/1.22 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.85/1.22 addition [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.85/1.22 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.85/1.22 multiplication [40, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.85/1.22 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.85/1.22 leq [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.85/1.22 domain [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.85/1.22 skol1 [46, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.85/1.22 skol2 [47, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Starting Search:
% 0.85/1.22
% 0.85/1.22 *** allocated 15000 integers for clauses
% 0.85/1.22 *** allocated 22500 integers for clauses
% 0.85/1.22 *** allocated 33750 integers for clauses
% 0.85/1.22 *** allocated 50625 integers for clauses
% 0.85/1.22
% 0.85/1.22 Bliksems!, er is een bewijs:
% 0.85/1.22 % SZS status Theorem
% 0.85/1.22 % SZS output start Refutation
% 0.85/1.22
% 0.85/1.22 (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X ) }.
% 0.85/1.22 (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.85/1.22 (7) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Y ),
% 0.85/1.22 multiplication( X, Z ) ) ==> multiplication( X, addition( Y, Z ) ) }.
% 0.85/1.22 (15) {G0,W6,D4,L1,V1,M1} I { addition( domain( X ), one ) ==> one }.
% 0.85/1.22 (18) {G0,W11,D5,L1,V0,M1} I { ! addition( domain( skol1 ), multiplication(
% 0.85/1.22 domain( skol1 ), domain( skol2 ) ) ) ==> domain( skol1 ) }.
% 0.85/1.22 (20) {G1,W6,D4,L1,V1,M1} P(15,0) { addition( one, domain( X ) ) ==> one }.
% 0.85/1.22 (49) {G1,W11,D4,L1,V2,M1} P(5,7) { addition( X, multiplication( X, Y ) ) =
% 0.85/1.22 multiplication( X, addition( one, Y ) ) }.
% 0.85/1.22 (712) {G2,W0,D0,L0,V0,M0} P(49,18);d(20);d(5);q { }.
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 % SZS output end Refutation
% 0.85/1.22 found a proof!
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Unprocessed initial clauses:
% 0.85/1.22
% 0.85/1.22 (714) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.85/1.22 (715) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.85/1.22 addition( Z, Y ), X ) }.
% 0.85/1.22 (716) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.85/1.22 (717) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.85/1.22 (718) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.85/1.22 multiplication( multiplication( X, Y ), Z ) }.
% 0.85/1.22 (719) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.85/1.22 (720) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.85/1.22 (721) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.85/1.22 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.85/1.22 (722) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.85/1.22 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.85/1.22 (723) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.85/1.22 (724) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.85/1.22 (725) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.85/1.22 (726) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.85/1.22 (727) {G0,W11,D5,L1,V1,M1} { addition( X, multiplication( domain( X ), X )
% 0.85/1.22 ) = multiplication( domain( X ), X ) }.
% 0.85/1.22 (728) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) = domain(
% 0.85/1.22 multiplication( X, domain( Y ) ) ) }.
% 0.85/1.22 (729) {G0,W6,D4,L1,V1,M1} { addition( domain( X ), one ) = one }.
% 0.85/1.22 (730) {G0,W4,D3,L1,V0,M1} { domain( zero ) = zero }.
% 0.85/1.22 (731) {G0,W10,D4,L1,V2,M1} { domain( addition( X, Y ) ) = addition( domain
% 0.85/1.22 ( X ), domain( Y ) ) }.
% 0.85/1.22 (732) {G0,W11,D5,L1,V0,M1} { ! addition( domain( skol1 ), multiplication(
% 0.85/1.22 domain( skol1 ), domain( skol2 ) ) ) = domain( skol1 ) }.
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Total Proof:
% 0.85/1.22
% 0.85/1.22 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X
% 0.85/1.22 ) }.
% 0.85/1.22 parent0: (714) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X )
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 Y := Y
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.85/1.22 parent0: (719) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqswap: (744) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Y ),
% 0.85/1.22 multiplication( X, Z ) ) = multiplication( X, addition( Y, Z ) ) }.
% 0.85/1.22 parent0[0]: (721) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z
% 0.85/1.22 ) ) = addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 Y := Y
% 0.85/1.22 Z := Z
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (7) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Y )
% 0.85/1.22 , multiplication( X, Z ) ) ==> multiplication( X, addition( Y, Z ) ) }.
% 0.85/1.22 parent0: (744) {G0,W13,D4,L1,V3,M1} { addition( multiplication( X, Y ),
% 0.85/1.22 multiplication( X, Z ) ) = multiplication( X, addition( Y, Z ) ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 Y := Y
% 0.85/1.22 Z := Z
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (15) {G0,W6,D4,L1,V1,M1} I { addition( domain( X ), one ) ==>
% 0.85/1.22 one }.
% 0.85/1.22 parent0: (729) {G0,W6,D4,L1,V1,M1} { addition( domain( X ), one ) = one
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (18) {G0,W11,D5,L1,V0,M1} I { ! addition( domain( skol1 ),
% 0.85/1.22 multiplication( domain( skol1 ), domain( skol2 ) ) ) ==> domain( skol1 )
% 0.85/1.22 }.
% 0.85/1.22 parent0: (732) {G0,W11,D5,L1,V0,M1} { ! addition( domain( skol1 ),
% 0.85/1.22 multiplication( domain( skol1 ), domain( skol2 ) ) ) = domain( skol1 )
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqswap: (778) {G0,W6,D4,L1,V1,M1} { one ==> addition( domain( X ), one )
% 0.85/1.22 }.
% 0.85/1.22 parent0[0]: (15) {G0,W6,D4,L1,V1,M1} I { addition( domain( X ), one ) ==>
% 0.85/1.22 one }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 paramod: (779) {G1,W6,D4,L1,V1,M1} { one ==> addition( one, domain( X ) )
% 0.85/1.22 }.
% 0.85/1.22 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { addition( X, Y ) = addition( Y, X )
% 0.85/1.22 }.
% 0.85/1.22 parent1[0; 2]: (778) {G0,W6,D4,L1,V1,M1} { one ==> addition( domain( X ),
% 0.85/1.22 one ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := domain( X )
% 0.85/1.22 Y := one
% 0.85/1.22 end
% 0.85/1.22 substitution1:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqswap: (782) {G1,W6,D4,L1,V1,M1} { addition( one, domain( X ) ) ==> one
% 0.85/1.22 }.
% 0.85/1.22 parent0[0]: (779) {G1,W6,D4,L1,V1,M1} { one ==> addition( one, domain( X )
% 0.85/1.22 ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (20) {G1,W6,D4,L1,V1,M1} P(15,0) { addition( one, domain( X )
% 0.85/1.22 ) ==> one }.
% 0.85/1.22 parent0: (782) {G1,W6,D4,L1,V1,M1} { addition( one, domain( X ) ) ==> one
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqswap: (784) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) )
% 0.85/1.22 ==> addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.85/1.22 parent0[0]: (7) {G0,W13,D4,L1,V3,M1} I { addition( multiplication( X, Y ),
% 0.85/1.22 multiplication( X, Z ) ) ==> multiplication( X, addition( Y, Z ) ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 Y := Y
% 0.85/1.22 Z := Z
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 paramod: (785) {G1,W11,D4,L1,V2,M1} { multiplication( X, addition( one, Y
% 0.85/1.22 ) ) ==> addition( X, multiplication( X, Y ) ) }.
% 0.85/1.22 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.85/1.22 parent1[0; 7]: (784) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y
% 0.85/1.22 , Z ) ) ==> addition( multiplication( X, Y ), multiplication( X, Z ) )
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 end
% 0.85/1.22 substitution1:
% 0.85/1.22 X := X
% 0.85/1.22 Y := one
% 0.85/1.22 Z := Y
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqswap: (787) {G1,W11,D4,L1,V2,M1} { addition( X, multiplication( X, Y ) )
% 0.85/1.22 ==> multiplication( X, addition( one, Y ) ) }.
% 0.85/1.22 parent0[0]: (785) {G1,W11,D4,L1,V2,M1} { multiplication( X, addition( one
% 0.85/1.22 , Y ) ) ==> addition( X, multiplication( X, Y ) ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 Y := Y
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (49) {G1,W11,D4,L1,V2,M1} P(5,7) { addition( X, multiplication
% 0.85/1.22 ( X, Y ) ) = multiplication( X, addition( one, Y ) ) }.
% 0.85/1.22 parent0: (787) {G1,W11,D4,L1,V2,M1} { addition( X, multiplication( X, Y )
% 0.85/1.22 ) ==> multiplication( X, addition( one, Y ) ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := X
% 0.85/1.22 Y := Y
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 0 ==> 0
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqswap: (790) {G0,W11,D5,L1,V0,M1} { ! domain( skol1 ) ==> addition(
% 0.85/1.22 domain( skol1 ), multiplication( domain( skol1 ), domain( skol2 ) ) ) }.
% 0.85/1.22 parent0[0]: (18) {G0,W11,D5,L1,V0,M1} I { ! addition( domain( skol1 ),
% 0.85/1.22 multiplication( domain( skol1 ), domain( skol2 ) ) ) ==> domain( skol1 )
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 paramod: (793) {G1,W10,D5,L1,V0,M1} { ! domain( skol1 ) ==> multiplication
% 0.85/1.22 ( domain( skol1 ), addition( one, domain( skol2 ) ) ) }.
% 0.85/1.22 parent0[0]: (49) {G1,W11,D4,L1,V2,M1} P(5,7) { addition( X, multiplication
% 0.85/1.22 ( X, Y ) ) = multiplication( X, addition( one, Y ) ) }.
% 0.85/1.22 parent1[0; 4]: (790) {G0,W11,D5,L1,V0,M1} { ! domain( skol1 ) ==> addition
% 0.85/1.22 ( domain( skol1 ), multiplication( domain( skol1 ), domain( skol2 ) ) )
% 0.85/1.22 }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := domain( skol1 )
% 0.85/1.22 Y := domain( skol2 )
% 0.85/1.22 end
% 0.85/1.22 substitution1:
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 paramod: (794) {G2,W7,D4,L1,V0,M1} { ! domain( skol1 ) ==> multiplication
% 0.85/1.22 ( domain( skol1 ), one ) }.
% 0.85/1.22 parent0[0]: (20) {G1,W6,D4,L1,V1,M1} P(15,0) { addition( one, domain( X ) )
% 0.85/1.22 ==> one }.
% 0.85/1.22 parent1[0; 7]: (793) {G1,W10,D5,L1,V0,M1} { ! domain( skol1 ) ==>
% 0.85/1.22 multiplication( domain( skol1 ), addition( one, domain( skol2 ) ) ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := skol2
% 0.85/1.22 end
% 0.85/1.22 substitution1:
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 paramod: (795) {G1,W5,D3,L1,V0,M1} { ! domain( skol1 ) ==> domain( skol1 )
% 0.85/1.22 }.
% 0.85/1.22 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.85/1.22 parent1[0; 4]: (794) {G2,W7,D4,L1,V0,M1} { ! domain( skol1 ) ==>
% 0.85/1.22 multiplication( domain( skol1 ), one ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 X := domain( skol1 )
% 0.85/1.22 end
% 0.85/1.22 substitution1:
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 eqrefl: (796) {G0,W0,D0,L0,V0,M0} { }.
% 0.85/1.22 parent0[0]: (795) {G1,W5,D3,L1,V0,M1} { ! domain( skol1 ) ==> domain(
% 0.85/1.22 skol1 ) }.
% 0.85/1.22 substitution0:
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 subsumption: (712) {G2,W0,D0,L0,V0,M0} P(49,18);d(20);d(5);q { }.
% 0.85/1.22 parent0: (796) {G0,W0,D0,L0,V0,M0} { }.
% 0.85/1.22 substitution0:
% 0.85/1.22 end
% 0.85/1.22 permutation0:
% 0.85/1.22 end
% 0.85/1.22
% 0.85/1.22 Proof check complete!
% 0.85/1.22
% 0.85/1.22 Memory use:
% 0.85/1.22
% 0.85/1.22 space for terms: 8344
% 0.85/1.22 space for clauses: 43945
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 clauses generated: 7275
% 0.85/1.22 clauses kept: 713
% 0.85/1.22 clauses selected: 154
% 0.85/1.22 clauses deleted: 2
% 0.85/1.22 clauses inuse deleted: 0
% 0.85/1.22
% 0.85/1.22 subsentry: 8331
% 0.85/1.22 literals s-matched: 6530
% 0.85/1.22 literals matched: 6482
% 0.85/1.22 full subsumption: 418
% 0.85/1.22
% 0.85/1.22 checksum: 531320817
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 Bliksem ended
%------------------------------------------------------------------------------