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