%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP182-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n003.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.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP182-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : bliksem %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Tue Jun 14 08:07:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09 [
% 0.70/1.09 [ =( multiply( identity, X ), X ) ],
% 0.70/1.09 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.70/1.09 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.70/1.09 ],
% 0.70/1.09 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.70/1.09 ,
% 0.70/1.09 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.70/1.09 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.09 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.70/1.09 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.70/1.09 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.70/1.09 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.70/1.09 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.70/1.09 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.70/1.09 ,
% 0.70/1.09 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.70/1.09 ,
% 0.70/1.09 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.70/1.09 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.70/1.09 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.09 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.70/1.09 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.70/1.09 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.70/1.09 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.70/1.09 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.70/1.09 [ =( inverse( identity ), identity ) ],
% 0.70/1.09 [ =( inverse( inverse( X ) ), X ) ],
% 0.70/1.09 [ =( inverse( multiply( X, Y ) ), multiply( inverse( Y ), inverse( X ) )
% 0.70/1.09 ) ],
% 0.70/1.09 [ ~( =( 'least_upper_bound'( identity, 'greatest_lower_bound'( a,
% 0.70/1.09 identity ) ), identity ) ) ]
% 0.70/1.09 ] .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.09 This is a pure equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 1
% 0.70/1.09 useeqrefl = 1
% 0.70/1.09 useeqfact = 1
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 5
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = eqrewr
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.09
% 0.70/1.09 termordering = kbo
% 0.70/1.09
% 0.70/1.09 litapriori = 0
% 0.70/1.09 termapriori = 1
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = negord
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 1
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.70/1.09 multiply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.09 inverse [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.09 'greatest_lower_bound' [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.70/1.09 'least_upper_bound' [46, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.70/1.09 a [47, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Unsatisfiable
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.70/1.09 X ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.70/1.09 ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 18, [ ~( =( 'least_upper_bound'( identity, 'greatest_lower_bound'(
% 0.70/1.09 a, identity ) ), identity ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 30, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X ) ),
% 0.70/1.09 X ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 46, [] )
% 0.70/1.09 .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 initialclauses(
% 0.70/1.09 [ clause( 48, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.09 , clause( 49, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.09 , clause( 50, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.70/1.09 Y, Z ) ) ) ] )
% 0.70/1.09 , clause( 51, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.70/1.09 Y, X ) ) ] )
% 0.70/1.09 , clause( 52, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.70/1.09 ) ] )
% 0.70/1.09 , clause( 53, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.70/1.09 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.09 , clause( 54, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.70/1.09 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.70/1.09 , clause( 55, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.70/1.09 , clause( 56, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.70/1.09 , clause( 57, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , clause( 58, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , clause( 59, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.70/1.09 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.09 , clause( 60, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.09 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.09 , clause( 61, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.70/1.09 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.09 , clause( 62, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.70/1.09 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.09 , clause( 63, [ =( inverse( identity ), identity ) ] )
% 0.70/1.09 , clause( 64, [ =( inverse( inverse( X ) ), X ) ] )
% 0.70/1.09 , clause( 65, [ =( inverse( multiply( X, Y ) ), multiply( inverse( Y ),
% 0.70/1.09 inverse( X ) ) ) ] )
% 0.70/1.09 , clause( 66, [ ~( =( 'least_upper_bound'( identity, 'greatest_lower_bound'(
% 0.70/1.09 a, identity ) ), identity ) ) ] )
% 0.70/1.09 ] ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.70/1.09 X ) ) ] )
% 0.70/1.09 , clause( 51, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.70/1.09 Y, X ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.70/1.09 ) ] )
% 0.70/1.09 , clause( 57, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 18, [ ~( =( 'least_upper_bound'( identity, 'greatest_lower_bound'(
% 0.70/1.09 a, identity ) ), identity ) ) ] )
% 0.70/1.09 , clause( 66, [ ~( =( 'least_upper_bound'( identity, 'greatest_lower_bound'(
% 0.70/1.09 a, identity ) ), identity ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 95, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.70/1.09 ) ) ] )
% 0.70/1.09 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 96, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X )
% 0.70/1.09 ) ) ] )
% 0.70/1.09 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.70/1.09 , X ) ) ] )
% 0.70/1.09 , 0, clause( 95, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X
% 0.70/1.09 , Y ) ) ) ] )
% 0.70/1.09 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.70/1.09 :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 99, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X ) ),
% 0.70/1.09 X ) ] )
% 0.70/1.09 , clause( 96, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X
% 0.70/1.09 ) ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 30, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X ) ),
% 0.70/1.09 X ) ] )
% 0.70/1.09 , clause( 99, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X ) )
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 102, [ ~( =( identity, identity ) ) ] )
% 0.70/1.09 , clause( 30, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( Y, X ) )
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , 0, clause( 18, [ ~( =( 'least_upper_bound'( identity,
% 0.70/1.09 'greatest_lower_bound'( a, identity ) ), identity ) ) ] )
% 0.70/1.09 , 0, 2, substitution( 0, [ :=( X, identity ), :=( Y, a )] ), substitution(
% 0.70/1.09 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqrefl(
% 0.70/1.09 clause( 103, [] )
% 0.70/1.09 , clause( 102, [ ~( =( identity, identity ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 46, [] )
% 0.70/1.09 , clause( 103, [] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 end.
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 825
% 0.70/1.09 space for clauses: 4674
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 215
% 0.70/1.09 clauses kept: 47
% 0.70/1.09 clauses selected: 19
% 0.70/1.09 clauses deleted: 1
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 209
% 0.70/1.09 literals s-matched: 113
% 0.70/1.09 literals matched: 109
% 0.70/1.09 full subsumption: 0
% 0.70/1.09
% 0.70/1.09 checksum: 1169109302
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------