TSTP Solution File: GRP533-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP533-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:30 EDT 2022
% Result : Unsatisfiable 0.41s 1.07s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP533-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n012.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 04:17:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/1.07 *** allocated 10000 integers for termspace/termends
% 0.41/1.07 *** allocated 10000 integers for clauses
% 0.41/1.07 *** allocated 10000 integers for justifications
% 0.41/1.07 Bliksem 1.12
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Automatic Strategy Selection
% 0.41/1.07
% 0.41/1.07 Clauses:
% 0.41/1.07 [
% 0.41/1.07 [ =( divide( divide( X, divide( divide( X, Y ), Z ) ), Y ), Z ) ],
% 0.41/1.07 [ =( multiply( X, Y ), divide( X, divide( divide( Z, Z ), Y ) ) ) ],
% 0.41/1.07 [ =( inverse( X ), divide( divide( Y, Y ), X ) ) ],
% 0.41/1.07 [ =( identity, divide( X, X ) ) ],
% 0.41/1.07 [ ~( =( multiply( inverse( a1 ), a1 ), multiply( inverse( b1 ), b1 ) ) )
% 0.41/1.07 ]
% 0.41/1.07 ] .
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.41/1.07 This is a pure equality problem
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Options Used:
% 0.41/1.07
% 0.41/1.07 useres = 1
% 0.41/1.07 useparamod = 1
% 0.41/1.07 useeqrefl = 1
% 0.41/1.07 useeqfact = 1
% 0.41/1.07 usefactor = 1
% 0.41/1.07 usesimpsplitting = 0
% 0.41/1.07 usesimpdemod = 5
% 0.41/1.07 usesimpres = 3
% 0.41/1.07
% 0.41/1.07 resimpinuse = 1000
% 0.41/1.07 resimpclauses = 20000
% 0.41/1.07 substype = eqrewr
% 0.41/1.07 backwardsubs = 1
% 0.41/1.07 selectoldest = 5
% 0.41/1.07
% 0.41/1.07 litorderings [0] = split
% 0.41/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.07
% 0.41/1.07 termordering = kbo
% 0.41/1.07
% 0.41/1.07 litapriori = 0
% 0.41/1.07 termapriori = 1
% 0.41/1.07 litaposteriori = 0
% 0.41/1.07 termaposteriori = 0
% 0.41/1.07 demodaposteriori = 0
% 0.41/1.07 ordereqreflfact = 0
% 0.41/1.07
% 0.41/1.07 litselect = negord
% 0.41/1.07
% 0.41/1.07 maxweight = 15
% 0.41/1.07 maxdepth = 30000
% 0.41/1.07 maxlength = 115
% 0.41/1.07 maxnrvars = 195
% 0.41/1.07 excuselevel = 1
% 0.41/1.07 increasemaxweight = 1
% 0.41/1.07
% 0.41/1.07 maxselected = 10000000
% 0.41/1.07 maxnrclauses = 10000000
% 0.41/1.07
% 0.41/1.07 showgenerated = 0
% 0.41/1.07 showkept = 0
% 0.41/1.07 showselected = 0
% 0.41/1.07 showdeleted = 0
% 0.41/1.07 showresimp = 1
% 0.41/1.07 showstatus = 2000
% 0.41/1.07
% 0.41/1.07 prologoutput = 1
% 0.41/1.07 nrgoals = 5000000
% 0.41/1.07 totalproof = 1
% 0.41/1.07
% 0.41/1.07 Symbols occurring in the translation:
% 0.41/1.07
% 0.41/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.41/1.07 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.41/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.07 divide [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.41/1.07 multiply [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.41/1.07 inverse [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.41/1.07 identity [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.41/1.07 a1 [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.41/1.07 b1 [47, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Starting Search:
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Bliksems!, er is een bewijs:
% 0.41/1.07 % SZS status Unsatisfiable
% 0.41/1.07 % SZS output start Refutation
% 0.41/1.07
% 0.41/1.07 clause( 1, [ =( divide( X, divide( divide( Z, Z ), Y ) ), multiply( X, Y )
% 0.41/1.07 ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 2, [ =( divide( divide( Y, Y ), X ), inverse( X ) ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 4, [ ~( =( multiply( inverse( b1 ), b1 ), multiply( inverse( a1 ),
% 0.41/1.07 a1 ) ) ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 5, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 21, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 50, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.41/1.07 .
% 0.41/1.07 clause( 51, [] )
% 0.41/1.07 .
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 % SZS output end Refutation
% 0.41/1.07 found a proof!
% 0.41/1.07
% 0.41/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.07
% 0.41/1.07 initialclauses(
% 0.41/1.07 [ clause( 53, [ =( divide( divide( X, divide( divide( X, Y ), Z ) ), Y ), Z
% 0.41/1.07 ) ] )
% 0.41/1.07 , clause( 54, [ =( multiply( X, Y ), divide( X, divide( divide( Z, Z ), Y )
% 0.41/1.07 ) ) ] )
% 0.41/1.07 , clause( 55, [ =( inverse( X ), divide( divide( Y, Y ), X ) ) ] )
% 0.41/1.07 , clause( 56, [ =( identity, divide( X, X ) ) ] )
% 0.41/1.07 , clause( 57, [ ~( =( multiply( inverse( a1 ), a1 ), multiply( inverse( b1
% 0.41/1.07 ), b1 ) ) ) ] )
% 0.41/1.07 ] ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqswap(
% 0.41/1.07 clause( 59, [ =( divide( X, divide( divide( Z, Z ), Y ) ), multiply( X, Y )
% 0.41/1.07 ) ] )
% 0.41/1.07 , clause( 54, [ =( multiply( X, Y ), divide( X, divide( divide( Z, Z ), Y )
% 0.41/1.07 ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 1, [ =( divide( X, divide( divide( Z, Z ), Y ) ), multiply( X, Y )
% 0.41/1.07 ) ] )
% 0.41/1.07 , clause( 59, [ =( divide( X, divide( divide( Z, Z ), Y ) ), multiply( X, Y
% 0.41/1.07 ) ) ] )
% 0.41/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.41/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqswap(
% 0.41/1.07 clause( 62, [ =( divide( divide( Y, Y ), X ), inverse( X ) ) ] )
% 0.41/1.07 , clause( 55, [ =( inverse( X ), divide( divide( Y, Y ), X ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 2, [ =( divide( divide( Y, Y ), X ), inverse( X ) ) ] )
% 0.41/1.07 , clause( 62, [ =( divide( divide( Y, Y ), X ), inverse( X ) ) ] )
% 0.41/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.41/1.07 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqswap(
% 0.41/1.07 clause( 66, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 , clause( 56, [ =( identity, divide( X, X ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 , clause( 66, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqswap(
% 0.41/1.07 clause( 71, [ ~( =( multiply( inverse( b1 ), b1 ), multiply( inverse( a1 )
% 0.41/1.07 , a1 ) ) ) ] )
% 0.41/1.07 , clause( 57, [ ~( =( multiply( inverse( a1 ), a1 ), multiply( inverse( b1
% 0.41/1.07 ), b1 ) ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 4, [ ~( =( multiply( inverse( b1 ), b1 ), multiply( inverse( a1 ),
% 0.41/1.07 a1 ) ) ) ] )
% 0.41/1.07 , clause( 71, [ ~( =( multiply( inverse( b1 ), b1 ), multiply( inverse( a1
% 0.41/1.07 ), a1 ) ) ) ] )
% 0.41/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 paramod(
% 0.41/1.07 clause( 74, [ =( divide( identity, Y ), inverse( Y ) ) ] )
% 0.41/1.07 , clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 , 0, clause( 2, [ =( divide( divide( Y, Y ), X ), inverse( X ) ) ] )
% 0.41/1.07 , 0, 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, Y ),
% 0.41/1.07 :=( Y, X )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 5, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.41/1.07 , clause( 74, [ =( divide( identity, Y ), inverse( Y ) ) ] )
% 0.41/1.07 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.41/1.07 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 paramod(
% 0.41/1.07 clause( 79, [ =( divide( X, divide( identity, Z ) ), multiply( X, Z ) ) ]
% 0.41/1.07 )
% 0.41/1.07 , clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 , 0, clause( 1, [ =( divide( X, divide( divide( Z, Z ), Y ) ), multiply( X
% 0.41/1.07 , Y ) ) ] )
% 0.41/1.07 , 0, 4, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.41/1.07 :=( Y, Z ), :=( Z, Y )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 paramod(
% 0.41/1.07 clause( 80, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.41/1.07 , clause( 5, [ =( divide( identity, X ), inverse( X ) ) ] )
% 0.41/1.07 , 0, clause( 79, [ =( divide( X, divide( identity, Z ) ), multiply( X, Z )
% 0.41/1.07 ) ] )
% 0.41/1.07 , 0, 3, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.41/1.07 :=( Y, Z ), :=( Z, Y )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 21, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.41/1.07 , clause( 80, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.41/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.41/1.07 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqswap(
% 0.41/1.07 clause( 82, [ =( multiply( X, Y ), divide( X, inverse( Y ) ) ) ] )
% 0.41/1.07 , clause( 21, [ =( divide( X, inverse( Y ) ), multiply( X, Y ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 paramod(
% 0.41/1.07 clause( 84, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.41/1.07 , clause( 3, [ =( divide( X, X ), identity ) ] )
% 0.41/1.07 , 0, clause( 82, [ =( multiply( X, Y ), divide( X, inverse( Y ) ) ) ] )
% 0.41/1.07 , 0, 5, substitution( 0, [ :=( X, inverse( X ) )] ), substitution( 1, [
% 0.41/1.07 :=( X, inverse( X ) ), :=( Y, X )] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 50, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.41/1.07 , clause( 84, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.41/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqswap(
% 0.41/1.07 clause( 87, [ ~( =( multiply( inverse( a1 ), a1 ), multiply( inverse( b1 )
% 0.41/1.07 , b1 ) ) ) ] )
% 0.41/1.07 , clause( 4, [ ~( =( multiply( inverse( b1 ), b1 ), multiply( inverse( a1 )
% 0.41/1.07 , a1 ) ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 paramod(
% 0.41/1.07 clause( 90, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.41/1.07 , clause( 50, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.41/1.07 , 0, clause( 87, [ ~( =( multiply( inverse( a1 ), a1 ), multiply( inverse(
% 0.41/1.07 b1 ), b1 ) ) ) ] )
% 0.41/1.07 , 0, 6, substitution( 0, [ :=( X, b1 )] ), substitution( 1, [] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 paramod(
% 0.41/1.07 clause( 92, [ ~( =( identity, identity ) ) ] )
% 0.41/1.07 , clause( 50, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.41/1.07 , 0, clause( 90, [ ~( =( multiply( inverse( a1 ), a1 ), identity ) ) ] )
% 0.41/1.07 , 0, 2, substitution( 0, [ :=( X, a1 )] ), substitution( 1, [] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 eqrefl(
% 0.41/1.07 clause( 93, [] )
% 0.41/1.07 , clause( 92, [ ~( =( identity, identity ) ) ] )
% 0.41/1.07 , 0, substitution( 0, [] )).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 subsumption(
% 0.41/1.07 clause( 51, [] )
% 0.41/1.07 , clause( 93, [] )
% 0.41/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 end.
% 0.41/1.07
% 0.41/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.07
% 0.41/1.07 Memory use:
% 0.41/1.07
% 0.41/1.07 space for terms: 596
% 0.41/1.07 space for clauses: 5461
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 clauses generated: 158
% 0.41/1.07 clauses kept: 52
% 0.41/1.07 clauses selected: 16
% 0.41/1.07 clauses deleted: 3
% 0.41/1.07 clauses inuse deleted: 0
% 0.41/1.07
% 0.41/1.07 subsentry: 129
% 0.41/1.07 literals s-matched: 57
% 0.41/1.07 literals matched: 57
% 0.41/1.07 full subsumption: 0
% 0.41/1.07
% 0.41/1.07 checksum: -2012152096
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Bliksem ended
%------------------------------------------------------------------------------