TSTP Solution File: GRP041-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP041-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:34:33 EDT 2022
% Result : Unsatisfiable 0.76s 1.15s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP041-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Tue Jun 14 12:25:43 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.76/1.15 *** allocated 10000 integers for termspace/termends
% 0.76/1.15 *** allocated 10000 integers for clauses
% 0.76/1.15 *** allocated 10000 integers for justifications
% 0.76/1.15 Bliksem 1.12
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Automatic Strategy Selection
% 0.76/1.15
% 0.76/1.15 Clauses:
% 0.76/1.15 [
% 0.76/1.15 [ product( identity, X, X ) ],
% 0.76/1.15 [ product( inverse( X ), X, identity ) ],
% 0.76/1.15 [ product( X, Y, multiply( X, Y ) ) ],
% 0.76/1.15 [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish( Z, T ) ]
% 0.76/1.15 ,
% 0.76/1.15 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.76/1.15 ) ), product( X, U, W ) ],
% 0.76/1.15 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.76/1.15 ) ), product( Z, T, W ) ],
% 0.76/1.15 [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z, T, Y ) ]
% 0.76/1.15 ,
% 0.76/1.15 [ ~( equalish( a, a ) ) ]
% 0.76/1.15 ] .
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 percentage equality = 0.000000, percentage horn = 1.000000
% 0.76/1.15 This is a near-Horn, non-equality problem
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Options Used:
% 0.76/1.15
% 0.76/1.15 useres = 1
% 0.76/1.15 useparamod = 0
% 0.76/1.15 useeqrefl = 0
% 0.76/1.15 useeqfact = 0
% 0.76/1.15 usefactor = 1
% 0.76/1.15 usesimpsplitting = 0
% 0.76/1.15 usesimpdemod = 0
% 0.76/1.15 usesimpres = 4
% 0.76/1.15
% 0.76/1.15 resimpinuse = 1000
% 0.76/1.15 resimpclauses = 20000
% 0.76/1.15 substype = standard
% 0.76/1.15 backwardsubs = 1
% 0.76/1.15 selectoldest = 5
% 0.76/1.15
% 0.76/1.15 litorderings [0] = split
% 0.76/1.15 litorderings [1] = liftord
% 0.76/1.15
% 0.76/1.15 termordering = none
% 0.76/1.15
% 0.76/1.15 litapriori = 1
% 0.76/1.15 termapriori = 0
% 0.76/1.15 litaposteriori = 0
% 0.76/1.15 termaposteriori = 0
% 0.76/1.15 demodaposteriori = 0
% 0.76/1.15 ordereqreflfact = 0
% 0.76/1.15
% 0.76/1.15 litselect = negative
% 0.76/1.15
% 0.76/1.15 maxweight = 30000
% 0.76/1.15 maxdepth = 30000
% 0.76/1.15 maxlength = 115
% 0.76/1.15 maxnrvars = 195
% 0.76/1.15 excuselevel = 0
% 0.76/1.15 increasemaxweight = 0
% 0.76/1.15
% 0.76/1.15 maxselected = 10000000
% 0.76/1.15 maxnrclauses = 10000000
% 0.76/1.15
% 0.76/1.15 showgenerated = 0
% 0.76/1.15 showkept = 0
% 0.76/1.15 showselected = 0
% 0.76/1.15 showdeleted = 0
% 0.76/1.15 showresimp = 1
% 0.76/1.15 showstatus = 2000
% 0.76/1.15
% 0.76/1.15 prologoutput = 1
% 0.76/1.15 nrgoals = 5000000
% 0.76/1.15 totalproof = 1
% 0.76/1.15
% 0.76/1.15 Symbols occurring in the translation:
% 0.76/1.15
% 0.76/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.76/1.15 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.76/1.15 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.76/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.15 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.76/1.15 product [41, 3] (w:1, o:50, a:1, s:1, b:0),
% 0.76/1.15 inverse [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.76/1.15 multiply [44, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.76/1.15 equalish [47, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.76/1.15 a [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Starting Search:
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Bliksems!, er is een bewijs:
% 0.76/1.15 % SZS status Unsatisfiable
% 0.76/1.15 % SZS output start Refutation
% 0.76/1.15
% 0.76/1.15 clause( 0, [ product( identity, X, X ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.76/1.15 ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 7, [ ~( equalish( a, a ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 8, [ equalish( X, X ), ~( product( Y, Z, X ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 17, [ equalish( X, X ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 21, [] )
% 0.76/1.15 .
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 % SZS output end Refutation
% 0.76/1.15 found a proof!
% 0.76/1.15
% 0.76/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.15
% 0.76/1.15 initialclauses(
% 0.76/1.15 [ clause( 23, [ product( identity, X, X ) ] )
% 0.76/1.15 , clause( 24, [ product( inverse( X ), X, identity ) ] )
% 0.76/1.15 , clause( 25, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.76/1.15 , clause( 26, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.76/1.15 Z, T ) ] )
% 0.76/1.15 , clause( 27, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.76/1.15 product( Z, T, W ) ), product( X, U, W ) ] )
% 0.76/1.15 , clause( 28, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.76/1.15 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.76/1.15 , clause( 29, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z
% 0.76/1.15 , T, Y ) ] )
% 0.76/1.15 , clause( 30, [ ~( equalish( a, a ) ) ] )
% 0.76/1.15 ] ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 0, [ product( identity, X, X ) ] )
% 0.76/1.15 , clause( 23, [ product( identity, X, X ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.76/1.15 ) ) ] )
% 0.76/1.15 , clause( 26, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.76/1.15 Z, T ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 7, [ ~( equalish( a, a ) ) ] )
% 0.76/1.15 , clause( 30, [ ~( equalish( a, a ) ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 factor(
% 0.76/1.15 clause( 41, [ equalish( X, X ), ~( product( Y, Z, X ) ) ] )
% 0.76/1.15 , clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y
% 0.76/1.15 , T ) ) ] )
% 0.76/1.15 , 1, 2, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, X )] )
% 0.76/1.15 ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 8, [ equalish( X, X ), ~( product( Y, Z, X ) ) ] )
% 0.76/1.15 , clause( 41, [ equalish( X, X ), ~( product( Y, Z, X ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 42, [ equalish( X, X ) ] )
% 0.76/1.15 , clause( 8, [ equalish( X, X ), ~( product( Y, Z, X ) ) ] )
% 0.76/1.15 , 1, clause( 0, [ product( identity, X, X ) ] )
% 0.76/1.15 , 0, substitution( 0, [ :=( X, X ), :=( Y, identity ), :=( Z, X )] ),
% 0.76/1.15 substitution( 1, [ :=( X, X )] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 17, [ equalish( X, X ) ] )
% 0.76/1.15 , clause( 42, [ equalish( X, X ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 43, [] )
% 0.76/1.15 , clause( 7, [ ~( equalish( a, a ) ) ] )
% 0.76/1.15 , 0, clause( 17, [ equalish( X, X ) ] )
% 0.76/1.15 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 21, [] )
% 0.76/1.15 , clause( 43, [] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 end.
% 0.76/1.15
% 0.76/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.15
% 0.76/1.15 Memory use:
% 0.76/1.15
% 0.76/1.15 space for terms: 440
% 0.76/1.15 space for clauses: 1129
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 clauses generated: 28
% 0.76/1.15 clauses kept: 22
% 0.76/1.15 clauses selected: 7
% 0.76/1.15 clauses deleted: 0
% 0.76/1.15 clauses inuse deleted: 0
% 0.76/1.15
% 0.76/1.15 subsentry: 56
% 0.76/1.15 literals s-matched: 25
% 0.76/1.15 literals matched: 14
% 0.76/1.15 full subsumption: 10
% 0.76/1.15
% 0.76/1.15 checksum: 1073783425
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Bliksem ended
%------------------------------------------------------------------------------