TSTP Solution File: SET840-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET840-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:52:36 EDT 2022
% Result : Unsatisfiable 0.69s 1.11s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET840-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n027.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 : Sun Jul 10 05:00:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.11 *** allocated 10000 integers for termspace/termends
% 0.69/1.11 *** allocated 10000 integers for clauses
% 0.69/1.11 *** allocated 10000 integers for justifications
% 0.69/1.11 Bliksem 1.12
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Automatic Strategy Selection
% 0.69/1.11
% 0.69/1.11 Clauses:
% 0.69/1.11 [
% 0.69/1.11 [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset', 'tc_set'( 't_b'
% 0.69/1.11 ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ],
% 0.69/1.11 [ 'c_lessequals'( 'c_Union'( 'v_S', 't_b' ), X, 'tc_set'( 't_b' ) ), ~(
% 0.69/1.11 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ],
% 0.69/1.11 [ ~( 'c_in'( X, Y, Z ) ), ~( 'c_in'( Y, T, 'tc_set'( Z ) ) ), 'c_in'( X
% 0.69/1.11 , 'c_Union'( T, Z ), Z ) ],
% 0.69/1.11 [ ~( 'c_in'( X, Y, Z ) ), 'c_in'( X, 'c_insert'( T, Y, Z ), Z ) ],
% 0.69/1.11 [ 'c_in'( X, 'c_insert'( X, Y, Z ), Z ) ],
% 0.69/1.11 [ ~( 'c_in'( X, 'c_insert'( Y, Z, T ), T ) ), 'c_in'( X, Z, T ), =( X, Y
% 0.69/1.11 ) ],
% 0.69/1.11 [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ), 'c_lessequals'( X, Y
% 0.69/1.11 , 'tc_set'( Z ) ) ],
% 0.69/1.11 [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ), 'c_lessequals'(
% 0.69/1.11 X, Y, 'tc_set'( Z ) ) ],
% 0.69/1.11 [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'( Y, X,
% 0.69/1.11 'tc_set'( Z ) ) ), =( Y, X ) ]
% 0.69/1.11 ] .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 percentage equality = 0.105263, percentage horn = 0.777778
% 0.69/1.11 This is a problem with some equality
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Options Used:
% 0.69/1.11
% 0.69/1.11 useres = 1
% 0.69/1.11 useparamod = 1
% 0.69/1.11 useeqrefl = 1
% 0.69/1.11 useeqfact = 1
% 0.69/1.11 usefactor = 1
% 0.69/1.11 usesimpsplitting = 0
% 0.69/1.11 usesimpdemod = 5
% 0.69/1.11 usesimpres = 3
% 0.69/1.11
% 0.69/1.11 resimpinuse = 1000
% 0.69/1.11 resimpclauses = 20000
% 0.69/1.11 substype = eqrewr
% 0.69/1.11 backwardsubs = 1
% 0.69/1.11 selectoldest = 5
% 0.69/1.11
% 0.69/1.11 litorderings [0] = split
% 0.69/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.11
% 0.69/1.11 termordering = kbo
% 0.69/1.11
% 0.69/1.11 litapriori = 0
% 0.69/1.11 termapriori = 1
% 0.69/1.11 litaposteriori = 0
% 0.69/1.11 termaposteriori = 0
% 0.69/1.11 demodaposteriori = 0
% 0.69/1.11 ordereqreflfact = 0
% 0.69/1.11
% 0.69/1.11 litselect = negord
% 0.69/1.11
% 0.69/1.11 maxweight = 15
% 0.69/1.11 maxdepth = 30000
% 0.69/1.11 maxlength = 115
% 0.69/1.11 maxnrvars = 195
% 0.69/1.11 excuselevel = 1
% 0.69/1.11 increasemaxweight = 1
% 0.69/1.11
% 0.69/1.11 maxselected = 10000000
% 0.69/1.11 maxnrclauses = 10000000
% 0.69/1.11
% 0.69/1.11 showgenerated = 0
% 0.69/1.11 showkept = 0
% 0.69/1.11 showselected = 0
% 0.69/1.11 showdeleted = 0
% 0.69/1.11 showresimp = 1
% 0.69/1.11 showstatus = 2000
% 0.69/1.11
% 0.69/1.11 prologoutput = 1
% 0.69/1.11 nrgoals = 5000000
% 0.69/1.11 totalproof = 1
% 0.69/1.11
% 0.69/1.11 Symbols occurring in the translation:
% 0.69/1.11
% 0.69/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.11 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 0.69/1.11 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 0.69/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 'v_S' [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.69/1.11 'c_emptyset' [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.69/1.11 't_b' [42, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.11 'tc_set' [43, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.69/1.11 'c_insert' [44, 3] (w:1, o:53, a:1, s:1, b:0),
% 0.69/1.11 'c_lessequals' [45, 3] (w:1, o:54, a:1, s:1, b:0),
% 0.69/1.11 'c_Union' [46, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.69/1.11 'c_in' [47, 3] (w:1, o:55, a:1, s:1, b:0),
% 0.69/1.11 'c_Main_OsubsetI__1' [56, 3] (w:1, o:56, a:1, s:1, b:0).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Starting Search:
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksems!, er is een bewijs:
% 0.69/1.11 % SZS status Unsatisfiable
% 0.69/1.11 % SZS output start Refutation
% 0.69/1.11
% 0.69/1.11 clause( 0, [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset',
% 0.69/1.11 'tc_set'( 't_b' ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1, [ 'c_lessequals'( 'c_Union'( 'v_S', 't_b' ), X, 'tc_set'( 't_b'
% 0.69/1.11 ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 2, [ ~( 'c_in'( X, Y, Z ) ), ~( 'c_in'( Y, T, 'tc_set'( Z ) ) ),
% 0.69/1.11 'c_in'( X, 'c_Union'( T, Z ), Z ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 4, [ 'c_in'( X, 'c_insert'( X, Y, Z ), Z ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 6, [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 7, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 8, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'(
% 0.69/1.11 Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 13, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 17, [ 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'v_S', 'tc_set'(
% 0.69/1.11 't_b' ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 19, [ ~( 'c_lessequals'( X, 'c_Union'( 'v_S', 't_b' ), 'tc_set'(
% 0.69/1.11 't_b' ) ) ), =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 40, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_in'(
% 0.69/1.11 'c_Main_OsubsetI__1'( X, T, Z ), 'c_Union'( Y, Z ), Z ), 'c_lessequals'(
% 0.69/1.11 X, T, 'tc_set'( Z ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 109, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X,
% 0.69/1.11 'c_Union'( Y, Z ), 'tc_set'( Z ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 110, [ ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ), =( X, 'c_Union'(
% 0.69/1.11 'v_S', 't_b' ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 116, [ =( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X, 'c_emptyset'
% 0.69/1.11 , 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_Union'( 'v_S', 't_b' ) ) ]
% 0.69/1.11 )
% 0.69/1.11 .
% 0.69/1.11 clause( 125, [ ~( 'c_in'( 'c_Union'( 'v_S', 't_b' ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 141, [] )
% 0.69/1.11 .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 % SZS output end Refutation
% 0.69/1.11 found a proof!
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 initialclauses(
% 0.69/1.11 [ clause( 143, [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset',
% 0.69/1.11 'tc_set'( 't_b' ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ] )
% 0.69/1.11 , clause( 144, [ 'c_lessequals'( 'c_Union'( 'v_S', 't_b' ), X, 'tc_set'(
% 0.69/1.11 't_b' ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 145, [ ~( 'c_in'( X, Y, Z ) ), ~( 'c_in'( Y, T, 'tc_set'( Z ) ) )
% 0.69/1.11 , 'c_in'( X, 'c_Union'( T, Z ), Z ) ] )
% 0.69/1.11 , clause( 146, [ ~( 'c_in'( X, Y, Z ) ), 'c_in'( X, 'c_insert'( T, Y, Z ),
% 0.69/1.11 Z ) ] )
% 0.69/1.11 , clause( 147, [ 'c_in'( X, 'c_insert'( X, Y, Z ), Z ) ] )
% 0.69/1.11 , clause( 148, [ ~( 'c_in'( X, 'c_insert'( Y, Z, T ), T ) ), 'c_in'( X, Z,
% 0.69/1.11 T ), =( X, Y ) ] )
% 0.69/1.11 , clause( 149, [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 150, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 151, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.69/1.11 'c_lessequals'( Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.69/1.11 ] ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 0, [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset',
% 0.69/1.11 'tc_set'( 't_b' ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ] )
% 0.69/1.11 , clause( 143, [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset',
% 0.69/1.11 'tc_set'( 't_b' ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 1, [ 'c_lessequals'( 'c_Union'( 'v_S', 't_b' ), X, 'tc_set'( 't_b'
% 0.69/1.11 ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 144, [ 'c_lessequals'( 'c_Union'( 'v_S', 't_b' ), X, 'tc_set'(
% 0.69/1.11 't_b' ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 2, [ ~( 'c_in'( X, Y, Z ) ), ~( 'c_in'( Y, T, 'tc_set'( Z ) ) ),
% 0.69/1.11 'c_in'( X, 'c_Union'( T, Z ), Z ) ] )
% 0.69/1.11 , clause( 145, [ ~( 'c_in'( X, Y, Z ) ), ~( 'c_in'( Y, T, 'tc_set'( Z ) ) )
% 0.69/1.11 , 'c_in'( X, 'c_Union'( T, Z ), Z ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 4, [ 'c_in'( X, 'c_insert'( X, Y, Z ), Z ) ] )
% 0.69/1.11 , clause( 147, [ 'c_in'( X, 'c_insert'( X, Y, Z ), Z ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 6, [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 149, [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 7, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 150, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 8, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'(
% 0.69/1.11 Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.69/1.11 , clause( 151, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.69/1.11 'c_lessequals'( Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 156, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 0, [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset',
% 0.69/1.11 'tc_set'( 't_b' ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 7, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, 'v_S' ),
% 0.69/1.11 :=( Y, 'c_insert'( X, 'c_emptyset', 'tc_set'( 't_b' ) ) ), :=( Z,
% 0.69/1.11 'tc_set'( 't_b' ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 13, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 156, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 157, [ 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'v_S', 'tc_set'(
% 0.69/1.11 't_b' ) ) ] )
% 0.69/1.11 , clause( 0, [ ~( 'c_lessequals'( 'v_S', 'c_insert'( X, 'c_emptyset',
% 0.69/1.11 'tc_set'( 't_b' ) ), 'tc_set'( 'tc_set'( 't_b' ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 6, [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, 'v_S' ),
% 0.69/1.11 :=( Y, 'c_insert'( X, 'c_emptyset', 'tc_set'( 't_b' ) ) ), :=( Z,
% 0.69/1.11 'tc_set'( 't_b' ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 17, [ 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'v_S', 'tc_set'(
% 0.69/1.11 't_b' ) ) ] )
% 0.69/1.11 , clause( 157, [ 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'v_S', 'tc_set'(
% 0.69/1.11 't_b' ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 158, [ ~( 'c_lessequals'( X, 'c_Union'( 'v_S', 't_b' ), 'tc_set'(
% 0.69/1.11 't_b' ) ) ), =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 8, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~(
% 0.69/1.11 'c_lessequals'( Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.69/1.11 , 0, clause( 1, [ 'c_lessequals'( 'c_Union'( 'v_S', 't_b' ), X, 'tc_set'(
% 0.69/1.11 't_b' ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'c_Union'( 'v_S', 't_b' ) ), :=( Y, X ),
% 0.69/1.11 :=( Z, 't_b' )] ), substitution( 1, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 19, [ ~( 'c_lessequals'( X, 'c_Union'( 'v_S', 't_b' ), 'tc_set'(
% 0.69/1.11 't_b' ) ) ), =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 158, [ ~( 'c_lessequals'( X, 'c_Union'( 'v_S', 't_b' ), 'tc_set'(
% 0.69/1.11 't_b' ) ) ), =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 ), ==>( 2, 2 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 160, [ ~( 'c_in'( X, T, 'tc_set'( Z ) ) ), 'c_in'(
% 0.69/1.11 'c_Main_OsubsetI__1'( X, Y, Z ), 'c_Union'( T, Z ), Z ), 'c_lessequals'(
% 0.69/1.11 X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 2, [ ~( 'c_in'( X, Y, Z ) ), ~( 'c_in'( Y, T, 'tc_set'( Z ) ) ),
% 0.69/1.11 'c_in'( X, 'c_Union'( T, Z ), Z ) ] )
% 0.69/1.11 , 0, clause( 6, [ 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), X, Z ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'c_Main_OsubsetI__1'( X, Y, Z ) ), :=( Y, X
% 0.69/1.11 ), :=( Z, Z ), :=( T, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.69/1.11 , :=( Z, Z )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 40, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_in'(
% 0.69/1.11 'c_Main_OsubsetI__1'( X, T, Z ), 'c_Union'( Y, Z ), Z ), 'c_lessequals'(
% 0.69/1.11 X, T, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 160, [ ~( 'c_in'( X, T, 'tc_set'( Z ) ) ), 'c_in'(
% 0.69/1.11 'c_Main_OsubsetI__1'( X, Y, Z ), 'c_Union'( T, Z ), Z ), 'c_lessequals'(
% 0.69/1.11 X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, T ), :=( Z, Z ), :=( T, Y )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 162, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~(
% 0.69/1.11 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X, 'c_Union'( Y, Z ),
% 0.69/1.11 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 7, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( X, Y, Z ), Y, Z ) ),
% 0.69/1.11 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 0, clause( 40, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_in'(
% 0.69/1.11 'c_Main_OsubsetI__1'( X, T, Z ), 'c_Union'( Y, Z ), Z ), 'c_lessequals'(
% 0.69/1.11 X, T, 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, X ), :=( Y, 'c_Union'( Y, Z ) ), :=( Z, Z )] )
% 0.69/1.11 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, 'c_Union'(
% 0.69/1.11 Y, Z ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 factor(
% 0.69/1.11 clause( 163, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~(
% 0.69/1.11 'c_in'( X, Y, 'tc_set'( Z ) ) ) ] )
% 0.69/1.11 , clause( 162, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~(
% 0.69/1.11 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X, 'c_Union'( Y, Z ),
% 0.69/1.11 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 109, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X,
% 0.69/1.11 'c_Union'( Y, Z ), 'tc_set'( Z ) ) ] )
% 0.69/1.11 , clause( 163, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~(
% 0.69/1.11 'c_in'( X, Y, 'tc_set'( Z ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 164, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_lessequals'( X,
% 0.69/1.11 'c_Union'( 'v_S', 't_b' ), 'tc_set'( 't_b' ) ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 19, [ ~( 'c_lessequals'( X, 'c_Union'( 'v_S', 't_b' ), 'tc_set'(
% 0.69/1.11 't_b' ) ) ), =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 165, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 164, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_lessequals'( X,
% 0.69/1.11 'c_Union'( 'v_S', 't_b' ), 'tc_set'( 't_b' ) ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 1, clause( 109, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X,
% 0.69/1.11 'c_Union'( Y, Z ), 'tc_set'( Z ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.69/1.11 , 'v_S' ), :=( Z, 't_b' )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 factor(
% 0.69/1.11 clause( 166, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 165, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ), ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 1, 2, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 167, [ =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 166, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 110, [ ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ), =( X, 'c_Union'(
% 0.69/1.11 'v_S', 't_b' ) ) ] )
% 0.69/1.11 , clause( 167, [ =( X, 'c_Union'( 'v_S', 't_b' ) ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 169, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 110, [ ~( 'c_in'( X, 'v_S', 'tc_set'( 't_b' ) ) ), =( X,
% 0.69/1.11 'c_Union'( 'v_S', 't_b' ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 170, [ =( 'c_Union'( 'v_S', 't_b' ), 'c_Main_OsubsetI__1'( 'v_S',
% 0.69/1.11 'c_insert'( X, 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 169, [ =( 'c_Union'( 'v_S', 't_b' ), X ), ~( 'c_in'( X, 'v_S',
% 0.69/1.11 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 1, clause( 17, [ 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'v_S', 'tc_set'(
% 0.69/1.11 't_b' ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) )] ),
% 0.69/1.11 substitution( 1, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 171, [ =( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X, 'c_emptyset'
% 0.69/1.11 , 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_Union'( 'v_S', 't_b' ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 170, [ =( 'c_Union'( 'v_S', 't_b' ), 'c_Main_OsubsetI__1'( 'v_S'
% 0.69/1.11 , 'c_insert'( X, 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 116, [ =( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X, 'c_emptyset'
% 0.69/1.11 , 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_Union'( 'v_S', 't_b' ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 171, [ =( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_Union'( 'v_S'
% 0.69/1.11 , 't_b' ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 173, [ ~( 'c_in'( 'c_Union'( 'v_S', 't_b' ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 116, [ =( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_Union'( 'v_S'
% 0.69/1.11 , 't_b' ) ) ] )
% 0.69/1.11 , 0, clause( 13, [ ~( 'c_in'( 'c_Main_OsubsetI__1'( 'v_S', 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 0, 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 125, [ ~( 'c_in'( 'c_Union'( 'v_S', 't_b' ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , clause( 173, [ ~( 'c_in'( 'c_Union'( 'v_S', 't_b' ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 174, [] )
% 0.69/1.11 , clause( 125, [ ~( 'c_in'( 'c_Union'( 'v_S', 't_b' ), 'c_insert'( X,
% 0.69/1.11 'c_emptyset', 'tc_set'( 't_b' ) ), 'tc_set'( 't_b' ) ) ) ] )
% 0.69/1.11 , 0, clause( 4, [ 'c_in'( X, 'c_insert'( X, Y, Z ), Z ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'c_Union'( 'v_S', 't_b' ) )] ),
% 0.69/1.11 substitution( 1, [ :=( X, 'c_Union'( 'v_S', 't_b' ) ), :=( Y,
% 0.69/1.11 'c_emptyset' ), :=( Z, 'tc_set'( 't_b' ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 141, [] )
% 0.69/1.11 , clause( 174, [] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 end.
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 3080
% 0.69/1.11 space for clauses: 10037
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 4907
% 0.69/1.11 clauses kept: 142
% 0.69/1.11 clauses selected: 52
% 0.69/1.11 clauses deleted: 0
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 309
% 0.69/1.11 literals s-matched: 262
% 0.69/1.11 literals matched: 262
% 0.69/1.11 full subsumption: 90
% 0.69/1.11
% 0.69/1.11 checksum: -1183788748
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------