%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET046-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:46:06 EDT 2022
% Result : Unsatisfiable 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET046-5 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sun Jul 10 21:43:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.10 *** allocated 10000 integers for termspace/termends
% 0.70/1.10 *** allocated 10000 integers for clauses
% 0.70/1.10 *** allocated 10000 integers for justifications
% 0.70/1.10 Bliksem 1.12
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Automatic Strategy Selection
% 0.70/1.10
% 0.70/1.10 Clauses:
% 0.70/1.10 [
% 0.70/1.10 [ ~( element( X, a ) ), ~( element( X, Y ) ), ~( element( Y, X ) ) ]
% 0.70/1.10 ,
% 0.70/1.10 [ element( X, f( X ) ), element( X, a ) ],
% 0.70/1.10 [ element( f( X ), X ), element( X, a ) ]
% 0.70/1.10 ] .
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 percentage equality = 0.000000, percentage horn = 0.333333
% 0.70/1.10 This a non-horn, non-equality problem
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Options Used:
% 0.70/1.10
% 0.70/1.10 useres = 1
% 0.70/1.10 useparamod = 0
% 0.70/1.10 useeqrefl = 0
% 0.70/1.10 useeqfact = 0
% 0.70/1.10 usefactor = 1
% 0.70/1.10 usesimpsplitting = 0
% 0.70/1.10 usesimpdemod = 0
% 0.70/1.10 usesimpres = 3
% 0.70/1.10
% 0.70/1.10 resimpinuse = 1000
% 0.70/1.10 resimpclauses = 20000
% 0.70/1.10 substype = standard
% 0.70/1.10 backwardsubs = 1
% 0.70/1.10 selectoldest = 5
% 0.70/1.10
% 0.70/1.10 litorderings [0] = split
% 0.70/1.10 litorderings [1] = liftord
% 0.70/1.10
% 0.70/1.10 termordering = none
% 0.70/1.10
% 0.70/1.10 litapriori = 1
% 0.70/1.10 termapriori = 0
% 0.70/1.10 litaposteriori = 0
% 0.70/1.10 termaposteriori = 0
% 0.70/1.10 demodaposteriori = 0
% 0.70/1.10 ordereqreflfact = 0
% 0.70/1.10
% 0.70/1.10 litselect = none
% 0.70/1.10
% 0.70/1.10 maxweight = 15
% 0.70/1.10 maxdepth = 30000
% 0.70/1.10 maxlength = 115
% 0.70/1.10 maxnrvars = 195
% 0.70/1.10 excuselevel = 1
% 0.70/1.10 increasemaxweight = 1
% 0.70/1.10
% 0.70/1.10 maxselected = 10000000
% 0.70/1.10 maxnrclauses = 10000000
% 0.70/1.10
% 0.70/1.10 showgenerated = 0
% 0.70/1.10 showkept = 0
% 0.70/1.10 showselected = 0
% 0.70/1.10 showdeleted = 0
% 0.70/1.10 showresimp = 1
% 0.70/1.10 showstatus = 2000
% 0.70/1.10
% 0.70/1.10 prologoutput = 1
% 0.70/1.10 nrgoals = 5000000
% 0.70/1.10 totalproof = 1
% 0.70/1.10
% 0.70/1.10 Symbols occurring in the translation:
% 0.70/1.10
% 0.70/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.10 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.70/1.10 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.70/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 a [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.70/1.10 element [41, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.70/1.10 f [43, 1] (w:1, o:17, a:1, s:1, b:0).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Starting Search:
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksems!, er is een bewijs:
% 0.70/1.10 % SZS status Unsatisfiable
% 0.70/1.10 % SZS output start Refutation
% 0.70/1.10
% 0.70/1.10 clause( 0, [ ~( element( X, Y ) ), ~( element( Y, X ) ), ~( element( X, a )
% 0.70/1.10 ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 1, [ element( X, a ), element( X, f( X ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 2, [ element( X, a ), element( f( X ), X ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 4, [ ~( element( a, X ) ), ~( element( X, a ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 5, [ ~( element( a, a ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 6, [ element( f( a ), a ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 12, [ element( X, a ), ~( element( f( X ), a ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 17, [] )
% 0.70/1.10 .
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 % SZS output end Refutation
% 0.70/1.10 found a proof!
% 0.70/1.10
% 0.70/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.10
% 0.70/1.10 initialclauses(
% 0.70/1.10 [ clause( 19, [ ~( element( X, a ) ), ~( element( X, Y ) ), ~( element( Y,
% 0.70/1.10 X ) ) ] )
% 0.70/1.10 , clause( 20, [ element( X, f( X ) ), element( X, a ) ] )
% 0.70/1.10 , clause( 21, [ element( f( X ), X ), element( X, a ) ] )
% 0.70/1.10 ] ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 0, [ ~( element( X, Y ) ), ~( element( Y, X ) ), ~( element( X, a )
% 0.70/1.10 ) ] )
% 0.70/1.10 , clause( 19, [ ~( element( X, a ) ), ~( element( X, Y ) ), ~( element( Y,
% 0.70/1.10 X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 2
% 0.70/1.10 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 1, [ element( X, a ), element( X, f( X ) ) ] )
% 0.70/1.10 , clause( 20, [ element( X, f( X ) ), element( X, a ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 2, [ element( X, a ), element( f( X ), X ) ] )
% 0.70/1.10 , clause( 21, [ element( f( X ), X ), element( X, a ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 factor(
% 0.70/1.10 clause( 32, [ ~( element( X, a ) ), ~( element( a, X ) ) ] )
% 0.70/1.10 , clause( 0, [ ~( element( X, Y ) ), ~( element( Y, X ) ), ~( element( X, a
% 0.70/1.10 ) ) ] )
% 0.70/1.10 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, a )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 4, [ ~( element( a, X ) ), ~( element( X, a ) ) ] )
% 0.70/1.10 , clause( 32, [ ~( element( X, a ) ), ~( element( a, X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 factor(
% 0.70/1.10 clause( 35, [ ~( element( X, a ) ), ~( element( a, X ) ) ] )
% 0.70/1.10 , clause( 0, [ ~( element( X, Y ) ), ~( element( Y, X ) ), ~( element( X, a
% 0.70/1.10 ) ) ] )
% 0.70/1.10 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, a )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 factor(
% 0.70/1.10 clause( 36, [ ~( element( a, a ) ) ] )
% 0.70/1.10 , clause( 35, [ ~( element( X, a ) ), ~( element( a, X ) ) ] )
% 0.70/1.10 , 0, 1, substitution( 0, [ :=( X, a )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 5, [ ~( element( a, a ) ) ] )
% 0.70/1.10 , clause( 36, [ ~( element( a, a ) ) ] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 37, [ ~( element( a, a ) ), element( f( a ), a ) ] )
% 0.70/1.10 , clause( 4, [ ~( element( a, X ) ), ~( element( X, a ) ) ] )
% 0.70/1.10 , 0, clause( 2, [ element( X, a ), element( f( X ), X ) ] )
% 0.70/1.10 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [ :=( X, a )] )
% 0.70/1.10 ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 40, [ element( f( a ), a ), element( f( a ), a ) ] )
% 0.70/1.10 , clause( 37, [ ~( element( a, a ) ), element( f( a ), a ) ] )
% 0.70/1.10 , 0, clause( 2, [ element( X, a ), element( f( X ), X ) ] )
% 0.70/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 factor(
% 0.70/1.10 clause( 41, [ element( f( a ), a ) ] )
% 0.70/1.10 , clause( 40, [ element( f( a ), a ), element( f( a ), a ) ] )
% 0.70/1.10 , 0, 1, substitution( 0, [] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 6, [ element( f( a ), a ) ] )
% 0.70/1.10 , clause( 41, [ element( f( a ), a ) ] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 43, [ ~( element( X, f( X ) ) ), ~( element( f( X ), a ) ), element(
% 0.70/1.10 X, a ) ] )
% 0.70/1.10 , clause( 0, [ ~( element( X, Y ) ), ~( element( Y, X ) ), ~( element( X, a
% 0.70/1.10 ) ) ] )
% 0.70/1.10 , 0, clause( 2, [ element( X, a ), element( f( X ), X ) ] )
% 0.70/1.10 , 1, substitution( 0, [ :=( X, f( X ) ), :=( Y, X )] ), substitution( 1, [
% 0.70/1.10 :=( X, X )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 51, [ ~( element( f( X ), a ) ), element( X, a ), element( X, a ) ]
% 0.70/1.10 )
% 0.70/1.10 , clause( 43, [ ~( element( X, f( X ) ) ), ~( element( f( X ), a ) ),
% 0.70/1.10 element( X, a ) ] )
% 0.70/1.10 , 0, clause( 1, [ element( X, a ), element( X, f( X ) ) ] )
% 0.70/1.10 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.70/1.10 ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 factor(
% 0.70/1.10 clause( 53, [ ~( element( f( X ), a ) ), element( X, a ) ] )
% 0.70/1.10 , clause( 51, [ ~( element( f( X ), a ) ), element( X, a ), element( X, a )
% 0.70/1.10 ] )
% 0.70/1.10 , 1, 2, substitution( 0, [ :=( X, X )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 12, [ element( X, a ), ~( element( f( X ), a ) ) ] )
% 0.70/1.10 , clause( 53, [ ~( element( f( X ), a ) ), element( X, a ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 54, [ element( a, a ) ] )
% 0.70/1.10 , clause( 12, [ element( X, a ), ~( element( f( X ), a ) ) ] )
% 0.70/1.10 , 1, clause( 6, [ element( f( a ), a ) ] )
% 0.70/1.10 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 55, [] )
% 0.70/1.10 , clause( 5, [ ~( element( a, a ) ) ] )
% 0.70/1.10 , 0, clause( 54, [ element( a, a ) ] )
% 0.70/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 17, [] )
% 0.70/1.10 , clause( 55, [] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 end.
% 0.70/1.10
% 0.70/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.10
% 0.70/1.10 Memory use:
% 0.70/1.10
% 0.70/1.10 space for terms: 217
% 0.70/1.10 space for clauses: 961
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 clauses generated: 34
% 0.70/1.10 clauses kept: 18
% 0.70/1.10 clauses selected: 9
% 0.70/1.10 clauses deleted: 0
% 0.70/1.10 clauses inuse deleted: 0
% 0.70/1.10
% 0.70/1.10 subsentry: 98
% 0.70/1.10 literals s-matched: 48
% 0.70/1.10 literals matched: 37
% 0.70/1.10 full subsumption: 5
% 0.70/1.10
% 0.70/1.10 checksum: -2012169227
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksem ended
%------------------------------------------------------------------------------