TSTP Solution File: GRP460-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP460-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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:37:08 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.03/0.12 % Problem : GRP460-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Tue Jun 14 06:37:23 EDT 2022
% 0.12/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 [ =( divide( X, divide( divide( divide( identity, Y ), Z ), divide(
% 0.70/1.09 divide( divide( X, X ), X ), Z ) ) ), Y ) ],
% 0.70/1.09 [ =( multiply( X, Y ), divide( X, divide( identity, Y ) ) ) ],
% 0.70/1.09 [ =( inverse( X ), divide( identity, X ) ) ],
% 0.70/1.09 [ =( identity, divide( X, X ) ) ],
% 0.70/1.09 [ ~( =( multiply( inverse( a1 ), a1 ), 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 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.70/1.09 divide [42, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.70/1.09 multiply [44, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.09 inverse [45, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.09 a1 [46, 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( 1, [ =( divide( X, divide( identity, Y ) ), multiply( X, Y ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 2, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 4, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 6, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 10, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 11, [] )
% 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( 13, [ =( divide( X, divide( divide( divide( identity, Y ), Z ),
% 0.70/1.09 divide( divide( divide( X, X ), X ), Z ) ) ), Y ) ] )
% 0.70/1.09 , clause( 14, [ =( multiply( X, Y ), divide( X, divide( identity, Y ) ) ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 15, [ =( inverse( X ), divide( identity, X ) ) ] )
% 0.70/1.09 , clause( 16, [ =( identity, divide( X, X ) ) ] )
% 0.70/1.09 , clause( 17, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.70/1.09 ] ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 19, [ =( divide( X, divide( identity, Y ) ), multiply( X, Y ) ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 14, [ =( multiply( X, Y ), divide( X, divide( identity, Y ) ) ) ]
% 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( 1, [ =( divide( X, divide( identity, Y ) ), multiply( X, Y ) ) ] )
% 0.70/1.09 , clause( 19, [ =( divide( X, divide( identity, Y ) ), multiply( X, Y ) ) ]
% 0.70/1.09 )
% 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 eqswap(
% 0.70/1.09 clause( 22, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.70/1.09 , clause( 15, [ =( inverse( X ), divide( identity, X ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 2, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.70/1.09 , clause( 22, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 26, [ =( divide( X, X ), identity ) ] )
% 0.70/1.09 , clause( 16, [ =( identity, divide( X, X ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.70/1.09 , clause( 26, [ =( divide( X, X ), identity ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 4, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.70/1.09 , clause( 17, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 34, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.70/1.09 , clause( 2, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.70/1.09 , 0, clause( 1, [ =( divide( X, divide( identity, Y ) ), multiply( X, Y ) )
% 0.70/1.09 ] )
% 0.70/1.09 , 0, 3, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.09 :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 6, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.70/1.09 , clause( 34, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 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 eqswap(
% 0.70/1.09 clause( 36, [ =( multiply( X, Y ), divide( X, inverse( Y ) ) ) ] )
% 0.70/1.09 , clause( 6, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 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( 38, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.09 , clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.70/1.09 , 0, clause( 36, [ =( multiply( X, Y ), divide( X, inverse( Y ) ) ) ] )
% 0.70/1.09 , 0, 5, substitution( 0, [ :=( X, inverse( X ) )] ), substitution( 1, [
% 0.70/1.09 :=( X, inverse( X ) ), :=( Y, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 10, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.09 , clause( 38, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 40, [ =( identity, multiply( inverse( X ), X ) ) ] )
% 0.70/1.09 , clause( 10, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 41, [ ~( =( identity, multiply( inverse( a1 ), a1 ) ) ) ] )
% 0.70/1.09 , clause( 4, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 42, [] )
% 0.70/1.09 , clause( 41, [ ~( =( identity, multiply( inverse( a1 ), a1 ) ) ) ] )
% 0.70/1.09 , 0, clause( 40, [ =( identity, multiply( inverse( X ), X ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a1 )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 11, [] )
% 0.70/1.09 , clause( 42, [] )
% 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: 204
% 0.70/1.09 space for clauses: 1180
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 23
% 0.70/1.09 clauses kept: 12
% 0.70/1.09 clauses selected: 6
% 0.70/1.09 clauses deleted: 2
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 108
% 0.70/1.09 literals s-matched: 50
% 0.70/1.09 literals matched: 50
% 0.70/1.09 full subsumption: 0
% 0.70/1.09
% 0.70/1.09 checksum: 513442617
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------