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