TSTP Solution File: SET004-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET004-1 : TPTP v8.1.0. Released v1.0.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 : Mon Jul 18 22:45:08 EDT 2022
% Result : Unsatisfiable 0.73s 1.12s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Sun Jul 10 09:03:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.73/1.12 *** allocated 10000 integers for termspace/termends
% 0.73/1.12 *** allocated 10000 integers for clauses
% 0.73/1.12 *** allocated 10000 integers for justifications
% 0.73/1.12 Bliksem 1.12
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Automatic Strategy Selection
% 0.73/1.12
% 0.73/1.12 Clauses:
% 0.73/1.12 [
% 0.73/1.12 [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ],
% 0.73/1.12 [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X ) ],
% 0.73/1.12 [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y ) ]
% 0.73/1.12 ,
% 0.73/1.12 [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ],
% 0.73/1.12 [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ],
% 0.73/1.12 [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y, X ) ],
% 0.73/1.12 [ ~( union( X, Y, Z ) ), ~( member( T, Z ) ), member( T, X ), member( T
% 0.73/1.12 , Y ) ],
% 0.73/1.12 [ ~( union( X, Y, Z ) ), ~( member( T, X ) ), member( T, Z ) ],
% 0.73/1.12 [ ~( union( X, Y, Z ) ), ~( member( T, Y ) ), member( T, Z ) ],
% 0.73/1.12 [ union( X, Y, Z ), member( g( X, Y, Z ), X ), member( g( X, Y, Z ), Y )
% 0.73/1.12 , member( g( X, Y, Z ), Z ) ],
% 0.73/1.12 [ ~( member( g( X, Y, Z ), X ) ), ~( member( g( X, Y, Z ), Z ) ), union(
% 0.73/1.12 X, Y, Z ) ],
% 0.73/1.12 [ ~( member( g( X, Y, Z ), Y ) ), ~( member( g( X, Y, Z ), Z ) ), union(
% 0.73/1.12 X, Y, Z ) ],
% 0.73/1.12 [ union( a, b, aUb ) ],
% 0.73/1.12 [ ~( subset( a, aUb ) ) ]
% 0.73/1.12 ] .
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 percentage equality = 0.000000, percentage horn = 0.785714
% 0.73/1.12 This a non-horn, non-equality problem
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Options Used:
% 0.73/1.12
% 0.73/1.12 useres = 1
% 0.73/1.12 useparamod = 0
% 0.73/1.12 useeqrefl = 0
% 0.73/1.12 useeqfact = 0
% 0.73/1.12 usefactor = 1
% 0.73/1.12 usesimpsplitting = 0
% 0.73/1.12 usesimpdemod = 0
% 0.73/1.12 usesimpres = 3
% 0.73/1.12
% 0.73/1.12 resimpinuse = 1000
% 0.73/1.12 resimpclauses = 20000
% 0.73/1.12 substype = standard
% 0.73/1.12 backwardsubs = 1
% 0.73/1.12 selectoldest = 5
% 0.73/1.12
% 0.73/1.12 litorderings [0] = split
% 0.73/1.12 litorderings [1] = liftord
% 0.73/1.12
% 0.73/1.12 termordering = none
% 0.73/1.12
% 0.73/1.12 litapriori = 1
% 0.73/1.12 termapriori = 0
% 0.73/1.12 litaposteriori = 0
% 0.73/1.12 termaposteriori = 0
% 0.73/1.12 demodaposteriori = 0
% 0.73/1.12 ordereqreflfact = 0
% 0.73/1.12
% 0.73/1.12 litselect = none
% 0.73/1.12
% 0.73/1.12 maxweight = 15
% 0.73/1.12 maxdepth = 30000
% 0.73/1.12 maxlength = 115
% 0.73/1.12 maxnrvars = 195
% 0.73/1.12 excuselevel = 1
% 0.73/1.12 increasemaxweight = 1
% 0.73/1.12
% 0.73/1.12 maxselected = 10000000
% 0.73/1.12 maxnrclauses = 10000000
% 0.73/1.12
% 0.73/1.12 showgenerated = 0
% 0.73/1.12 showkept = 0
% 0.73/1.12 showselected = 0
% 0.73/1.12 showdeleted = 0
% 0.73/1.12 showresimp = 1
% 0.73/1.12 showstatus = 2000
% 0.73/1.12
% 0.73/1.12 prologoutput = 1
% 0.73/1.12 nrgoals = 5000000
% 0.73/1.12 totalproof = 1
% 0.73/1.12
% 0.73/1.12 Symbols occurring in the translation:
% 0.73/1.12
% 0.73/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.12 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.73/1.12 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.73/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 member [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.73/1.12 subset [43, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.73/1.12 'member_of_1_not_of_2' [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.73/1.12 'equal_sets' [45, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.73/1.12 union [49, 3] (w:1, o:52, a:1, s:1, b:0),
% 0.73/1.12 g [50, 3] (w:1, o:53, a:1, s:1, b:0),
% 0.73/1.12 a [51, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.73/1.12 b [52, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.73/1.12 aUb [53, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Starting Search:
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksems!, er is een bewijs:
% 0.73/1.12 % SZS status Unsatisfiable
% 0.73/1.12 % SZS output start Refutation
% 0.73/1.12
% 0.73/1.12 clause( 1, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y ) ]
% 0.73/1.12 )
% 0.73/1.12 .
% 0.73/1.12 clause( 2, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y
% 0.73/1.12 ) ] )
% 0.73/1.12 .
% 0.73/1.12 clause( 7, [ ~( member( T, X ) ), member( T, Z ), ~( union( X, Y, Z ) ) ]
% 0.73/1.12 )
% 0.73/1.12 .
% 0.73/1.12 clause( 12, [ union( a, b, aUb ) ] )
% 0.73/1.12 .
% 0.73/1.12 clause( 13, [ ~( subset( a, aUb ) ) ] )
% 0.73/1.12 .
% 0.73/1.12 clause( 23, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), aUb ) ) ] )
% 0.73/1.12 .
% 0.73/1.12 clause( 25, [ member( 'member_of_1_not_of_2'( a, aUb ), a ) ] )
% 0.73/1.12 .
% 0.73/1.12 clause( 27, [ ~( member( X, a ) ), member( X, aUb ) ] )
% 0.73/1.12 .
% 0.73/1.12 clause( 28, [] )
% 0.73/1.12 .
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 % SZS output end Refutation
% 0.73/1.12 found a proof!
% 0.73/1.12
% 0.73/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.12
% 0.73/1.12 initialclauses(
% 0.73/1.12 [ clause( 30, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.73/1.12 )
% 0.73/1.12 , clause( 31, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X )
% 0.73/1.12 ] )
% 0.73/1.12 , clause( 32, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X
% 0.73/1.12 , Y ) ] )
% 0.73/1.12 , clause( 33, [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ] )
% 0.73/1.12 , clause( 34, [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ] )
% 0.73/1.12 , clause( 35, [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y,
% 0.73/1.12 X ) ] )
% 0.73/1.12 , clause( 36, [ ~( union( X, Y, Z ) ), ~( member( T, Z ) ), member( T, X )
% 0.73/1.12 , member( T, Y ) ] )
% 0.73/1.12 , clause( 37, [ ~( union( X, Y, Z ) ), ~( member( T, X ) ), member( T, Z )
% 0.73/1.12 ] )
% 0.73/1.12 , clause( 38, [ ~( union( X, Y, Z ) ), ~( member( T, Y ) ), member( T, Z )
% 0.73/1.12 ] )
% 0.73/1.12 , clause( 39, [ union( X, Y, Z ), member( g( X, Y, Z ), X ), member( g( X,
% 0.73/1.12 Y, Z ), Y ), member( g( X, Y, Z ), Z ) ] )
% 0.73/1.12 , clause( 40, [ ~( member( g( X, Y, Z ), X ) ), ~( member( g( X, Y, Z ), Z
% 0.73/1.12 ) ), union( X, Y, Z ) ] )
% 0.73/1.12 , clause( 41, [ ~( member( g( X, Y, Z ), Y ) ), ~( member( g( X, Y, Z ), Z
% 0.73/1.12 ) ), union( X, Y, Z ) ] )
% 0.73/1.12 , clause( 42, [ union( a, b, aUb ) ] )
% 0.73/1.12 , clause( 43, [ ~( subset( a, aUb ) ) ] )
% 0.73/1.12 ] ).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 subsumption(
% 0.73/1.12 clause( 1, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y ) ]
% 0.73/1.12 )
% 0.73/1.12 , clause( 31, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X )
% 0.73/1.12 ] )
% 0.73/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.73/1.12 ), ==>( 1, 0 )] ) ).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 subsumption(
% 0.73/1.12 clause( 2, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y
% 0.73/1.12 ) ] )
% 0.73/1.12 , clause( 32, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X
% 0.73/1.12 , Y ) ] )
% 0.73/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.12 ), ==>( 1, 1 )] ) ).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 subsumption(
% 0.73/1.12 clause( 7, [ ~( member( T, X ) ), member( T, Z ), ~( union( X, Y, Z ) ) ]
% 0.73/1.12 )
% 0.73/1.12 , clause( 37, [ ~( union( X, Y, Z ) ), ~( member( T, X ) ), member( T, Z )
% 0.73/1.12 ] )
% 0.73/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.73/1.12 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 subsumption(
% 0.73/1.12 clause( 12, [ union( a, b, aUb ) ] )
% 0.73/1.12 , clause( 42, [ union( a, b, aUb ) ] )
% 0.73/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 subsumption(
% 0.73/1.12 clause( 13, [ ~( subset( a, aUb ) ) ] )
% 0.73/1.12 , clause( 43, [ ~( subset( a, aUb ) ) ] )
% 0.73/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 resolution(
% 0.73/1.12 clause( 62, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), aUb ) ) ] )
% 0.73/1.12 , clause( 13, [ ~( subset( a, aUb ) ) ] )
% 0.73/1.12 , 0, clause( 2, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset(
% 0.77/1.12 X, Y ) ] )
% 0.77/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, aUb )] )
% 0.77/1.12 ).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 subsumption(
% 0.77/1.12 clause( 23, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), aUb ) ) ] )
% 0.77/1.12 , clause( 62, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), aUb ) ) ] )
% 0.77/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 resolution(
% 0.77/1.12 clause( 63, [ member( 'member_of_1_not_of_2'( a, aUb ), a ) ] )
% 0.77/1.12 , clause( 13, [ ~( subset( a, aUb ) ) ] )
% 0.77/1.12 , 0, clause( 1, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y
% 0.77/1.12 ) ] )
% 0.77/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, aUb )] )
% 0.77/1.12 ).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 subsumption(
% 0.77/1.12 clause( 25, [ member( 'member_of_1_not_of_2'( a, aUb ), a ) ] )
% 0.77/1.12 , clause( 63, [ member( 'member_of_1_not_of_2'( a, aUb ), a ) ] )
% 0.77/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 resolution(
% 0.77/1.12 clause( 64, [ ~( member( X, a ) ), member( X, aUb ) ] )
% 0.77/1.12 , clause( 7, [ ~( member( T, X ) ), member( T, Z ), ~( union( X, Y, Z ) ) ]
% 0.77/1.12 )
% 0.77/1.12 , 2, clause( 12, [ union( a, b, aUb ) ] )
% 0.77/1.12 , 0, substitution( 0, [ :=( X, a ), :=( Y, b ), :=( Z, aUb ), :=( T, X )] )
% 0.77/1.12 , substitution( 1, [] )).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 subsumption(
% 0.77/1.12 clause( 27, [ ~( member( X, a ) ), member( X, aUb ) ] )
% 0.77/1.12 , clause( 64, [ ~( member( X, a ) ), member( X, aUb ) ] )
% 0.77/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.77/1.12 1 )] ) ).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 resolution(
% 0.77/1.12 clause( 65, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), a ) ) ] )
% 0.77/1.12 , clause( 23, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), aUb ) ) ] )
% 0.77/1.12 , 0, clause( 27, [ ~( member( X, a ) ), member( X, aUb ) ] )
% 0.77/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X,
% 0.77/1.12 'member_of_1_not_of_2'( a, aUb ) )] )).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 resolution(
% 0.77/1.12 clause( 66, [] )
% 0.77/1.12 , clause( 65, [ ~( member( 'member_of_1_not_of_2'( a, aUb ), a ) ) ] )
% 0.77/1.12 , 0, clause( 25, [ member( 'member_of_1_not_of_2'( a, aUb ), a ) ] )
% 0.77/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 subsumption(
% 0.77/1.12 clause( 28, [] )
% 0.77/1.12 , clause( 66, [] )
% 0.77/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 end.
% 0.77/1.12
% 0.77/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.12
% 0.77/1.12 Memory use:
% 0.77/1.12
% 0.77/1.12 space for terms: 730
% 0.77/1.12 space for clauses: 1702
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 clauses generated: 37
% 0.77/1.12 clauses kept: 29
% 0.77/1.12 clauses selected: 15
% 0.77/1.12 clauses deleted: 0
% 0.77/1.12 clauses inuse deleted: 0
% 0.77/1.12
% 0.77/1.12 subsentry: 44
% 0.77/1.12 literals s-matched: 20
% 0.77/1.12 literals matched: 14
% 0.77/1.12 full subsumption: 0
% 0.77/1.12
% 0.77/1.12 checksum: 545394385
% 0.77/1.12
% 0.77/1.12
% 0.77/1.12 Bliksem ended
%------------------------------------------------------------------------------