TSTP Solution File: GRP142-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP142-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:35:33 EDT 2022
% Result : Unsatisfiable 0.43s 1.16s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP142-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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 : Mon Jun 13 16:41:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.16 *** allocated 10000 integers for termspace/termends
% 0.43/1.16 *** allocated 10000 integers for clauses
% 0.43/1.16 *** allocated 10000 integers for justifications
% 0.43/1.16 Bliksem 1.12
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 Automatic Strategy Selection
% 0.43/1.16
% 0.43/1.16 Clauses:
% 0.43/1.16 [
% 0.43/1.16 [ =( multiply( identity, X ), X ) ],
% 0.43/1.16 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.43/1.16 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.43/1.16 ],
% 0.43/1.16 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.43/1.16 ,
% 0.43/1.16 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.43/1.16 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.16 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.43/1.16 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.16 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.43/1.16 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.43/1.16 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.43/1.16 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.43/1.16 ,
% 0.43/1.16 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.43/1.16 ,
% 0.43/1.16 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.43/1.16 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.16 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.16 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.16 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.43/1.16 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.16 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.16 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.16 [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), a ), a ) )
% 0.43/1.16 ]
% 0.43/1.16 ] .
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 percentage equality = 1.000000, percentage horn = 1.000000
% 0.43/1.16 This is a pure equality problem
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 Options Used:
% 0.43/1.16
% 0.43/1.16 useres = 1
% 0.43/1.16 useparamod = 1
% 0.43/1.16 useeqrefl = 1
% 0.43/1.16 useeqfact = 1
% 0.43/1.16 usefactor = 1
% 0.43/1.16 usesimpsplitting = 0
% 0.43/1.16 usesimpdemod = 5
% 0.43/1.16 usesimpres = 3
% 0.43/1.16
% 0.43/1.16 resimpinuse = 1000
% 0.43/1.16 resimpclauses = 20000
% 0.43/1.16 substype = eqrewr
% 0.43/1.16 backwardsubs = 1
% 0.43/1.16 selectoldest = 5
% 0.43/1.16
% 0.43/1.16 litorderings [0] = split
% 0.43/1.16 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.16
% 0.43/1.16 termordering = kbo
% 0.43/1.16
% 0.43/1.16 litapriori = 0
% 0.43/1.16 termapriori = 1
% 0.43/1.16 litaposteriori = 0
% 0.43/1.16 termaposteriori = 0
% 0.43/1.16 demodaposteriori = 0
% 0.43/1.16 ordereqreflfact = 0
% 0.43/1.16
% 0.43/1.16 litselect = negord
% 0.43/1.16
% 0.43/1.16 maxweight = 15
% 0.43/1.16 maxdepth = 30000
% 0.43/1.16 maxlength = 115
% 0.43/1.16 maxnrvars = 195
% 0.43/1.16 excuselevel = 1
% 0.43/1.16 increasemaxweight = 1
% 0.43/1.16
% 0.43/1.16 maxselected = 10000000
% 0.43/1.16 maxnrclauses = 10000000
% 0.43/1.16
% 0.43/1.16 showgenerated = 0
% 0.43/1.16 showkept = 0
% 0.43/1.16 showselected = 0
% 0.43/1.16 showdeleted = 0
% 0.43/1.16 showresimp = 1
% 0.43/1.16 showstatus = 2000
% 0.43/1.16
% 0.43/1.16 prologoutput = 1
% 0.43/1.16 nrgoals = 5000000
% 0.43/1.16 totalproof = 1
% 0.43/1.16
% 0.43/1.16 Symbols occurring in the translation:
% 0.43/1.16
% 0.43/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.16 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.16 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.43/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.16 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.43/1.16 multiply [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.43/1.16 inverse [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.43/1.16 'greatest_lower_bound' [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.43/1.16 'least_upper_bound' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.43/1.16 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.43/1.16 b [48, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 Starting Search:
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 Bliksems!, er is een bewijs:
% 0.43/1.16 % SZS status Unsatisfiable
% 0.43/1.16 % SZS output start Refutation
% 0.43/1.16
% 0.43/1.16 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.43/1.16 ] )
% 0.43/1.16 .
% 0.43/1.16 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.43/1.16 ) ] )
% 0.43/1.16 .
% 0.43/1.16 clause( 15, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), a
% 0.43/1.16 ), a ) ) ] )
% 0.43/1.16 .
% 0.43/1.16 clause( 37, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.43/1.16 X ) ] )
% 0.43/1.16 .
% 0.43/1.16 clause( 54, [] )
% 0.43/1.16 .
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 % SZS output end Refutation
% 0.43/1.16 found a proof!
% 0.43/1.16
% 0.43/1.16 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.16
% 0.43/1.16 initialclauses(
% 0.43/1.16 [ clause( 56, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.16 , clause( 57, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.16 , clause( 58, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.43/1.16 Y, Z ) ) ) ] )
% 0.43/1.16 , clause( 59, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.43/1.16 Y, X ) ) ] )
% 0.43/1.16 , clause( 60, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.16 ) ] )
% 0.43/1.16 , clause( 61, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.43/1.16 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.16 , clause( 62, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.16 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.16 , clause( 63, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.43/1.16 , clause( 64, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.43/1.16 , clause( 65, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.43/1.16 , X ) ] )
% 0.43/1.16 , clause( 66, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.16 , X ) ] )
% 0.43/1.16 , clause( 67, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.16 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.16 , clause( 68, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.16 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.16 , clause( 69, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.43/1.16 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.16 , clause( 70, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.16 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.16 , clause( 71, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ),
% 0.43/1.16 a ), a ) ) ] )
% 0.43/1.16 ] ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 subsumption(
% 0.43/1.16 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.43/1.16 ] )
% 0.43/1.16 , clause( 60, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.16 ) ] )
% 0.43/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.16 )] ) ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 subsumption(
% 0.43/1.16 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.43/1.16 ) ] )
% 0.43/1.16 , clause( 65, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.43/1.16 , X ) ] )
% 0.43/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.16 )] ) ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 subsumption(
% 0.43/1.16 clause( 15, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), a
% 0.43/1.16 ), a ) ) ] )
% 0.43/1.16 , clause( 71, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ),
% 0.43/1.16 a ), a ) ) ] )
% 0.43/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 eqswap(
% 0.43/1.16 clause( 97, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.43/1.16 ) ) ] )
% 0.43/1.16 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.43/1.16 , X ) ] )
% 0.43/1.16 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 paramod(
% 0.43/1.16 clause( 98, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.43/1.16 ) ) ] )
% 0.43/1.16 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.16 ) ] )
% 0.43/1.16 , 0, clause( 97, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X
% 0.43/1.16 , Y ) ) ) ] )
% 0.43/1.16 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'greatest_lower_bound'( X, Y
% 0.43/1.16 ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 eqswap(
% 0.43/1.16 clause( 101, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.43/1.16 , X ) ] )
% 0.43/1.16 , clause( 98, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ),
% 0.43/1.16 X ) ) ] )
% 0.43/1.16 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 subsumption(
% 0.43/1.16 clause( 37, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.43/1.16 X ) ] )
% 0.43/1.16 , clause( 101, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.43/1.16 ), X ) ] )
% 0.43/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.16 )] ) ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 paramod(
% 0.43/1.16 clause( 104, [ ~( =( a, a ) ) ] )
% 0.43/1.16 , clause( 37, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.43/1.16 , X ) ] )
% 0.43/1.16 , 0, clause( 15, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b
% 0.43/1.16 ), a ), a ) ) ] )
% 0.43/1.16 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.43/1.16 ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 eqrefl(
% 0.43/1.16 clause( 105, [] )
% 0.43/1.16 , clause( 104, [ ~( =( a, a ) ) ] )
% 0.43/1.16 , 0, substitution( 0, [] )).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 subsumption(
% 0.43/1.16 clause( 54, [] )
% 0.43/1.16 , clause( 105, [] )
% 0.43/1.16 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 end.
% 0.43/1.16
% 0.43/1.16 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.16
% 0.43/1.16 Memory use:
% 0.43/1.16
% 0.43/1.16 space for terms: 887
% 0.43/1.16 space for clauses: 5720
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 clauses generated: 221
% 0.43/1.16 clauses kept: 55
% 0.43/1.16 clauses selected: 17
% 0.43/1.16 clauses deleted: 1
% 0.43/1.16 clauses inuse deleted: 0
% 0.43/1.16
% 0.43/1.16 subsentry: 197
% 0.43/1.16 literals s-matched: 106
% 0.43/1.16 literals matched: 106
% 0.43/1.16 full subsumption: 0
% 0.43/1.16
% 0.43/1.16 checksum: -111926507
% 0.43/1.16
% 0.43/1.16
% 0.43/1.16 Bliksem ended
%------------------------------------------------------------------------------