TSTP Solution File: KLE053+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE053+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:56 EDT 2022
% Result : Theorem 0.77s 1.18s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE053+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : bliksem %s
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % DateTime : Thu Jun 16 12:04:14 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.77/1.18 *** allocated 10000 integers for termspace/termends
% 0.77/1.18 *** allocated 10000 integers for clauses
% 0.77/1.18 *** allocated 10000 integers for justifications
% 0.77/1.18 Bliksem 1.12
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Automatic Strategy Selection
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Clauses:
% 0.77/1.18
% 0.77/1.18 { addition( X, Y ) = addition( Y, X ) }.
% 0.77/1.18 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.77/1.18 { addition( X, zero ) = X }.
% 0.77/1.18 { addition( X, X ) = X }.
% 0.77/1.18 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.77/1.18 multiplication( X, Y ), Z ) }.
% 0.77/1.18 { multiplication( X, one ) = X }.
% 0.77/1.18 { multiplication( one, X ) = X }.
% 0.77/1.18 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.77/1.18 , multiplication( X, Z ) ) }.
% 0.77/1.18 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.77/1.18 , multiplication( Y, Z ) ) }.
% 0.77/1.18 { multiplication( X, zero ) = zero }.
% 0.77/1.18 { multiplication( zero, X ) = zero }.
% 0.77/1.18 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.77/1.18 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.77/1.18 { addition( X, multiplication( domain( X ), X ) ) = multiplication( domain
% 0.77/1.18 ( X ), X ) }.
% 0.77/1.18 { domain( multiplication( X, Y ) ) = domain( multiplication( X, domain( Y )
% 0.77/1.18 ) ) }.
% 0.77/1.18 { addition( domain( X ), one ) = one }.
% 0.77/1.18 { domain( zero ) = zero }.
% 0.77/1.18 { domain( addition( X, Y ) ) = addition( domain( X ), domain( Y ) ) }.
% 0.77/1.18 { ! domain( domain( skol1 ) ) = domain( skol1 ) }.
% 0.77/1.18
% 0.77/1.18 percentage equality = 0.904762, percentage horn = 1.000000
% 0.77/1.18 This is a pure equality problem
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Options Used:
% 0.77/1.18
% 0.77/1.18 useres = 1
% 0.77/1.18 useparamod = 1
% 0.77/1.18 useeqrefl = 1
% 0.77/1.18 useeqfact = 1
% 0.77/1.18 usefactor = 1
% 0.77/1.18 usesimpsplitting = 0
% 0.77/1.18 usesimpdemod = 5
% 0.77/1.18 usesimpres = 3
% 0.77/1.18
% 0.77/1.18 resimpinuse = 1000
% 0.77/1.18 resimpclauses = 20000
% 0.77/1.18 substype = eqrewr
% 0.77/1.18 backwardsubs = 1
% 0.77/1.18 selectoldest = 5
% 0.77/1.18
% 0.77/1.18 litorderings [0] = split
% 0.77/1.18 litorderings [1] = extend the termordering, first sorting on arguments
% 0.77/1.18
% 0.77/1.18 termordering = kbo
% 0.77/1.18
% 0.77/1.18 litapriori = 0
% 0.77/1.18 termapriori = 1
% 0.77/1.18 litaposteriori = 0
% 0.77/1.18 termaposteriori = 0
% 0.77/1.18 demodaposteriori = 0
% 0.77/1.18 ordereqreflfact = 0
% 0.77/1.18
% 0.77/1.18 litselect = negord
% 0.77/1.18
% 0.77/1.18 maxweight = 15
% 0.77/1.18 maxdepth = 30000
% 0.77/1.18 maxlength = 115
% 0.77/1.18 maxnrvars = 195
% 0.77/1.18 excuselevel = 1
% 0.77/1.18 increasemaxweight = 1
% 0.77/1.18
% 0.77/1.18 maxselected = 10000000
% 0.77/1.18 maxnrclauses = 10000000
% 0.77/1.18
% 0.77/1.18 showgenerated = 0
% 0.77/1.18 showkept = 0
% 0.77/1.18 showselected = 0
% 0.77/1.18 showdeleted = 0
% 0.77/1.18 showresimp = 1
% 0.77/1.18 showstatus = 2000
% 0.77/1.18
% 0.77/1.18 prologoutput = 0
% 0.77/1.18 nrgoals = 5000000
% 0.77/1.18 totalproof = 1
% 0.77/1.18
% 0.77/1.18 Symbols occurring in the translation:
% 0.77/1.18
% 0.77/1.18 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.77/1.18 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.77/1.18 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.77/1.18 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.18 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.18 addition [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.77/1.18 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.77/1.18 multiplication [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.77/1.18 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.77/1.18 leq [42, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.77/1.18 domain [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.77/1.18 skol1 [46, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Starting Search:
% 0.77/1.18
% 0.77/1.18 *** allocated 15000 integers for clauses
% 0.77/1.18
% 0.77/1.18 Bliksems!, er is een bewijs:
% 0.77/1.18 % SZS status Theorem
% 0.77/1.18 % SZS output start Refutation
% 0.77/1.18
% 0.77/1.18 (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.77/1.18 (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain( Y ) ) )
% 0.77/1.18 ==> domain( multiplication( X, Y ) ) }.
% 0.77/1.18 (18) {G0,W6,D4,L1,V0,M1} I { ! domain( domain( skol1 ) ) ==> domain( skol1
% 0.77/1.18 ) }.
% 0.77/1.18 (128) {G1,W6,D4,L1,V1,M1} P(6,14);d(6) { domain( domain( X ) ) ==> domain(
% 0.77/1.18 X ) }.
% 0.77/1.18 (181) {G2,W0,D0,L0,V0,M0} R(128,18) { }.
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 % SZS output end Refutation
% 0.77/1.18 found a proof!
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Unprocessed initial clauses:
% 0.77/1.18
% 0.77/1.18 (183) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.77/1.18 (184) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.77/1.18 addition( Z, Y ), X ) }.
% 0.77/1.18 (185) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.77/1.18 (186) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.77/1.18 (187) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.77/1.18 multiplication( multiplication( X, Y ), Z ) }.
% 0.77/1.18 (188) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.77/1.18 (189) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.77/1.18 (190) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.77/1.18 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.77/1.18 (191) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.77/1.18 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.77/1.18 (192) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.77/1.18 (193) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.77/1.18 (194) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.77/1.18 (195) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.77/1.18 (196) {G0,W11,D5,L1,V1,M1} { addition( X, multiplication( domain( X ), X )
% 0.77/1.18 ) = multiplication( domain( X ), X ) }.
% 0.77/1.18 (197) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) = domain(
% 0.77/1.18 multiplication( X, domain( Y ) ) ) }.
% 0.77/1.18 (198) {G0,W6,D4,L1,V1,M1} { addition( domain( X ), one ) = one }.
% 0.77/1.18 (199) {G0,W4,D3,L1,V0,M1} { domain( zero ) = zero }.
% 0.77/1.18 (200) {G0,W10,D4,L1,V2,M1} { domain( addition( X, Y ) ) = addition( domain
% 0.77/1.18 ( X ), domain( Y ) ) }.
% 0.77/1.18 (201) {G0,W6,D4,L1,V0,M1} { ! domain( domain( skol1 ) ) = domain( skol1 )
% 0.77/1.18 }.
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Total Proof:
% 0.77/1.18
% 0.77/1.18 subsumption: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.77/1.18 parent0: (189) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 end
% 0.77/1.18 permutation0:
% 0.77/1.18 0 ==> 0
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 eqswap: (221) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y
% 0.77/1.18 ) ) ) = domain( multiplication( X, Y ) ) }.
% 0.77/1.18 parent0[0]: (197) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) )
% 0.77/1.18 = domain( multiplication( X, domain( Y ) ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 Y := Y
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 subsumption: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X,
% 0.77/1.18 domain( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.77/1.18 parent0: (221) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y
% 0.77/1.18 ) ) ) = domain( multiplication( X, Y ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 Y := Y
% 0.77/1.18 end
% 0.77/1.18 permutation0:
% 0.77/1.18 0 ==> 0
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 subsumption: (18) {G0,W6,D4,L1,V0,M1} I { ! domain( domain( skol1 ) ) ==>
% 0.77/1.18 domain( skol1 ) }.
% 0.77/1.18 parent0: (201) {G0,W6,D4,L1,V0,M1} { ! domain( domain( skol1 ) ) = domain
% 0.77/1.18 ( skol1 ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 end
% 0.77/1.18 permutation0:
% 0.77/1.18 0 ==> 0
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 eqswap: (241) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) ==>
% 0.77/1.18 domain( multiplication( X, domain( Y ) ) ) }.
% 0.77/1.18 parent0[0]: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain
% 0.77/1.18 ( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 Y := Y
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 paramod: (244) {G1,W8,D4,L1,V1,M1} { domain( multiplication( one, X ) )
% 0.77/1.18 ==> domain( domain( X ) ) }.
% 0.77/1.18 parent0[0]: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.77/1.18 parent1[0; 6]: (241) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y )
% 0.77/1.18 ) ==> domain( multiplication( X, domain( Y ) ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := domain( X )
% 0.77/1.18 end
% 0.77/1.18 substitution1:
% 0.77/1.18 X := one
% 0.77/1.18 Y := X
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 paramod: (246) {G1,W6,D4,L1,V1,M1} { domain( X ) ==> domain( domain( X ) )
% 0.77/1.18 }.
% 0.77/1.18 parent0[0]: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.77/1.18 parent1[0; 2]: (244) {G1,W8,D4,L1,V1,M1} { domain( multiplication( one, X
% 0.77/1.18 ) ) ==> domain( domain( X ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 end
% 0.77/1.18 substitution1:
% 0.77/1.18 X := X
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 eqswap: (247) {G1,W6,D4,L1,V1,M1} { domain( domain( X ) ) ==> domain( X )
% 0.77/1.18 }.
% 0.77/1.18 parent0[0]: (246) {G1,W6,D4,L1,V1,M1} { domain( X ) ==> domain( domain( X
% 0.77/1.18 ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 subsumption: (128) {G1,W6,D4,L1,V1,M1} P(6,14);d(6) { domain( domain( X ) )
% 0.77/1.18 ==> domain( X ) }.
% 0.77/1.18 parent0: (247) {G1,W6,D4,L1,V1,M1} { domain( domain( X ) ) ==> domain( X )
% 0.77/1.18 }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 end
% 0.77/1.18 permutation0:
% 0.77/1.18 0 ==> 0
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 eqswap: (248) {G1,W6,D4,L1,V1,M1} { domain( X ) ==> domain( domain( X ) )
% 0.77/1.18 }.
% 0.77/1.18 parent0[0]: (128) {G1,W6,D4,L1,V1,M1} P(6,14);d(6) { domain( domain( X ) )
% 0.77/1.18 ==> domain( X ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 X := X
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 eqswap: (249) {G0,W6,D4,L1,V0,M1} { ! domain( skol1 ) ==> domain( domain(
% 0.77/1.18 skol1 ) ) }.
% 0.77/1.18 parent0[0]: (18) {G0,W6,D4,L1,V0,M1} I { ! domain( domain( skol1 ) ) ==>
% 0.77/1.18 domain( skol1 ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 resolution: (250) {G1,W0,D0,L0,V0,M0} { }.
% 0.77/1.18 parent0[0]: (249) {G0,W6,D4,L1,V0,M1} { ! domain( skol1 ) ==> domain(
% 0.77/1.18 domain( skol1 ) ) }.
% 0.77/1.18 parent1[0]: (248) {G1,W6,D4,L1,V1,M1} { domain( X ) ==> domain( domain( X
% 0.77/1.18 ) ) }.
% 0.77/1.18 substitution0:
% 0.77/1.18 end
% 0.77/1.18 substitution1:
% 0.77/1.18 X := skol1
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 subsumption: (181) {G2,W0,D0,L0,V0,M0} R(128,18) { }.
% 0.77/1.18 parent0: (250) {G1,W0,D0,L0,V0,M0} { }.
% 0.77/1.18 substitution0:
% 0.77/1.18 end
% 0.77/1.18 permutation0:
% 0.77/1.18 end
% 0.77/1.18
% 0.77/1.18 Proof check complete!
% 0.77/1.18
% 0.77/1.18 Memory use:
% 0.77/1.18
% 0.77/1.18 space for terms: 2275
% 0.77/1.18 space for clauses: 12914
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 clauses generated: 914
% 0.77/1.18 clauses kept: 182
% 0.77/1.18 clauses selected: 50
% 0.77/1.18 clauses deleted: 0
% 0.77/1.18 clauses inuse deleted: 0
% 0.77/1.18
% 0.77/1.18 subsentry: 905
% 0.77/1.18 literals s-matched: 683
% 0.77/1.18 literals matched: 683
% 0.77/1.18 full subsumption: 43
% 0.77/1.18
% 0.77/1.18 checksum: 1364614631
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 Bliksem ended
%------------------------------------------------------------------------------