TSTP Solution File: TOP004-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : TOP004-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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 : Thu Jul 21 21:20:15 EDT 2022
% Result : Unsatisfiable 0.42s 1.06s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : TOP004-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n028.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 May 29 10:01:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06 [
% 0.42/1.06 [ 'element_of_set'( X, 'union_of_members'( Y ) ), ~( 'element_of_set'( X
% 0.42/1.06 , Z ) ), ~( 'element_of_collection'( Z, Y ) ) ],
% 0.42/1.06 [ ~( basis( X, Y ) ), 'equal_sets'( 'union_of_members'( Y ), X ) ],
% 0.42/1.06 [ ~( basis( X, Y ) ), ~( 'element_of_set'( Z, X ) ), ~(
% 0.42/1.06 'element_of_collection'( T, Y ) ), ~( 'element_of_collection'( U, Y ) ),
% 0.42/1.06 ~( 'element_of_set'( Z, 'intersection_of_sets'( T, U ) ) ),
% 0.42/1.06 'element_of_set'( Z, f6( X, Y, Z, T, U ) ) ],
% 0.42/1.06 [ ~( basis( X, Y ) ), ~( 'element_of_set'( Z, X ) ), ~(
% 0.42/1.06 'element_of_collection'( T, Y ) ), ~( 'element_of_collection'( U, Y ) ),
% 0.42/1.06 ~( 'element_of_set'( Z, 'intersection_of_sets'( T, U ) ) ),
% 0.42/1.06 'element_of_collection'( f6( X, Y, Z, T, U ), Y ) ],
% 0.42/1.06 [ ~( basis( X, Y ) ), ~( 'element_of_set'( Z, X ) ), ~(
% 0.42/1.06 'element_of_collection'( T, Y ) ), ~( 'element_of_collection'( U, Y ) ),
% 0.42/1.06 ~( 'element_of_set'( Z, 'intersection_of_sets'( T, U ) ) ), 'subset_sets'(
% 0.42/1.06 f6( X, Y, Z, T, U ), 'intersection_of_sets'( T, U ) ) ],
% 0.42/1.06 [ ~( 'element_of_collection'( X, 'top_of_basis'( Y ) ) ), ~(
% 0.42/1.06 'element_of_set'( Z, X ) ), 'element_of_set'( Z, f10( Y, X, Z ) ) ],
% 0.42/1.06 [ ~( 'element_of_collection'( X, 'top_of_basis'( Y ) ) ), ~(
% 0.42/1.06 'element_of_set'( Z, X ) ), 'element_of_collection'( f10( Y, X, Z ), Y )
% 0.42/1.06 ],
% 0.42/1.06 [ ~( 'element_of_collection'( X, 'top_of_basis'( Y ) ) ), ~(
% 0.42/1.06 'element_of_set'( Z, X ) ), 'subset_sets'( f10( Y, X, Z ), X ) ],
% 0.42/1.06 [ 'element_of_collection'( X, 'top_of_basis'( Y ) ), 'element_of_set'(
% 0.42/1.06 f11( Y, X ), X ) ],
% 0.42/1.06 [ 'element_of_collection'( X, 'top_of_basis'( Y ) ), ~( 'element_of_set'(
% 0.42/1.06 f11( Y, X ), Z ) ), ~( 'element_of_collection'( Z, Y ) ), ~(
% 0.42/1.06 'subset_sets'( Z, X ) ) ],
% 0.42/1.06 [ ~( 'subset_sets'( X, Y ) ), ~( 'subset_sets'( Y, Z ) ), 'subset_sets'(
% 0.42/1.06 X, Z ) ],
% 0.42/1.06 [ ~( 'element_of_set'( X, 'intersection_of_sets'( Y, Z ) ) ),
% 0.42/1.06 'element_of_set'( X, Y ) ],
% 0.42/1.06 [ ~( 'element_of_set'( X, 'intersection_of_sets'( Y, Z ) ) ),
% 0.42/1.06 'element_of_set'( X, Z ) ],
% 0.42/1.06 [ 'element_of_set'( X, 'intersection_of_sets'( Y, Z ) ), ~(
% 0.42/1.06 'element_of_set'( X, Y ) ), ~( 'element_of_set'( X, Z ) ) ],
% 0.42/1.06 [ ~( 'subset_sets'( X, Y ) ), ~( 'subset_sets'( Z, T ) ), 'subset_sets'(
% 0.42/1.06 'intersection_of_sets'( X, Z ), 'intersection_of_sets'( Y, T ) ) ],
% 0.42/1.06 [ ~( 'equal_sets'( X, Y ) ), ~( 'element_of_set'( Z, X ) ),
% 0.42/1.06 'element_of_set'( Z, Y ) ],
% 0.42/1.06 [ 'equal_sets'( 'intersection_of_sets'( X, Y ), 'intersection_of_sets'(
% 0.42/1.06 Y, X ) ) ],
% 0.42/1.06 [ basis( cx, f ) ],
% 0.42/1.06 [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ],
% 0.42/1.06 [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ],
% 0.42/1.06 [ ~( 'element_of_collection'( 'intersection_of_sets'( X, Y ),
% 0.42/1.06 'top_of_basis'( f ) ) ) ]
% 0.42/1.06 ] .
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 percentage equality = 0.000000, percentage horn = 0.950000
% 0.42/1.06 This is a near-Horn, non-equality problem
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 0
% 0.42/1.06 useeqrefl = 0
% 0.42/1.06 useeqfact = 0
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 0
% 0.42/1.06 usesimpres = 4
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = standard
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = liftord
% 0.42/1.06
% 0.42/1.06 termordering = none
% 0.42/1.06
% 0.42/1.06 litapriori = 1
% 0.42/1.06 termapriori = 0
% 0.42/1.06 litaposteriori = 0
% 0.42/1.06 termaposteriori = 0
% 0.42/1.06 demodaposteriori = 0
% 0.42/1.06 ordereqreflfact = 0
% 0.42/1.06
% 0.42/1.06 litselect = negative
% 0.42/1.06
% 0.42/1.06 maxweight = 30000
% 0.42/1.06 maxdepth = 30000
% 0.42/1.06 maxlength = 115
% 0.42/1.06 maxnrvars = 195
% 0.42/1.06 excuselevel = 0
% 0.42/1.06 increasemaxweight = 0
% 0.42/1.06
% 0.42/1.06 maxselected = 10000000
% 0.42/1.06 maxnrclauses = 10000000
% 0.42/1.06
% 0.42/1.06 showgenerated = 0
% 0.42/1.06 showkept = 0
% 0.42/1.06 showselected = 0
% 0.42/1.06 showdeleted = 0
% 0.42/1.06 showresimp = 1
% 0.42/1.06 showstatus = 2000
% 0.42/1.06
% 0.42/1.06 prologoutput = 1
% 0.42/1.06 nrgoals = 5000000
% 0.42/1.06 totalproof = 1
% 0.42/1.06
% 0.42/1.06 Symbols occurring in the translation:
% 0.42/1.06
% 0.42/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.06 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 0.42/1.06 ! [4, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 'union_of_members' [41, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.42/1.06 'element_of_set' [42, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.42/1.06 'element_of_collection' [44, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.42/1.06 basis [46, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.42/1.06 'equal_sets' [47, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.42/1.06 'intersection_of_sets' [51, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.42/1.06 f6 [52, 5] (w:1, o:61, a:1, s:1, b:0),
% 0.42/1.06 'subset_sets' [53, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.42/1.06 'top_of_basis' [54, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.42/1.06 f10 [55, 3] (w:1, o:60, a:1, s:1, b:0),
% 0.42/1.06 f11 [56, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.42/1.06 cx [60, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.06 f [61, 0] (w:1, o:20, a:1, s:1, b:0).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Starting Search:
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksems!, er is een bewijs:
% 0.42/1.06 % SZS status Unsatisfiable
% 0.42/1.06 % SZS output start Refutation
% 0.42/1.06
% 0.42/1.06 clause( 18, [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 19, [] )
% 0.42/1.06 .
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 % SZS output end Refutation
% 0.42/1.06 found a proof!
% 0.42/1.06
% 0.42/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06
% 0.42/1.06 initialclauses(
% 0.42/1.06 [ clause( 21, [ 'element_of_set'( X, 'union_of_members'( Y ) ), ~(
% 0.42/1.06 'element_of_set'( X, Z ) ), ~( 'element_of_collection'( Z, Y ) ) ] )
% 0.42/1.06 , clause( 22, [ ~( basis( X, Y ) ), 'equal_sets'( 'union_of_members'( Y ),
% 0.42/1.06 X ) ] )
% 0.42/1.06 , clause( 23, [ ~( basis( X, Y ) ), ~( 'element_of_set'( Z, X ) ), ~(
% 0.42/1.06 'element_of_collection'( T, Y ) ), ~( 'element_of_collection'( U, Y ) ),
% 0.42/1.06 ~( 'element_of_set'( Z, 'intersection_of_sets'( T, U ) ) ),
% 0.42/1.06 'element_of_set'( Z, f6( X, Y, Z, T, U ) ) ] )
% 0.42/1.06 , clause( 24, [ ~( basis( X, Y ) ), ~( 'element_of_set'( Z, X ) ), ~(
% 0.42/1.06 'element_of_collection'( T, Y ) ), ~( 'element_of_collection'( U, Y ) ),
% 0.42/1.06 ~( 'element_of_set'( Z, 'intersection_of_sets'( T, U ) ) ),
% 0.42/1.06 'element_of_collection'( f6( X, Y, Z, T, U ), Y ) ] )
% 0.42/1.06 , clause( 25, [ ~( basis( X, Y ) ), ~( 'element_of_set'( Z, X ) ), ~(
% 0.42/1.06 'element_of_collection'( T, Y ) ), ~( 'element_of_collection'( U, Y ) ),
% 0.42/1.06 ~( 'element_of_set'( Z, 'intersection_of_sets'( T, U ) ) ), 'subset_sets'(
% 0.42/1.06 f6( X, Y, Z, T, U ), 'intersection_of_sets'( T, U ) ) ] )
% 0.42/1.06 , clause( 26, [ ~( 'element_of_collection'( X, 'top_of_basis'( Y ) ) ), ~(
% 0.42/1.06 'element_of_set'( Z, X ) ), 'element_of_set'( Z, f10( Y, X, Z ) ) ] )
% 0.42/1.06 , clause( 27, [ ~( 'element_of_collection'( X, 'top_of_basis'( Y ) ) ), ~(
% 0.42/1.06 'element_of_set'( Z, X ) ), 'element_of_collection'( f10( Y, X, Z ), Y )
% 0.42/1.06 ] )
% 0.42/1.06 , clause( 28, [ ~( 'element_of_collection'( X, 'top_of_basis'( Y ) ) ), ~(
% 0.42/1.06 'element_of_set'( Z, X ) ), 'subset_sets'( f10( Y, X, Z ), X ) ] )
% 0.42/1.06 , clause( 29, [ 'element_of_collection'( X, 'top_of_basis'( Y ) ),
% 0.42/1.06 'element_of_set'( f11( Y, X ), X ) ] )
% 0.42/1.06 , clause( 30, [ 'element_of_collection'( X, 'top_of_basis'( Y ) ), ~(
% 0.42/1.06 'element_of_set'( f11( Y, X ), Z ) ), ~( 'element_of_collection'( Z, Y )
% 0.42/1.06 ), ~( 'subset_sets'( Z, X ) ) ] )
% 0.42/1.06 , clause( 31, [ ~( 'subset_sets'( X, Y ) ), ~( 'subset_sets'( Y, Z ) ),
% 0.42/1.06 'subset_sets'( X, Z ) ] )
% 0.42/1.06 , clause( 32, [ ~( 'element_of_set'( X, 'intersection_of_sets'( Y, Z ) ) )
% 0.42/1.06 , 'element_of_set'( X, Y ) ] )
% 0.42/1.06 , clause( 33, [ ~( 'element_of_set'( X, 'intersection_of_sets'( Y, Z ) ) )
% 0.42/1.06 , 'element_of_set'( X, Z ) ] )
% 0.42/1.06 , clause( 34, [ 'element_of_set'( X, 'intersection_of_sets'( Y, Z ) ), ~(
% 0.42/1.06 'element_of_set'( X, Y ) ), ~( 'element_of_set'( X, Z ) ) ] )
% 0.42/1.06 , clause( 35, [ ~( 'subset_sets'( X, Y ) ), ~( 'subset_sets'( Z, T ) ),
% 0.42/1.06 'subset_sets'( 'intersection_of_sets'( X, Z ), 'intersection_of_sets'( Y
% 0.42/1.06 , T ) ) ] )
% 0.42/1.06 , clause( 36, [ ~( 'equal_sets'( X, Y ) ), ~( 'element_of_set'( Z, X ) ),
% 0.42/1.06 'element_of_set'( Z, Y ) ] )
% 0.42/1.06 , clause( 37, [ 'equal_sets'( 'intersection_of_sets'( X, Y ),
% 0.42/1.06 'intersection_of_sets'( Y, X ) ) ] )
% 0.42/1.06 , clause( 38, [ basis( cx, f ) ] )
% 0.42/1.06 , clause( 39, [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ] )
% 0.42/1.06 , clause( 40, [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ] )
% 0.42/1.06 , clause( 41, [ ~( 'element_of_collection'( 'intersection_of_sets'( X, Y )
% 0.42/1.06 , 'top_of_basis'( f ) ) ) ] )
% 0.42/1.06 ] ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 18, [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ] )
% 0.42/1.06 , clause( 39, [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 66, [] )
% 0.42/1.06 , clause( 41, [ ~( 'element_of_collection'( 'intersection_of_sets'( X, Y )
% 0.42/1.06 , 'top_of_basis'( f ) ) ) ] )
% 0.42/1.06 , 0, clause( 18, [ 'element_of_collection'( X, 'top_of_basis'( f ) ) ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.42/1.06 , 'intersection_of_sets'( X, Y ) )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 19, [] )
% 0.42/1.06 , clause( 66, [] )
% 0.42/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 end.
% 0.42/1.06
% 0.42/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06
% 0.42/1.06 Memory use:
% 0.42/1.06
% 0.42/1.06 space for terms: 987
% 0.42/1.06 space for clauses: 1306
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 clauses generated: 21
% 0.42/1.06 clauses kept: 20
% 0.42/1.06 clauses selected: 0
% 0.42/1.06 clauses deleted: 0
% 0.42/1.06 clauses inuse deleted: 0
% 0.42/1.06
% 0.42/1.06 subsentry: 16
% 0.42/1.06 literals s-matched: 10
% 0.42/1.06 literals matched: 10
% 0.42/1.06 full subsumption: 2
% 0.42/1.06
% 0.42/1.06 checksum: -34366264
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksem ended
%------------------------------------------------------------------------------