%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.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 : Sat Jul 16 13:12:33 EDT 2022
% Result : Unsatisfiable 0.73s 1.08s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.0.
% 0.02/0.12 % Command : bliksem %s
% 0.13/0.32 % Computer : n022.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % DateTime : Fri Jun 17 06:14:47 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.73/1.08 *** allocated 10000 integers for termspace/termends
% 0.73/1.08 *** allocated 10000 integers for clauses
% 0.73/1.08 *** allocated 10000 integers for justifications
% 0.73/1.08 Bliksem 1.12
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Automatic Strategy Selection
% 0.73/1.08
% 0.73/1.08 Clauses:
% 0.73/1.08 [
% 0.73/1.08 [ =( X, o ), =( X, i ) ],
% 0.73/1.08 [ ~( =( inv( X ), X ) ) ],
% 0.73/1.08 [ =( unpack1( X, Y, pack1( X, Y ) ), X ) ],
% 0.73/1.08 [ =( unpack1( inv( X ), Y, pack1( X, Y ) ), X ) ],
% 0.73/1.08 [ =( unpack1( X, inv( Y ), pack1( X, Y ) ), X ) ],
% 0.73/1.08 [ =( unpack1( X, Y, inv( pack1( X, Y ) ) ), X ) ],
% 0.73/1.08 [ =( unpack2( X, Y, pack1( X, Y ) ), Y ) ],
% 0.73/1.08 [ =( unpack2( inv( X ), Y, pack1( X, Y ) ), Y ) ],
% 0.73/1.08 [ =( unpack2( X, inv( Y ), pack1( X, Y ) ), Y ) ],
% 0.73/1.08 [ =( unpack2( X, Y, inv( pack1( X, Y ) ) ), Y ) ]
% 0.73/1.08 ] .
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 percentage equality = 1.000000, percentage horn = 0.900000
% 0.73/1.08 This is a pure equality problem
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Options Used:
% 0.73/1.08
% 0.73/1.08 useres = 1
% 0.73/1.08 useparamod = 1
% 0.73/1.08 useeqrefl = 1
% 0.73/1.08 useeqfact = 1
% 0.73/1.08 usefactor = 1
% 0.73/1.08 usesimpsplitting = 0
% 0.73/1.08 usesimpdemod = 5
% 0.73/1.08 usesimpres = 3
% 0.73/1.08
% 0.73/1.08 resimpinuse = 1000
% 0.73/1.08 resimpclauses = 20000
% 0.73/1.08 substype = eqrewr
% 0.73/1.08 backwardsubs = 1
% 0.73/1.08 selectoldest = 5
% 0.73/1.08
% 0.73/1.08 litorderings [0] = split
% 0.73/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.08
% 0.73/1.08 termordering = kbo
% 0.73/1.08
% 0.73/1.08 litapriori = 0
% 0.73/1.08 termapriori = 1
% 0.73/1.08 litaposteriori = 0
% 0.73/1.08 termaposteriori = 0
% 0.73/1.08 demodaposteriori = 0
% 0.73/1.08 ordereqreflfact = 0
% 0.73/1.08
% 0.73/1.08 litselect = negord
% 0.73/1.08
% 0.73/1.08 maxweight = 15
% 0.73/1.08 maxdepth = 30000
% 0.73/1.08 maxlength = 115
% 0.73/1.08 maxnrvars = 195
% 0.73/1.08 excuselevel = 1
% 0.73/1.08 increasemaxweight = 1
% 0.73/1.08
% 0.73/1.08 maxselected = 10000000
% 0.73/1.08 maxnrclauses = 10000000
% 0.73/1.08
% 0.73/1.08 showgenerated = 0
% 0.73/1.08 showkept = 0
% 0.73/1.08 showselected = 0
% 0.73/1.08 showdeleted = 0
% 0.73/1.08 showresimp = 1
% 0.73/1.08 showstatus = 2000
% 0.73/1.08
% 0.73/1.08 prologoutput = 1
% 0.73/1.08 nrgoals = 5000000
% 0.73/1.08 totalproof = 1
% 0.73/1.08
% 0.73/1.08 Symbols occurring in the translation:
% 0.73/1.08
% 0.73/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.08 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.73/1.08 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.73/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.08 o [40, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.73/1.08 i [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.73/1.08 inv [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.73/1.08 pack1 [45, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.73/1.08 unpack1 [46, 3] (w:1, o:46, a:1, s:1, b:0),
% 0.73/1.08 unpack2 [47, 3] (w:1, o:47, a:1, s:1, b:0).
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Starting Search:
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Bliksems!, er is een bewijs:
% 0.73/1.08 % SZS status Unsatisfiable
% 0.73/1.08 % SZS output start Refutation
% 0.73/1.08
% 0.73/1.08 clause( 0, [ =( X, o ), =( X, i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 1, [ ~( =( inv( X ), X ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 2, [ =( unpack1( X, Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 3, [ =( unpack1( inv( X ), Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 5, [ =( unpack1( X, Y, inv( pack1( X, Y ) ) ), X ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 10, [ ~( =( i, o ) ), =( X, i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 13, [ ~( =( i, X ) ), ~( =( i, o ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 14, [ ~( =( i, o ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 15, [ =( Y, X ), =( Y, i ), =( X, i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 17, [ ~( =( X, o ) ), =( X, o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 18, [ ~( =( o, X ) ), =( inv( X ), i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 19, [ ~( =( i, X ) ), =( inv( X ), o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 21, [ =( inv( o ), i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 26, [ ~( =( i, X ) ), =( X, i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 33, [ =( Y, o ), =( Y, X ), ~( =( i, X ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 34, [ ~( =( X, o ) ), ~( =( i, X ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 37, [ =( unpack1( X, Y, o ), X ), =( pack1( X, Y ), i ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 38, [ =( unpack1( X, Y, i ), X ), =( pack1( X, Y ), o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 39, [ =( Y, X ), =( Y, i ), ~( =( X, o ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 69, [ =( unpack1( i, X, pack1( o, X ) ), o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 175, [ ~( =( X, o ) ), =( X, Y ), ~( =( Y, o ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 213, [ =( unpack1( X, Y, o ), X ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 214, [ =( unpack1( X, Y, i ), X ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 220, [ =( unpack1( Y, Z, X ), Y ), ~( =( i, X ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 246, [ =( unpack1( i, Y, pack1( X, Y ) ), X ), =( X, Z ), ~( =( i,
% 0.73/1.08 Z ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 256, [ =( pack1( X, Y ), Z ), ~( =( i, Z ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 259, [ =( pack1( X, Y ), o ), ~( =( i, Z ) ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 274, [ =( pack1( X, Y ), o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 275, [ =( i, o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 276, [ =( X, o ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 285, [ =( X, Y ) ] )
% 0.73/1.08 .
% 0.73/1.08 clause( 286, [] )
% 0.73/1.08 .
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 % SZS output end Refutation
% 0.73/1.13 found a proof!
% 0.73/1.13
% 0.73/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.13
% 0.73/1.13 initialclauses(
% 0.73/1.13 [ clause( 288, [ =( X, o ), =( X, i ) ] )
% 0.73/1.13 , clause( 289, [ ~( =( inv( X ), X ) ) ] )
% 0.73/1.13 , clause( 290, [ =( unpack1( X, Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , clause( 291, [ =( unpack1( inv( X ), Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , clause( 292, [ =( unpack1( X, inv( Y ), pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , clause( 293, [ =( unpack1( X, Y, inv( pack1( X, Y ) ) ), X ) ] )
% 0.73/1.13 , clause( 294, [ =( unpack2( X, Y, pack1( X, Y ) ), Y ) ] )
% 0.73/1.13 , clause( 295, [ =( unpack2( inv( X ), Y, pack1( X, Y ) ), Y ) ] )
% 0.73/1.13 , clause( 296, [ =( unpack2( X, inv( Y ), pack1( X, Y ) ), Y ) ] )
% 0.73/1.13 , clause( 297, [ =( unpack2( X, Y, inv( pack1( X, Y ) ) ), Y ) ] )
% 0.73/1.13 ] ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 0, [ =( X, o ), =( X, i ) ] )
% 0.73/1.13 , clause( 288, [ =( X, o ), =( X, i ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.13 1 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 1, [ ~( =( inv( X ), X ) ) ] )
% 0.73/1.13 , clause( 289, [ ~( =( inv( X ), X ) ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 2, [ =( unpack1( X, Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , clause( 290, [ =( unpack1( X, Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.13 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 3, [ =( unpack1( inv( X ), Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , clause( 291, [ =( unpack1( inv( X ), Y, pack1( X, Y ) ), X ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.13 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 5, [ =( unpack1( X, Y, inv( pack1( X, Y ) ) ), X ) ] )
% 0.73/1.13 , clause( 293, [ =( unpack1( X, Y, inv( pack1( X, Y ) ) ), X ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.13 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqfact(
% 0.73/1.13 clause( 339, [ ~( =( o, i ) ), =( X, i ) ] )
% 0.73/1.13 , clause( 0, [ =( X, o ), =( X, i ) ] )
% 0.73/1.13 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 344, [ ~( =( i, o ) ), =( X, i ) ] )
% 0.73/1.13 , clause( 339, [ ~( =( o, i ) ), =( X, i ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 10, [ ~( =( i, o ) ), =( X, i ) ] )
% 0.73/1.13 , clause( 344, [ ~( =( i, o ) ), =( X, i ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.13 1 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 347, [ ~( =( o, i ) ), =( X, i ) ] )
% 0.73/1.13 , clause( 10, [ ~( =( i, o ) ), =( X, i ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 350, [ ~( =( X, inv( X ) ) ) ] )
% 0.73/1.13 , clause( 1, [ ~( =( inv( X ), X ) ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 paramod(
% 0.73/1.13 clause( 351, [ ~( =( X, i ) ), ~( =( o, i ) ) ] )
% 0.73/1.13 , clause( 347, [ ~( =( o, i ) ), =( X, i ) ] )
% 0.73/1.13 , 1, clause( 350, [ ~( =( X, inv( X ) ) ) ] )
% 0.73/1.13 , 0, 3, substitution( 0, [ :=( X, inv( X ) )] ), substitution( 1, [ :=( X,
% 0.73/1.13 X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 362, [ ~( =( i, o ) ), ~( =( X, i ) ) ] )
% 0.73/1.13 , clause( 351, [ ~( =( X, i ) ), ~( =( o, i ) ) ] )
% 0.73/1.13 , 1, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 363, [ ~( =( i, X ) ), ~( =( i, o ) ) ] )
% 0.73/1.13 , clause( 362, [ ~( =( i, o ) ), ~( =( X, i ) ) ] )
% 0.73/1.13 , 1, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 13, [ ~( =( i, X ) ), ~( =( i, o ) ) ] )
% 0.73/1.13 , clause( 363, [ ~( =( i, X ) ), ~( =( i, o ) ) ] )
% 0.73/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.13 1 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 366, [ ~( =( X, i ) ), ~( =( i, o ) ) ] )
% 0.73/1.13 , clause( 13, [ ~( =( i, X ) ), ~( =( i, o ) ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqrefl(
% 0.73/1.13 clause( 369, [ ~( =( i, o ) ) ] )
% 0.73/1.13 , clause( 366, [ ~( =( X, i ) ), ~( =( i, o ) ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, i )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 subsumption(
% 0.73/1.13 clause( 14, [ ~( =( i, o ) ) ] )
% 0.73/1.13 , clause( 369, [ ~( =( i, o ) ) ] )
% 0.73/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 371, [ =( o, X ), =( X, i ) ] )
% 0.73/1.13 , clause( 0, [ =( X, o ), =( X, i ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 eqswap(
% 0.73/1.13 clause( 374, [ =( o, X ), =( X, i ) ] )
% 0.73/1.13 , clause( 0, [ =( X, o ), =( X, i ) ] )
% 0.73/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.73/1.13
% 0.73/1.13
% 0.73/1.13 paramod(
% 0.73/1.13 clause( 377, [ =( Y, X ), =( Y, i ), =( X, i ) ] )
% 0.73/1.13 , clause( 371, [ =( o, X ), =( X, i ) ] )
% 0.73/1.13 , 0, clause( 374, [ =( o, X ), =( X, i ) ] )
% 0.73/1.13 , 0, 1, substitution( 0, [ :=( X, Y )] ), substiCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------