TSTP Solution File: KLE075+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE075+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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.41s 1.06s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : KLE075+1 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Thu Jun 16 11:17:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.06 *** allocated 10000 integers for termspace/termends
% 0.41/1.06 *** allocated 10000 integers for clauses
% 0.41/1.06 *** allocated 10000 integers for justifications
% 0.41/1.06 Bliksem 1.12
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Automatic Strategy Selection
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Clauses:
% 0.41/1.06
% 0.41/1.06 { addition( X, Y ) = addition( Y, X ) }.
% 0.41/1.06 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.41/1.06 { addition( X, zero ) = X }.
% 0.41/1.06 { addition( X, X ) = X }.
% 0.41/1.06 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.41/1.06 multiplication( X, Y ), Z ) }.
% 0.41/1.06 { multiplication( X, one ) = X }.
% 0.41/1.06 { multiplication( one, X ) = X }.
% 0.41/1.06 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.41/1.06 , multiplication( X, Z ) ) }.
% 0.41/1.06 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.41/1.06 , multiplication( Y, Z ) ) }.
% 0.41/1.06 { multiplication( X, zero ) = zero }.
% 0.41/1.06 { multiplication( zero, X ) = zero }.
% 0.41/1.06 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.41/1.06 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.41/1.06 { addition( X, multiplication( domain( X ), X ) ) = multiplication( domain
% 0.41/1.06 ( X ), X ) }.
% 0.41/1.06 { domain( multiplication( X, Y ) ) = domain( multiplication( X, domain( Y )
% 0.41/1.06 ) ) }.
% 0.41/1.06 { addition( domain( X ), one ) = one }.
% 0.41/1.06 { domain( zero ) = zero }.
% 0.41/1.06 { domain( addition( X, Y ) ) = addition( domain( X ), domain( Y ) ) }.
% 0.41/1.06 { ! domain( multiplication( one, domain( skol1 ) ) ) = domain( skol1 ) }.
% 0.41/1.06
% 0.41/1.06 percentage equality = 0.904762, percentage horn = 1.000000
% 0.41/1.06 This is a pure equality problem
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Options Used:
% 0.41/1.06
% 0.41/1.06 useres = 1
% 0.41/1.06 useparamod = 1
% 0.41/1.06 useeqrefl = 1
% 0.41/1.06 useeqfact = 1
% 0.41/1.06 usefactor = 1
% 0.41/1.06 usesimpsplitting = 0
% 0.41/1.06 usesimpdemod = 5
% 0.41/1.06 usesimpres = 3
% 0.41/1.06
% 0.41/1.06 resimpinuse = 1000
% 0.41/1.06 resimpclauses = 20000
% 0.41/1.06 substype = eqrewr
% 0.41/1.06 backwardsubs = 1
% 0.41/1.06 selectoldest = 5
% 0.41/1.06
% 0.41/1.06 litorderings [0] = split
% 0.41/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.06
% 0.41/1.06 termordering = kbo
% 0.41/1.06
% 0.41/1.06 litapriori = 0
% 0.41/1.06 termapriori = 1
% 0.41/1.06 litaposteriori = 0
% 0.41/1.06 termaposteriori = 0
% 0.41/1.06 demodaposteriori = 0
% 0.41/1.06 ordereqreflfact = 0
% 0.41/1.06
% 0.41/1.06 litselect = negord
% 0.41/1.06
% 0.41/1.06 maxweight = 15
% 0.41/1.06 maxdepth = 30000
% 0.41/1.06 maxlength = 115
% 0.41/1.06 maxnrvars = 195
% 0.41/1.06 excuselevel = 1
% 0.41/1.06 increasemaxweight = 1
% 0.41/1.06
% 0.41/1.06 maxselected = 10000000
% 0.41/1.06 maxnrclauses = 10000000
% 0.41/1.06
% 0.41/1.06 showgenerated = 0
% 0.41/1.06 showkept = 0
% 0.41/1.06 showselected = 0
% 0.41/1.06 showdeleted = 0
% 0.41/1.06 showresimp = 1
% 0.41/1.06 showstatus = 2000
% 0.41/1.06
% 0.41/1.06 prologoutput = 0
% 0.41/1.06 nrgoals = 5000000
% 0.41/1.06 totalproof = 1
% 0.41/1.06
% 0.41/1.06 Symbols occurring in the translation:
% 0.41/1.06
% 0.41/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.06 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.41/1.06 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.41/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.06 addition [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.41/1.06 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.41/1.06 multiplication [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.41/1.06 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.41/1.06 leq [42, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.41/1.06 domain [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.41/1.06 skol1 [46, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Starting Search:
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksems!, er is een bewijs:
% 0.41/1.06 % SZS status Theorem
% 0.41/1.06 % SZS output start Refutation
% 0.41/1.06
% 0.41/1.06 (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.41/1.06 (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain( Y ) ) )
% 0.41/1.06 ==> domain( multiplication( X, Y ) ) }.
% 0.41/1.06 (18) {G1,W0,D0,L0,V0,M0} I;d(14);d(6);q { }.
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 % SZS output end Refutation
% 0.41/1.06 found a proof!
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Unprocessed initial clauses:
% 0.41/1.06
% 0.41/1.06 (20) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.41/1.06 (21) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.41/1.06 addition( Z, Y ), X ) }.
% 0.41/1.06 (22) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.41/1.06 (23) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.41/1.06 (24) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.41/1.06 multiplication( multiplication( X, Y ), Z ) }.
% 0.41/1.06 (25) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.41/1.06 (26) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.41/1.06 (27) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.41/1.06 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.41/1.06 (28) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.41/1.06 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.41/1.06 (29) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.41/1.06 (30) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.41/1.06 (31) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.41/1.06 (32) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.41/1.06 (33) {G0,W11,D5,L1,V1,M1} { addition( X, multiplication( domain( X ), X )
% 0.41/1.06 ) = multiplication( domain( X ), X ) }.
% 0.41/1.06 (34) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) = domain(
% 0.41/1.06 multiplication( X, domain( Y ) ) ) }.
% 0.41/1.06 (35) {G0,W6,D4,L1,V1,M1} { addition( domain( X ), one ) = one }.
% 0.41/1.06 (36) {G0,W4,D3,L1,V0,M1} { domain( zero ) = zero }.
% 0.41/1.06 (37) {G0,W10,D4,L1,V2,M1} { domain( addition( X, Y ) ) = addition( domain
% 0.41/1.06 ( X ), domain( Y ) ) }.
% 0.41/1.06 (38) {G0,W8,D5,L1,V0,M1} { ! domain( multiplication( one, domain( skol1 )
% 0.41/1.06 ) ) = domain( skol1 ) }.
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Total Proof:
% 0.41/1.06
% 0.41/1.06 subsumption: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.41/1.06 parent0: (26) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 0
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 eqswap: (58) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y )
% 0.41/1.06 ) ) = domain( multiplication( X, Y ) ) }.
% 0.41/1.06 parent0[0]: (34) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, Y ) ) =
% 0.41/1.06 domain( multiplication( X, domain( Y ) ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := Y
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X,
% 0.41/1.06 domain( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.41/1.06 parent0: (58) {G0,W10,D5,L1,V2,M1} { domain( multiplication( X, domain( Y
% 0.41/1.06 ) ) ) = domain( multiplication( X, Y ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := Y
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 0
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 paramod: (117) {G1,W7,D4,L1,V0,M1} { ! domain( multiplication( one, skol1
% 0.41/1.06 ) ) = domain( skol1 ) }.
% 0.41/1.06 parent0[0]: (14) {G0,W10,D5,L1,V2,M1} I { domain( multiplication( X, domain
% 0.41/1.06 ( Y ) ) ) ==> domain( multiplication( X, Y ) ) }.
% 0.41/1.06 parent1[0; 2]: (38) {G0,W8,D5,L1,V0,M1} { ! domain( multiplication( one,
% 0.41/1.06 domain( skol1 ) ) ) = domain( skol1 ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := one
% 0.41/1.06 Y := skol1
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 paramod: (118) {G1,W5,D3,L1,V0,M1} { ! domain( skol1 ) = domain( skol1 )
% 0.41/1.06 }.
% 0.41/1.06 parent0[0]: (6) {G0,W5,D3,L1,V1,M1} I { multiplication( one, X ) ==> X }.
% 0.41/1.06 parent1[0; 3]: (117) {G1,W7,D4,L1,V0,M1} { ! domain( multiplication( one,
% 0.41/1.06 skol1 ) ) = domain( skol1 ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := skol1
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 eqrefl: (119) {G0,W0,D0,L0,V0,M0} { }.
% 0.41/1.06 parent0[0]: (118) {G1,W5,D3,L1,V0,M1} { ! domain( skol1 ) = domain( skol1
% 0.41/1.06 ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (18) {G1,W0,D0,L0,V0,M0} I;d(14);d(6);q { }.
% 0.41/1.06 parent0: (119) {G0,W0,D0,L0,V0,M0} { }.
% 0.41/1.06 substitution0:
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 Proof check complete!
% 0.41/1.06
% 0.41/1.06 Memory use:
% 0.41/1.06
% 0.41/1.06 space for terms: 540
% 0.41/1.06 space for clauses: 1729
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 clauses generated: 19
% 0.41/1.06 clauses kept: 19
% 0.41/1.06 clauses selected: 0
% 0.41/1.06 clauses deleted: 0
% 0.41/1.06 clauses inuse deleted: 0
% 0.41/1.06
% 0.41/1.06 subsentry: 293
% 0.41/1.06 literals s-matched: 121
% 0.41/1.06 literals matched: 121
% 0.41/1.06 full subsumption: 0
% 0.41/1.06
% 0.41/1.06 checksum: -1072595649
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksem ended
%------------------------------------------------------------------------------