TSTP Solution File: LAT035-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LAT035-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n003.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 : Sun Jul 17 03:48:28 EDT 2022
% Result : Unsatisfiable 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT035-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n003.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 : Wed Jun 29 20:00:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09 [
% 0.70/1.09 [ =( meet( X, X ), X ) ],
% 0.70/1.09 [ =( join( X, X ), X ) ],
% 0.70/1.09 [ =( meet( X, join( X, Y ) ), X ) ],
% 0.70/1.09 [ =( join( X, meet( X, Y ) ), X ) ],
% 0.70/1.09 [ =( meet( X, Y ), meet( Y, X ) ) ],
% 0.70/1.09 [ =( join( X, Y ), join( Y, X ) ) ],
% 0.70/1.09 [ =( meet( meet( X, Y ), Z ), meet( X, meet( Y, Z ) ) ) ],
% 0.70/1.09 [ =( join( join( X, Y ), Z ), join( X, join( Y, Z ) ) ) ],
% 0.70/1.09 [ =( meet( X, n0 ), n0 ) ],
% 0.70/1.09 [ =( join( X, n0 ), X ) ],
% 0.70/1.09 [ =( meet( X, n1 ), X ) ],
% 0.70/1.09 [ =( join( X, n1 ), n1 ) ],
% 0.70/1.09 [ ~( =( meet( X, Y ), X ) ), =( meet( Y, join( X, Z ) ), join( X, meet(
% 0.70/1.09 Z, Y ) ) ) ],
% 0.70/1.09 [ =( k( join( X, Y ) ), meet( k( X ), k( Y ) ) ) ],
% 0.70/1.09 [ =( k( meet( X, Y ) ), join( k( X ), k( Y ) ) ) ],
% 0.70/1.09 [ =( k( n0 ), n1 ) ],
% 0.70/1.09 [ =( k( n1 ), n0 ) ],
% 0.70/1.09 [ =( f( meet( X, Y ) ), join( f( X ), f( Y ) ) ) ],
% 0.70/1.09 [ =( f( n1 ), n0 ) ],
% 0.70/1.09 [ ~( =( f( k( join( aa, bb ) ) ), join( f( k( aa ) ), f( k( bb ) ) ) ) )
% 0.70/1.09 , ~( =( f( k( n0 ) ), n0 ) ) ]
% 0.70/1.09 ] .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.09 This is a pure equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 1
% 0.70/1.09 useeqrefl = 1
% 0.70/1.09 useeqfact = 1
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 5
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = eqrewr
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.09
% 0.70/1.09 termordering = kbo
% 0.70/1.09
% 0.70/1.09 litapriori = 0
% 0.70/1.09 termapriori = 1
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = negord
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 1
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 meet [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.70/1.09 join [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.70/1.09 n0 [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.09 n1 [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.70/1.09 k [48, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.70/1.09 f [49, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.70/1.09 aa [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.70/1.09 bb [51, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Unsatisfiable
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 clause( 13, [ =( meet( k( X ), k( Y ) ), k( join( X, Y ) ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 15, [ =( k( n0 ), n1 ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 17, [ =( join( f( X ), f( Y ) ), f( meet( X, Y ) ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 18, [ =( f( n1 ), n0 ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 19, [] )
% 0.70/1.09 .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 initialclauses(
% 0.70/1.09 [ clause( 21, [ =( meet( X, X ), X ) ] )
% 0.70/1.09 , clause( 22, [ =( join( X, X ), X ) ] )
% 0.70/1.09 , clause( 23, [ =( meet( X, join( X, Y ) ), X ) ] )
% 0.70/1.09 , clause( 24, [ =( join( X, meet( X, Y ) ), X ) ] )
% 0.70/1.09 , clause( 25, [ =( meet( X, Y ), meet( Y, X ) ) ] )
% 0.70/1.09 , clause( 26, [ =( join( X, Y ), join( Y, X ) ) ] )
% 0.70/1.09 , clause( 27, [ =( meet( meet( X, Y ), Z ), meet( X, meet( Y, Z ) ) ) ] )
% 0.70/1.09 , clause( 28, [ =( join( join( X, Y ), Z ), join( X, join( Y, Z ) ) ) ] )
% 0.70/1.09 , clause( 29, [ =( meet( X, n0 ), n0 ) ] )
% 0.70/1.09 , clause( 30, [ =( join( X, n0 ), X ) ] )
% 0.70/1.09 , clause( 31, [ =( meet( X, n1 ), X ) ] )
% 0.70/1.09 , clause( 32, [ =( join( X, n1 ), n1 ) ] )
% 0.70/1.09 , clause( 33, [ ~( =( meet( X, Y ), X ) ), =( meet( Y, join( X, Z ) ), join(
% 0.70/1.09 X, meet( Z, Y ) ) ) ] )
% 0.70/1.09 , clause( 34, [ =( k( join( X, Y ) ), meet( k( X ), k( Y ) ) ) ] )
% 0.70/1.09 , clause( 35, [ =( k( meet( X, Y ) ), join( k( X ), k( Y ) ) ) ] )
% 0.70/1.09 , clause( 36, [ =( k( n0 ), n1 ) ] )
% 0.70/1.09 , clause( 37, [ =( k( n1 ), n0 ) ] )
% 0.70/1.09 , clause( 38, [ =( f( meet( X, Y ) ), join( f( X ), f( Y ) ) ) ] )
% 0.70/1.09 , clause( 39, [ =( f( n1 ), n0 ) ] )
% 0.70/1.09 , clause( 40, [ ~( =( f( k( join( aa, bb ) ) ), join( f( k( aa ) ), f( k(
% 0.70/1.09 bb ) ) ) ) ), ~( =( f( k( n0 ) ), n0 ) ) ] )
% 0.70/1.09 ] ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 54, [ =( meet( k( X ), k( Y ) ), k( join( X, Y ) ) ) ] )
% 0.70/1.09 , clause( 34, [ =( k( join( X, Y ) ), meet( k( X ), k( Y ) ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 13, [ =( meet( k( X ), k( Y ) ), k( join( X, Y ) ) ) ] )
% 0.70/1.09 , clause( 54, [ =( meet( k( X ), k( Y ) ), k( join( X, Y ) ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 15, [ =( k( n0 ), n1 ) ] )
% 0.70/1.09 , clause( 36, [ =( k( n0 ), n1 ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 88, [ =( join( f( X ), f( Y ) ), f( meet( X, Y ) ) ) ] )
% 0.70/1.09 , clause( 38, [ =( f( meet( X, Y ) ), join( f( X ), f( Y ) ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 17, [ =( join( f( X ), f( Y ) ), f( meet( X, Y ) ) ) ] )
% 0.70/1.09 , clause( 88, [ =( join( f( X ), f( Y ) ), f( meet( X, Y ) ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 18, [ =( f( n1 ), n0 ) ] )
% 0.70/1.09 , clause( 39, [ =( f( n1 ), n0 ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 212, [ ~( =( f( k( join( aa, bb ) ) ), f( meet( k( aa ), k( bb ) )
% 0.70/1.09 ) ) ), ~( =( f( k( n0 ) ), n0 ) ) ] )
% 0.70/1.09 , clause( 17, [ =( join( f( X ), f( Y ) ), f( meet( X, Y ) ) ) ] )
% 0.70/1.09 , 0, clause( 40, [ ~( =( f( k( join( aa, bb ) ) ), join( f( k( aa ) ), f( k(
% 0.70/1.09 bb ) ) ) ) ), ~( =( f( k( n0 ) ), n0 ) ) ] )
% 0.70/1.09 , 0, 7, substitution( 0, [ :=( X, k( aa ) ), :=( Y, k( bb ) )] ),
% 0.70/1.09 substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 213, [ ~( =( f( n1 ), n0 ) ), ~( =( f( k( join( aa, bb ) ) ), f(
% 0.70/1.09 meet( k( aa ), k( bb ) ) ) ) ) ] )
% 0.70/1.09 , clause( 15, [ =( k( n0 ), n1 ) ] )
% 0.70/1.09 , 0, clause( 212, [ ~( =( f( k( join( aa, bb ) ) ), f( meet( k( aa ), k( bb
% 0.70/1.09 ) ) ) ) ), ~( =( f( k( n0 ) ), n0 ) ) ] )
% 0.70/1.09 , 1, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 214, [ ~( =( f( k( join( aa, bb ) ) ), f( k( join( aa, bb ) ) ) ) )
% 0.70/1.09 , ~( =( f( n1 ), n0 ) ) ] )
% 0.70/1.09 , clause( 13, [ =( meet( k( X ), k( Y ) ), k( join( X, Y ) ) ) ] )
% 0.70/1.09 , 0, clause( 213, [ ~( =( f( n1 ), n0 ) ), ~( =( f( k( join( aa, bb ) ) ),
% 0.70/1.09 f( meet( k( aa ), k( bb ) ) ) ) ) ] )
% 0.70/1.09 , 1, 8, substitution( 0, [ :=( X, aa ), :=( Y, bb )] ), substitution( 1, [] )
% 0.70/1.09 ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 215, [ ~( =( n0, n0 ) ), ~( =( f( k( join( aa, bb ) ) ), f( k( join(
% 0.70/1.09 aa, bb ) ) ) ) ) ] )
% 0.70/1.09 , clause( 18, [ =( f( n1 ), n0 ) ] )
% 0.70/1.09 , 0, clause( 214, [ ~( =( f( k( join( aa, bb ) ) ), f( k( join( aa, bb ) )
% 0.70/1.09 ) ) ), ~( =( f( n1 ), n0 ) ) ] )
% 0.70/1.09 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqrefl(
% 0.70/1.09 clause( 216, [ ~( =( f( k( join( aa, bb ) ) ), f( k( join( aa, bb ) ) ) ) )
% 0.70/1.09 ] )
% 0.70/1.09 , clause( 215, [ ~( =( n0, n0 ) ), ~( =( f( k( join( aa, bb ) ) ), f( k(
% 0.70/1.09 join( aa, bb ) ) ) ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqrefl(
% 0.70/1.09 clause( 218, [] )
% 0.70/1.09 , clause( 216, [ ~( =( f( k( join( aa, bb ) ) ), f( k( join( aa, bb ) ) ) )
% 0.70/1.09 ) ] )
% 0.70/1.09 , 0, substitution( 0, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 19, [] )
% 0.70/1.09 , clause( 218, [] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 end.
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 548
% 0.70/1.09 space for clauses: 1696
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 20
% 0.70/1.09 clauses kept: 20
% 0.70/1.09 clauses selected: 0
% 0.70/1.09 clauses deleted: 0
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 827
% 0.70/1.09 literals s-matched: 341
% 0.70/1.09 literals matched: 341
% 0.70/1.09 full subsumption: 0
% 0.70/1.09
% 0.70/1.09 checksum: -106558092
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------