TSTP Solution File: SEU150+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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.67s 1.05s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.11 % Command : bliksem %s
% 0.12/0.32 % Computer : n021.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % DateTime : Sun Jun 19 11:39:17 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.67/1.05 *** allocated 10000 integers for termspace/termends
% 0.67/1.05 *** allocated 10000 integers for clauses
% 0.67/1.05 *** allocated 10000 integers for justifications
% 0.67/1.05 Bliksem 1.12
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Automatic Strategy Selection
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Clauses:
% 0.67/1.05
% 0.67/1.05 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.67/1.05 { && }.
% 0.67/1.05 { && }.
% 0.67/1.05 { ! singleton( X ) = unordered_pair( Y, Z ), X = Y }.
% 0.67/1.05 { singleton( skol3 ) = unordered_pair( skol1, skol2 ) }.
% 0.67/1.05 { ! skol1 = skol2 }.
% 0.67/1.05
% 0.67/1.05 percentage equality = 0.833333, percentage horn = 1.000000
% 0.67/1.05 This is a pure equality problem
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Options Used:
% 0.67/1.05
% 0.67/1.05 useres = 1
% 0.67/1.05 useparamod = 1
% 0.67/1.05 useeqrefl = 1
% 0.67/1.05 useeqfact = 1
% 0.67/1.05 usefactor = 1
% 0.67/1.05 usesimpsplitting = 0
% 0.67/1.05 usesimpdemod = 5
% 0.67/1.05 usesimpres = 3
% 0.67/1.05
% 0.67/1.05 resimpinuse = 1000
% 0.67/1.05 resimpclauses = 20000
% 0.67/1.05 substype = eqrewr
% 0.67/1.05 backwardsubs = 1
% 0.67/1.05 selectoldest = 5
% 0.67/1.05
% 0.67/1.05 litorderings [0] = split
% 0.67/1.05 litorderings [1] = extend the termordering, first sorting on arguments
% 0.67/1.05
% 0.67/1.05 termordering = kbo
% 0.67/1.05
% 0.67/1.05 litapriori = 0
% 0.67/1.05 termapriori = 1
% 0.67/1.05 litaposteriori = 0
% 0.67/1.05 termaposteriori = 0
% 0.67/1.05 demodaposteriori = 0
% 0.67/1.05 ordereqreflfact = 0
% 0.67/1.05
% 0.67/1.05 litselect = negord
% 0.67/1.05
% 0.67/1.05 maxweight = 15
% 0.67/1.05 maxdepth = 30000
% 0.67/1.05 maxlength = 115
% 0.67/1.05 maxnrvars = 195
% 0.67/1.05 excuselevel = 1
% 0.67/1.05 increasemaxweight = 1
% 0.67/1.05
% 0.67/1.05 maxselected = 10000000
% 0.67/1.05 maxnrclauses = 10000000
% 0.67/1.05
% 0.67/1.05 showgenerated = 0
% 0.67/1.05 showkept = 0
% 0.67/1.05 showselected = 0
% 0.67/1.05 showdeleted = 0
% 0.67/1.05 showresimp = 1
% 0.67/1.05 showstatus = 2000
% 0.67/1.05
% 0.67/1.05 prologoutput = 0
% 0.67/1.05 nrgoals = 5000000
% 0.67/1.05 totalproof = 1
% 0.67/1.05
% 0.67/1.05 Symbols occurring in the translation:
% 0.67/1.05
% 0.67/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.05 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.67/1.05 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.67/1.05 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.67/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.05 unordered_pair [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.67/1.05 singleton [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.67/1.05 skol1 [40, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.67/1.05 skol2 [41, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.67/1.05 skol3 [42, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Starting Search:
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Bliksems!, er is een bewijs:
% 0.67/1.05 % SZS status Theorem
% 0.67/1.05 % SZS output start Refutation
% 0.67/1.05
% 0.67/1.05 (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.67/1.05 }.
% 0.67/1.05 (2) {G0,W9,D3,L2,V3,M2} I { ! singleton( X ) = unordered_pair( Y, Z ), X =
% 0.67/1.05 Y }.
% 0.67/1.05 (3) {G0,W6,D3,L1,V0,M1} I { unordered_pair( skol1, skol2 ) ==> singleton(
% 0.67/1.05 skol3 ) }.
% 0.67/1.05 (4) {G0,W3,D2,L1,V0,M1} I { ! skol2 ==> skol1 }.
% 0.67/1.05 (5) {G1,W6,D3,L1,V0,M1} P(0,3) { unordered_pair( skol2, skol1 ) ==>
% 0.67/1.05 singleton( skol3 ) }.
% 0.67/1.05 (11) {G2,W8,D3,L2,V1,M2} P(5,2) { ! singleton( X ) = singleton( skol3 ), X
% 0.67/1.05 = skol2 }.
% 0.67/1.05 (19) {G1,W8,D3,L2,V1,M2} P(3,2) { ! singleton( X ) = singleton( skol3 ), X
% 0.67/1.05 = skol1 }.
% 0.67/1.05 (28) {G2,W3,D2,L1,V0,M1} Q(19) { skol3 ==> skol1 }.
% 0.67/1.05 (29) {G3,W3,D2,L1,V0,M1} Q(11);d(28) { skol2 ==> skol1 }.
% 0.67/1.05 (32) {G4,W0,D0,L0,V0,M0} S(29);r(4) { }.
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 % SZS output end Refutation
% 0.67/1.05 found a proof!
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Unprocessed initial clauses:
% 0.67/1.05
% 0.67/1.05 (34) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.67/1.05 }.
% 0.67/1.05 (35) {G0,W1,D1,L1,V0,M1} { && }.
% 0.67/1.05 (36) {G0,W1,D1,L1,V0,M1} { && }.
% 0.67/1.05 (37) {G0,W9,D3,L2,V3,M2} { ! singleton( X ) = unordered_pair( Y, Z ), X =
% 0.67/1.05 Y }.
% 0.67/1.05 (38) {G0,W6,D3,L1,V0,M1} { singleton( skol3 ) = unordered_pair( skol1,
% 0.67/1.05 skol2 ) }.
% 0.67/1.05 (39) {G0,W3,D2,L1,V0,M1} { ! skol1 = skol2 }.
% 0.67/1.05
% 0.67/1.05
% 0.67/1.05 Total Proof:
% 0.67/1.05
% 0.67/1.05 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.67/1.05 unordered_pair( Y, X ) }.
% 0.67/1.05 parent0: (34) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) =
% 0.67/1.05 unordered_pair( Y, X ) }.
% 0.67/1.05 substitution0:
% 0.67/1.05 X := X
% 0.67/1.05 Y := Y
% 0.67/1.05 end
% 0.67/1.05 permutation0:
% 0.67/1.05 0 ==> 0
% 0.67/1.05 end
% 0.67/1.05
% 0.67/1.05 subsumption: (2) {G0,W9,D3,L2,V3,M2} I { ! singleton( X ) = unordered_pair
% 0.67/1.05 ( Y, Z ), X = Y }.
% 0.67/1.05 parent0: (37) {G0,W9,D3,L2,V3,M2} { ! singleton( X ) = unordered_pair( Y,
% 0.67/1.05 Z ), X = Y }.
% 0.67/1.05 substitution0:
% 0.67/1.05 X := X
% 0.67/1.05 Y := Y
% 0.67/1.05 Z := Z
% 0.67/1.05 end
% 0.67/1.05 permutation0:
% 0.67/1.05 0 ==> 0
% 0.67/1.05 1 ==> 1
% 0.67/1.05 end
% 0.67/1.05
% 0.67/1.05 eqswap: (46) {G0,W6,D3,L1,V0,M1} { unordered_pair( skol1, skol2 ) =
% 0.67/1.05 singleton( skol3 ) }.
% 0.67/1.05 parent0[0]: (38) {G0,W6,D3,L1,V0,M1} { singleton( skol3 ) = unordered_pair
% 0.67/1.05 ( skol1, skol2 ) }.
% 0.67/1.05 substitution0:
% 0.67/1.05 end
% 0.67/1.05
% 0.67/1.05 subsumptioCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------