TSTP Solution File: SEU150+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU150+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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 Jul 19 07:10:56 EDT 2022
% Result : Theorem 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU150+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : bliksem %s
% 0.13/0.34 % Computer : n005.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 : Sun Jun 19 15:25:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.07 *** allocated 10000 integers for termspace/termends
% 0.45/1.07 *** allocated 10000 integers for clauses
% 0.45/1.07 *** allocated 10000 integers for justifications
% 0.45/1.07 Bliksem 1.12
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Automatic Strategy Selection
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Clauses:
% 0.45/1.07
% 0.45/1.07 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.45/1.07 { empty( skol1 ) }.
% 0.45/1.07 { ! empty( skol2 ) }.
% 0.45/1.07 { ! singleton( X ) = unordered_pair( Y, Z ), X = Y }.
% 0.45/1.07 { singleton( skol5 ) = unordered_pair( skol3, skol4 ) }.
% 0.45/1.07 { ! skol3 = skol4 }.
% 0.45/1.07
% 0.45/1.07 percentage equality = 0.714286, percentage horn = 1.000000
% 0.45/1.07 This is a problem with some equality
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Options Used:
% 0.45/1.07
% 0.45/1.07 useres = 1
% 0.45/1.07 useparamod = 1
% 0.45/1.07 useeqrefl = 1
% 0.45/1.07 useeqfact = 1
% 0.45/1.07 usefactor = 1
% 0.45/1.07 usesimpsplitting = 0
% 0.45/1.07 usesimpdemod = 5
% 0.45/1.07 usesimpres = 3
% 0.45/1.07
% 0.45/1.07 resimpinuse = 1000
% 0.45/1.07 resimpclauses = 20000
% 0.45/1.07 substype = eqrewr
% 0.45/1.07 backwardsubs = 1
% 0.45/1.07 selectoldest = 5
% 0.45/1.07
% 0.45/1.07 litorderings [0] = split
% 0.45/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.07
% 0.45/1.07 termordering = kbo
% 0.45/1.07
% 0.45/1.07 litapriori = 0
% 0.45/1.07 termapriori = 1
% 0.45/1.07 litaposteriori = 0
% 0.45/1.07 termaposteriori = 0
% 0.45/1.07 demodaposteriori = 0
% 0.45/1.07 ordereqreflfact = 0
% 0.45/1.07
% 0.45/1.07 litselect = negord
% 0.45/1.07
% 0.45/1.07 maxweight = 15
% 0.45/1.07 maxdepth = 30000
% 0.45/1.07 maxlength = 115
% 0.45/1.07 maxnrvars = 195
% 0.45/1.07 excuselevel = 1
% 0.45/1.07 increasemaxweight = 1
% 0.45/1.07
% 0.45/1.07 maxselected = 10000000
% 0.45/1.07 maxnrclauses = 10000000
% 0.45/1.07
% 0.45/1.07 showgenerated = 0
% 0.45/1.07 showkept = 0
% 0.45/1.07 showselected = 0
% 0.45/1.07 showdeleted = 0
% 0.45/1.07 showresimp = 1
% 0.45/1.07 showstatus = 2000
% 0.45/1.07
% 0.45/1.07 prologoutput = 0
% 0.45/1.07 nrgoals = 5000000
% 0.45/1.07 totalproof = 1
% 0.45/1.07
% 0.45/1.07 Symbols occurring in the translation:
% 0.45/1.07
% 0.45/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.45/1.07 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.45/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 unordered_pair [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.45/1.07 empty [38, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.45/1.07 singleton [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.07 skol1 [41, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.45/1.07 skol2 [42, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.45/1.07 skol3 [43, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.45/1.07 skol4 [44, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.45/1.07 skol5 [45, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Starting Search:
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Bliksems!, er is een bewijs:
% 0.45/1.07 % SZS status Theorem
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.45/1.07 }.
% 0.45/1.07 (3) {G0,W9,D3,L2,V3,M2} I { ! singleton( X ) = unordered_pair( Y, Z ), X =
% 0.45/1.07 Y }.
% 0.45/1.07 (4) {G0,W6,D3,L1,V0,M1} I { unordered_pair( skol3, skol4 ) ==> singleton(
% 0.45/1.07 skol5 ) }.
% 0.45/1.07 (5) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> skol3 }.
% 0.45/1.07 (6) {G1,W6,D3,L1,V0,M1} P(0,4) { unordered_pair( skol4, skol3 ) ==>
% 0.45/1.07 singleton( skol5 ) }.
% 0.45/1.07 (15) {G1,W8,D3,L2,V1,M2} P(4,3) { ! singleton( X ) = singleton( skol5 ), X
% 0.45/1.07 = skol3 }.
% 0.45/1.07 (21) {G1,W9,D3,L2,V2,M2} P(3,5) { ! X = skol3, ! singleton( X ) =
% 0.45/1.07 unordered_pair( skol4, Y ) }.
% 0.45/1.07 (26) {G2,W6,D3,L1,V1,M1} Q(21) { ! unordered_pair( skol4, X ) ==> singleton
% 0.45/1.07 ( skol3 ) }.
% 0.45/1.07 (28) {G2,W3,D2,L1,V0,M1} Q(15) { skol5 ==> skol3 }.
% 0.45/1.07 (51) {G3,W0,D0,L0,V0,M0} S(6);d(28);r(26) { }.
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 found a proof!
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Unprocessed initial clauses:
% 0.45/1.07
% 0.45/1.07 (53) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.45/1.07 }.
% 0.45/1.07 (54) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.45/1.07 (55) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.45/1.07 (56) {G0,W9,D3,L2,V3,M2} { ! singleton( X ) = unordered_pair( Y, Z ), X =
% 0.45/1.07 Y }.
% 0.45/1.07 (57) {G0,W6,D3,L1,V0,M1} { singleton( skol5 ) = unordered_pair( skol3,
% 0.45/1.07 skol4 ) }.
% 0.45/1.07 (58) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol4 }.
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Total Proof:
% 0.45/1.07
% 0.45/1.07 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.45/1.07 unordered_pair( Y, X ) }.
% 0.45/1.07 parent0: (53) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) =
% 0.45/1.07 unordered_pair( Y, X ) }.
% 0.45/1.07 substitution0:
% 0.45/1.07 X := X
% 0.45/1.07 Y := Y
% 0.45/1.07 end
% 0.45/1.07 permutation0:
% 0.45/1.07 0 ==> 0
% 0.45/1.07 end
% 0.45/1.07
% 0.45/1.07 subsumption: (3) {G0,W9,D3,L2,V3,M2} I { ! singleton( X ) = unordered_pair
% 0.45/1.07 ( Y, Z ), X = Y }.
% 0.45/1.07 parent0: (56) {G0,W9,D3,L2,V3,M2} { ! singleton( X ) = unordered_pair( Y,
% 0.45/1.07 Z ), X = Y }.
% 0.45/1.07 substitution0:
% 0.45/1.07 X := X
% 0.45/1.07 Y := Y
% 0.45/1.07 Z := Z
% 0.45/1.07 end
% 0.45/1.07 permutation0:
% 0.45/1.07 0 ==> 0
% 0.45/1.07 1 ==> 1
% 0.45/1.07 end
% 0.45/1.07
% 0.45/1.07 eqswap: (65) Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------