TSTP Solution File: GRP022-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:21 EDT 2022
% Result : Unsatisfiable 0.48s 1.11s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % DateTime : Tue Jun 14 13:54:58 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.48/1.11 *** allocated 10000 integers for termspace/termends
% 0.48/1.11 *** allocated 10000 integers for clauses
% 0.48/1.11 *** allocated 10000 integers for justifications
% 0.48/1.11 Bliksem 1.12
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Automatic Strategy Selection
% 0.48/1.11
% 0.48/1.11 Clauses:
% 0.48/1.11 [
% 0.48/1.11 [ =( multiply( identity, X ), X ) ],
% 0.48/1.11 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.48/1.11 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.48/1.11 ],
% 0.48/1.11 [ =( multiply( X, identity ), X ) ],
% 0.48/1.11 [ =( multiply( X, inverse( X ) ), identity ) ],
% 0.48/1.11 [ ~( =( inverse( inverse( a ) ), a ) ) ]
% 0.48/1.11 ] .
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 percentage equality = 1.000000, percentage horn = 1.000000
% 0.48/1.11 This is a pure equality problem
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Options Used:
% 0.48/1.11
% 0.48/1.11 useres = 1
% 0.48/1.11 useparamod = 1
% 0.48/1.11 useeqrefl = 1
% 0.48/1.11 useeqfact = 1
% 0.48/1.11 usefactor = 1
% 0.48/1.11 usesimpsplitting = 0
% 0.48/1.11 usesimpdemod = 5
% 0.48/1.11 usesimpres = 3
% 0.48/1.11
% 0.48/1.11 resimpinuse = 1000
% 0.48/1.11 resimpclauses = 20000
% 0.48/1.11 substype = eqrewr
% 0.48/1.11 backwardsubs = 1
% 0.48/1.11 selectoldest = 5
% 0.48/1.11
% 0.48/1.11 litorderings [0] = split
% 0.48/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.48/1.11
% 0.48/1.11 termordering = kbo
% 0.48/1.11
% 0.48/1.11 litapriori = 0
% 0.48/1.11 termapriori = 1
% 0.48/1.11 litaposteriori = 0
% 0.48/1.11 termaposteriori = 0
% 0.48/1.11 demodaposteriori = 0
% 0.48/1.11 ordereqreflfact = 0
% 0.48/1.11
% 0.48/1.11 litselect = negord
% 0.48/1.11
% 0.48/1.11 maxweight = 15
% 0.48/1.11 maxdepth = 30000
% 0.48/1.11 maxlength = 115
% 0.48/1.11 maxnrvars = 195
% 0.48/1.11 excuselevel = 1
% 0.48/1.11 increasemaxweight = 1
% 0.48/1.11
% 0.48/1.11 maxselected = 10000000
% 0.48/1.11 maxnrclauses = 10000000
% 0.48/1.11
% 0.48/1.11 showgenerated = 0
% 0.48/1.11 showkept = 0
% 0.48/1.11 showselected = 0
% 0.48/1.11 showdeleted = 0
% 0.48/1.11 showresimp = 1
% 0.48/1.11 showstatus = 2000
% 0.48/1.11
% 0.48/1.11 prologoutput = 1
% 0.48/1.11 nrgoals = 5000000
% 0.48/1.11 totalproof = 1
% 0.48/1.11
% 0.48/1.11 Symbols occurring in the translation:
% 0.48/1.11
% 0.48/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.48/1.11 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.48/1.11 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.48/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.48/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.48/1.11 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.48/1.11 multiply [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.48/1.11 inverse [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.48/1.11 a [45, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Starting Search:
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Bliksems!, er is een bewijs:
% 0.48/1.11 % SZS status Unsatisfiable
% 0.48/1.11 % SZS output start Refutation
% 0.48/1.11
% 0.48/1.11 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.48/1.11 , Z ) ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 3, [ =( multiply( X, identity ), X ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 4, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 5, [ ~( =( inverse( inverse( a ) ), a ) ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 9, [ =( multiply( multiply( Y, X ), inverse( X ) ), Y ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 12, [ =( inverse( inverse( X ) ), X ) ] )
% 0.48/1.11 .
% 0.48/1.11 clause( 13, [] )
% 0.48/1.11 .
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 % SZS output end Refutation
% 0.48/1.11 found a proof!
% 0.48/1.11
% 0.48/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.48/1.11
% 0.48/1.11 initialclauses(
% 0.48/1.11 [ clause( 15, [ =( multiply( identity, X ), X ) ] )
% 0.48/1.11 , clause( 16, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.48/1.11 , clause( 17, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.48/1.11 Y, Z ) ) ) ] )
% 0.48/1.11 , clause( 18, [ =( multiply( X, identity ), X ) ] )
% 0.48/1.11 , clause( 19, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.48/1.11 , clause( 20, [ ~( =( inverse( inverse( a ) ), a ) ) ] )
% 0.48/1.11 ] ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.48/1.11 , clause( 15, [ =( multiply( identity, X ), X ) ] )
% 0.48/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 eqswap(
% 0.48/1.11 clause( 24, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.48/1.11 ), Z ) ) ] )
% 0.48/1.11 , clause( 17, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.48/1.11 Y, Z ) ) ) ] )
% 0.48/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.48/1.11 , Z ) ) ] )
% 0.48/1.11 , clause( 24, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X,
% 0.48/1.11 Y ), Z ) ) ] )
% 0.48/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.48/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 3, [ =( multiply( X, identity ), X ) ] )
% 0.48/1.11 , clause( 18, [ =( multiply( X, identity ), X ) ] )
% 0.48/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 4, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.48/1.11 , clause( 19, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.48/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 5, [ ~( =( inverse( inverse( a ) ), a ) ) ] )
% 0.48/1.11 , clause( 20, [ ~( =( inverse( inverse( a ) ), a ) ) ] )
% 0.48/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 eqswap(
% 0.48/1.11 clause( 41, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y
% 0.48/1.11 , Z ) ) ) ] )
% 0.48/1.11 , clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.48/1.11 ), Z ) ) ] )
% 0.48/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 paramod(
% 0.48/1.11 clause( 45, [ =( multiply( multiply( X, Y ), inverse( Y ) ), multiply( X,
% 0.48/1.11 identity ) ) ] )
% 0.48/1.11 , clause( 4, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.48/1.11 , 0, clause( 41, [ =( multiply( multiply( X, Y ), Z ), multiply( X,
% 0.48/1.11 multiply( Y, Z ) ) ) ] )
% 0.48/1.11 , 0, 9, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.48/1.11 :=( Y, Y ), :=( Z, inverse( Y ) )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 paramod(
% 0.48/1.11 clause( 46, [ =( multiply( multiply( X, Y ), inverse( Y ) ), X ) ] )
% 0.48/1.11 , clause( 3, [ =( multiply( X, identity ), X ) ] )
% 0.48/1.11 , 0, clause( 45, [ =( multiply( multiply( X, Y ), inverse( Y ) ), multiply(
% 0.48/1.11 X, identity ) ) ] )
% 0.48/1.11 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.48/1.11 :=( Y, Y )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 9, [ =( multiply( multiply( Y, X ), inverse( X ) ), Y ) ] )
% 0.48/1.11 , clause( 46, [ =( multiply( multiply( X, Y ), inverse( Y ) ), X ) ] )
% 0.48/1.11 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.48/1.11 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 eqswap(
% 0.48/1.11 clause( 49, [ =( X, multiply( multiply( X, Y ), inverse( Y ) ) ) ] )
% 0.48/1.11 , clause( 9, [ =( multiply( multiply( Y, X ), inverse( X ) ), Y ) ] )
% 0.48/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 paramod(
% 0.48/1.11 clause( 51, [ =( X, multiply( identity, inverse( inverse( X ) ) ) ) ] )
% 0.48/1.11 , clause( 4, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.48/1.11 , 0, clause( 49, [ =( X, multiply( multiply( X, Y ), inverse( Y ) ) ) ] )
% 0.48/1.11 , 0, 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.48/1.11 :=( Y, inverse( X ) )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 paramod(
% 0.48/1.11 clause( 52, [ =( X, inverse( inverse( X ) ) ) ] )
% 0.48/1.11 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.48/1.11 , 0, clause( 51, [ =( X, multiply( identity, inverse( inverse( X ) ) ) ) ]
% 0.48/1.11 )
% 0.48/1.11 , 0, 2, substitution( 0, [ :=( X, inverse( inverse( X ) ) )] ),
% 0.48/1.11 substitution( 1, [ :=( X, X )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 eqswap(
% 0.48/1.11 clause( 53, [ =( inverse( inverse( X ) ), X ) ] )
% 0.48/1.11 , clause( 52, [ =( X, inverse( inverse( X ) ) ) ] )
% 0.48/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 12, [ =( inverse( inverse( X ) ), X ) ] )
% 0.48/1.11 , clause( 53, [ =( inverse( inverse( X ) ), X ) ] )
% 0.48/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 eqswap(
% 0.48/1.11 clause( 54, [ =( X, inverse( inverse( X ) ) ) ] )
% 0.48/1.11 , clause( 12, [ =( inverse( inverse( X ) ), X ) ] )
% 0.48/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 eqswap(
% 0.48/1.11 clause( 55, [ ~( =( a, inverse( inverse( a ) ) ) ) ] )
% 0.48/1.11 , clause( 5, [ ~( =( inverse( inverse( a ) ), a ) ) ] )
% 0.48/1.11 , 0, substitution( 0, [] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 resolution(
% 0.48/1.11 clause( 56, [] )
% 0.48/1.11 , clause( 55, [ ~( =( a, inverse( inverse( a ) ) ) ) ] )
% 0.48/1.11 , 0, clause( 54, [ =( X, inverse( inverse( X ) ) ) ] )
% 0.48/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 subsumption(
% 0.48/1.11 clause( 13, [] )
% 0.48/1.11 , clause( 56, [] )
% 0.48/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 end.
% 0.48/1.11
% 0.48/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.48/1.11
% 0.48/1.11 Memory use:
% 0.48/1.11
% 0.48/1.11 space for terms: 204
% 0.48/1.11 space for clauses: 1250
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 clauses generated: 48
% 0.48/1.11 clauses kept: 14
% 0.48/1.11 clauses selected: 9
% 0.48/1.11 clauses deleted: 0
% 0.48/1.11 clauses inuse deleted: 0
% 0.48/1.11
% 0.48/1.11 subsentry: 147
% 0.48/1.11 literals s-matched: 67
% 0.48/1.11 literals matched: 67
% 0.48/1.11 full subsumption: 0
% 0.48/1.11
% 0.48/1.11 checksum: 1162478541
% 0.48/1.11
% 0.48/1.11
% 0.48/1.11 Bliksem ended
%------------------------------------------------------------------------------