TSTP Solution File: GRP702-11 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:39:06 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% 0.08/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n010.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 : Tue Jun 14 05:17:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09 [
% 0.71/1.09 [ =( mult( X, ld( X, Y ) ), Y ) ],
% 0.71/1.09 [ =( ld( X, mult( X, Y ) ), Y ) ],
% 0.71/1.09 [ =( mult( rd( X, Y ), Y ), X ) ],
% 0.71/1.09 [ =( rd( mult( X, Y ), Y ), X ) ],
% 0.71/1.09 [ =( mult( X, unit ), X ) ],
% 0.71/1.09 [ =( mult( unit, X ), X ) ],
% 0.71/1.09 [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X, Y ), Y ),
% 0.71/1.09 Z ) ) ],
% 0.71/1.09 [ =( mult( 'op_c', mult( X, Y ) ), mult( mult( 'op_c', X ), Y ) ) ],
% 0.71/1.09 [ =( mult( X, mult( Y, 'op_c' ) ), mult( mult( X, Y ), 'op_c' ) ) ],
% 0.71/1.09 [ =( mult( X, mult( 'op_c', Y ) ), mult( mult( X, 'op_c' ), Y ) ) ],
% 0.71/1.09 [ =( 'op_d', ld( X, mult( 'op_c', X ) ) ) ],
% 0.71/1.09 [ =( 'op_e', mult( mult( rd( 'op_c', mult( X, Y ) ), Y ), X ) ) ],
% 0.71/1.09 [ =( 'op_f', mult( X, mult( Y, ld( mult( X, Y ), 'op_c' ) ) ) ) ],
% 0.71/1.09 [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1 ), 'op_d' ) )
% 0.71/1.09 ) ]
% 0.71/1.09 ] .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.71/1.09 This is a pure equality problem
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 1
% 0.71/1.09 useeqrefl = 1
% 0.71/1.09 useeqfact = 1
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 5
% 0.71/1.09 usesimpres = 3
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = eqrewr
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.09
% 0.71/1.09 termordering = kbo
% 0.71/1.09
% 0.71/1.09 litapriori = 0
% 0.71/1.09 termapriori = 1
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negord
% 0.71/1.09
% 0.71/1.09 maxweight = 15
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 1
% 0.71/1.09 increasemaxweight = 1
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 1
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ld [41, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.09 mult [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.09 rd [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.09 unit [44, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.09 'op_c' [46, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.71/1.09 'op_d' [47, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.09 'op_e' [48, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.09 'op_f' [49, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.09 x0 [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.09 x1 [51, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 clause( 1, [ =( ld( X, mult( X, Y ) ), Y ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 8, [ =( mult( X, mult( Y, 'op_c' ) ), mult( mult( X, Y ), 'op_c' )
% 0.71/1.09 ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 10, [ =( ld( X, mult( 'op_c', X ) ), 'op_d' ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 13, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1 ),
% 0.71/1.09 'op_d' ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 30, [ =( 'op_d', 'op_c' ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 125, [] )
% 0.71/1.09 .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 initialclauses(
% 0.71/1.09 [ clause( 127, [ =( mult( X, ld( X, Y ) ), Y ) ] )
% 0.71/1.09 , clause( 128, [ =( ld( X, mult( X, Y ) ), Y ) ] )
% 0.71/1.09 , clause( 129, [ =( mult( rd( X, Y ), Y ), X ) ] )
% 0.71/1.09 , clause( 130, [ =( rd( mult( X, Y ), Y ), X ) ] )
% 0.71/1.09 , clause( 131, [ =( mult( X, unit ), X ) ] )
% 0.71/1.09 , clause( 132, [ =( mult( unit, X ), X ) ] )
% 0.71/1.09 , clause( 133, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X
% 0.71/1.09 , Y ), Y ), Z ) ) ] )
% 0.71/1.09 , clause( 134, [ =( mult( 'op_c', mult( X, Y ) ), mult( mult( 'op_c', X ),
% 0.71/1.09 Y ) ) ] )
% 0.71/1.09 , clause( 135, [ =( mult( X, mult( Y, 'op_c' ) ), mult( mult( X, Y ),
% 0.71/1.09 'op_c' ) ) ] )
% 0.71/1.09 , clause( 136, [ =( mult( X, mult( 'op_c', Y ) ), mult( mult( X, 'op_c' ),
% 0.71/1.09 Y ) ) ] )
% 0.71/1.09 , clause( 137, [ =( 'op_d', ld( X, mult( 'op_c', X ) ) ) ] )
% 0.71/1.09 , clause( 138, [ =( 'op_e', mult( mult( rd( 'op_c', mult( X, Y ) ), Y ), X
% 0.71/1.09 ) ) ] )
% 0.71/1.09 , clause( 139, [ =( 'op_f', mult( X, mult( Y, ld( mult( X, Y ), 'op_c' ) )
% 0.71/1.09 ) ) ] )
% 0.71/1.09 , clause( 140, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1 )
% 0.71/1.09 , 'op_d' ) ) ) ] )
% 0.71/1.09 ] ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 1, [ =( ld( X, mult( X, Y ) ), Y ) ] )
% 0.71/1.09 , clause( 128, [ =( ld( X, mult( X, Y ) ), Y ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 8, [ =( mult( X, mult( Y, 'op_c' ) ), mult( mult( X, Y ), 'op_c' )
% 0.71/1.09 ) ] )
% 0.71/1.09 , clause( 135, [ =( mult( X, mult( Y, 'op_c' ) ), mult( mult( X, Y ),
% 0.71/1.09 'op_c' ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 162, [ =( ld( X, mult( 'op_c', X ) ), 'op_d' ) ] )
% 0.71/1.09 , clause( 137, [ =( 'op_d', ld( X, mult( 'op_c', X ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 10, [ =( ld( X, mult( 'op_c', X ) ), 'op_d' ) ] )
% 0.71/1.09 , clause( 162, [ =( ld( X, mult( 'op_c', X ) ), 'op_d' ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 13, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1 ),
% 0.71/1.09 'op_d' ) ) ) ] )
% 0.71/1.09 , clause( 140, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1 )
% 0.71/1.09 , 'op_d' ) ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 177, [ =( 'op_d', ld( X, mult( 'op_c', X ) ) ) ] )
% 0.71/1.09 , clause( 10, [ =( ld( X, mult( 'op_c', X ) ), 'op_d' ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 179, [ =( 'op_d', 'op_c' ) ] )
% 0.71/1.09 , clause( 1, [ =( ld( X, mult( X, Y ) ), Y ) ] )
% 0.71/1.09 , 0, clause( 177, [ =( 'op_d', ld( X, mult( 'op_c', X ) ) ) ] )
% 0.71/1.09 , 0, 2, substitution( 0, [ :=( X, 'op_c' ), :=( Y, 'op_c' )] ),
% 0.71/1.09 substitution( 1, [ :=( X, 'op_c' )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 30, [ =( 'op_d', 'op_c' ) ] )
% 0.71/1.09 , clause( 179, [ =( 'op_d', 'op_c' ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 185, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1 ),
% 0.71/1.09 'op_c' ) ) ) ] )
% 0.71/1.09 , clause( 30, [ =( 'op_d', 'op_c' ) ] )
% 0.71/1.09 , 0, clause( 13, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0, x1
% 0.71/1.09 ), 'op_d' ) ) ) ] )
% 0.71/1.09 , 0, 11, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 186, [ ~( =( mult( x0, mult( x1, 'op_c' ) ), mult( mult( x0, x1 ),
% 0.71/1.09 'op_c' ) ) ) ] )
% 0.71/1.09 , clause( 30, [ =( 'op_d', 'op_c' ) ] )
% 0.71/1.09 , 0, clause( 185, [ ~( =( mult( x0, mult( x1, 'op_d' ) ), mult( mult( x0,
% 0.71/1.09 x1 ), 'op_c' ) ) ) ] )
% 0.71/1.09 , 0, 6, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 187, [ ~( =( mult( mult( x0, x1 ), 'op_c' ), mult( mult( x0, x1 ),
% 0.71/1.09 'op_c' ) ) ) ] )
% 0.71/1.09 , clause( 8, [ =( mult( X, mult( Y, 'op_c' ) ), mult( mult( X, Y ), 'op_c'
% 0.71/1.09 ) ) ] )
% 0.71/1.09 , 0, clause( 186, [ ~( =( mult( x0, mult( x1, 'op_c' ) ), mult( mult( x0,
% 0.71/1.09 x1 ), 'op_c' ) ) ) ] )
% 0.71/1.09 , 0, 2, substitution( 0, [ :=( X, x0 ), :=( Y, x1 )] ), substitution( 1, [] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqrefl(
% 0.71/1.09 clause( 188, [] )
% 0.71/1.09 , clause( 187, [ ~( =( mult( mult( x0, x1 ), 'op_c' ), mult( mult( x0, x1 )
% 0.71/1.09 , 'op_c' ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 125, [] )
% 0.71/1.09 , clause( 188, [] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 end.
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 Memory use:
% 0.71/1.09
% 0.71/1.09 space for terms: 1755
% 0.71/1.09 space for clauses: 15120
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 clauses generated: 483
% 0.71/1.09 clauses kept: 126
% 0.71/1.09 clauses selected: 36
% 0.71/1.09 clauses deleted: 5
% 0.71/1.09 clauses inuse deleted: 0
% 0.71/1.09
% 0.71/1.09 subsentry: 258
% 0.71/1.09 literals s-matched: 133
% 0.71/1.09 literals matched: 133
% 0.71/1.09 full subsumption: 0
% 0.71/1.09
% 0.71/1.09 checksum: -1844667647
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksem ended
%------------------------------------------------------------------------------