%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP042-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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 07:34:33 EDT 2022
% Result : Unsatisfiable 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP042-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.35 % Computer : n007.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % DateTime : Mon Jun 13 12:10:39 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.45/1.07 *** allocated 10000 integers for termspace/termends
% 0.45/1.07 *** allocated 10000 integers for clauses
% 0.45/1.07 *** allocated 10000 integers for justifications
% 0.45/1.07 Bliksem 1.12
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Automatic Strategy Selection
% 0.45/1.07
% 0.45/1.07 Clauses:
% 0.45/1.07 [
% 0.45/1.07 [ product( identity, X, X ) ],
% 0.45/1.07 [ product( inverse( X ), X, identity ) ],
% 0.45/1.07 [ product( X, Y, multiply( X, Y ) ) ],
% 0.45/1.07 [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish( Z, T ) ]
% 0.45/1.07 ,
% 0.45/1.07 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.45/1.07 ) ), product( X, U, W ) ],
% 0.45/1.07 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.45/1.07 ) ), product( Z, T, W ) ],
% 0.45/1.07 [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z, T, Y ) ]
% 0.45/1.07 ,
% 0.45/1.07 [ equalish( a, b ) ],
% 0.45/1.07 [ ~( equalish( b, a ) ) ]
% 0.45/1.07 ] .
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.45/1.07 This is a near-Horn, non-equality problem
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Options Used:
% 0.45/1.07
% 0.45/1.07 useres = 1
% 0.45/1.07 useparamod = 0
% 0.45/1.07 useeqrefl = 0
% 0.45/1.07 useeqfact = 0
% 0.45/1.07 usefactor = 1
% 0.45/1.07 usesimpsplitting = 0
% 0.45/1.07 usesimpdemod = 0
% 0.45/1.07 usesimpres = 4
% 0.45/1.07
% 0.45/1.07 resimpinuse = 1000
% 0.45/1.07 resimpclauses = 20000
% 0.45/1.07 substype = standard
% 0.45/1.07 backwardsubs = 1
% 0.45/1.07 selectoldest = 5
% 0.45/1.07
% 0.45/1.07 litorderings [0] = split
% 0.45/1.07 litorderings [1] = liftord
% 0.45/1.07
% 0.45/1.07 termordering = none
% 0.45/1.07
% 0.45/1.07 litapriori = 1
% 0.45/1.07 termapriori = 0
% 0.45/1.07 litaposteriori = 0
% 0.45/1.07 termaposteriori = 0
% 0.45/1.07 demodaposteriori = 0
% 0.45/1.07 ordereqreflfact = 0
% 0.45/1.07
% 0.45/1.07 litselect = negative
% 0.45/1.07
% 0.45/1.07 maxweight = 30000
% 0.45/1.07 maxdepth = 30000
% 0.45/1.07 maxlength = 115
% 0.45/1.07 maxnrvars = 195
% 0.45/1.07 excuselevel = 0
% 0.45/1.07 increasemaxweight = 0
% 0.45/1.07
% 0.45/1.07 maxselected = 10000000
% 0.45/1.07 maxnrclauses = 10000000
% 0.45/1.07
% 0.45/1.07 showgenerated = 0
% 0.45/1.07 showkept = 0
% 0.45/1.07 showselected = 0
% 0.45/1.07 showdeleted = 0
% 0.45/1.07 showresimp = 1
% 0.45/1.07 showstatus = 2000
% 0.45/1.07
% 0.45/1.07 prologoutput = 1
% 0.45/1.07 nrgoals = 5000000
% 0.45/1.07 totalproof = 1
% 0.45/1.07
% 0.45/1.07 Symbols occurring in the translation:
% 0.45/1.07
% 0.45/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.07 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.45/1.07 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.45/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.45/1.07 product [41, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.45/1.07 inverse [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.45/1.07 multiply [44, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.45/1.07 equalish [47, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.45/1.07 a [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.45/1.07 b [51, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Starting Search:
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Bliksems!, er is een bewijs:
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 clause( 0, [ product( identity, X, X ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.45/1.07 ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T, X
% 0.45/1.07 ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 7, [ equalish( a, b ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 8, [ ~( equalish( b, a ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 18, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 45, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 49, [ product( identity, a, b ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 53, [] )
% 0.45/1.07 .
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 found a proof!
% 0.45/1.07
% 0.45/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.07
% 0.45/1.07 initialclauses(
% 0.45/1.07 [ clause( 55, [ product( identity, X, X ) ] )
% 0.45/1.07 , clause( 56, [ product( inverse( X ), X, identity ) ] )
% 0.45/1.07 , clause( 57, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.45/1.07 , clause( 58, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.45/1.07 Z, T ) ] )
% 0.45/1.07 , clause( 59, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.45/1.07 product( Z, T, W ) ), product( X, U, W ) ] )
% 0.45/1.07 , clause( 60, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.45/1.07 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.45/1.07 , clause( 61, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z
% 0.45/1.07 , T, Y ) ] )
% 0.45/1.07 , clause( 62, [ equalish( a, b ) ] )
% 0.45/1.07 , clause( 63, [ ~( equalish( b, a ) ) ] )
% 0.45/1.07 ] ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 0, [ product( identity, X, X ) ] )
% 0.45/1.07 , clause( 55, [ product( identity, X, X ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.45/1.07 ) ) ] )
% 0.45/1.07 , clause( 58, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.45/1.07 Z, T ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.45/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T, X
% 0.45/1.07 ) ) ] )
% 0.45/1.07 , clause( 61, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z
% 0.45/1.07 , T, Y ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.45/1.07 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 7, [ equalish( a, b ) ] )
% 0.45/1.07 , clause( 62, [ equalish( a, b ) ] )
% 0.45/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 8, [ ~( equalish( b, a ) ) ] )
% 0.45/1.07 , clause( 63, [ ~( equalish( b, a ) ) ] )
% 0.45/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 resolution(
% 0.45/1.07 clause( 93, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.45/1.07 , clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y
% 0.45/1.07 , T ) ) ] )
% 0.45/1.07 , 2, clause( 0, [ product( identity, X, X ) ] )
% 0.45/1.07 , 0, substitution( 0, [ :=( X, identity ), :=( Y, Y ), :=( Z, X ), :=( T, Y
% 0.45/1.07 )] ), substitution( 1, [ :=( X, Y )] )).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 18, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.45/1.07 , clause( 93, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.07 ), ==>( 1, 1 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 resolution(
% 0.45/1.07 clause( 94, [ ~( equalish( X, Y ) ), product( identity, X, Y ) ] )
% 0.45/1.07 , clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T
% 0.45/1.07 , X ) ) ] )
% 0.45/1.07 , 2, clause( 0, [ product( identity, X, X ) ] )
% 0.45/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, identity ), :=( T, X
% 0.45/1.07 )] ), substitution( 1, [ :=( X, X )] )).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 45, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.45/1.07 , clause( 94, [ ~( equalish( X, Y ) ), product( identity, X, Y ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.45/1.07 ), ==>( 1, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 resolution(
% 0.45/1.07 clause( 95, [ product( identity, a, b ) ] )
% 0.45/1.07 , clause( 45, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.45/1.07 , 1, clause( 7, [ equalish( a, b ) ] )
% 0.45/1.07 , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.45/1.07 ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 49, [ product( identity, a, b ) ] )
% 0.45/1.07 , clause( 95, [ product( identity, a, b ) ] )
% 0.45/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 resolution(
% 0.45/1.07 clause( 96, [ equalish( b, a ) ] )
% 0.45/1.07 , clause( 18, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.45/1.07 , 1, clause( 49, [ product( identity, a, b ) ] )
% 0.45/1.07 , 0, substitution( 0, [ :=( X, b ), :=( Y, a )] ), substitution( 1, [] )
% 0.45/1.07 ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 resolution(
% 0.45/1.07 clause( 97, [] )
% 0.45/1.07 , clause( 8, [ ~( equalish( b, a ) ) ] )
% 0.45/1.07 , 0, clause( 96, [ equalish( b, a ) ] )
% 0.45/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 53, [] )
% 0.45/1.07 , clause( 97, [] )
% 0.45/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 end.
% 0.45/1.07
% 0.45/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.07
% 0.45/1.07 Memory use:
% 0.45/1.07
% 0.45/1.07 space for terms: 771
% 0.45/1.07 space for clauses: 3008
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 clauses generated: 71
% 0.45/1.07 clauses kept: 54
% 0.45/1.07 clauses selected: 23
% 0.45/1.07 clauses deleted: 2
% 0.45/1.07 clauses inuse deleted: 0
% 0.45/1.07
% 0.45/1.07 subsentry: 195
% 0.45/1.07 literals s-matched: 76
% 0.45/1.07 literals matched: 53
% 0.45/1.07 full subsumption: 25
% 0.45/1.07
% 0.45/1.07 checksum: -1893068300
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Bliksem ended
%------------------------------------------------------------------------------