TSTP Solution File: KLE074+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:02 EDT 2022
% Result : Theorem 0.44s 1.10s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n015.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.34 % DateTime : Thu Jun 16 09:42:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.10 *** allocated 10000 integers for termspace/termends
% 0.44/1.10 *** allocated 10000 integers for clauses
% 0.44/1.10 *** allocated 10000 integers for justifications
% 0.44/1.10 Bliksem 1.12
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Automatic Strategy Selection
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Clauses:
% 0.44/1.10
% 0.44/1.10 { addition( X, Y ) = addition( Y, X ) }.
% 0.44/1.10 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.44/1.10 { addition( X, zero ) = X }.
% 0.44/1.10 { addition( X, X ) = X }.
% 0.44/1.10 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.44/1.10 multiplication( X, Y ), Z ) }.
% 0.44/1.10 { multiplication( X, one ) = X }.
% 0.44/1.10 { multiplication( one, X ) = X }.
% 0.44/1.10 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.44/1.10 , multiplication( X, Z ) ) }.
% 0.44/1.10 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.44/1.10 , multiplication( Y, Z ) ) }.
% 0.44/1.10 { multiplication( X, zero ) = zero }.
% 0.44/1.10 { multiplication( zero, X ) = zero }.
% 0.44/1.10 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.44/1.10 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.44/1.10 { addition( X, multiplication( domain( X ), X ) ) = multiplication( domain
% 0.44/1.10 ( X ), X ) }.
% 0.44/1.10 { domain( multiplication( X, Y ) ) = domain( multiplication( X, domain( Y )
% 0.44/1.10 ) ) }.
% 0.44/1.10 { addition( domain( X ), one ) = one }.
% 0.44/1.10 { domain( zero ) = zero }.
% 0.44/1.10 { domain( addition( X, Y ) ) = addition( domain( X ), domain( Y ) ) }.
% 0.44/1.10 { ! domain( multiplication( multiplication( skol1, skol2 ), domain( skol3 )
% 0.44/1.10 ) ) = domain( multiplication( skol1, domain( multiplication( skol2,
% 0.44/1.10 domain( skol3 ) ) ) ) ) }.
% 0.44/1.10
% 0.44/1.10 percentage equality = 0.904762, percentage horn = 1.000000
% 0.44/1.10 This is a pure equality problem
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Options Used:
% 0.44/1.10
% 0.44/1.10 useres = 1
% 0.44/1.10 useparamod = 1
% 0.44/1.10 useeqrefl = 1
% 0.44/1.10 useeqfact = 1
% 0.44/1.10 usefactor = 1
% 0.44/1.10 usesimpsplitting = 0
% 0.44/1.10 usesimpdemod = 5
% 0.44/1.10 usesimpres = 3
% 0.44/1.10
% 0.44/1.10 resimpinuse = 1000
% 0.44/1.10 resimpclauses = 20000
% 0.44/1.10 substype = eqrewr
% 0.44/1.10 backwardsubs = 1
% 0.44/1.10 selectoldest = 5
% 0.44/1.10
% 0.44/1.10 litorderings [0] = split
% 0.44/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.10
% 0.44/1.10 termordering = kbo
% 0.44/1.10
% 0.44/1.10 litapriori = 0
% 0.44/1.10 termapriori = 1
% 0.44/1.10 litaposteriori = 0
% 0.44/1.10 termaposteriori = 0
% 0.44/1.10 demodaposteriori = 0
% 0.44/1.10 ordereqreflfact = 0
% 0.44/1.10
% 0.44/1.10 litselect = negord
% 0.44/1.10
% 0.44/1.10 maxweight = 15
% 0.44/1.10 maxdepth = 30000
% 0.44/1.10 maxlength = 115
% 0.44/1.10 maxnrvars = 195
% 0.44/1.10 excuselevel = 1
% 0.44/1.10 increasemaxweight = 1
% 0.44/1.10
% 0.44/1.10 maxselected = 10000000
% 0.44/1.10 maxnrclauses = 10000000
% 0.44/1.10
% 0.44/1.10 showgenerated = 0
% 0.44/1.10 showkept = 0
% 0.44/1.10 showselected = 0
% 0.44/1.10 showdeleted = 0
% 0.44/1.10 showresimp = 1
% 0.44/1.10 showstatus = 2000
% 0.44/1.10
% 0.44/1.10 prologoutput = 0
% 0.44/1.10 nrgoals = 5000000
% 0.44/1.10 totalproof = 1
% 0.44/1.10
% 0.44/1.10 Symbols occurring in the translation:
% 0.44/1.10
% 0.44/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.10 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.10 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.44/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.10 addition [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.10 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.44/1.10 multiplication [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.44/1.10 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.44/1.10 leq [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.44/1.10 domain [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.10 skol1 [47, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.44/1.10 skol2 [48, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.44/1.10 skol3 [49, 0] (w:1, o:16, a:1, s:1, b:1).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Starting Search:
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Bliksems!, er is een bewijs:
% 0.44/1.10 % SZS status Theorem
% 0.44/1.10 % SZS output start Refutation
% 0.44/1.10
% 0.44/1.10 (4) {G0,W11,D4,L1,V3,M1} I { multiplication( X, multiplication( Y, Z ) )
% 0.44/1.10 ==> multiplication( multiplication( X, Y ), Z ) }.
% 0.44/1.10 (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain( Y ) ) )
% 0.44/1.10 ==> domain( multiplication( X, Y ) ) }.
% 0.44/1.10 (18) {G1,W0,D0,L0,V0,M0} I;d(14);d(14);d(4);d(14);q { }.
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 % SZS output end Refutation
% 0.44/1.10 found a proof!
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Unprocessed initial clauses:
% 0.44/1.10
% 0.44/1.10 (20) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.44/1.10 (21) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.44/1.10 addition( Z, Y ), X ) }.
% 0.44/1.10 (22) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.44/1.10 (23) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.44/1.10 (24) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.44/1.10 multiplication( multiplication( X, Y ), Z ) }.
% 0.44/1.10 (25) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.44/1.10 (26) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.44/1.10 (27) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.44/1.10 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.44/1.10 (28) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.44/1.10 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.44/1.10 (29) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.44/1.10 (30) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.44/1.10 (31) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.44/1.10 (32) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.44/1.10 (33) {G0,W11,D5,L1,V1,M1} { addition( X, multiplication( domain( X ), X )
% 0.44/1.10 ) = multiplication( domain( X ), X ) }.
% 0.44/1.10 (34) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) = domain(
% 0.44/1.10 multiplication( X, domain( Y ) ) ) }.
% 0.44/1.10 (35) {G0,W6,D4,L1,V1,M1} { addition( domain( X ), one ) = one }.
% 0.44/1.10 (36) {G0,W4,D3,L1,V0,M1} { domain( zero ) = zero }.
% 0.44/1.10 (37) {G0,W10,D4,L1,V2,M1} { domain( addition( X, Y ) ) = addition( domain
% 0.44/1.10 ( X ), domain( Y ) ) }.
% 0.44/1.10 (38) {G0,W16,D7,L1,V0,M1} { ! domain( multiplication( multiplication(
% 0.44/1.10 skol1, skol2 ), domain( skol3 ) ) ) = domain( multiplication( skol1,
% 0.44/1.10 domain( multiplication( skol2, domain( skol3 ) ) ) ) ) }.
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Total Proof:
% 0.44/1.10
% 0.44/1.10 subsumption: (4) {G0,W11,D4,L1,V3,M1} I { multiplication( X, multiplication
% 0.44/1.10 ( Y, Z ) ) ==> multiplication( multiplication( X, Y ), Z ) }.
% 0.44/1.10 parent0: (24) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y
% 0.44/1.10 , Z ) ) = multiplication( multiplication( X, Y ), Z ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 Z := Z
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (56) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y )
% 0.44/1.10 ) ) = domain( multiplication( X, Y ) ) }.
% 0.44/1.10 parent0[0]: (34) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) =
% 0.44/1.10 domain( multiplication( X, domain( Y ) ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X,
% 0.44/1.10 domain( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.44/1.10 parent0: (56) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y
% 0.44/1.10 ) ) ) = domain( multiplication( X, Y ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 paramod: (155) {G1,W15,D6,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( skol1, domain( multiplication( skol2, skol3 ) ) ) ) }.
% 0.44/1.10 parent0[0]: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain
% 0.44/1.10 ( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.44/1.10 parent1[0; 12]: (38) {G0,W16,D7,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( skol1, domain( multiplication( skol2, domain( skol3 ) ) )
% 0.44/1.10 ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := skol2
% 0.44/1.10 Y := skol3
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 paramod: (161) {G1,W14,D5,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( skol1, multiplication( skol2, skol3 ) ) ) }.
% 0.44/1.10 parent0[0]: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain
% 0.44/1.10 ( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.44/1.10 parent1[0; 9]: (155) {G1,W15,D6,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( skol1, domain( multiplication( skol2, skol3 ) ) ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := skol1
% 0.44/1.10 Y := multiplication( skol2, skol3 )
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 paramod: (163) {G1,W14,D5,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( multiplication( skol1, skol2 ), skol3 ) ) }.
% 0.44/1.10 parent0[0]: (4) {G0,W11,D4,L1,V3,M1} I { multiplication( X, multiplication
% 0.44/1.10 ( Y, Z ) ) ==> multiplication( multiplication( X, Y ), Z ) }.
% 0.44/1.10 parent1[0; 10]: (161) {G1,W14,D5,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( skol1, multiplication( skol2, skol3 ) ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := skol1
% 0.44/1.10 Y := skol2
% 0.44/1.10 Z := skol3
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 paramod: (164) {G1,W13,D5,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), skol3 ) ) = domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), skol3 ) ) }.
% 0.44/1.10 parent0[0]: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain
% 0.44/1.10 ( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.44/1.10 parent1[0; 2]: (163) {G1,W14,D5,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), domain( skol3 ) ) ) = domain(
% 0.44/1.10 multiplication( multiplication( skol1, skol2 ), skol3 ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := multiplication( skol1, skol2 )
% 0.44/1.10 Y := skol3
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqrefl: (165) {G0,W0,D0,L0,V0,M0} { }.
% 0.44/1.10 parent0[0]: (164) {G1,W13,D5,L1,V0,M1} { ! domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), skol3 ) ) = domain( multiplication(
% 0.44/1.10 multiplication( skol1, skol2 ), skol3 ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (18) {G1,W0,D0,L0,V0,M0} I;d(14);d(14);d(4);d(14);q { }.
% 0.44/1.10 parent0: (165) {G0,W0,D0,L0,V0,M0} { }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 Proof check complete!
% 0.44/1.10
% 0.44/1.10 Memory use:
% 0.44/1.10
% 0.44/1.10 space for terms: 560
% 0.44/1.10 space for clauses: 1733
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 clauses generated: 19
% 0.44/1.10 clauses kept: 19
% 0.44/1.10 clauses selected: 0
% 0.44/1.10 clauses deleted: 0
% 0.44/1.10 clauses inuse deleted: 0
% 0.44/1.10
% 0.44/1.10 subsentry: 429
% 0.44/1.10 literals s-matched: 157
% 0.44/1.10 literals matched: 157
% 0.44/1.10 full subsumption: 0
% 0.44/1.10
% 0.44/1.10 checksum: -1072595328
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Bliksem ended
%------------------------------------------------------------------------------