TSTP Solution File: SEU139+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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:51 EDT 2022
% Result : Theorem 0.72s 1.08s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n004.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 : Sun Jun 19 13:36:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.08 *** allocated 10000 integers for termspace/termends
% 0.43/1.08 *** allocated 10000 integers for clauses
% 0.43/1.08 *** allocated 10000 integers for justifications
% 0.43/1.08 Bliksem 1.12
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Automatic Strategy Selection
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Clauses:
% 0.43/1.08
% 0.43/1.08 { ! proper_subset( X, Y ), ! proper_subset( Y, X ) }.
% 0.43/1.08 { ! X = Y, subset( X, Y ) }.
% 0.43/1.08 { ! X = Y, subset( Y, X ) }.
% 0.43/1.08 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.43/1.08 { ! proper_subset( X, Y ), subset( X, Y ) }.
% 0.43/1.08 { ! proper_subset( X, Y ), ! X = Y }.
% 0.43/1.08 { ! subset( X, Y ), X = Y, proper_subset( X, Y ) }.
% 0.43/1.08 { ! proper_subset( X, X ) }.
% 0.43/1.08 { subset( X, X ) }.
% 0.43/1.08 { subset( skol1, skol2 ) }.
% 0.43/1.08 { proper_subset( skol2, skol1 ) }.
% 0.43/1.08
% 0.43/1.08 percentage equality = 0.250000, percentage horn = 0.909091
% 0.43/1.08 This is a problem with some equality
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Options Used:
% 0.43/1.08
% 0.43/1.08 useres = 1
% 0.43/1.08 useparamod = 1
% 0.43/1.08 useeqrefl = 1
% 0.43/1.08 useeqfact = 1
% 0.43/1.08 usefactor = 1
% 0.43/1.08 usesimpsplitting = 0
% 0.43/1.08 usesimpdemod = 5
% 0.43/1.08 usesimpres = 3
% 0.43/1.08
% 0.43/1.08 resimpinuse = 1000
% 0.43/1.08 resimpclauses = 20000
% 0.43/1.08 substype = eqrewr
% 0.43/1.08 backwardsubs = 1
% 0.43/1.08 selectoldest = 5
% 0.43/1.08
% 0.43/1.08 litorderings [0] = split
% 0.72/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.08
% 0.72/1.08 termordering = kbo
% 0.72/1.08
% 0.72/1.08 litapriori = 0
% 0.72/1.08 termapriori = 1
% 0.72/1.08 litaposteriori = 0
% 0.72/1.08 termaposteriori = 0
% 0.72/1.08 demodaposteriori = 0
% 0.72/1.08 ordereqreflfact = 0
% 0.72/1.08
% 0.72/1.08 litselect = negord
% 0.72/1.08
% 0.72/1.08 maxweight = 15
% 0.72/1.08 maxdepth = 30000
% 0.72/1.08 maxlength = 115
% 0.72/1.08 maxnrvars = 195
% 0.72/1.08 excuselevel = 1
% 0.72/1.08 increasemaxweight = 1
% 0.72/1.08
% 0.72/1.08 maxselected = 10000000
% 0.72/1.08 maxnrclauses = 10000000
% 0.72/1.08
% 0.72/1.08 showgenerated = 0
% 0.72/1.08 showkept = 0
% 0.72/1.08 showselected = 0
% 0.72/1.08 showdeleted = 0
% 0.72/1.08 showresimp = 1
% 0.72/1.08 showstatus = 2000
% 0.72/1.08
% 0.72/1.08 prologoutput = 0
% 0.72/1.08 nrgoals = 5000000
% 0.72/1.08 totalproof = 1
% 0.72/1.08
% 0.72/1.08 Symbols occurring in the translation:
% 0.72/1.08
% 0.72/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.08 . [1, 2] (w:1, o:15, a:1, s:1, b:0),
% 0.72/1.08 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.72/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.08 proper_subset [37, 2] (w:1, o:39, a:1, s:1, b:0),
% 0.72/1.08 subset [38, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.72/1.08 skol1 [39, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.72/1.08 skol2 [40, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Starting Search:
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Bliksems!, er is een bewijs:
% 0.72/1.08 % SZS status Theorem
% 0.72/1.08 % SZS output start Refutation
% 0.72/1.08
% 0.72/1.08 (0) {G0,W6,D2,L2,V2,M2} I { ! proper_subset( X, Y ), ! proper_subset( Y, X
% 0.72/1.08 ) }.
% 0.72/1.08 (1) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.72/1.08 (4) {G0,W6,D2,L2,V2,M2} I { ! proper_subset( X, Y ), ! X = Y }.
% 0.72/1.08 (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), X = Y, proper_subset( X, Y )
% 0.72/1.08 }.
% 0.72/1.08 (6) {G0,W3,D2,L1,V1,M1} I { ! proper_subset( X, X ) }.
% 0.72/1.08 (8) {G0,W3,D2,L1,V0,M1} I { subset( skol1, skol2 ) }.
% 0.72/1.08 (9) {G0,W3,D2,L1,V0,M1} I { proper_subset( skol2, skol1 ) }.
% 0.72/1.08 (10) {G1,W3,D2,L1,V0,M1} R(4,9) { ! skol2 ==> skol1 }.
% 0.72/1.08 (11) {G1,W3,D2,L1,V0,M1} R(0,9) { ! proper_subset( skol1, skol2 ) }.
% 0.72/1.08 (13) {G2,W3,D2,L1,V0,M1} R(5,11);r(8) { skol2 ==> skol1 }.
% 0.72/1.08 (18) {G3,W6,D2,L2,V1,M2} P(5,10);d(13);d(13);r(1) { ! X = skol1,
% 0.72/1.08 proper_subset( X, skol1 ) }.
% 0.72/1.08 (23) {G4,W0,D0,L0,V0,M0} Q(18);r(6) { }.
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 % SZS output end Refutation
% 0.72/1.08 found a proof!
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Unprocessed initial clauses:
% 0.72/1.08
% 0.72/1.08 (25) {G0,W6,D2,L2,V2,M2} { ! proper_subset( X, Y ), ! proper_subset( Y, X
% 0.72/1.08 ) }.
% 0.72/1.08 (26) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.72/1.08 (27) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.72/1.08 (28) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.72/1.08 (29) {G0,W6,D2,L2,V2,M2} { ! proper_subset( X, Y ), subset( X, Y ) }.
% 0.72/1.08 (30) {G0,W6,D2,L2,V2,M2} { ! proper_subset( X, Y ), ! X = Y }.
% 0.72/1.08 (31) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), X = Y, proper_subset( X, Y )
% 0.72/1.08 }.
% 0.72/1.08 (32) {G0,W3,D2,L1,V1,M1} { ! proper_subset( X, X ) }.
% 0.72/1.08 (33) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.72/1.08 (34) {G0,W3,D2,L1,V0,M1} { subset( skol1, skol2 ) }.
% 0.72/1.08 (35) {G0,W3,D2,L1,V0,M1} { proper_subset( skol2, skol1 ) }.
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Total Proof:
% 0.72/1.08
% 0.72/1.08 subsumption: (0) {G0,W6,D2,L2,V2,M2} I { ! proper_subset( X, Y ), !
% 0.72/1.08 proper_subset( Y, X ) }.
% 0.72/1.08 parent0: (25) {G0,W6,D2,L2,V2,M2} { ! proper_subset( X, Y ), !
% 0.72/1.08 proper_subset( Y, X ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (1) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.93/1.34 parent0: (26) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 Y := Y
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 1 ==> 1
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (4) {G0,W6,D2,L2,V2,M2} I { ! proper_subset( X, Y ), ! X = Y
% 0.93/1.34 }.
% 0.93/1.34 parent0: (30) {G0,W6,D2,L2,V2,M2} { ! proper_subset( X, Y ), ! X = Y }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 Y := Y
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 1 ==> 1
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), X = Y,
% 0.93/1.34 proper_subset( X, Y ) }.
% 0.93/1.34 parent0: (31) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), X = Y, proper_subset
% 0.93/1.34 ( X, Y ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 Y := Y
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 1 ==> 1
% 0.93/1.34 2 ==> 2
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 factor: (50) {G0,W3,D2,L1,V1,M1} { ! proper_subset( X, X ) }.
% 0.93/1.34 parent0[0, 1]: (25) {G0,W6,D2,L2,V2,M2} { ! proper_subset( X, Y ), !
% 0.93/1.34 proper_subset( Y, X ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 Y := X
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (6) {G0,W3,D2,L1,V1,M1} I { ! proper_subset( X, X ) }.
% 0.93/1.34 parent0: (50) {G0,W3,D2,L1,V1,M1} { ! proper_subset( X, X ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (8) {G0,W3,D2,L1,V0,M1} I { subset( skol1, skol2 ) }.
% 0.93/1.34 parent0: (34) {G0,W3,D2,L1,V0,M1} { subset( skol1, skol2 ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (9) {G0,W3,D2,L1,V0,M1} I { proper_subset( skol2, skol1 ) }.
% 0.93/1.34 parent0: (35) {G0,W3,D2,L1,V0,M1} { proper_subset( skol2, skol1 ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 eqswap: (63) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! proper_subset( X, Y ) }.
% 0.93/1.34 parent0[1]: (4) {G0,W6,D2,L2,V2,M2} I { ! proper_subset( X, Y ), ! X = Y
% 0.93/1.34 }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 Y := Y
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 resolution: (64) {G1,W3,D2,L1,V0,M1} { ! skol1 = skol2 }.
% 0.93/1.34 parent0[1]: (63) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! proper_subset( X, Y )
% 0.93/1.34 }.
% 0.93/1.34 parent1[0]: (9) {G0,W3,D2,L1,V0,M1} I { proper_subset( skol2, skol1 ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := skol2
% 0.93/1.34 Y := skol1
% 0.93/1.34 end
% 0.93/1.34 substitution1:
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 eqswap: (65) {G1,W3,D2,L1,V0,M1} { ! skol2 = skol1 }.
% 0.93/1.34 parent0[0]: (64) {G1,W3,D2,L1,V0,M1} { ! skol1 = skol2 }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (10) {G1,W3,D2,L1,V0,M1} R(4,9) { ! skol2 ==> skol1 }.
% 0.93/1.34 parent0: (65) {G1,W3,D2,L1,V0,M1} { ! skol2 = skol1 }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 resolution: (66) {G1,W3,D2,L1,V0,M1} { ! proper_subset( skol1, skol2 ) }.
% 0.93/1.34 parent0[0]: (0) {G0,W6,D2,L2,V2,M2} I { ! proper_subset( X, Y ), !
% 0.93/1.34 proper_subset( Y, X ) }.
% 0.93/1.34 parent1[0]: (9) {G0,W3,D2,L1,V0,M1} I { proper_subset( skol2, skol1 ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := skol2
% 0.93/1.34 Y := skol1
% 0.93/1.34 end
% 0.93/1.34 substitution1:
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (11) {G1,W3,D2,L1,V0,M1} R(0,9) { ! proper_subset( skol1,
% 0.93/1.34 skol2 ) }.
% 0.93/1.34 parent0: (66) {G1,W3,D2,L1,V0,M1} { ! proper_subset( skol1, skol2 ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 eqswap: (67) {G0,W9,D2,L3,V2,M3} { Y = X, ! subset( X, Y ), proper_subset
% 0.93/1.34 ( X, Y ) }.
% 0.93/1.34 parent0[1]: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), X = Y,
% 0.93/1.34 proper_subset( X, Y ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 X := X
% 0.93/1.34 Y := Y
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 resolution: (68) {G1,W6,D2,L2,V0,M2} { skol2 = skol1, ! subset( skol1,
% 0.93/1.34 skol2 ) }.
% 0.93/1.34 parent0[0]: (11) {G1,W3,D2,L1,V0,M1} R(0,9) { ! proper_subset( skol1, skol2
% 0.93/1.34 ) }.
% 0.93/1.34 parent1[2]: (67) {G0,W9,D2,L3,V2,M3} { Y = X, ! subset( X, Y ),
% 0.93/1.34 proper_subset( X, Y ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 substitution1:
% 0.93/1.34 X := skol1
% 0.93/1.34 Y := skol2
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 resolution: (69) {G1,W3,D2,L1,V0,M1} { skol2 = skol1 }.
% 0.93/1.34 parent0[1]: (68) {G1,W6,D2,L2,V0,M2} { skol2 = skol1, ! subset( skol1,
% 0.93/1.34 skol2 ) }.
% 0.93/1.34 parent1[0]: (8) {G0,W3,D2,L1,V0,M1} I { subset( skol1, skol2 ) }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 substitution1:
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 subsumption: (13) {G2,W3,D2,L1,V0,M1} R(5,11);r(8) { skol2 ==> skol1 }.
% 0.93/1.34 parent0: (69) {G1,W3,D2,L1,V0,M1} { skol2 = skol1 }.
% 0.93/1.34 substitution0:
% 0.93/1.34 end
% 0.93/1.34 permutation0:
% 0.93/1.34 0 ==> 0
% 0.93/1.34 end
% 0.93/1.34
% 0.93/1.34 *** allocated 15000 integers for termspace/termends
% 0.93/1.34 *** allocated 15000 integers for clauses
% 0.93/1.34 *** allocated 15000 integers for justifications
% 0.93/1.34 *** allocated 22500 integers for termspace/termends
% 0.93/1.34 *** allocated 22500 integers for clauses
% 0.93/1.34 *** allocated 22500 integers for justifications
% 0.93/1.34 *** allocated 33750 integers for termspace/termends
% 0.93/1.34 *** Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------