TSTP Solution File: KLE067+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE067+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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.83s 1.19s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE067+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % DateTime : Thu Jun 16 14:57:49 EDT 2022
% 0.13/0.35 % 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 { addition( X, multiplication( domain( X ), X ) ) = multiplication( domain
% 0.83/1.19 ( X ), X ) }.
% 0.83/1.19 { domain( multiplication( X, Y ) ) = domain( multiplication( X, domain( Y )
% 0.83/1.19 ) ) }.
% 0.83/1.19 { addition( domain( X ), one ) = one }.
% 0.83/1.19 { domain( zero ) = zero }.
% 0.83/1.19 { domain( addition( X, Y ) ) = addition( domain( X ), domain( Y ) ) }.
% 0.83/1.19 { ! domain( addition( domain( skol1 ), domain( skol2 ) ) ) = addition(
% 0.83/1.19 domain( skol1 ), domain( skol2 ) ) }.
% 0.83/1.19
% 0.83/1.19 percentage equality = 0.904762, 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:21, 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:45, 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:47, 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:46, a:1, s:1, b:0),
% 0.83/1.19 domain [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.83/1.19 skol1 [46, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.83/1.19 skol2 [47, 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
% 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 (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.83/1.19 (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain( Y ) ) )
% 0.83/1.19 ==> domain( multiplication( X, Y ) ) }.
% 0.83/1.19 (17) {G0,W10,D4,L1,V2,M1} I { addition( domain( X ), domain( Y ) ) ==>
% 0.83/1.19 domain( addition( X, Y ) ) }.
% 0.83/1.19 (18) {G1,W10,D5,L1,V0,M1} I;d(17) { ! domain( domain( addition( skol1,
% 0.83/1.19 skol2 ) ) ) ==> domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 (139) {G1,W6,D4,L1,V1,M1} P(6,14);d(6) { domain( domain( X ) ) ==> domain(
% 0.83/1.19 X ) }.
% 0.83/1.19 (199) {G2,W0,D0,L0,V0,M0} S(18);d(139);q { }.
% 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 (201) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.83/1.19 (202) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.83/1.19 addition( Z, Y ), X ) }.
% 0.83/1.19 (203) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.83/1.19 (204) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.83/1.19 (205) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.83/1.19 multiplication( multiplication( X, Y ), Z ) }.
% 0.83/1.19 (206) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.83/1.19 (207) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.83/1.19 (208) {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 (209) {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 (210) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.83/1.19 (211) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.83/1.19 (212) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.83/1.19 (213) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.83/1.19 (214) {G0,W11,D5,L1,V1,M1} { addition( X, multiplication( domain( X ), X )
% 0.83/1.19 ) = multiplication( domain( X ), X ) }.
% 0.83/1.19 (215) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) = domain(
% 0.83/1.19 multiplication( X, domain( Y ) ) ) }.
% 0.83/1.19 (216) {G0,W6,D4,L1,V1,M1} { addition( domain( X ), one ) = one }.
% 0.83/1.19 (217) {G0,W4,D3,L1,V0,M1} { domain( zero ) = zero }.
% 0.83/1.19 (218) {G0,W10,D4,L1,V2,M1} { domain( addition( X, Y ) ) = addition( domain
% 0.83/1.19 ( X ), domain( Y ) ) }.
% 0.83/1.19 (219) {G0,W12,D5,L1,V0,M1} { ! domain( addition( domain( skol1 ), domain(
% 0.83/1.19 skol2 ) ) ) = addition( domain( skol1 ), domain( skol2 ) ) }.
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Total Proof:
% 0.83/1.19
% 0.83/1.19 subsumption: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.83/1.19 parent0: (207) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = 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: (239) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y
% 0.83/1.19 ) ) ) = domain( multiplication( X, Y ) ) }.
% 0.83/1.19 parent0[0]: (215) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) )
% 0.83/1.19 = domain( multiplication( X, domain( Y ) ) ) }.
% 0.83/1.19 substitution0:
% 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: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X,
% 0.83/1.19 domain( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.83/1.19 parent0: (239) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y
% 0.83/1.19 ) ) ) = domain( multiplication( X, Y ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Y
% 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 *** allocated 22500 integers for clauses
% 0.83/1.19 eqswap: (256) {G0,W10,D4,L1,V2,M1} { addition( domain( X ), domain( Y ) )
% 0.83/1.19 = domain( addition( X, Y ) ) }.
% 0.83/1.19 parent0[0]: (218) {G0,W10,D4,L1,V2,M1} { domain( addition( X, Y ) ) =
% 0.83/1.19 addition( domain( X ), domain( Y ) ) }.
% 0.83/1.19 substitution0:
% 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: (17) {G0,W10,D4,L1,V2,M1} I { addition( domain( X ), domain( Y
% 0.83/1.19 ) ) ==> domain( addition( X, Y ) ) }.
% 0.83/1.19 parent0: (256) {G0,W10,D4,L1,V2,M1} { addition( domain( X ), domain( Y ) )
% 0.83/1.19 = domain( addition( X, Y ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 Y := Y
% 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 paramod: (297) {G1,W11,D5,L1,V0,M1} { ! domain( addition( domain( skol1 )
% 0.83/1.19 , domain( skol2 ) ) ) = domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 parent0[0]: (17) {G0,W10,D4,L1,V2,M1} I { addition( domain( X ), domain( Y
% 0.83/1.19 ) ) ==> domain( addition( X, Y ) ) }.
% 0.83/1.19 parent1[0; 8]: (219) {G0,W12,D5,L1,V0,M1} { ! domain( addition( domain(
% 0.83/1.19 skol1 ), domain( skol2 ) ) ) = addition( domain( skol1 ), domain( skol2 )
% 0.83/1.19 ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := skol1
% 0.83/1.19 Y := skol2
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 paramod: (298) {G1,W10,D5,L1,V0,M1} { ! domain( domain( addition( skol1,
% 0.83/1.19 skol2 ) ) ) = domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 parent0[0]: (17) {G0,W10,D4,L1,V2,M1} I { addition( domain( X ), domain( Y
% 0.83/1.19 ) ) ==> domain( addition( X, Y ) ) }.
% 0.83/1.19 parent1[0; 3]: (297) {G1,W11,D5,L1,V0,M1} { ! domain( addition( domain(
% 0.83/1.19 skol1 ), domain( skol2 ) ) ) = domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := skol1
% 0.83/1.19 Y := 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: (18) {G1,W10,D5,L1,V0,M1} I;d(17) { ! domain( domain( addition
% 0.83/1.19 ( skol1, skol2 ) ) ) ==> domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 parent0: (298) {G1,W10,D5,L1,V0,M1} { ! domain( domain( addition( skol1,
% 0.83/1.19 skol2 ) ) ) = domain( addition( skol1, 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 eqswap: (303) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) ==>
% 0.83/1.19 domain( multiplication( X, domain( Y ) ) ) }.
% 0.83/1.19 parent0[0]: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain
% 0.83/1.19 ( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.83/1.19 substitution0:
% 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 paramod: (306) {G1,W8,D4,L1,V1,M1} { domain( multiplication( one, X ) )
% 0.83/1.19 ==> domain( domain( X ) ) }.
% 0.83/1.19 parent0[0]: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.83/1.19 parent1[0; 6]: (303) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y )
% 0.83/1.19 ) ==> domain( multiplication( X, domain( Y ) ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := domain( X )
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 X := one
% 0.83/1.19 Y := X
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 paramod: (308) {G1,W6,D4,L1,V1,M1} { domain( X ) ==> domain( domain( X ) )
% 0.83/1.19 }.
% 0.83/1.19 parent0[0]: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.83/1.19 parent1[0; 2]: (306) {G1,W8,D4,L1,V1,M1} { domain( multiplication( one, X
% 0.83/1.19 ) ) ==> domain( domain( X ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 X := X
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 eqswap: (309) {G1,W6,D4,L1,V1,M1} { domain( domain( X ) ) ==> domain( X )
% 0.83/1.19 }.
% 0.83/1.19 parent0[0]: (308) {G1,W6,D4,L1,V1,M1} { domain( X ) ==> domain( domain( X
% 0.83/1.19 ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := X
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (139) {G1,W6,D4,L1,V1,M1} P(6,14);d(6) { domain( domain( X ) )
% 0.83/1.19 ==> domain( X ) }.
% 0.83/1.19 parent0: (309) {G1,W6,D4,L1,V1,M1} { domain( domain( X ) ) ==> domain( X )
% 0.83/1.19 }.
% 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 paramod: (312) {G2,W9,D4,L1,V0,M1} { ! domain( addition( skol1, skol2 ) )
% 0.83/1.19 ==> domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 parent0[0]: (139) {G1,W6,D4,L1,V1,M1} P(6,14);d(6) { domain( domain( X ) )
% 0.83/1.19 ==> domain( X ) }.
% 0.83/1.19 parent1[0; 2]: (18) {G1,W10,D5,L1,V0,M1} I;d(17) { ! domain( domain(
% 0.83/1.19 addition( skol1, skol2 ) ) ) ==> domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 X := addition( skol1, skol2 )
% 0.83/1.19 end
% 0.83/1.19 substitution1:
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 eqrefl: (313) {G0,W0,D0,L0,V0,M0} { }.
% 0.83/1.19 parent0[0]: (312) {G2,W9,D4,L1,V0,M1} { ! domain( addition( skol1, skol2 )
% 0.83/1.19 ) ==> domain( addition( skol1, skol2 ) ) }.
% 0.83/1.19 substitution0:
% 0.83/1.19 end
% 0.83/1.19
% 0.83/1.19 subsumption: (199) {G2,W0,D0,L0,V0,M0} S(18);d(139);q { }.
% 0.83/1.19 parent0: (313) {G0,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: 2544
% 0.83/1.19 space for clauses: 14093
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 clauses generated: 1346
% 0.83/1.19 clauses kept: 200
% 0.83/1.19 clauses selected: 44
% 0.83/1.19 clauses deleted: 2
% 0.83/1.19 clauses inuse deleted: 0
% 0.83/1.19
% 0.83/1.19 subsentry: 2097
% 0.83/1.19 literals s-matched: 1379
% 0.83/1.19 literals matched: 1374
% 0.83/1.19 full subsumption: 160
% 0.83/1.19
% 0.83/1.19 checksum: -1715642962
% 0.83/1.19
% 0.83/1.19
% 0.83/1.19 Bliksem ended
%------------------------------------------------------------------------------