%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWX206+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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 : Tue May 5 06:56:48 PM UTC 2026
% Result : Theorem 0.66s 1.07s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWX206+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : bliksem %s
% 0.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % DateTime : Tue May 5 11:32:44 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.66/1.07 *** allocated 10000 integers for termspace/termends
% 0.66/1.07 *** allocated 10000 integers for clauses
% 0.66/1.07 *** allocated 10000 integers for justifications
% 0.66/1.07 Bliksem 1.12
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Automatic Strategy Selection
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Clauses:
% 0.66/1.07
% 0.66/1.07 { proj1S( s( X ) ) = X }.
% 0.66/1.07 { ! z = s( X ) }.
% 0.66/1.07 { x2( z, X ) = X }.
% 0.66/1.07 { x2( s( Y ), X ) = s( x2( Y, X ) ) }.
% 0.66/1.07 { ! x2( X, X ) = X }.
% 0.66/1.07
% 0.66/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.66/1.07 This is a pure equality problem
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Options Used:
% 0.66/1.07
% 0.66/1.07 useres = 1
% 0.66/1.07 useparamod = 1
% 0.66/1.07 useeqrefl = 1
% 0.66/1.07 useeqfact = 1
% 0.66/1.07 usefactor = 1
% 0.66/1.07 usesimpsplitting = 0
% 0.66/1.07 usesimpdemod = 5
% 0.66/1.07 usesimpres = 3
% 0.66/1.07
% 0.66/1.07 resimpinuse = 1000
% 0.66/1.07 resimpclauses = 20000
% 0.66/1.07 substype = eqrewr
% 0.66/1.07 backwardsubs = 1
% 0.66/1.07 selectoldest = 5
% 0.66/1.07
% 0.66/1.07 litorderings [0] = split
% 0.66/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.66/1.07
% 0.66/1.07 termordering = kbo
% 0.66/1.07
% 0.66/1.07 litapriori = 0
% 0.66/1.07 termapriori = 1
% 0.66/1.07 litaposteriori = 0
% 0.66/1.07 termaposteriori = 0
% 0.66/1.07 demodaposteriori = 0
% 0.66/1.07 ordereqreflfact = 0
% 0.66/1.07
% 0.66/1.07 litselect = negord
% 0.66/1.07
% 0.66/1.07 maxweight = 15
% 0.66/1.07 maxdepth = 30000
% 0.66/1.07 maxlength = 115
% 0.66/1.07 maxnrvars = 195
% 0.66/1.07 excuselevel = 1
% 0.66/1.07 increasemaxweight = 1
% 0.66/1.07
% 0.66/1.07 maxselected = 10000000
% 0.66/1.07 maxnrclauses = 10000000
% 0.66/1.07
% 0.66/1.07 showgenerated = 0
% 0.66/1.07 showkept = 0
% 0.66/1.07 showselected = 0
% 0.66/1.07 showdeleted = 0
% 0.66/1.07 showresimp = 1
% 0.66/1.07 showstatus = 2000
% 0.66/1.07
% 0.66/1.07 prologoutput = 0
% 0.66/1.07 nrgoals = 5000000
% 0.66/1.07 totalproof = 1
% 0.66/1.07
% 0.66/1.07 Symbols occurring in the translation:
% 0.66/1.07
% 0.66/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.66/1.07 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.66/1.07 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.66/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.07 s [36, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.66/1.07 proj1S [37, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.66/1.07 z [38, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.66/1.07 x2 [40, 2] (w:1, o:41, a:1, s:1, b:0).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Starting Search:
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Bliksems!, er is een bewijs:
% 0.66/1.07 % SZS status Theorem
% 0.66/1.07 % SZS output start Refutation
% 0.66/1.07
% 0.66/1.07 (2) {G0,W5,D3,L1,V1,M1} I { x2( z, X ) ==> X }.
% 0.66/1.07 (4) {G0,W5,D3,L1,V1,M1} I { ! x2( X, X ) ==> X }.
% 0.66/1.07 (5) {G1,W0,D0,L0,V0,M0} R(2,4) { }.
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 % SZS output end Refutation
% 0.66/1.07 found a proof!
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Unprocessed initial clauses:
% 0.66/1.07
% 0.66/1.07 (7) {G0,W5,D4,L1,V1,M1} { proj1S( s( X ) ) = X }.
% 0.66/1.07 (8) {G0,W4,D3,L1,V1,M1} { ! z = s( X ) }.
% 0.66/1.07 (9) {G0,W5,D3,L1,V1,M1} { x2( z, X ) = X }.
% 0.66/1.07 (10) {G0,W9,D4,L1,V2,M1} { x2( s( Y ), X ) = s( x2( Y, X ) ) }.
% 0.66/1.07 (11) {G0,W5,D3,L1,V1,M1} { ! x2( X, X ) = X }.
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Total Proof:
% 0.66/1.07
% 0.66/1.07 subsumption: (2) {G0,W5,D3,L1,V1,M1} I { x2( z, X ) ==> X }.
% 0.66/1.07 parent0: (9) {G0,W5,D3,L1,V1,M1} { x2( z, X ) = X }.
% 0.66/1.07 substitution0:
% 0.66/1.07 X := X
% 0.66/1.07 end
% 0.66/1.07 permutation0:
% 0.66/1.07 0 ==> 0
% 0.66/1.07 end
% 0.66/1.07
% 0.66/1.07 subsumption: (4) {G0,W5,D3,L1,V1,M1} I { ! x2( X, X ) ==> X }.
% 0.66/1.07 parent0: (11) {G0,W5,D3,L1,V1,M1} { ! x2( X, X ) = X }.
% 0.66/1.07 substitution0:
% 0.66/1.07 X := X
% 0.66/1.07 end
% 0.66/1.07 permutation0:
% 0.66/1.07 0 ==> 0
% 0.66/1.07 end
% 0.66/1.07
% 0.66/1.07 eqswap: (20) {G0,W5,D3,L1,V1,M1} { X ==> x2( z, X ) }.
% 0.66/1.07 parent0[0]: (2) {G0,W5,D3,L1,V1,M1} I { x2( z, X ) ==> X }.
% 0.66/1.07 substitution0:
% 0.66/1.07 X := X
% 0.66/1.07 end
% 0.66/1.07
% 0.66/1.07 eqswap: (21) {G0,W5,D3,L1,V1,M1} { ! X ==> x2( X, X ) }.
% 0.66/1.07 parent0[0]: (4) {G0,W5,D3,L1,V1,M1} I { ! x2( X, X ) ==> X }.
% 0.66/1.07 substitution0:
% 0.66/1.07 X := X
% 0.66/1.07 end
% 0.66/1.07
% 0.66/1.07 resolution: (22) {G1,W0,D0,L0,V0,M0} { }.
% 0.66/1.07 parent0[0]: (21) {G0,W5,D3,L1,V1,M1} { ! X ==> x2( X, X ) }.
% 0.66/1.07 parent1[0]: (20) {G0,W5,D3,L1,V1,M1} { X ==> x2( z, X ) }.
% 0.66/1.07 substitution0:
% 0.66/1.07 X := z
% 0.66/1.07 end
% 0.66/1.07 substitution1:
% 0.66/1.07 X := z
% 0.66/1.07 end
% 0.66/1.07
% 0.66/1.07 subsumption: (5) {G1,W0,D0,L0,V0,M0} R(2,4) { }.
% 0.66/1.07 parent0: (22) {G1,W0,D0,L0,V0,M0} { }.
% 0.66/1.07 substitution0:
% 0.66/1.07 end
% 0.66/1.07 permutation0:
% 0.66/1.07 end
% 0.66/1.07
% 0.66/1.07 Proof check complete!
% 0.66/1.07
% 0.66/1.07 Memory use:
% 0.66/1.07
% 0.66/1.07 space for terms: 113
% 0.66/1.07 space for clauses: 440
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 clauses generated: 6
% 0.66/1.07 clauses kept: 6
% 0.66/1.07 clauses selected: 3
% 0.66/1.07 clauses deleted: 0
% 0.66/1.07 clauses inuse deleted: 0
% 0.66/1.07
% 0.66/1.07 subsentry: 54
% 0.66/1.07 literals s-matched: 26
% 0.66/1.07 literals matched: 26
% 0.66/1.07 full subsumption: 0
% 0.66/1.07
% 0.66/1.07 checksum: 1073909699
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Bliksem ended
%------------------------------------------------------------------------------