TSTP Solution File: GRP189-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:36:01 EDT 2022
% Result : Unsatisfiable 0.64s 1.05s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.10 % Command : bliksem %s
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % DateTime : Tue Jun 14 06:34:21 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.64/1.05 *** allocated 10000 integers for termspace/termends
% 0.64/1.05 *** allocated 10000 integers for clauses
% 0.64/1.05 *** allocated 10000 integers for justifications
% 0.64/1.05 Bliksem 1.12
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Automatic Strategy Selection
% 0.64/1.05
% 0.64/1.05 Clauses:
% 0.64/1.05 [
% 0.64/1.05 [ =( multiply( identity, X ), X ) ],
% 0.64/1.05 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.64/1.05 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.64/1.05 ],
% 0.64/1.05 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.64/1.05 ,
% 0.64/1.05 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.64/1.05 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.64/1.05 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.64/1.05 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.64/1.05 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.64/1.05 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.64/1.05 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.64/1.05 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.64/1.05 ,
% 0.64/1.05 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.64/1.05 ,
% 0.64/1.05 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.64/1.05 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.64/1.05 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.64/1.05 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.64/1.05 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.64/1.05 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.64/1.05 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.64/1.05 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.64/1.05 [ =( inverse( identity ), identity ) ],
% 0.64/1.05 [ =( inverse( inverse( X ) ), X ) ],
% 0.64/1.05 [ =( inverse( multiply( X, Y ) ), multiply( inverse( Y ), inverse( X ) )
% 0.64/1.05 ) ],
% 0.64/1.05 [ ~( =( 'greatest_lower_bound'( b, 'least_upper_bound'( a, b ) ), b ) )
% 0.64/1.05 ]
% 0.64/1.05 ] .
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 percentage equality = 1.000000, percentage horn = 1.000000
% 0.64/1.05 This is a pure equality problem
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Options Used:
% 0.64/1.05
% 0.64/1.05 useres = 1
% 0.64/1.05 useparamod = 1
% 0.64/1.05 useeqrefl = 1
% 0.64/1.05 useeqfact = 1
% 0.64/1.05 usefactor = 1
% 0.64/1.05 usesimpsplitting = 0
% 0.64/1.05 usesimpdemod = 5
% 0.64/1.05 usesimpres = 3
% 0.64/1.05
% 0.64/1.05 resimpinuse = 1000
% 0.64/1.05 resimpclauses = 20000
% 0.64/1.05 substype = eqrewr
% 0.64/1.05 backwardsubs = 1
% 0.64/1.05 selectoldest = 5
% 0.64/1.05
% 0.64/1.05 litorderings [0] = split
% 0.64/1.05 litorderings [1] = extend the termordering, first sorting on arguments
% 0.64/1.05
% 0.64/1.05 termordering = kbo
% 0.64/1.05
% 0.64/1.05 litapriori = 0
% 0.64/1.05 termapriori = 1
% 0.64/1.05 litaposteriori = 0
% 0.64/1.05 termaposteriori = 0
% 0.64/1.05 demodaposteriori = 0
% 0.64/1.05 ordereqreflfact = 0
% 0.64/1.05
% 0.64/1.05 litselect = negord
% 0.64/1.05
% 0.64/1.05 maxweight = 15
% 0.64/1.05 maxdepth = 30000
% 0.64/1.05 maxlength = 115
% 0.64/1.05 maxnrvars = 195
% 0.64/1.05 excuselevel = 1
% 0.64/1.05 increasemaxweight = 1
% 0.64/1.05
% 0.64/1.05 maxselected = 10000000
% 0.64/1.05 maxnrclauses = 10000000
% 0.64/1.05
% 0.64/1.05 showgenerated = 0
% 0.64/1.05 showkept = 0
% 0.64/1.05 showselected = 0
% 0.64/1.05 showdeleted = 0
% 0.64/1.05 showresimp = 1
% 0.64/1.05 showstatus = 2000
% 0.64/1.05
% 0.64/1.05 prologoutput = 1
% 0.64/1.05 nrgoals = 5000000
% 0.64/1.05 totalproof = 1
% 0.64/1.05
% 0.64/1.05 Symbols occurring in the translation:
% 0.64/1.05
% 0.64/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.64/1.05 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.64/1.05 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.64/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.05 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.64/1.05 multiply [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.64/1.05 inverse [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.64/1.05 'greatest_lower_bound' [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.64/1.05 'least_upper_bound' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.64/1.05 b [47, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.64/1.05 a [48, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Starting Search:
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Bliksems!, er is een bewijs:
% 0.64/1.05 % SZS status Unsatisfiable
% 0.64/1.05 % SZS output start Refutation
% 0.64/1.05
% 0.64/1.05 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.64/1.05 ] )
% 0.64/1.05 .
% 0.64/1.05 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.64/1.05 X ) ] )
% 0.64/1.05 .
% 0.64/1.05 clause( 18, [ ~( =( 'greatest_lower_bound'( b, 'least_upper_bound'( a, b )
% 0.64/1.05 ), b ) ) ] )
% 0.64/1.05 .
% 0.64/1.05 clause( 21, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) ),
% 0.64/1.05 X ) ] )
% 0.64/1.05 .
% 0.64/1.05 clause( 46, [] )
% 0.64/1.05 .
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 % SZS output end Refutation
% 0.64/1.05 found a proof!
% 0.64/1.05
% 0.64/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.64/1.05
% 0.64/1.05 initialclauses(
% 0.64/1.05 [ clause( 48, [ =( multiply( identity, X ), X ) ] )
% 0.64/1.05 , clause( 49, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.64/1.05 , clause( 50, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.64/1.05 Y, Z ) ) ) ] )
% 0.64/1.05 , clause( 51, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.64/1.05 Y, X ) ) ] )
% 0.64/1.05 , clause( 52, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.64/1.05 ) ] )
% 0.64/1.05 , clause( 53, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.64/1.05 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.64/1.05 , clause( 54, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.64/1.05 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.64/1.05 , clause( 55, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.64/1.05 , clause( 56, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.64/1.05 , clause( 57, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.64/1.05 , X ) ] )
% 0.64/1.05 , clause( 58, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.64/1.05 , X ) ] )
% 0.64/1.05 , clause( 59, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.64/1.05 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.64/1.05 , clause( 60, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.64/1.05 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.64/1.05 , clause( 61, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.64/1.05 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.64/1.05 , clause( 62, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.64/1.05 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.64/1.05 , clause( 63, [ =( inverse( identity ), identity ) ] )
% 0.64/1.05 , clause( 64, [ =( inverse( inverse( X ) ), X ) ] )
% 0.64/1.05 , clause( 65, [ =( inverse( multiply( X, Y ) ), multiply( inverse( Y ),
% 0.64/1.05 inverse( X ) ) ) ] )
% 0.64/1.05 , clause( 66, [ ~( =( 'greatest_lower_bound'( b, 'least_upper_bound'( a, b
% 0.64/1.05 ) ), b ) ) ] )
% 0.64/1.05 ] ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 subsumption(
% 0.64/1.05 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.64/1.05 ] )
% 0.64/1.05 , clause( 52, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.64/1.05 ) ] )
% 0.64/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.05 )] ) ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 subsumption(
% 0.64/1.05 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.64/1.05 X ) ] )
% 0.64/1.05 , clause( 58, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.64/1.05 , X ) ] )
% 0.64/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.05 )] ) ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 subsumption(
% 0.64/1.05 clause( 18, [ ~( =( 'greatest_lower_bound'( b, 'least_upper_bound'( a, b )
% 0.64/1.05 ), b ) ) ] )
% 0.64/1.05 , clause( 66, [ ~( =( 'greatest_lower_bound'( b, 'least_upper_bound'( a, b
% 0.64/1.05 ) ), b ) ) ] )
% 0.64/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 eqswap(
% 0.64/1.05 clause( 96, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.64/1.05 ) ) ] )
% 0.64/1.05 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.64/1.05 , X ) ] )
% 0.64/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 paramod(
% 0.64/1.05 clause( 97, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X )
% 0.64/1.05 ) ) ] )
% 0.64/1.05 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.64/1.05 ) ] )
% 0.64/1.05 , 0, clause( 96, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.64/1.05 , Y ) ) ) ] )
% 0.64/1.05 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.64/1.05 :=( X, X ), :=( Y, Y )] )).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 eqswap(
% 0.64/1.05 clause( 100, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) )
% 0.64/1.05 , X ) ] )
% 0.64/1.05 , clause( 97, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X
% 0.64/1.05 ) ) ) ] )
% 0.64/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 subsumption(
% 0.64/1.05 clause( 21, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) ),
% 0.64/1.05 X ) ] )
% 0.64/1.05 , clause( 100, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X )
% 0.64/1.05 ), X ) ] )
% 0.64/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.05 )] ) ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 paramod(
% 0.64/1.05 clause( 103, [ ~( =( b, b ) ) ] )
% 0.64/1.05 , clause( 21, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) )
% 0.64/1.05 , X ) ] )
% 0.64/1.05 , 0, clause( 18, [ ~( =( 'greatest_lower_bound'( b, 'least_upper_bound'( a
% 0.64/1.05 , b ) ), b ) ) ] )
% 0.64/1.05 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, a )] ), substitution( 1, [] )
% 0.64/1.05 ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 eqrefl(
% 0.64/1.05 clause( 104, [] )
% 0.64/1.05 , clause( 103, [ ~( =( b, b ) ) ] )
% 0.64/1.05 , 0, substitution( 0, [] )).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 subsumption(
% 0.64/1.05 clause( 46, [] )
% 0.64/1.05 , clause( 104, [] )
% 0.64/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 end.
% 0.64/1.05
% 0.64/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.64/1.05
% 0.64/1.05 Memory use:
% 0.64/1.05
% 0.64/1.05 space for terms: 825
% 0.64/1.05 space for clauses: 4674
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 clauses generated: 215
% 0.64/1.05 clauses kept: 47
% 0.64/1.05 clauses selected: 19
% 0.64/1.05 clauses deleted: 1
% 0.64/1.05 clauses inuse deleted: 0
% 0.64/1.05
% 0.64/1.05 subsentry: 217
% 0.64/1.05 literals s-matched: 118
% 0.64/1.05 literals matched: 114
% 0.64/1.05 full subsumption: 0
% 0.64/1.05
% 0.64/1.05 checksum: 1179005956
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Bliksem ended
%------------------------------------------------------------------------------