TSTP Solution File: GRP139-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP139-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:35:32 EDT 2022
% Result : Unsatisfiable 0.47s 0.85s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP139-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.07 % Command : bliksem %s
% 0.08/0.26 % Computer : n024.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 300
% 0.08/0.26 % DateTime : Mon Jun 13 19:09:18 EDT 2022
% 0.08/0.26 % CPUTime :
% 0.47/0.85 *** allocated 10000 integers for termspace/termends
% 0.47/0.85 *** allocated 10000 integers for clauses
% 0.47/0.85 *** allocated 10000 integers for justifications
% 0.47/0.85 Bliksem 1.12
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 Automatic Strategy Selection
% 0.47/0.85
% 0.47/0.85 Clauses:
% 0.47/0.85 [
% 0.47/0.85 [ =( multiply( identity, X ), X ) ],
% 0.47/0.85 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.47/0.85 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.47/0.85 ],
% 0.47/0.85 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.47/0.85 ,
% 0.47/0.85 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.47/0.85 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.47/0.85 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.47/0.85 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.47/0.85 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.47/0.85 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.47/0.85 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.47/0.85 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.47/0.85 ,
% 0.47/0.85 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.47/0.85 ,
% 0.47/0.85 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.47/0.85 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.47/0.85 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.47/0.85 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.47/0.85 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.47/0.85 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.47/0.85 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.47/0.85 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.47/0.85 [ =( 'greatest_lower_bound'( a, c ), c ) ],
% 0.47/0.85 [ =( 'greatest_lower_bound'( b, c ), c ) ],
% 0.47/0.85 [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b ), c ), c )
% 0.47/0.85 ) ]
% 0.47/0.85 ] .
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 percentage equality = 1.000000, percentage horn = 1.000000
% 0.47/0.85 This is a pure equality problem
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 Options Used:
% 0.47/0.85
% 0.47/0.85 useres = 1
% 0.47/0.85 useparamod = 1
% 0.47/0.85 useeqrefl = 1
% 0.47/0.85 useeqfact = 1
% 0.47/0.85 usefactor = 1
% 0.47/0.85 usesimpsplitting = 0
% 0.47/0.85 usesimpdemod = 5
% 0.47/0.85 usesimpres = 3
% 0.47/0.85
% 0.47/0.85 resimpinuse = 1000
% 0.47/0.85 resimpclauses = 20000
% 0.47/0.85 substype = eqrewr
% 0.47/0.85 backwardsubs = 1
% 0.47/0.85 selectoldest = 5
% 0.47/0.85
% 0.47/0.85 litorderings [0] = split
% 0.47/0.85 litorderings [1] = extend the termordering, first sorting on arguments
% 0.47/0.85
% 0.47/0.85 termordering = kbo
% 0.47/0.85
% 0.47/0.85 litapriori = 0
% 0.47/0.85 termapriori = 1
% 0.47/0.85 litaposteriori = 0
% 0.47/0.85 termaposteriori = 0
% 0.47/0.85 demodaposteriori = 0
% 0.47/0.85 ordereqreflfact = 0
% 0.47/0.85
% 0.47/0.85 litselect = negord
% 0.47/0.85
% 0.47/0.85 maxweight = 15
% 0.47/0.85 maxdepth = 30000
% 0.47/0.85 maxlength = 115
% 0.47/0.85 maxnrvars = 195
% 0.47/0.85 excuselevel = 1
% 0.47/0.85 increasemaxweight = 1
% 0.47/0.85
% 0.47/0.85 maxselected = 10000000
% 0.47/0.85 maxnrclauses = 10000000
% 0.47/0.85
% 0.47/0.85 showgenerated = 0
% 0.47/0.85 showkept = 0
% 0.47/0.85 showselected = 0
% 0.47/0.85 showdeleted = 0
% 0.47/0.85 showresimp = 1
% 0.47/0.85 showstatus = 2000
% 0.47/0.85
% 0.47/0.85 prologoutput = 1
% 0.47/0.85 nrgoals = 5000000
% 0.47/0.85 totalproof = 1
% 0.47/0.85
% 0.47/0.85 Symbols occurring in the translation:
% 0.47/0.85
% 0.47/0.85 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/0.85 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.47/0.85 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.47/0.85 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/0.85 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/0.85 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.47/0.85 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.47/0.85 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.47/0.85 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.47/0.85 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.47/0.85 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.47/0.85 c [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.47/0.85 b [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 Starting Search:
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 Bliksems!, er is een bewijs:
% 0.47/0.85 % SZS status Unsatisfiable
% 0.47/0.85 % SZS output start Refutation
% 0.47/0.85
% 0.47/0.85 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.47/0.85 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.47/0.85 .
% 0.47/0.85 clause( 15, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.47/0.85 .
% 0.47/0.85 clause( 16, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.47/0.85 .
% 0.47/0.85 clause( 17, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b )
% 0.47/0.85 , c ), c ) ) ] )
% 0.47/0.85 .
% 0.47/0.85 clause( 37, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ), c
% 0.47/0.85 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.47/0.85 .
% 0.47/0.85 clause( 76, [] )
% 0.47/0.85 .
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 % SZS output end Refutation
% 0.47/0.85 found a proof!
% 0.47/0.85
% 0.47/0.85 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/0.85
% 0.47/0.85 initialclauses(
% 0.47/0.85 [ clause( 78, [ =( multiply( identity, X ), X ) ] )
% 0.47/0.85 , clause( 79, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.47/0.85 , clause( 80, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.47/0.85 Y, Z ) ) ) ] )
% 0.47/0.85 , clause( 81, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.47/0.85 Y, X ) ) ] )
% 0.47/0.85 , clause( 82, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.47/0.85 ) ] )
% 0.47/0.85 , clause( 83, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.47/0.85 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.47/0.85 , clause( 84, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.47/0.85 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.47/0.85 , clause( 85, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.47/0.85 , clause( 86, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.47/0.85 , clause( 87, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.47/0.85 , X ) ] )
% 0.47/0.85 , clause( 88, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.47/0.85 , X ) ] )
% 0.47/0.85 , clause( 89, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.47/0.85 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.47/0.85 , clause( 90, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.47/0.85 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.47/0.85 , clause( 91, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.47/0.85 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.47/0.85 , clause( 92, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.47/0.85 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.47/0.85 , clause( 93, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.47/0.85 , clause( 94, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.47/0.85 , clause( 95, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b
% 0.47/0.85 ), c ), c ) ) ] )
% 0.47/0.85 ] ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 subsumption(
% 0.47/0.85 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.47/0.85 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.47/0.85 , clause( 83, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.47/0.85 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.47/0.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/0.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 subsumption(
% 0.47/0.85 clause( 15, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.47/0.85 , clause( 93, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.47/0.85 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 subsumption(
% 0.47/0.85 clause( 16, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.47/0.85 , clause( 94, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.47/0.85 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 subsumption(
% 0.47/0.85 clause( 17, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b )
% 0.47/0.85 , c ), c ) ) ] )
% 0.47/0.85 , clause( 95, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b
% 0.47/0.85 ), c ), c ) ) ] )
% 0.47/0.85 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 eqswap(
% 0.47/0.85 clause( 146, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z
% 0.47/0.85 ), 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.47/0.85 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.47/0.85 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.47/0.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 paramod(
% 0.47/0.85 clause( 148, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ), c
% 0.47/0.85 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.47/0.85 , clause( 16, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.47/0.85 , 0, clause( 146, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y
% 0.47/0.85 ), Z ), 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ) ) ]
% 0.47/0.85 )
% 0.47/0.85 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, b ),
% 0.47/0.85 :=( Z, c )] )).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 subsumption(
% 0.47/0.85 clause( 37, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ), c
% 0.47/0.85 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.47/0.85 , clause( 148, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b )
% 0.47/0.85 , c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.47/0.85 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 paramod(
% 0.47/0.85 clause( 154, [ ~( =( 'greatest_lower_bound'( a, c ), c ) ) ] )
% 0.47/0.85 , clause( 37, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ),
% 0.47/0.85 c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.47/0.85 , 0, clause( 17, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a
% 0.47/0.85 , b ), c ), c ) ) ] )
% 0.47/0.85 , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 paramod(
% 0.47/0.85 clause( 155, [ ~( =( c, c ) ) ] )
% 0.47/0.85 , clause( 15, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.47/0.85 , 0, clause( 154, [ ~( =( 'greatest_lower_bound'( a, c ), c ) ) ] )
% 0.47/0.85 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 eqrefl(
% 0.47/0.85 clause( 156, [] )
% 0.47/0.85 , clause( 155, [ ~( =( c, c ) ) ] )
% 0.47/0.85 , 0, substitution( 0, [] )).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 subsumption(
% 0.47/0.85 clause( 76, [] )
% 0.47/0.85 , clause( 156, [] )
% 0.47/0.85 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 end.
% 0.47/0.85
% 0.47/0.85 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/0.85
% 0.47/0.85 Memory use:
% 0.47/0.85
% 0.47/0.85 space for terms: 1115
% 0.47/0.85 space for clauses: 7835
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 clauses generated: 330
% 0.47/0.85 clauses kept: 77
% 0.47/0.85 clauses selected: 26
% 0.47/0.85 clauses deleted: 1
% 0.47/0.85 clauses inuse deleted: 0
% 0.47/0.85
% 0.47/0.85 subsentry: 351
% 0.47/0.85 literals s-matched: 185
% 0.47/0.85 literals matched: 185
% 0.47/0.85 full subsumption: 0
% 0.47/0.85
% 0.47/0.85 checksum: 477331077
% 0.47/0.85
% 0.47/0.85
% 0.47/0.85 Bliksem ended
%------------------------------------------------------------------------------