TSTP Solution File: GRP003-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP003-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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:14 EDT 2022
% Result : Unsatisfiable 0.67s 1.09s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP003-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Tue Jun 14 08:40:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.08 *** allocated 10000 integers for termspace/termends
% 0.67/1.08 *** allocated 10000 integers for clauses
% 0.67/1.08 *** allocated 10000 integers for justifications
% 0.67/1.08 Bliksem 1.12
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Automatic Strategy Selection
% 0.67/1.08
% 0.67/1.08 Clauses:
% 0.67/1.08 [
% 0.67/1.08 [ product( identity, X, X ) ],
% 0.67/1.08 [ product( inverse( X ), X, identity ) ],
% 0.67/1.08 [ product( X, Y, multiply( X, Y ) ) ],
% 0.67/1.08 [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish( Z, T ) ]
% 0.67/1.08 ,
% 0.67/1.08 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.67/1.08 ) ), product( X, U, W ) ],
% 0.67/1.08 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.67/1.08 ) ), product( Z, T, W ) ],
% 0.67/1.08 [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z, T, Y ) ]
% 0.67/1.08 ,
% 0.67/1.08 [ ~( product( a, identity, a ) ) ]
% 0.67/1.08 ] .
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.67/1.08 This is a near-Horn, non-equality problem
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Options Used:
% 0.67/1.08
% 0.67/1.08 useres = 1
% 0.67/1.08 useparamod = 0
% 0.67/1.08 useeqrefl = 0
% 0.67/1.08 useeqfact = 0
% 0.67/1.08 usefactor = 1
% 0.67/1.08 usesimpsplitting = 0
% 0.67/1.08 usesimpdemod = 0
% 0.67/1.08 usesimpres = 4
% 0.67/1.08
% 0.67/1.08 resimpinuse = 1000
% 0.67/1.08 resimpclauses = 20000
% 0.67/1.08 substype = standard
% 0.67/1.08 backwardsubs = 1
% 0.67/1.08 selectoldest = 5
% 0.67/1.08
% 0.67/1.08 litorderings [0] = split
% 0.67/1.08 litorderings [1] = liftord
% 0.67/1.08
% 0.67/1.08 termordering = none
% 0.67/1.08
% 0.67/1.08 litapriori = 1
% 0.67/1.08 termapriori = 0
% 0.67/1.08 litaposteriori = 0
% 0.67/1.08 termaposteriori = 0
% 0.67/1.08 demodaposteriori = 0
% 0.67/1.08 ordereqreflfact = 0
% 0.67/1.08
% 0.67/1.08 litselect = negative
% 0.67/1.08
% 0.67/1.08 maxweight = 30000
% 0.67/1.08 maxdepth = 30000
% 0.67/1.08 maxlength = 115
% 0.67/1.08 maxnrvars = 195
% 0.67/1.08 excuselevel = 0
% 0.67/1.08 increasemaxweight = 0
% 0.67/1.08
% 0.67/1.08 maxselected = 10000000
% 0.67/1.08 maxnrclauses = 10000000
% 0.67/1.08
% 0.67/1.08 showgenerated = 0
% 0.67/1.08 showkept = 0
% 0.67/1.08 showselected = 0
% 0.67/1.08 showdeleted = 0
% 0.67/1.08 showresimp = 1
% 0.67/1.08 showstatus = 2000
% 0.67/1.08
% 0.67/1.08 prologoutput = 1
% 0.67/1.08 nrgoals = 5000000
% 0.67/1.08 totalproof = 1
% 0.67/1.08
% 0.67/1.08 Symbols occurring in the translation:
% 0.67/1.08
% 0.67/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.08 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.67/1.08 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.67/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.09 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.67/1.09 product [41, 3] (w:1, o:50, a:1, s:1, b:0),
% 0.67/1.09 inverse [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.67/1.09 multiply [44, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.67/1.09 equalish [47, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.67/1.09 a [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 Starting Search:
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 Bliksems!, er is een bewijs:
% 0.67/1.09 % SZS status Unsatisfiable
% 0.67/1.09 % SZS output start Refutation
% 0.67/1.09
% 0.67/1.09 clause( 0, [ product( identity, X, X ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 4, [ ~( product( Y, T, U ) ), ~( product( X, Y, Z ) ), product( X,
% 0.67/1.09 U, W ), ~( product( Z, T, W ) ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, U, W ) ), product( Z,
% 0.67/1.09 T, W ), ~( product( Y, T, U ) ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 7, [ ~( product( a, identity, a ) ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 24, [ ~( product( X, Y, Z ) ), product( T, Z, Y ), ~( product( T, X
% 0.67/1.09 , identity ) ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 31, [ ~( product( X, identity, Y ) ), product( Y, Z, T ), ~(
% 0.67/1.09 product( X, Z, T ) ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 32, [ product( Y, identity, Y ), ~( product( X, identity, Y ) ) ]
% 0.67/1.09 )
% 0.67/1.09 .
% 0.67/1.09 clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 438, [ product( inverse( inverse( X ) ), identity, X ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 607, [ product( X, identity, X ) ] )
% 0.67/1.09 .
% 0.67/1.09 clause( 622, [] )
% 0.67/1.09 .
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 % SZS output end Refutation
% 0.67/1.09 found a proof!
% 0.67/1.09
% 0.67/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.09
% 0.67/1.09 initialclauses(
% 0.67/1.09 [ clause( 624, [ product( identity, X, X ) ] )
% 0.67/1.09 , clause( 625, [ product( inverse( X ), X, identity ) ] )
% 0.67/1.09 , clause( 626, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.67/1.09 , clause( 627, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.67/1.09 Z, T ) ] )
% 0.67/1.09 , clause( 628, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.67/1.09 product( Z, T, W ) ), product( X, U, W ) ] )
% 0.67/1.09 , clause( 629, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.67/1.09 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.67/1.09 , clause( 630, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z
% 0.67/1.09 , T, Y ) ] )
% 0.67/1.09 , clause( 631, [ ~( product( a, identity, a ) ) ] )
% 0.67/1.09 ] ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 0, [ product( identity, X, X ) ] )
% 0.67/1.09 , clause( 624, [ product( identity, X, X ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.67/1.09 , clause( 625, [ product( inverse( X ), X, identity ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 4, [ ~( product( Y, T, U ) ), ~( product( X, Y, Z ) ), product( X,
% 0.67/1.09 U, W ), ~( product( Z, T, W ) ) ] )
% 0.67/1.09 , clause( 628, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.67/1.09 product( Z, T, W ) ), product( X, U, W ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.67/1.09 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2
% 0.67/1.09 , 3 ), ==>( 3, 2 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, U, W ) ), product( Z,
% 0.67/1.09 T, W ), ~( product( Y, T, U ) ) ] )
% 0.67/1.09 , clause( 629, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.67/1.09 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.67/1.09 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 3 ), ==>( 2
% 0.67/1.09 , 1 ), ==>( 3, 2 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 7, [ ~( product( a, identity, a ) ) ] )
% 0.67/1.09 , clause( 631, [ ~( product( a, identity, a ) ) ] )
% 0.67/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 resolution(
% 0.67/1.09 clause( 657, [ ~( product( X, Y, Z ) ), ~( product( T, X, identity ) ),
% 0.67/1.09 product( T, Z, Y ) ] )
% 0.67/1.09 , clause( 4, [ ~( product( Y, T, U ) ), ~( product( X, Y, Z ) ), product( X
% 0.67/1.09 , U, W ), ~( product( Z, T, W ) ) ] )
% 0.67/1.09 , 3, clause( 0, [ product( identity, X, X ) ] )
% 0.67/1.09 , 0, substitution( 0, [ :=( X, T ), :=( Y, X ), :=( Z, identity ), :=( T, Y
% 0.67/1.09 ), :=( U, Z ), :=( W, Y )] ), substitution( 1, [ :=( X, Y )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 24, [ ~( product( X, Y, Z ) ), product( T, Z, Y ), ~( product( T, X
% 0.67/1.09 , identity ) ) ] )
% 0.67/1.09 , clause( 657, [ ~( product( X, Y, Z ) ), ~( product( T, X, identity ) ),
% 0.67/1.09 product( T, Z, Y ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.67/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 resolution(
% 0.67/1.09 clause( 663, [ ~( product( X, identity, Y ) ), ~( product( X, Z, T ) ),
% 0.67/1.09 product( Y, Z, T ) ] )
% 0.67/1.09 , clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, U, W ) ), product( Z
% 0.67/1.09 , T, W ), ~( product( Y, T, U ) ) ] )
% 0.67/1.09 , 3, clause( 0, [ product( identity, X, X ) ] )
% 0.67/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, identity ), :=( Z, Y ), :=( T, Z
% 0.67/1.09 ), :=( U, Z ), :=( W, T )] ), substitution( 1, [ :=( X, Z )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 31, [ ~( product( X, identity, Y ) ), product( Y, Z, T ), ~(
% 0.67/1.09 product( X, Z, T ) ) ] )
% 0.67/1.09 , clause( 663, [ ~( product( X, identity, Y ) ), ~( product( X, Z, T ) ),
% 0.67/1.09 product( Y, Z, T ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.67/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 factor(
% 0.67/1.09 clause( 667, [ ~( product( X, identity, Y ) ), product( Y, identity, Y ) ]
% 0.67/1.09 )
% 0.67/1.09 , clause( 31, [ ~( product( X, identity, Y ) ), product( Y, Z, T ), ~(
% 0.67/1.09 product( X, Z, T ) ) ] )
% 0.67/1.09 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, identity ), :=( T
% 0.67/1.09 , Y )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 32, [ product( Y, identity, Y ), ~( product( X, identity, Y ) ) ]
% 0.67/1.09 )
% 0.67/1.09 , clause( 667, [ ~( product( X, identity, Y ) ), product( Y, identity, Y )
% 0.67/1.09 ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.67/1.09 ), ==>( 1, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 resolution(
% 0.67/1.09 clause( 669, [ ~( product( X, Y, Z ) ), product( inverse( X ), Z, Y ) ] )
% 0.67/1.09 , clause( 24, [ ~( product( X, Y, Z ) ), product( T, Z, Y ), ~( product( T
% 0.67/1.09 , X, identity ) ) ] )
% 0.67/1.09 , 2, clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.67/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, inverse(
% 0.67/1.09 X ) )] ), substitution( 1, [ :=( X, X )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ] )
% 0.67/1.09 , clause( 669, [ ~( product( X, Y, Z ) ), product( inverse( X ), Z, Y ) ]
% 0.67/1.09 )
% 0.67/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 resolution(
% 0.67/1.09 clause( 670, [ product( inverse( inverse( X ) ), identity, X ) ] )
% 0.67/1.09 , clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ]
% 0.67/1.09 )
% 0.67/1.09 , 1, clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.67/1.09 , 0, substitution( 0, [ :=( X, inverse( X ) ), :=( Y, X ), :=( Z, identity
% 0.67/1.09 )] ), substitution( 1, [ :=( X, X )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 438, [ product( inverse( inverse( X ) ), identity, X ) ] )
% 0.67/1.09 , clause( 670, [ product( inverse( inverse( X ) ), identity, X ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 resolution(
% 0.67/1.09 clause( 671, [ product( X, identity, X ) ] )
% 0.67/1.09 , clause( 32, [ product( Y, identity, Y ), ~( product( X, identity, Y ) ) ]
% 0.67/1.09 )
% 0.67/1.09 , 1, clause( 438, [ product( inverse( inverse( X ) ), identity, X ) ] )
% 0.67/1.09 , 0, substitution( 0, [ :=( X, inverse( inverse( X ) ) ), :=( Y, X )] ),
% 0.67/1.09 substitution( 1, [ :=( X, X )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 607, [ product( X, identity, X ) ] )
% 0.67/1.09 , clause( 671, [ product( X, identity, X ) ] )
% 0.67/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 resolution(
% 0.67/1.09 clause( 672, [] )
% 0.67/1.09 , clause( 7, [ ~( product( a, identity, a ) ) ] )
% 0.67/1.09 , 0, clause( 607, [ product( X, identity, X ) ] )
% 0.67/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 subsumption(
% 0.67/1.09 clause( 622, [] )
% 0.67/1.09 , clause( 672, [] )
% 0.67/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 end.
% 0.67/1.09
% 0.67/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.09
% 0.67/1.09 Memory use:
% 0.67/1.09
% 0.67/1.09 space for terms: 8311
% 0.67/1.09 space for clauses: 35753
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 clauses generated: 880
% 0.67/1.09 clauses kept: 623
% 0.67/1.09 clauses selected: 98
% 0.67/1.09 clauses deleted: 5
% 0.67/1.09 clauses inuse deleted: 0
% 0.67/1.09
% 0.67/1.09 subsentry: 3217
% 0.67/1.09 literals s-matched: 810
% 0.67/1.09 literals matched: 614
% 0.67/1.09 full subsumption: 135
% 0.67/1.09
% 0.67/1.09 checksum: -2051160100
% 0.67/1.09
% 0.67/1.09
% 0.67/1.09 Bliksem ended
%------------------------------------------------------------------------------