TSTP Solution File: GRP146-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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:34 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n019.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 20:53:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.07 *** allocated 10000 integers for termspace/termends
% 0.43/1.07 *** allocated 10000 integers for clauses
% 0.43/1.07 *** allocated 10000 integers for justifications
% 0.43/1.07 Bliksem 1.12
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Automatic Strategy Selection
% 0.43/1.07
% 0.43/1.07 Clauses:
% 0.43/1.07 [
% 0.43/1.07 [ =( multiply( identity, X ), X ) ],
% 0.43/1.07 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.43/1.07 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.43/1.07 ],
% 0.43/1.07 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.43/1.07 ,
% 0.43/1.07 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.43/1.07 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.07 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.43/1.07 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.43/1.07 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.43/1.07 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.43/1.07 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.43/1.07 ,
% 0.43/1.07 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.43/1.07 ,
% 0.43/1.07 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.43/1.07 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.07 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.07 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.07 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.43/1.07 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.07 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.07 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.07 [ =( 'least_upper_bound'( a, c ), c ) ],
% 0.43/1.07 [ =( 'least_upper_bound'( b, c ), c ) ],
% 0.43/1.07 [ ~( =( 'least_upper_bound'( 'least_upper_bound'( a, b ), c ), c ) ) ]
% 0.43/1.07 ] .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.43/1.07 This is a pure equality problem
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Options Used:
% 0.43/1.07
% 0.43/1.07 useres = 1
% 0.43/1.07 useparamod = 1
% 0.43/1.07 useeqrefl = 1
% 0.43/1.07 useeqfact = 1
% 0.43/1.07 usefactor = 1
% 0.43/1.07 usesimpsplitting = 0
% 0.43/1.07 usesimpdemod = 5
% 0.43/1.07 usesimpres = 3
% 0.43/1.07
% 0.43/1.07 resimpinuse = 1000
% 0.43/1.07 resimpclauses = 20000
% 0.43/1.07 substype = eqrewr
% 0.43/1.07 backwardsubs = 1
% 0.43/1.07 selectoldest = 5
% 0.43/1.07
% 0.43/1.07 litorderings [0] = split
% 0.43/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.07
% 0.43/1.07 termordering = kbo
% 0.43/1.07
% 0.43/1.07 litapriori = 0
% 0.43/1.07 termapriori = 1
% 0.43/1.07 litaposteriori = 0
% 0.43/1.07 termaposteriori = 0
% 0.43/1.07 demodaposteriori = 0
% 0.43/1.07 ordereqreflfact = 0
% 0.43/1.07
% 0.43/1.07 litselect = negord
% 0.43/1.07
% 0.43/1.07 maxweight = 15
% 0.43/1.07 maxdepth = 30000
% 0.43/1.07 maxlength = 115
% 0.43/1.07 maxnrvars = 195
% 0.43/1.07 excuselevel = 1
% 0.43/1.07 increasemaxweight = 1
% 0.43/1.07
% 0.43/1.07 maxselected = 10000000
% 0.43/1.07 maxnrclauses = 10000000
% 0.43/1.07
% 0.43/1.07 showgenerated = 0
% 0.43/1.07 showkept = 0
% 0.43/1.07 showselected = 0
% 0.43/1.07 showdeleted = 0
% 0.43/1.07 showresimp = 1
% 0.43/1.07 showstatus = 2000
% 0.43/1.07
% 0.43/1.07 prologoutput = 1
% 0.43/1.07 nrgoals = 5000000
% 0.43/1.07 totalproof = 1
% 0.43/1.07
% 0.43/1.07 Symbols occurring in the translation:
% 0.43/1.07
% 0.43/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.07 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.43/1.07 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.43/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.43/1.07 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.43/1.07 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.07 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.43/1.07 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.43/1.07 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.43/1.07 c [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.43/1.07 b [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Starting Search:
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksems!, er is een bewijs:
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07 % SZS output start Refutation
% 0.43/1.07
% 0.43/1.07 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 15, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 17, [ ~( =( 'least_upper_bound'( 'least_upper_bound'( a, b ), c ),
% 0.43/1.07 c ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 53, [ =( 'least_upper_bound'( 'least_upper_bound'( X, b ), c ),
% 0.43/1.07 'least_upper_bound'( X, c ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 77, [] )
% 0.43/1.07 .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 % SZS output end Refutation
% 0.43/1.07 found a proof!
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 initialclauses(
% 0.43/1.07 [ clause( 79, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.07 , clause( 80, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.07 , clause( 81, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.43/1.07 Y, Z ) ) ) ] )
% 0.43/1.07 , clause( 82, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.43/1.07 Y, X ) ) ] )
% 0.43/1.07 , clause( 83, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.07 ) ] )
% 0.43/1.07 , clause( 84, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.43/1.07 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.07 , clause( 85, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.07 , clause( 86, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.43/1.07 , clause( 87, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.43/1.07 , clause( 88, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.43/1.07 , X ) ] )
% 0.43/1.07 , clause( 89, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.07 , X ) ] )
% 0.43/1.07 , clause( 90, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.07 , clause( 91, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.07 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.07 , clause( 92, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.43/1.07 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.07 , clause( 93, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.07 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.07 , clause( 94, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.43/1.07 , clause( 95, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.43/1.07 , clause( 96, [ ~( =( 'least_upper_bound'( 'least_upper_bound'( a, b ), c )
% 0.43/1.07 , c ) ) ] )
% 0.43/1.07 ] ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.07 , clause( 85, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 15, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.43/1.07 , clause( 94, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.43/1.07 , clause( 95, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 17, [ ~( =( 'least_upper_bound'( 'least_upper_bound'( a, b ), c ),
% 0.43/1.07 c ) ) ] )
% 0.43/1.07 , clause( 96, [ ~( =( 'least_upper_bound'( 'least_upper_bound'( a, b ), c )
% 0.43/1.07 , c ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 148, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ),
% 0.43/1.07 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.43/1.07 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.07 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 150, [ =( 'least_upper_bound'( 'least_upper_bound'( X, b ), c ),
% 0.43/1.07 'least_upper_bound'( X, c ) ) ] )
% 0.43/1.07 , clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.43/1.07 , 0, clause( 148, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z
% 0.43/1.07 ), 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.43/1.07 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, b ),
% 0.43/1.07 :=( Z, c )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 53, [ =( 'least_upper_bound'( 'least_upper_bound'( X, b ), c ),
% 0.43/1.07 'least_upper_bound'( X, c ) ) ] )
% 0.43/1.07 , clause( 150, [ =( 'least_upper_bound'( 'least_upper_bound'( X, b ), c ),
% 0.43/1.07 'least_upper_bound'( X, c ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 156, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.43/1.07 , clause( 53, [ =( 'least_upper_bound'( 'least_upper_bound'( X, b ), c ),
% 0.43/1.07 'least_upper_bound'( X, c ) ) ] )
% 0.43/1.07 , 0, clause( 17, [ ~( =( 'least_upper_bound'( 'least_upper_bound'( a, b ),
% 0.43/1.07 c ), c ) ) ] )
% 0.43/1.07 , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 157, [ ~( =( c, c ) ) ] )
% 0.43/1.07 , clause( 15, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.43/1.07 , 0, clause( 156, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.43/1.07 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqrefl(
% 0.43/1.07 clause( 158, [] )
% 0.43/1.07 , clause( 157, [ ~( =( c, c ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 77, [] )
% 0.43/1.07 , clause( 158, [] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 end.
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 1126
% 0.43/1.07 space for clauses: 7963
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 330
% 0.43/1.07 clauses kept: 78
% 0.43/1.07 clauses selected: 26
% 0.43/1.07 clauses deleted: 1
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 357
% 0.43/1.07 literals s-matched: 188
% 0.43/1.07 literals matched: 188
% 0.43/1.07 full subsumption: 0
% 0.43/1.07
% 0.43/1.07 checksum: 480682174
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------