TSTP Solution File: GRP028-4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP028-4 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:26 EDT 2022
% Result : Unsatisfiable 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP028-4 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n014.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 : Mon Jun 13 13:16:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.07 *** allocated 10000 integers for termspace/termends
% 0.44/1.07 *** allocated 10000 integers for clauses
% 0.44/1.07 *** allocated 10000 integers for justifications
% 0.44/1.07 Bliksem 1.12
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Automatic Strategy Selection
% 0.44/1.07
% 0.44/1.07 Clauses:
% 0.44/1.07 [
% 0.44/1.07 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.44/1.07 ) ), product( Z, T, W ) ],
% 0.44/1.07 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.44/1.07 ) ), product( X, U, W ) ],
% 0.44/1.07 [ product( 'left_solution'( X, Y ), X, Y ) ],
% 0.44/1.07 [ product( X, 'right_solution'( X, Y ), Y ) ],
% 0.44/1.07 [ ~( product( 'not_identity'( X ), X, 'not_identity'( X ) ) ) ]
% 0.44/1.07 ] .
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.07 This is a near-Horn, non-equality problem
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Options Used:
% 0.44/1.07
% 0.44/1.07 useres = 1
% 0.44/1.07 useparamod = 0
% 0.44/1.07 useeqrefl = 0
% 0.44/1.07 useeqfact = 0
% 0.44/1.07 usefactor = 1
% 0.44/1.07 usesimpsplitting = 0
% 0.44/1.07 usesimpdemod = 0
% 0.44/1.07 usesimpres = 4
% 0.44/1.07
% 0.44/1.07 resimpinuse = 1000
% 0.44/1.07 resimpclauses = 20000
% 0.44/1.07 substype = standard
% 0.44/1.07 backwardsubs = 1
% 0.44/1.07 selectoldest = 5
% 0.44/1.07
% 0.44/1.07 litorderings [0] = split
% 0.44/1.07 litorderings [1] = liftord
% 0.44/1.07
% 0.44/1.07 termordering = none
% 0.44/1.07
% 0.44/1.07 litapriori = 1
% 0.44/1.07 termapriori = 0
% 0.44/1.07 litaposteriori = 0
% 0.44/1.07 termaposteriori = 0
% 0.44/1.07 demodaposteriori = 0
% 0.44/1.07 ordereqreflfact = 0
% 0.44/1.07
% 0.44/1.07 litselect = negative
% 0.44/1.07
% 0.44/1.07 maxweight = 30000
% 0.44/1.07 maxdepth = 30000
% 0.44/1.07 maxlength = 115
% 0.44/1.07 maxnrvars = 195
% 0.44/1.07 excuselevel = 0
% 0.44/1.07 increasemaxweight = 0
% 0.44/1.07
% 0.44/1.07 maxselected = 10000000
% 0.44/1.07 maxnrclauses = 10000000
% 0.44/1.07
% 0.44/1.07 showgenerated = 0
% 0.44/1.07 showkept = 0
% 0.44/1.07 showselected = 0
% 0.44/1.07 showdeleted = 0
% 0.44/1.07 showresimp = 1
% 0.44/1.07 showstatus = 2000
% 0.44/1.07
% 0.44/1.07 prologoutput = 1
% 0.44/1.07 nrgoals = 5000000
% 0.44/1.07 totalproof = 1
% 0.44/1.07
% 0.44/1.07 Symbols occurring in the translation:
% 0.44/1.07
% 0.44/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.44/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 product [42, 3] (w:1, o:48, a:1, s:1, b:0),
% 0.44/1.07 'left_solution' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.44/1.07 'right_solution' [47, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.07 'not_identity' [48, 1] (w:1, o:20, a:1, s:1, b:0).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Starting Search:
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksems!, er is een bewijs:
% 0.44/1.07 % SZS status Unsatisfiable
% 0.44/1.07 % SZS output start Refutation
% 0.44/1.07
% 0.44/1.07 clause( 0, [ ~( product( X, Y, Z ) ), ~( product( X, U, W ) ), product( Z,
% 0.44/1.07 T, W ), ~( product( Y, T, U ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 2, [ product( 'left_solution'( X, Y ), X, Y ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 3, [ product( X, 'right_solution'( X, Y ), Y ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 4, [ ~( product( 'not_identity'( X ), X, 'not_identity'( X ) ) ) ]
% 0.44/1.07 )
% 0.44/1.07 .
% 0.44/1.07 clause( 15, [ ~( product( X, Y, Z ) ), product( Z, 'right_solution'( Y, T )
% 0.44/1.07 , U ), ~( product( X, T, U ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 16, [ product( Z, 'right_solution'( Y, Y ), Z ), ~( product( X, Y,
% 0.44/1.07 Z ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 19, [ product( X, 'right_solution'( Y, Y ), X ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 22, [] )
% 0.44/1.07 .
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 % SZS output end Refutation
% 0.44/1.07 found a proof!
% 0.44/1.07
% 0.44/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07
% 0.44/1.07 initialclauses(
% 0.44/1.07 [ clause( 24, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.44/1.07 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.44/1.07 , clause( 25, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.44/1.07 product( Z, T, W ) ), product( X, U, W ) ] )
% 0.44/1.07 , clause( 26, [ product( 'left_solution'( X, Y ), X, Y ) ] )
% 0.44/1.07 , clause( 27, [ product( X, 'right_solution'( X, Y ), Y ) ] )
% 0.44/1.07 , clause( 28, [ ~( product( 'not_identity'( X ), X, 'not_identity'( X ) ) )
% 0.44/1.07 ] )
% 0.44/1.07 ] ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 0, [ ~( product( X, Y, Z ) ), ~( product( X, U, W ) ), product( Z,
% 0.44/1.07 T, W ), ~( product( Y, T, U ) ) ] )
% 0.44/1.07 , clause( 24, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.44/1.07 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.44/1.07 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 3 ), ==>( 2
% 0.44/1.07 , 1 ), ==>( 3, 2 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 2, [ product( 'left_solution'( X, Y ), X, Y ) ] )
% 0.44/1.07 , clause( 26, [ product( 'left_solution'( X, Y ), X, Y ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.07 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 3, [ product( X, 'right_solution'( X, Y ), Y ) ] )
% 0.44/1.07 , clause( 27, [ product( X, 'right_solution'( X, Y ), Y ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.07 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 4, [ ~( product( 'not_identity'( X ), X, 'not_identity'( X ) ) ) ]
% 0.44/1.07 )
% 0.44/1.07 , clause( 28, [ ~( product( 'not_identity'( X ), X, 'not_identity'( X ) ) )
% 0.44/1.07 ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 resolution(
% 0.44/1.07 clause( 59, [ ~( product( X, Y, Z ) ), ~( product( X, T, U ) ), product( Z
% 0.44/1.07 , 'right_solution'( Y, T ), U ) ] )
% 0.44/1.07 , clause( 0, [ ~( product( X, Y, Z ) ), ~( product( X, U, W ) ), product( Z
% 0.44/1.07 , T, W ), ~( product( Y, T, U ) ) ] )
% 0.44/1.07 , 3, clause( 3, [ product( X, 'right_solution'( X, Y ), Y ) ] )
% 0.44/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 0.44/1.07 'right_solution'( Y, T ) ), :=( U, T ), :=( W, U )] ), substitution( 1, [
% 0.44/1.07 :=( X, Y ), :=( Y, T )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 15, [ ~( product( X, Y, Z ) ), product( Z, 'right_solution'( Y, T )
% 0.44/1.07 , U ), ~( product( X, T, U ) ) ] )
% 0.44/1.07 , clause( 59, [ ~( product( X, Y, Z ) ), ~( product( X, T, U ) ), product(
% 0.44/1.07 Z, 'right_solution'( Y, T ), U ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.44/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] )
% 0.44/1.07 ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 factor(
% 0.44/1.07 clause( 62, [ ~( product( X, Y, Z ) ), product( Z, 'right_solution'( Y, Y )
% 0.44/1.07 , Z ) ] )
% 0.44/1.07 , clause( 15, [ ~( product( X, Y, Z ) ), product( Z, 'right_solution'( Y, T
% 0.44/1.07 ), U ), ~( product( X, T, U ) ) ] )
% 0.44/1.07 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, Y ),
% 0.44/1.07 :=( U, Z )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 16, [ product( Z, 'right_solution'( Y, Y ), Z ), ~( product( X, Y,
% 0.44/1.07 Z ) ) ] )
% 0.44/1.07 , clause( 62, [ ~( product( X, Y, Z ) ), product( Z, 'right_solution'( Y, Y
% 0.44/1.07 ), Z ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 resolution(
% 0.44/1.07 clause( 63, [ product( X, 'right_solution'( Y, Y ), X ) ] )
% 0.44/1.07 , clause( 16, [ product( Z, 'right_solution'( Y, Y ), Z ), ~( product( X, Y
% 0.44/1.07 , Z ) ) ] )
% 0.44/1.07 , 1, clause( 2, [ product( 'left_solution'( X, Y ), X, Y ) ] )
% 0.44/1.07 , 0, substitution( 0, [ :=( X, 'left_solution'( Y, X ) ), :=( Y, Y ), :=( Z
% 0.44/1.07 , X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 19, [ product( X, 'right_solution'( Y, Y ), X ) ] )
% 0.44/1.07 , clause( 63, [ product( X, 'right_solution'( Y, Y ), X ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.07 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 resolution(
% 0.44/1.07 clause( 64, [] )
% 0.44/1.07 , clause( 4, [ ~( product( 'not_identity'( X ), X, 'not_identity'( X ) ) )
% 0.44/1.07 ] )
% 0.44/1.07 , 0, clause( 19, [ product( X, 'right_solution'( Y, Y ), X ) ] )
% 0.44/1.07 , 0, substitution( 0, [ :=( X, 'right_solution'( X, X ) )] ),
% 0.44/1.07 substitution( 1, [ :=( X, 'not_identity'( 'right_solution'( X, X ) ) ),
% 0.44/1.07 :=( Y, X )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 22, [] )
% 0.44/1.07 , clause( 64, [] )
% 0.44/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 end.
% 0.44/1.07
% 0.44/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07
% 0.44/1.07 Memory use:
% 0.44/1.07
% 0.44/1.07 space for terms: 428
% 0.44/1.07 space for clauses: 1200
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 clauses generated: 35
% 0.44/1.07 clauses kept: 23
% 0.44/1.07 clauses selected: 9
% 0.44/1.07 clauses deleted: 1
% 0.44/1.07 clauses inuse deleted: 0
% 0.44/1.07
% 0.44/1.07 subsentry: 124
% 0.44/1.07 literals s-matched: 58
% 0.44/1.07 literals matched: 42
% 0.44/1.07 full subsumption: 20
% 0.44/1.07
% 0.44/1.07 checksum: 6323504
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksem ended
%------------------------------------------------------------------------------