TSTP Solution File: SYN071+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN071+1 : TPTP v8.1.0. Released v2.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 : Thu Jul 21 02:47:26 EDT 2022
% Result : Theorem 0.44s 1.15s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/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 : Mon Jul 11 16:11:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.15 *** allocated 10000 integers for termspace/termends
% 0.44/1.15 *** allocated 10000 integers for clauses
% 0.44/1.15 *** allocated 10000 integers for justifications
% 0.44/1.15 Bliksem 1.12
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Automatic Strategy Selection
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Clauses:
% 0.44/1.15
% 0.44/1.15 { a = b, c = d }.
% 0.44/1.15 { a = c, b = d }.
% 0.44/1.15 { ! a = d }.
% 0.44/1.15 { ! b = c }.
% 0.44/1.15
% 0.44/1.15 percentage equality = 1.000000, percentage horn = 0.500000
% 0.44/1.15 This is a pure equality problem
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Options Used:
% 0.44/1.15
% 0.44/1.15 useres = 1
% 0.44/1.15 useparamod = 1
% 0.44/1.15 useeqrefl = 1
% 0.44/1.15 useeqfact = 1
% 0.44/1.15 usefactor = 1
% 0.44/1.15 usesimpsplitting = 0
% 0.44/1.15 usesimpdemod = 5
% 0.44/1.15 usesimpres = 3
% 0.44/1.15
% 0.44/1.15 resimpinuse = 1000
% 0.44/1.15 resimpclauses = 20000
% 0.44/1.15 substype = eqrewr
% 0.44/1.15 backwardsubs = 1
% 0.44/1.15 selectoldest = 5
% 0.44/1.15
% 0.44/1.15 litorderings [0] = split
% 0.44/1.15 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.15
% 0.44/1.15 termordering = kbo
% 0.44/1.15
% 0.44/1.15 litapriori = 0
% 0.44/1.15 termapriori = 1
% 0.44/1.15 litaposteriori = 0
% 0.44/1.15 termaposteriori = 0
% 0.44/1.15 demodaposteriori = 0
% 0.44/1.15 ordereqreflfact = 0
% 0.44/1.15
% 0.44/1.15 litselect = negord
% 0.44/1.15
% 0.44/1.15 maxweight = 15
% 0.44/1.15 maxdepth = 30000
% 0.44/1.15 maxlength = 115
% 0.44/1.15 maxnrvars = 195
% 0.44/1.15 excuselevel = 1
% 0.44/1.15 increasemaxweight = 1
% 0.44/1.15
% 0.44/1.15 maxselected = 10000000
% 0.44/1.15 maxnrclauses = 10000000
% 0.44/1.15
% 0.44/1.15 showgenerated = 0
% 0.44/1.15 showkept = 0
% 0.44/1.15 showselected = 0
% 0.44/1.15 showdeleted = 0
% 0.44/1.15 showresimp = 1
% 0.44/1.15 showstatus = 2000
% 0.44/1.15
% 0.44/1.15 prologoutput = 0
% 0.44/1.15 nrgoals = 5000000
% 0.44/1.15 totalproof = 1
% 0.44/1.15
% 0.44/1.15 Symbols occurring in the translation:
% 0.44/1.15
% 0.44/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.15 . [1, 2] (w:1, o:15, a:1, s:1, b:0),
% 0.44/1.15 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.44/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.15 a [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.44/1.15 b [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.44/1.15 c [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.44/1.15 d [38, 0] (w:1, o:9, a:1, s:1, b:0).
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Starting Search:
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Bliksems!, er is een bewijs:
% 0.44/1.15 % SZS status Theorem
% 0.44/1.15 % SZS output start Refutation
% 0.44/1.15
% 0.44/1.15 (0) {G0,W6,D2,L2,V0,M2} I { b ==> a, d ==> c }.
% 0.44/1.15 (1) {G0,W6,D2,L2,V0,M2} I { c ==> a, d ==> b }.
% 0.44/1.15 (2) {G0,W3,D2,L1,V0,M1} I { ! d ==> a }.
% 0.44/1.15 (3) {G0,W3,D2,L1,V0,M1} I { ! c ==> b }.
% 0.44/1.15 (4) {G1,W6,D2,L2,V0,M2} P(1,2) { ! b ==> a, c ==> a }.
% 0.44/1.15 (6) {G2,W6,D2,L2,V0,M2} P(4,3) { ! b ==> a, ! b ==> a }.
% 0.44/1.15 (7) {G3,W3,D2,L1,V0,M1} F(6) { ! b ==> a }.
% 0.44/1.15 (8) {G4,W3,D2,L1,V0,M1} S(0);r(7) { d ==> c }.
% 0.44/1.15 (9) {G5,W3,D2,L1,V0,M1} P(8,1);r(3) { c ==> a }.
% 0.44/1.15 (10) {G6,W0,D0,L0,V0,M0} P(8,2);d(9);q { }.
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 % SZS output end Refutation
% 0.44/1.15 found a proof!
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Unprocessed initial clauses:
% 0.44/1.15
% 0.44/1.15 (12) {G0,W6,D2,L2,V0,M2} { a = b, c = d }.
% 0.44/1.15 (13) {G0,W6,D2,L2,V0,M2} { a = c, b = d }.
% 0.44/1.15 (14) {G0,W3,D2,L1,V0,M1} { ! a = d }.
% 0.44/1.15 (15) {G0,W3,D2,L1,V0,M1} { ! b = c }.
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 Total Proof:
% 0.44/1.15
% 0.44/1.15 eqswap: (17) {G0,W6,D2,L2,V0,M2} { d = c, a = b }.
% 0.44/1.15 parent0[1]: (12) {G0,W6,D2,L2,V0,M2} { a = b, c = d }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (18) {G0,W6,D2,L2,V0,M2} { b = a, d = c }.
% 0.44/1.15 parent0[1]: (17) {G0,W6,D2,L2,V0,M2} { d = c, a = b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (0) {G0,W6,D2,L2,V0,M2} I { b ==> a, d ==> c }.
% 0.44/1.15 parent0: (18) {G0,W6,D2,L2,V0,M2} { b = a, d = c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 1 ==> 1
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (23) {G0,W6,D2,L2,V0,M2} { d = b, a = c }.
% 0.44/1.15 parent0[1]: (13) {G0,W6,D2,L2,V0,M2} { a = c, b = d }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (24) {G0,W6,D2,L2,V0,M2} { c = a, d = b }.
% 0.44/1.15 parent0[1]: (23) {G0,W6,D2,L2,V0,M2} { d = b, a = c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (1) {G0,W6,D2,L2,V0,M2} I { c ==> a, d ==> b }.
% 0.44/1.15 parent0: (24) {G0,W6,D2,L2,V0,M2} { c = a, d = b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 1 ==> 1
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (31) {G0,W3,D2,L1,V0,M1} { ! d = a }.
% 0.44/1.15 parent0[0]: (14) {G0,W3,D2,L1,V0,M1} { ! a = d }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (2) {G0,W3,D2,L1,V0,M1} I { ! d ==> a }.
% 0.44/1.15 parent0: (31) {G0,W3,D2,L1,V0,M1} { ! d = a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (39) {G0,W3,D2,L1,V0,M1} { ! c = b }.
% 0.44/1.15 parent0[0]: (15) {G0,W3,D2,L1,V0,M1} { ! b = c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (3) {G0,W3,D2,L1,V0,M1} I { ! c ==> b }.
% 0.44/1.15 parent0: (39) {G0,W3,D2,L1,V0,M1} { ! c = b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (40) {G0,W6,D2,L2,V0,M2} { a ==> c, d ==> b }.
% 0.44/1.15 parent0[0]: (1) {G0,W6,D2,L2,V0,M2} I { c ==> a, d ==> b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (43) {G0,W3,D2,L1,V0,M1} { ! a ==> d }.
% 0.44/1.15 parent0[0]: (2) {G0,W3,D2,L1,V0,M1} I { ! d ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 paramod: (44) {G1,W6,D2,L2,V0,M2} { ! a ==> b, a ==> c }.
% 0.44/1.15 parent0[1]: (40) {G0,W6,D2,L2,V0,M2} { a ==> c, d ==> b }.
% 0.44/1.15 parent1[0; 3]: (43) {G0,W3,D2,L1,V0,M1} { ! a ==> d }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (46) {G1,W6,D2,L2,V0,M2} { c ==> a, ! a ==> b }.
% 0.44/1.15 parent0[1]: (44) {G1,W6,D2,L2,V0,M2} { ! a ==> b, a ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (47) {G1,W6,D2,L2,V0,M2} { ! b ==> a, c ==> a }.
% 0.44/1.15 parent0[1]: (46) {G1,W6,D2,L2,V0,M2} { c ==> a, ! a ==> b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (4) {G1,W6,D2,L2,V0,M2} P(1,2) { ! b ==> a, c ==> a }.
% 0.44/1.15 parent0: (47) {G1,W6,D2,L2,V0,M2} { ! b ==> a, c ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 1 ==> 1
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (48) {G1,W6,D2,L2,V0,M2} { ! a ==> b, c ==> a }.
% 0.44/1.15 parent0[0]: (4) {G1,W6,D2,L2,V0,M2} P(1,2) { ! b ==> a, c ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (51) {G0,W3,D2,L1,V0,M1} { ! b ==> c }.
% 0.44/1.15 parent0[0]: (3) {G0,W3,D2,L1,V0,M1} I { ! c ==> b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 paramod: (52) {G1,W6,D2,L2,V0,M2} { ! b ==> a, ! a ==> b }.
% 0.44/1.15 parent0[1]: (48) {G1,W6,D2,L2,V0,M2} { ! a ==> b, c ==> a }.
% 0.44/1.15 parent1[0; 3]: (51) {G0,W3,D2,L1,V0,M1} { ! b ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (54) {G1,W6,D2,L2,V0,M2} { ! b ==> a, ! b ==> a }.
% 0.44/1.15 parent0[1]: (52) {G1,W6,D2,L2,V0,M2} { ! b ==> a, ! a ==> b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (6) {G2,W6,D2,L2,V0,M2} P(4,3) { ! b ==> a, ! b ==> a }.
% 0.44/1.15 parent0: (54) {G1,W6,D2,L2,V0,M2} { ! b ==> a, ! b ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 1 ==> 0
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 factor: (57) {G2,W3,D2,L1,V0,M1} { ! b ==> a }.
% 0.44/1.15 parent0[0, 1]: (6) {G2,W6,D2,L2,V0,M2} P(4,3) { ! b ==> a, ! b ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (7) {G3,W3,D2,L1,V0,M1} F(6) { ! b ==> a }.
% 0.44/1.15 parent0: (57) {G2,W3,D2,L1,V0,M1} { ! b ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 resolution: (62) {G1,W3,D2,L1,V0,M1} { d ==> c }.
% 0.44/1.15 parent0[0]: (7) {G3,W3,D2,L1,V0,M1} F(6) { ! b ==> a }.
% 0.44/1.15 parent1[0]: (0) {G0,W6,D2,L2,V0,M2} I { b ==> a, d ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (8) {G4,W3,D2,L1,V0,M1} S(0);r(7) { d ==> c }.
% 0.44/1.15 parent0: (62) {G1,W3,D2,L1,V0,M1} { d ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (64) {G4,W3,D2,L1,V0,M1} { c ==> d }.
% 0.44/1.15 parent0[0]: (8) {G4,W3,D2,L1,V0,M1} S(0);r(7) { d ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (65) {G0,W6,D2,L2,V0,M2} { a ==> c, d ==> b }.
% 0.44/1.15 parent0[0]: (1) {G0,W6,D2,L2,V0,M2} I { c ==> a, d ==> b }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 paramod: (69) {G1,W6,D2,L2,V0,M2} { c ==> b, a ==> c }.
% 0.44/1.15 parent0[1]: (65) {G0,W6,D2,L2,V0,M2} { a ==> c, d ==> b }.
% 0.44/1.15 parent1[0; 2]: (64) {G4,W3,D2,L1,V0,M1} { c ==> d }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 resolution: (70) {G1,W3,D2,L1,V0,M1} { a ==> c }.
% 0.44/1.15 parent0[0]: (3) {G0,W3,D2,L1,V0,M1} I { ! c ==> b }.
% 0.44/1.15 parent1[0]: (69) {G1,W6,D2,L2,V0,M2} { c ==> b, a ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (71) {G1,W3,D2,L1,V0,M1} { c ==> a }.
% 0.44/1.15 parent0[0]: (70) {G1,W3,D2,L1,V0,M1} { a ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (9) {G5,W3,D2,L1,V0,M1} P(8,1);r(3) { c ==> a }.
% 0.44/1.15 parent0: (71) {G1,W3,D2,L1,V0,M1} { c ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 0 ==> 0
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqswap: (73) {G0,W3,D2,L1,V0,M1} { ! a ==> d }.
% 0.44/1.15 parent0[0]: (2) {G0,W3,D2,L1,V0,M1} I { ! d ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 paramod: (75) {G1,W3,D2,L1,V0,M1} { ! a ==> c }.
% 0.44/1.15 parent0[0]: (8) {G4,W3,D2,L1,V0,M1} S(0);r(7) { d ==> c }.
% 0.44/1.15 parent1[0; 3]: (73) {G0,W3,D2,L1,V0,M1} { ! a ==> d }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 paramod: (76) {G2,W3,D2,L1,V0,M1} { ! a ==> a }.
% 0.44/1.15 parent0[0]: (9) {G5,W3,D2,L1,V0,M1} P(8,1);r(3) { c ==> a }.
% 0.44/1.15 parent1[0; 3]: (75) {G1,W3,D2,L1,V0,M1} { ! a ==> c }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 substitution1:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 eqrefl: (77) {G0,W0,D0,L0,V0,M0} { }.
% 0.44/1.15 parent0[0]: (76) {G2,W3,D2,L1,V0,M1} { ! a ==> a }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 subsumption: (10) {G6,W0,D0,L0,V0,M0} P(8,2);d(9);q { }.
% 0.44/1.15 parent0: (77) {G0,W0,D0,L0,V0,M0} { }.
% 0.44/1.15 substitution0:
% 0.44/1.15 end
% 0.44/1.15 permutation0:
% 0.44/1.15 end
% 0.44/1.15
% 0.44/1.15 Proof check complete!
% 0.44/1.16
% 0.44/1.16 Memory use:
% 0.44/1.16
% 0.44/1.16 space for terms: 105
% 0.44/1.16 space for clauses: 555
% 0.44/1.16
% 0.44/1.16
% 0.44/1.16 clauses generated: 22
% 0.44/1.16 clauses kept: 11
% 0.44/1.16 clauses selected: 6
% 0.44/1.16 clauses deleted: 1
% 0.44/1.16 clauses inuse deleted: 0
% 0.44/1.16
% 0.44/1.16 subsentry: 423
% 0.44/1.16 literals s-matched: 143
% 0.44/1.16 literals matched: 143
% 0.44/1.16 full subsumption: 0
% 0.44/1.16
% 0.44/1.16 checksum: 61914
% 0.44/1.16
% 0.44/1.16
% 0.44/1.16 Bliksem ended
%------------------------------------------------------------------------------