TSTP Solution File: GRP155-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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.68s 1.10s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.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 : Mon Jun 13 11:09:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.68/1.10 *** allocated 10000 integers for termspace/termends
% 0.68/1.10 *** allocated 10000 integers for clauses
% 0.68/1.10 *** allocated 10000 integers for justifications
% 0.68/1.10 Bliksem 1.12
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Automatic Strategy Selection
% 0.68/1.10
% 0.68/1.10 Clauses:
% 0.68/1.10 [
% 0.68/1.10 [ =( multiply( identity, X ), X ) ],
% 0.68/1.10 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.68/1.10 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.68/1.10 ],
% 0.68/1.10 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.68/1.10 ,
% 0.68/1.10 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.68/1.10 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.68/1.10 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.68/1.10 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.68/1.10 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.68/1.10 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.68/1.10 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.68/1.10 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.68/1.10 ,
% 0.68/1.10 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.68/1.10 ,
% 0.68/1.10 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.68/1.10 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.68/1.10 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.68/1.10 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.68/1.10 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.68/1.10 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.68/1.10 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.68/1.10 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.68/1.10 [ =( 'greatest_lower_bound'( a, b ), a ) ],
% 0.68/1.10 [ ~( =( 'greatest_lower_bound'( multiply( a, c ), multiply( b, c ) ),
% 0.68/1.10 multiply( a, c ) ) ) ]
% 0.68/1.10 ] .
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 percentage equality = 1.000000, percentage horn = 1.000000
% 0.68/1.10 This is a pure equality problem
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Options Used:
% 0.68/1.10
% 0.68/1.10 useres = 1
% 0.68/1.10 useparamod = 1
% 0.68/1.10 useeqrefl = 1
% 0.68/1.10 useeqfact = 1
% 0.68/1.10 usefactor = 1
% 0.68/1.10 usesimpsplitting = 0
% 0.68/1.10 usesimpdemod = 5
% 0.68/1.10 usesimpres = 3
% 0.68/1.10
% 0.68/1.10 resimpinuse = 1000
% 0.68/1.10 resimpclauses = 20000
% 0.68/1.10 substype = eqrewr
% 0.68/1.10 backwardsubs = 1
% 0.68/1.10 selectoldest = 5
% 0.68/1.10
% 0.68/1.10 litorderings [0] = split
% 0.68/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.68/1.10
% 0.68/1.10 termordering = kbo
% 0.68/1.10
% 0.68/1.10 litapriori = 0
% 0.68/1.10 termapriori = 1
% 0.68/1.10 litaposteriori = 0
% 0.68/1.10 termaposteriori = 0
% 0.68/1.10 demodaposteriori = 0
% 0.68/1.10 ordereqreflfact = 0
% 0.68/1.10
% 0.68/1.10 litselect = negord
% 0.68/1.10
% 0.68/1.10 maxweight = 15
% 0.68/1.10 maxdepth = 30000
% 0.68/1.10 maxlength = 115
% 0.68/1.10 maxnrvars = 195
% 0.68/1.10 excuselevel = 1
% 0.68/1.10 increasemaxweight = 1
% 0.68/1.10
% 0.68/1.10 maxselected = 10000000
% 0.68/1.10 maxnrclauses = 10000000
% 0.68/1.10
% 0.68/1.10 showgenerated = 0
% 0.68/1.10 showkept = 0
% 0.68/1.10 showselected = 0
% 0.68/1.10 showdeleted = 0
% 0.68/1.10 showresimp = 1
% 0.68/1.10 showstatus = 2000
% 0.68/1.10
% 0.68/1.10 prologoutput = 1
% 0.68/1.10 nrgoals = 5000000
% 0.68/1.10 totalproof = 1
% 0.68/1.10
% 0.68/1.10 Symbols occurring in the translation:
% 0.68/1.10
% 0.68/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.10 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.68/1.10 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.68/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.10 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.68/1.10 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.68/1.10 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.68/1.10 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.68/1.10 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.68/1.10 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.68/1.10 b [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.68/1.10 c [49, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Starting Search:
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Bliksems!, er is een bewijs:
% 0.68/1.10 % SZS status Unsatisfiable
% 0.68/1.10 % SZS output start Refutation
% 0.68/1.10
% 0.68/1.10 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.68/1.10 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 .
% 0.68/1.10 clause( 15, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.68/1.10 .
% 0.68/1.10 clause( 16, [] )
% 0.68/1.10 .
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 % SZS output end Refutation
% 0.68/1.10 found a proof!
% 0.68/1.10
% 0.68/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.10
% 0.68/1.10 initialclauses(
% 0.68/1.10 [ clause( 18, [ =( multiply( identity, X ), X ) ] )
% 0.68/1.10 , clause( 19, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.68/1.10 , clause( 20, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.68/1.10 Y, Z ) ) ) ] )
% 0.68/1.10 , clause( 21, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.68/1.10 Y, X ) ) ] )
% 0.68/1.10 , clause( 22, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.68/1.10 ) ] )
% 0.68/1.10 , clause( 23, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.68/1.10 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 , clause( 24, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.68/1.10 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 , clause( 25, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.68/1.10 , clause( 26, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.68/1.10 , clause( 27, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.68/1.10 , X ) ] )
% 0.68/1.10 , clause( 28, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.68/1.10 , X ) ] )
% 0.68/1.10 , clause( 29, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.68/1.10 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.68/1.10 , clause( 30, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.68/1.10 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.68/1.10 , clause( 31, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.68/1.10 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.68/1.10 , clause( 32, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.68/1.10 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.68/1.10 , clause( 33, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.68/1.10 , clause( 34, [ ~( =( 'greatest_lower_bound'( multiply( a, c ), multiply( b
% 0.68/1.10 , c ) ), multiply( a, c ) ) ) ] )
% 0.68/1.10 ] ).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 eqswap(
% 0.68/1.10 clause( 47, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.68/1.10 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 , clause( 32, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.68/1.10 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.68/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 subsumption(
% 0.68/1.10 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.68/1.10 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 , clause( 47, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.68/1.10 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 subsumption(
% 0.68/1.10 clause( 15, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.68/1.10 , clause( 33, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.68/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 paramod(
% 0.68/1.10 clause( 113, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ),
% 0.68/1.10 multiply( a, c ) ) ) ] )
% 0.68/1.10 , clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.68/1.10 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.68/1.10 , 0, clause( 34, [ ~( =( 'greatest_lower_bound'( multiply( a, c ), multiply(
% 0.68/1.10 b, c ) ), multiply( a, c ) ) ) ] )
% 0.68/1.10 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b ), :=( Z, c )] ),
% 0.68/1.10 substitution( 1, [] )).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 paramod(
% 0.68/1.10 clause( 114, [ ~( =( multiply( a, c ), multiply( a, c ) ) ) ] )
% 0.68/1.10 , clause( 15, [ =( 'greatest_lower_bound'( a, b ), a ) ] )
% 0.68/1.10 , 0, clause( 113, [ ~( =( multiply( 'greatest_lower_bound'( a, b ), c ),
% 0.68/1.10 multiply( a, c ) ) ) ] )
% 0.68/1.10 , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 eqrefl(
% 0.68/1.10 clause( 115, [] )
% 0.68/1.10 , clause( 114, [ ~( =( multiply( a, c ), multiply( a, c ) ) ) ] )
% 0.68/1.10 , 0, substitution( 0, [] )).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 subsumption(
% 0.68/1.10 clause( 16, [] )
% 0.68/1.10 , clause( 115, [] )
% 0.68/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 end.
% 0.68/1.10
% 0.68/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.10
% 0.68/1.10 Memory use:
% 0.68/1.10
% 0.68/1.10 space for terms: 516
% 0.68/1.10 space for clauses: 1686
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 clauses generated: 17
% 0.68/1.10 clauses kept: 17
% 0.68/1.10 clauses selected: 0
% 0.68/1.10 clauses deleted: 0
% 0.68/1.10 clauses inuse deleted: 0
% 0.68/1.10
% 0.68/1.10 subsentry: 319
% 0.68/1.10 literals s-matched: 140
% 0.68/1.10 literals matched: 140
% 0.68/1.10 full subsumption: 0
% 0.68/1.10
% 0.68/1.10 checksum: 1311849
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Bliksem ended
%------------------------------------------------------------------------------