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