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