TSTP Solution File: SET886+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET886+1 : TPTP v8.1.0. Released v3.2.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 : Mon Jul 18 22:53:08 EDT 2022
% Result : Theorem 0.69s 1.09s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n004.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 08:38:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09
% 0.69/1.09 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.69/1.09 { empty( skol1 ) }.
% 0.69/1.09 { ! empty( skol2 ) }.
% 0.69/1.09 { subset( X, X ) }.
% 0.69/1.09 { ! subset( unordered_pair( X, Z ), singleton( Y ) ), X = Y }.
% 0.69/1.09 { subset( unordered_pair( skol3, skol4 ), singleton( skol5 ) ) }.
% 0.69/1.09 { ! unordered_pair( skol3, skol4 ) = singleton( skol5 ) }.
% 0.69/1.09 { unordered_pair( X, X ) = singleton( X ) }.
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.444444, percentage horn = 1.000000
% 0.69/1.09 This is a problem with some equality
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 1
% 0.69/1.09 useeqrefl = 1
% 0.69/1.09 useeqfact = 1
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 5
% 0.69/1.09 usesimpres = 3
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = eqrewr
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.09
% 0.69/1.09 termordering = kbo
% 0.69/1.09
% 0.69/1.09 litapriori = 0
% 0.69/1.09 termapriori = 1
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = negord
% 0.69/1.09
% 0.69/1.09 maxweight = 15
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 1
% 0.69/1.09 increasemaxweight = 1
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 0
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 unordered_pair [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.69/1.09 empty [38, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.09 subset [39, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.09 singleton [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.09 skol1 [42, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.69/1.09 skol2 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.69/1.09 skol3 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.69/1.09 skol4 [45, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.69/1.09 skol5 [46, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksems!, er is een bewijs:
% 0.69/1.09 % SZS status Theorem
% 0.69/1.09 % SZS output start Refutation
% 0.69/1.09
% 0.69/1.09 (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.69/1.09 }.
% 0.69/1.09 (4) {G0,W9,D3,L2,V3,M2} I { ! subset( unordered_pair( X, Z ), singleton( Y
% 0.69/1.09 ) ), X = Y }.
% 0.69/1.09 (5) {G0,W6,D3,L1,V0,M1} I { subset( unordered_pair( skol3, skol4 ),
% 0.69/1.09 singleton( skol5 ) ) }.
% 0.69/1.09 (6) {G0,W6,D3,L1,V0,M1} I { ! unordered_pair( skol3, skol4 ) ==> singleton
% 0.69/1.09 ( skol5 ) }.
% 0.69/1.09 (7) {G0,W6,D3,L1,V1,M1} I { unordered_pair( X, X ) ==> singleton( X ) }.
% 0.69/1.09 (8) {G1,W6,D3,L1,V0,M1} P(0,6) { ! unordered_pair( skol4, skol3 ) ==>
% 0.69/1.09 singleton( skol5 ) }.
% 0.69/1.09 (9) {G1,W6,D3,L1,V0,M1} P(0,5) { subset( unordered_pair( skol4, skol3 ),
% 0.69/1.09 singleton( skol5 ) ) }.
% 0.69/1.09 (10) {G2,W3,D2,L1,V0,M1} R(4,9) { skol5 ==> skol4 }.
% 0.69/1.09 (11) {G3,W3,D2,L1,V0,M1} R(4,5);d(10) { skol4 ==> skol3 }.
% 0.69/1.09 (42) {G4,W3,D2,L1,V0,M1} S(10);d(11) { skol5 ==> skol3 }.
% 0.69/1.09 (43) {G5,W0,D0,L0,V0,M0} P(11,8);d(7);d(42);q { }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Refutation
% 0.69/1.09 found a proof!
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Unprocessed initial clauses:
% 0.69/1.09
% 0.69/1.09 (45) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.69/1.09 }.
% 0.69/1.09 (46) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.69/1.09 (47) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.69/1.09 (48) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.69/1.09 (49) {G0,W9,D3,L2,V3,M2} { ! subset( unordered_pair( X, Z ), singleton( Y
% 0.69/1.09 ) ), X = Y }.
% 0.69/1.09 (50) {G0,W6,D3,L1,V0,M1} { subset( unordered_pair( skol3, skol4 ),
% 0.69/1.09 singleton( skol5 ) ) }.
% 0.69/1.09 (51) {G0,W6,D3,L1,V0,M1} { ! unordered_pair( skol3, skol4 ) = singleton(
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 (52) {G0,W6,D3,L1,V1,M1} { unordered_pair( X, X ) = singleton( X ) }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Total Proof:
% 0.69/1.09
% 0.69/1.09 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.69/1.09 unordered_pair( Y, X ) }.
% 0.69/1.09 parent0: (45) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) =
% 0.69/1.09 unordered_pair( Y, X ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (4) {G0,W9,D3,L2,V3,M2} I { ! subset( unordered_pair( X, Z ),
% 0.69/1.09 singleton( Y ) ), X = Y }.
% 0.69/1.09 parent0: (49) {G0,W9,D3,L2,V3,M2} { ! subset( unordered_pair( X, Z ),
% 0.69/1.09 singleton( Y ) ), X = Y }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (5) {G0,W6,D3,L1,V0,M1} I { subset( unordered_pair( skol3,
% 0.69/1.09 skol4 ), singleton( skol5 ) ) }.
% 0.69/1.09 parent0: (50) {G0,W6,D3,L1,V0,M1} { subset( unordered_pair( skol3, skol4 )
% 0.69/1.09 , singleton( skol5 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (6) {G0,W6,D3,L1,V0,M1} I { ! unordered_pair( skol3, skol4 )
% 0.69/1.09 ==> singleton( skol5 ) }.
% 0.69/1.09 parent0: (51) {G0,W6,D3,L1,V0,M1} { ! unordered_pair( skol3, skol4 ) =
% 0.69/1.09 singleton( skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (7) {G0,W6,D3,L1,V1,M1} I { unordered_pair( X, X ) ==>
% 0.69/1.09 singleton( X ) }.
% 0.69/1.09 parent0: (52) {G0,W6,D3,L1,V1,M1} { unordered_pair( X, X ) = singleton( X
% 0.69/1.09 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 eqswap: (60) {G0,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==> unordered_pair
% 0.69/1.09 ( skol3, skol4 ) }.
% 0.69/1.09 parent0[0]: (6) {G0,W6,D3,L1,V0,M1} I { ! unordered_pair( skol3, skol4 )
% 0.69/1.09 ==> singleton( skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (61) {G1,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 unordered_pair( skol4, skol3 ) }.
% 0.69/1.09 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.69/1.09 unordered_pair( Y, X ) }.
% 0.69/1.09 parent1[0; 4]: (60) {G0,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 unordered_pair( skol3, skol4 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol3
% 0.69/1.09 Y := skol4
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 eqswap: (64) {G1,W6,D3,L1,V0,M1} { ! unordered_pair( skol4, skol3 ) ==>
% 0.69/1.09 singleton( skol5 ) }.
% 0.69/1.09 parent0[0]: (61) {G1,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 unordered_pair( skol4, skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (8) {G1,W6,D3,L1,V0,M1} P(0,6) { ! unordered_pair( skol4,
% 0.69/1.09 skol3 ) ==> singleton( skol5 ) }.
% 0.69/1.09 parent0: (64) {G1,W6,D3,L1,V0,M1} { ! unordered_pair( skol4, skol3 ) ==>
% 0.69/1.09 singleton( skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (65) {G1,W6,D3,L1,V0,M1} { subset( unordered_pair( skol4, skol3 )
% 0.69/1.09 , singleton( skol5 ) ) }.
% 0.69/1.09 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.69/1.09 unordered_pair( Y, X ) }.
% 0.69/1.09 parent1[0; 1]: (5) {G0,W6,D3,L1,V0,M1} I { subset( unordered_pair( skol3,
% 0.69/1.09 skol4 ), singleton( skol5 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol3
% 0.69/1.09 Y := skol4
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (9) {G1,W6,D3,L1,V0,M1} P(0,5) { subset( unordered_pair( skol4
% 0.69/1.09 , skol3 ), singleton( skol5 ) ) }.
% 0.69/1.09 parent0: (65) {G1,W6,D3,L1,V0,M1} { subset( unordered_pair( skol4, skol3 )
% 0.69/1.09 , singleton( skol5 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 eqswap: (67) {G0,W9,D3,L2,V3,M2} { Y = X, ! subset( unordered_pair( X, Z )
% 0.69/1.09 , singleton( Y ) ) }.
% 0.69/1.09 parent0[1]: (4) {G0,W9,D3,L2,V3,M2} I { ! subset( unordered_pair( X, Z ),
% 0.69/1.09 singleton( Y ) ), X = Y }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (68) {G1,W3,D2,L1,V0,M1} { skol5 = skol4 }.
% 0.69/1.09 parent0[1]: (67) {G0,W9,D3,L2,V3,M2} { Y = X, ! subset( unordered_pair( X
% 0.69/1.09 , Z ), singleton( Y ) ) }.
% 0.69/1.09 parent1[0]: (9) {G1,W6,D3,L1,V0,M1} P(0,5) { subset( unordered_pair( skol4
% 0.69/1.09 , skol3 ), singleton( skol5 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol4
% 0.69/1.09 Y := skol5
% 0.69/1.09 Z := skol3
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (10) {G2,W3,D2,L1,V0,M1} R(4,9) { skol5 ==> skol4 }.
% 0.69/1.09 parent0: (68) {G1,W3,D2,L1,V0,M1} { skol5 = skol4 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 eqswap: (70) {G0,W9,D3,L2,V3,M2} { Y = X, ! subset( unordered_pair( X, Z )
% 0.69/1.09 , singleton( Y ) ) }.
% 0.69/1.09 parent0[1]: (4) {G0,W9,D3,L2,V3,M2} I { ! subset( unordered_pair( X, Z ),
% 0.69/1.09 singleton( Y ) ), X = Y }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (72) {G1,W3,D2,L1,V0,M1} { skol5 = skol3 }.
% 0.69/1.09 parent0[1]: (70) {G0,W9,D3,L2,V3,M2} { Y = X, ! subset( unordered_pair( X
% 0.69/1.09 , Z ), singleton( Y ) ) }.
% 0.69/1.09 parent1[0]: (5) {G0,W6,D3,L1,V0,M1} I { subset( unordered_pair( skol3,
% 0.69/1.09 skol4 ), singleton( skol5 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol3
% 0.69/1.09 Y := skol5
% 0.69/1.09 Z := skol4
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (73) {G2,W3,D2,L1,V0,M1} { skol4 = skol3 }.
% 0.69/1.09 parent0[0]: (10) {G2,W3,D2,L1,V0,M1} R(4,9) { skol5 ==> skol4 }.
% 0.69/1.09 parent1[0; 1]: (72) {G1,W3,D2,L1,V0,M1} { skol5 = skol3 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (11) {G3,W3,D2,L1,V0,M1} R(4,5);d(10) { skol4 ==> skol3 }.
% 0.69/1.09 parent0: (73) {G2,W3,D2,L1,V0,M1} { skol4 = skol3 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (77) {G3,W3,D2,L1,V0,M1} { skol5 ==> skol3 }.
% 0.69/1.09 parent0[0]: (11) {G3,W3,D2,L1,V0,M1} R(4,5);d(10) { skol4 ==> skol3 }.
% 0.69/1.09 parent1[0; 2]: (10) {G2,W3,D2,L1,V0,M1} R(4,9) { skol5 ==> skol4 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (42) {G4,W3,D2,L1,V0,M1} S(10);d(11) { skol5 ==> skol3 }.
% 0.69/1.09 parent0: (77) {G3,W3,D2,L1,V0,M1} { skol5 ==> skol3 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 eqswap: (80) {G1,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==> unordered_pair
% 0.69/1.09 ( skol4, skol3 ) }.
% 0.69/1.09 parent0[0]: (8) {G1,W6,D3,L1,V0,M1} P(0,6) { ! unordered_pair( skol4, skol3
% 0.69/1.09 ) ==> singleton( skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (83) {G2,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 unordered_pair( skol3, skol3 ) }.
% 0.69/1.09 parent0[0]: (11) {G3,W3,D2,L1,V0,M1} R(4,5);d(10) { skol4 ==> skol3 }.
% 0.69/1.09 parent1[0; 5]: (80) {G1,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 unordered_pair( skol4, skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (84) {G1,W5,D3,L1,V0,M1} { ! singleton( skol5 ) ==> singleton(
% 0.69/1.09 skol3 ) }.
% 0.69/1.09 parent0[0]: (7) {G0,W6,D3,L1,V1,M1} I { unordered_pair( X, X ) ==>
% 0.69/1.09 singleton( X ) }.
% 0.69/1.09 parent1[0; 4]: (83) {G2,W6,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 unordered_pair( skol3, skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol3
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (85) {G2,W5,D3,L1,V0,M1} { ! singleton( skol3 ) ==> singleton(
% 0.69/1.09 skol3 ) }.
% 0.69/1.09 parent0[0]: (42) {G4,W3,D2,L1,V0,M1} S(10);d(11) { skol5 ==> skol3 }.
% 0.69/1.09 parent1[0; 3]: (84) {G1,W5,D3,L1,V0,M1} { ! singleton( skol5 ) ==>
% 0.69/1.09 singleton( skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 eqrefl: (86) {G0,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 parent0[0]: (85) {G2,W5,D3,L1,V0,M1} { ! singleton( skol3 ) ==> singleton
% 0.69/1.09 ( skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (43) {G5,W0,D0,L0,V0,M0} P(11,8);d(7);d(42);q { }.
% 0.69/1.09 parent0: (86) {G0,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 Proof check complete!
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 582
% 0.69/1.09 space for clauses: 2557
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 103
% 0.69/1.09 clauses kept: 44
% 0.69/1.09 clauses selected: 12
% 0.69/1.09 clauses deleted: 1
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 177
% 0.69/1.09 literals s-matched: 126
% 0.69/1.09 literals matched: 126
% 0.69/1.09 full subsumption: 23
% 0.69/1.09
% 0.69/1.09 checksum: 1744778169
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------