TSTP Solution File: GRP160-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP160-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:38 EDT 2022
% Result : Unsatisfiable 0.46s 1.13s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP160-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Tue Jun 14 01:09:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.13 *** allocated 10000 integers for termspace/termends
% 0.46/1.13 *** allocated 10000 integers for clauses
% 0.46/1.13 *** allocated 10000 integers for justifications
% 0.46/1.13 Bliksem 1.12
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 Automatic Strategy Selection
% 0.46/1.13
% 0.46/1.13 Clauses:
% 0.46/1.13 [
% 0.46/1.13 [ =( multiply( identity, X ), X ) ],
% 0.46/1.13 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.46/1.13 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.46/1.13 ],
% 0.46/1.13 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.46/1.13 ,
% 0.46/1.13 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.46/1.13 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.46/1.13 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.46/1.13 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.46/1.13 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.46/1.13 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.46/1.13 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.46/1.13 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.46/1.13 ,
% 0.46/1.13 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.46/1.13 ,
% 0.46/1.13 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.46/1.13 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.46/1.13 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.46/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.46/1.13 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.46/1.13 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.46/1.13 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.46/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.46/1.13 [ ~( =( 'least_upper_bound'( a, a ), a ) ) ]
% 0.46/1.13 ] .
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 percentage equality = 1.000000, percentage horn = 1.000000
% 0.46/1.13 This is a pure equality problem
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 Options Used:
% 0.46/1.13
% 0.46/1.13 useres = 1
% 0.46/1.13 useparamod = 1
% 0.46/1.13 useeqrefl = 1
% 0.46/1.13 useeqfact = 1
% 0.46/1.13 usefactor = 1
% 0.46/1.13 usesimpsplitting = 0
% 0.46/1.13 usesimpdemod = 5
% 0.46/1.13 usesimpres = 3
% 0.46/1.13
% 0.46/1.13 resimpinuse = 1000
% 0.46/1.13 resimpclauses = 20000
% 0.46/1.13 substype = eqrewr
% 0.46/1.13 backwardsubs = 1
% 0.46/1.13 selectoldest = 5
% 0.46/1.13
% 0.46/1.13 litorderings [0] = split
% 0.46/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.46/1.13
% 0.46/1.13 termordering = kbo
% 0.46/1.13
% 0.46/1.13 litapriori = 0
% 0.46/1.13 termapriori = 1
% 0.46/1.13 litaposteriori = 0
% 0.46/1.13 termaposteriori = 0
% 0.46/1.13 demodaposteriori = 0
% 0.46/1.13 ordereqreflfact = 0
% 0.46/1.13
% 0.46/1.13 litselect = negord
% 0.46/1.13
% 0.46/1.13 maxweight = 15
% 0.46/1.13 maxdepth = 30000
% 0.46/1.13 maxlength = 115
% 0.46/1.13 maxnrvars = 195
% 0.46/1.13 excuselevel = 1
% 0.46/1.13 increasemaxweight = 1
% 0.46/1.13
% 0.46/1.13 maxselected = 10000000
% 0.46/1.13 maxnrclauses = 10000000
% 0.46/1.13
% 0.46/1.13 showgenerated = 0
% 0.46/1.13 showkept = 0
% 0.46/1.13 showselected = 0
% 0.46/1.13 showdeleted = 0
% 0.46/1.13 showresimp = 1
% 0.46/1.13 showstatus = 2000
% 0.46/1.13
% 0.46/1.13 prologoutput = 1
% 0.46/1.13 nrgoals = 5000000
% 0.46/1.13 totalproof = 1
% 0.46/1.13
% 0.46/1.13 Symbols occurring in the translation:
% 0.46/1.13
% 0.46/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.13 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.46/1.13 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.46/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.13 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.46/1.13 multiply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.46/1.13 inverse [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.46/1.13 'greatest_lower_bound' [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.46/1.13 'least_upper_bound' [46, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.46/1.13 a [47, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 Starting Search:
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 Bliksems!, er is een bewijs:
% 0.46/1.13 % SZS status Unsatisfiable
% 0.46/1.13 % SZS output start Refutation
% 0.46/1.13
% 0.46/1.13 clause( 7, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.46/1.13 .
% 0.46/1.13 clause( 15, [] )
% 0.46/1.13 .
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 % SZS output end Refutation
% 0.46/1.13 found a proof!
% 0.46/1.13
% 0.46/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.13
% 0.46/1.13 initialclauses(
% 0.46/1.13 [ clause( 17, [ =( multiply( identity, X ), X ) ] )
% 0.46/1.13 , clause( 18, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.46/1.13 , clause( 19, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.46/1.13 Y, Z ) ) ) ] )
% 0.46/1.13 , clause( 20, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.46/1.13 Y, X ) ) ] )
% 0.46/1.13 , clause( 21, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.46/1.13 ) ] )
% 0.46/1.13 , clause( 22, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.46/1.13 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.46/1.13 , clause( 23, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.46/1.13 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.46/1.13 , clause( 24, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.46/1.13 , clause( 25, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.46/1.13 , clause( 26, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.46/1.13 , X ) ] )
% 0.46/1.13 , clause( 27, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.46/1.13 , X ) ] )
% 0.46/1.13 , clause( 28, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.46/1.13 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.46/1.13 , clause( 29, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.46/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.46/1.13 , clause( 30, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.46/1.13 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.46/1.13 , clause( 31, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.46/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.46/1.13 , clause( 32, [ ~( =( 'least_upper_bound'( a, a ), a ) ) ] )
% 0.46/1.13 ] ).
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 subsumption(
% 0.46/1.13 clause( 7, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.46/1.13 , clause( 24, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.46/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 paramod(
% 0.46/1.13 clause( 71, [ ~( =( a, a ) ) ] )
% 0.46/1.13 , clause( 7, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.46/1.13 , 0, clause( 32, [ ~( =( 'least_upper_bound'( a, a ), a ) ) ] )
% 0.46/1.13 , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 eqrefl(
% 0.46/1.13 clause( 72, [] )
% 0.46/1.13 , clause( 71, [ ~( =( a, a ) ) ] )
% 0.46/1.13 , 0, substitution( 0, [] )).
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 subsumption(
% 0.46/1.13 clause( 15, [] )
% 0.46/1.13 , clause( 72, [] )
% 0.46/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 end.
% 0.46/1.13
% 0.46/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.13
% 0.46/1.13 Memory use:
% 0.46/1.13
% 0.46/1.13 space for terms: 485
% 0.46/1.13 space for clauses: 1616
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 clauses generated: 16
% 0.46/1.13 clauses kept: 16
% 0.46/1.13 clauses selected: 0
% 0.46/1.13 clauses deleted: 0
% 0.46/1.13 clauses inuse deleted: 0
% 0.46/1.13
% 0.46/1.13 subsentry: 132
% 0.46/1.13 literals s-matched: 54
% 0.46/1.13 literals matched: 54
% 0.46/1.13 full subsumption: 0
% 0.46/1.13
% 0.46/1.13 checksum: 9969
% 0.46/1.13
% 0.46/1.13
% 0.46/1.13 Bliksem ended
%------------------------------------------------------------------------------