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