TSTP Solution File: GRP156-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n032.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:37 EDT 2022
% Result : Unsatisfiable 0.55s 0.94s
% Output : Refutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % DateTime : Tue Jun 14 13:28:58 EDT 2022
% 0.17/0.32 % CPUTime :
% 0.55/0.94 *** allocated 10000 integers for termspace/termends
% 0.55/0.94 *** allocated 10000 integers for clauses
% 0.55/0.94 *** allocated 10000 integers for justifications
% 0.55/0.94 Bliksem 1.12
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 Automatic Strategy Selection
% 0.55/0.94
% 0.55/0.94 Clauses:
% 0.55/0.94 [
% 0.55/0.94 [ =( multiply( identity, X ), X ) ],
% 0.55/0.94 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.55/0.94 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.55/0.94 ],
% 0.55/0.94 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.55/0.94 ,
% 0.55/0.94 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.55/0.94 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.55/0.94 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.55/0.94 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.55/0.94 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.55/0.94 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.55/0.94 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.55/0.94 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.55/0.94 ,
% 0.55/0.94 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.55/0.94 ,
% 0.55/0.94 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.55/0.94 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.55/0.94 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.55/0.94 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.55/0.94 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.55/0.94 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.55/0.94 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.55/0.94 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.55/0.94 [ =( 'least_upper_bound'( a, b ), b ) ],
% 0.55/0.94 [ ~( =( 'greatest_lower_bound'( multiply( a, c ), multiply( b, c ) ),
% 0.55/0.94 multiply( a, c ) ) ) ]
% 0.55/0.94 ] .
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 percentage equality = 1.000000, percentage horn = 1.000000
% 0.55/0.94 This is a pure equality problem
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 Options Used:
% 0.55/0.94
% 0.55/0.94 useres = 1
% 0.55/0.94 useparamod = 1
% 0.55/0.94 useeqrefl = 1
% 0.55/0.94 useeqfact = 1
% 0.55/0.94 usefactor = 1
% 0.55/0.94 usesimpsplitting = 0
% 0.55/0.94 usesimpdemod = 5
% 0.55/0.94 usesimpres = 3
% 0.55/0.94
% 0.55/0.94 resimpinuse = 1000
% 0.55/0.94 resimpclauses = 20000
% 0.55/0.94 substype = eqrewr
% 0.55/0.94 backwardsubs = 1
% 0.55/0.94 selectoldest = 5
% 0.55/0.94
% 0.55/0.94 litorderings [0] = split
% 0.55/0.94 litorderings [1] = extend the termordering, first sorting on arguments
% 0.55/0.94
% 0.55/0.94 termordering = kbo
% 0.55/0.94
% 0.55/0.94 litapriori = 0
% 0.55/0.94 termapriori = 1
% 0.55/0.94 litaposteriori = 0
% 0.55/0.94 termaposteriori = 0
% 0.55/0.94 demodaposteriori = 0
% 0.55/0.94 ordereqreflfact = 0
% 0.55/0.94
% 0.55/0.94 litselect = negord
% 0.55/0.94
% 0.55/0.94 maxweight = 15
% 0.55/0.94 maxdepth = 30000
% 0.55/0.94 maxlength = 115
% 0.55/0.94 maxnrvars = 195
% 0.55/0.94 excuselevel = 1
% 0.55/0.94 increasemaxweight = 1
% 0.55/0.94
% 0.55/0.94 maxselected = 10000000
% 0.55/0.94 maxnrclauses = 10000000
% 0.55/0.94
% 0.55/0.94 showgenerated = 0
% 0.55/0.94 showkept = 0
% 0.55/0.94 showselected = 0
% 0.55/0.94 showdeleted = 0
% 0.55/0.94 showresimp = 1
% 0.55/0.94 showstatus = 2000
% 0.55/0.94
% 0.55/0.94 prologoutput = 1
% 0.55/0.94 nrgoals = 5000000
% 0.55/0.94 totalproof = 1
% 0.55/0.94
% 0.55/0.94 Symbols occurring in the translation:
% 0.55/0.94
% 0.55/0.94 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.55/0.94 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.55/0.94 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.55/0.94 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.55/0.94 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.55/0.94 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.55/0.94 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.55/0.94 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.55/0.94 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.55/0.94 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.55/0.94 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.55/0.94 b [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.55/0.94 c [49, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 Starting Search:
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 Bliksems!, er is een bewijs:
% 0.55/0.94 % SZS status Unsatisfiable
% 0.55/0.94 % SZS output start Refutation
% 0.55/0.94
% 0.55/0.94 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.55/0.94 X ) ] )
% 0.55/0.94 .
% 0.55/0.94 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.55/0.94 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 .
% 0.55/0.94 clause( 15, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.55/0.94 .
% 0.55/0.94 clause( 16, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ), multiply(
% 0.55/0.94 a, c ) ) ) ] )
% 0.55/0.94 .
% 0.55/0.94 clause( 23, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.55/0.94 .
% 0.55/0.94 clause( 128, [] )
% 0.55/0.94 .
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 % SZS output end Refutation
% 0.55/0.94 found a proof!
% 0.55/0.94
% 0.55/0.94 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.55/0.94
% 0.55/0.94 initialclauses(
% 0.55/0.94 [ clause( 130, [ =( multiply( identity, X ), X ) ] )
% 0.55/0.94 , clause( 131, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.55/0.94 , clause( 132, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.55/0.94 Y, Z ) ) ) ] )
% 0.55/0.94 , clause( 133, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.55/0.94 Y, X ) ) ] )
% 0.55/0.94 , clause( 134, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.55/0.94 ) ) ] )
% 0.55/0.94 , clause( 135, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.55/0.94 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 , clause( 136, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.55/0.94 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 , clause( 137, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.55/0.94 , clause( 138, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.55/0.94 , clause( 139, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.55/0.94 ), X ) ] )
% 0.55/0.94 , clause( 140, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.55/0.94 ), X ) ] )
% 0.55/0.94 , clause( 141, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.55/0.94 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.55/0.94 , clause( 142, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.55/0.94 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.55/0.94 , clause( 143, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.55/0.94 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.55/0.94 , clause( 144, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.55/0.94 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.55/0.94 , clause( 145, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.55/0.94 , clause( 146, [ ~( =( 'greatest_lower_bound'( multiply( a, c ), multiply(
% 0.55/0.94 b, c ) ), multiply( a, c ) ) ) ] )
% 0.55/0.94 ] ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 subsumption(
% 0.55/0.94 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.55/0.94 X ) ] )
% 0.55/0.94 , clause( 140, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.55/0.94 ), X ) ] )
% 0.55/0.94 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.55/0.94 )] ) ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 eqswap(
% 0.55/0.94 clause( 168, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.55/0.94 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 , clause( 144, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.55/0.94 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.55/0.94 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 subsumption(
% 0.55/0.94 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.55/0.94 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 , clause( 168, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y,
% 0.55/0.94 Z ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.55/0.94 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 subsumption(
% 0.55/0.94 clause( 15, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.55/0.94 , clause( 145, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.55/0.94 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 paramod(
% 0.55/0.94 clause( 217, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ),
% 0.55/0.94 multiply( a, c ) ) ) ] )
% 0.55/0.94 , clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.55/0.94 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.55/0.94 , 0, clause( 146, [ ~( =( 'greatest_lower_bound'( multiply( a, c ),
% 0.55/0.94 multiply( b, c ) ), multiply( a, c ) ) ) ] )
% 0.55/0.94 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b ), :=( Z, c )] ),
% 0.55/0.94 substitution( 1, [] )).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 subsumption(
% 0.55/0.94 clause( 16, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ), multiply(
% 0.55/0.94 a, c ) ) ) ] )
% 0.55/0.94 , clause( 217, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ),
% 0.55/0.94 multiply( a, c ) ) ) ] )
% 0.55/0.94 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 eqswap(
% 0.55/0.94 clause( 220, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.55/0.94 ) ) ] )
% 0.55/0.94 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.55/0.94 , X ) ] )
% 0.55/0.94 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 paramod(
% 0.55/0.94 clause( 221, [ =( a, 'greatest_lower_bound'( a, b ) ) ] )
% 0.55/0.94 , clause( 15, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.55/0.94 , 0, clause( 220, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.55/0.94 , Y ) ) ) ] )
% 0.55/0.94 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.55/0.94 ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 eqswap(
% 0.55/0.94 clause( 222, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.55/0.94 , clause( 221, [ =( a, 'greatest_lower_bound'( a, b ) ) ] )
% 0.55/0.94 , 0, substitution( 0, [] )).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 subsumption(
% 0.55/0.94 clause( 23, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.55/0.94 , clause( 222, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.55/0.94 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 paramod(
% 0.55/0.94 clause( 225, [ ~( =( multiply( a, c ), multiply( a, c ) ) ) ] )
% 0.55/0.94 , clause( 23, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.55/0.94 , 0, clause( 16, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ),
% 0.55/0.94 multiply( a, c ) ) ) ] )
% 0.55/0.94 , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 eqrefl(
% 0.55/0.94 clause( 226, [] )
% 0.55/0.94 , clause( 225, [ ~( =( multiply( a, c ), multiply( a, c ) ) ) ] )
% 0.55/0.94 , 0, substitution( 0, [] )).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 subsumption(
% 0.55/0.94 clause( 128, [] )
% 0.55/0.94 , clause( 226, [] )
% 0.55/0.94 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 end.
% 0.55/0.94
% 0.55/0.94 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.55/0.94
% 0.55/0.94 Memory use:
% 0.55/0.94
% 0.55/0.94 space for terms: 1741
% 0.55/0.94 space for clauses: 13920
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 clauses generated: 717
% 0.55/0.94 clauses kept: 129
% 0.55/0.94 clauses selected: 40
% 0.55/0.94 clauses deleted: 1
% 0.55/0.94 clauses inuse deleted: 0
% 0.55/0.94
% 0.55/0.94 subsentry: 382
% 0.55/0.94 literals s-matched: 198
% 0.55/0.94 literals matched: 198
% 0.55/0.94 full subsumption: 0
% 0.55/0.94
% 0.55/0.94 checksum: -1743490040
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 Bliksem ended
%------------------------------------------------------------------------------