TSTP Solution File: ALG235-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ALG235-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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 : Thu Jul 14 12:10:07 EDT 2022
% Result : Unsatisfiable 0.66s 1.07s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ALG235-1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n027.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 : Wed Jun 8 16:11:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.66/1.07 *** allocated 10000 integers for termspace/termends
% 0.66/1.07 *** allocated 10000 integers for clauses
% 0.66/1.07 *** allocated 10000 integers for justifications
% 0.66/1.07 Bliksem 1.12
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Automatic Strategy Selection
% 0.66/1.07
% 0.66/1.07 Clauses:
% 0.66/1.07 [
% 0.66/1.07 [ =( mult( X, mult( Y, mult( X, Y ) ) ), mult( X, Y ) ) ],
% 0.66/1.07 [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y, mult( X, T )
% 0.66/1.07 ) ) ) ],
% 0.66/1.07 [ =( mult( mult( X, mult( Y, mult( Z, Y ) ) ), T ), mult( X, mult( T,
% 0.66/1.07 mult( mult( Z, Y ), T ) ) ) ) ],
% 0.66/1.07 [ ~( =( mult( a, mult( b, mult( a, mult( c, mult( d, c ) ) ) ) ), mult(
% 0.66/1.07 a, mult( b, mult( d, c ) ) ) ) ) ]
% 0.66/1.07 ] .
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.66/1.07 This is a pure equality problem
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Options Used:
% 0.66/1.07
% 0.66/1.07 useres = 1
% 0.66/1.07 useparamod = 1
% 0.66/1.07 useeqrefl = 1
% 0.66/1.07 useeqfact = 1
% 0.66/1.07 usefactor = 1
% 0.66/1.07 usesimpsplitting = 0
% 0.66/1.07 usesimpdemod = 5
% 0.66/1.07 usesimpres = 3
% 0.66/1.07
% 0.66/1.07 resimpinuse = 1000
% 0.66/1.07 resimpclauses = 20000
% 0.66/1.07 substype = eqrewr
% 0.66/1.07 backwardsubs = 1
% 0.66/1.07 selectoldest = 5
% 0.66/1.07
% 0.66/1.07 litorderings [0] = split
% 0.66/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.66/1.07
% 0.66/1.07 termordering = kbo
% 0.66/1.07
% 0.66/1.07 litapriori = 0
% 0.66/1.07 termapriori = 1
% 0.66/1.07 litaposteriori = 0
% 0.66/1.07 termaposteriori = 0
% 0.66/1.07 demodaposteriori = 0
% 0.66/1.07 ordereqreflfact = 0
% 0.66/1.07
% 0.66/1.07 litselect = negord
% 0.66/1.07
% 0.66/1.07 maxweight = 15
% 0.66/1.07 maxdepth = 30000
% 0.66/1.07 maxlength = 115
% 0.66/1.07 maxnrvars = 195
% 0.66/1.07 excuselevel = 1
% 0.66/1.07 increasemaxweight = 1
% 0.66/1.07
% 0.66/1.07 maxselected = 10000000
% 0.66/1.07 maxnrclauses = 10000000
% 0.66/1.07
% 0.66/1.07 showgenerated = 0
% 0.66/1.07 showkept = 0
% 0.66/1.07 showselected = 0
% 0.66/1.07 showdeleted = 0
% 0.66/1.07 showresimp = 1
% 0.66/1.07 showstatus = 2000
% 0.66/1.07
% 0.66/1.07 prologoutput = 1
% 0.66/1.07 nrgoals = 5000000
% 0.66/1.07 totalproof = 1
% 0.66/1.07
% 0.66/1.07 Symbols occurring in the translation:
% 0.66/1.07
% 0.66/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.66/1.07 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.66/1.07 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.66/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.07 mult [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.66/1.07 a [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.66/1.07 b [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.66/1.07 c [46, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.66/1.07 d [47, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Starting Search:
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Bliksems!, er is een bewijs:
% 0.66/1.07 % SZS status Unsatisfiable
% 0.66/1.07 % SZS output start Refutation
% 0.66/1.07
% 0.66/1.07 clause( 0, [ =( mult( X, mult( Y, mult( X, Y ) ) ), mult( X, Y ) ) ] )
% 0.66/1.07 .
% 0.66/1.07 clause( 1, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y, mult(
% 0.66/1.07 X, T ) ) ) ) ] )
% 0.66/1.07 .
% 0.66/1.07 clause( 3, [ ~( =( mult( a, mult( b, mult( a, mult( c, mult( d, c ) ) ) ) )
% 0.66/1.07 , mult( a, mult( b, mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 .
% 0.66/1.07 clause( 10, [ =( mult( X, mult( T, mult( Z, mult( Y, mult( X, Y ) ) ) ) ),
% 0.66/1.07 mult( Z, mult( T, mult( X, Y ) ) ) ) ] )
% 0.66/1.07 .
% 0.66/1.07 clause( 44, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( d, mult( b,
% 0.66/1.07 mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 .
% 0.66/1.07 clause( 45, [] )
% 0.66/1.07 .
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 % SZS output end Refutation
% 0.66/1.07 found a proof!
% 0.66/1.07
% 0.66/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.66/1.07
% 0.66/1.07 initialclauses(
% 0.66/1.07 [ clause( 47, [ =( mult( X, mult( Y, mult( X, Y ) ) ), mult( X, Y ) ) ] )
% 0.66/1.07 , clause( 48, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y,
% 0.66/1.07 mult( X, T ) ) ) ) ] )
% 0.66/1.07 , clause( 49, [ =( mult( mult( X, mult( Y, mult( Z, Y ) ) ), T ), mult( X,
% 0.66/1.07 mult( T, mult( mult( Z, Y ), T ) ) ) ) ] )
% 0.66/1.07 , clause( 50, [ ~( =( mult( a, mult( b, mult( a, mult( c, mult( d, c ) ) )
% 0.66/1.07 ) ), mult( a, mult( b, mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 ] ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 0, [ =( mult( X, mult( Y, mult( X, Y ) ) ), mult( X, Y ) ) ] )
% 0.66/1.07 , clause( 47, [ =( mult( X, mult( Y, mult( X, Y ) ) ), mult( X, Y ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.66/1.07 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 1, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y, mult(
% 0.66/1.07 X, T ) ) ) ) ] )
% 0.66/1.07 , clause( 48, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y,
% 0.66/1.07 mult( X, T ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.66/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 3, [ ~( =( mult( a, mult( b, mult( a, mult( c, mult( d, c ) ) ) ) )
% 0.66/1.07 , mult( a, mult( b, mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 , clause( 50, [ ~( =( mult( a, mult( b, mult( a, mult( c, mult( d, c ) ) )
% 0.66/1.07 ) ), mult( a, mult( b, mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 paramod(
% 0.66/1.07 clause( 86, [ =( mult( X, mult( Y, mult( Z, mult( T, mult( X, T ) ) ) ) ),
% 0.66/1.07 mult( Z, mult( Y, mult( X, T ) ) ) ) ] )
% 0.66/1.07 , clause( 0, [ =( mult( X, mult( Y, mult( X, Y ) ) ), mult( X, Y ) ) ] )
% 0.66/1.07 , 0, clause( 1, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y,
% 0.66/1.07 mult( X, T ) ) ) ) ] )
% 0.66/1.07 , 0, 16, substitution( 0, [ :=( X, X ), :=( Y, T )] ), substitution( 1, [
% 0.66/1.07 :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, mult( T, mult( X, T ) ) )] )
% 0.66/1.07 ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 10, [ =( mult( X, mult( T, mult( Z, mult( Y, mult( X, Y ) ) ) ) ),
% 0.66/1.07 mult( Z, mult( T, mult( X, Y ) ) ) ) ] )
% 0.66/1.07 , clause( 86, [ =( mult( X, mult( Y, mult( Z, mult( T, mult( X, T ) ) ) ) )
% 0.66/1.07 , mult( Z, mult( Y, mult( X, T ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, T ), :=( Z, Z ), :=( T, Y )] ),
% 0.66/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 eqswap(
% 0.66/1.07 clause( 88, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( a, mult( b,
% 0.66/1.07 mult( a, mult( c, mult( d, c ) ) ) ) ) ) ) ] )
% 0.66/1.07 , clause( 3, [ ~( =( mult( a, mult( b, mult( a, mult( c, mult( d, c ) ) ) )
% 0.66/1.07 ), mult( a, mult( b, mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 paramod(
% 0.66/1.07 clause( 93, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( a, mult( b,
% 0.66/1.07 mult( d, mult( c, mult( a, c ) ) ) ) ) ) ) ] )
% 0.66/1.07 , clause( 1, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y,
% 0.66/1.07 mult( X, T ) ) ) ) ] )
% 0.66/1.07 , 0, clause( 88, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( a, mult(
% 0.66/1.07 b, mult( a, mult( c, mult( d, c ) ) ) ) ) ) ) ] )
% 0.66/1.07 , 0, 13, substitution( 0, [ :=( X, a ), :=( Y, c ), :=( Z, d ), :=( T, c )] )
% 0.66/1.07 , substitution( 1, [] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 paramod(
% 0.66/1.07 clause( 102, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( d, mult( b,
% 0.66/1.07 mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 , clause( 10, [ =( mult( X, mult( T, mult( Z, mult( Y, mult( X, Y ) ) ) ) )
% 0.66/1.07 , mult( Z, mult( T, mult( X, Y ) ) ) ) ] )
% 0.66/1.07 , 0, clause( 93, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( a, mult(
% 0.66/1.07 b, mult( d, mult( c, mult( a, c ) ) ) ) ) ) ) ] )
% 0.66/1.07 , 0, 9, substitution( 0, [ :=( X, a ), :=( Y, c ), :=( Z, d ), :=( T, b )] )
% 0.66/1.07 , substitution( 1, [] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 44, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( d, mult( b,
% 0.66/1.07 mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 , clause( 102, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( d, mult( b
% 0.66/1.07 , mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 eqswap(
% 0.66/1.07 clause( 104, [ ~( =( mult( d, mult( b, mult( a, c ) ) ), mult( a, mult( b,
% 0.66/1.07 mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 , clause( 44, [ ~( =( mult( a, mult( b, mult( d, c ) ) ), mult( d, mult( b
% 0.66/1.07 , mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 paramod(
% 0.66/1.07 clause( 106, [ ~( =( mult( d, mult( b, mult( a, c ) ) ), mult( d, mult( b,
% 0.66/1.07 mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 , clause( 1, [ =( mult( X, mult( Y, mult( Z, T ) ) ), mult( Z, mult( Y,
% 0.66/1.07 mult( X, T ) ) ) ) ] )
% 0.66/1.07 , 0, clause( 104, [ ~( =( mult( d, mult( b, mult( a, c ) ) ), mult( a, mult(
% 0.66/1.07 b, mult( d, c ) ) ) ) ) ] )
% 0.66/1.07 , 0, 9, substitution( 0, [ :=( X, a ), :=( Y, b ), :=( Z, d ), :=( T, c )] )
% 0.66/1.07 , substitution( 1, [] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 eqrefl(
% 0.66/1.07 clause( 109, [] )
% 0.66/1.07 , clause( 106, [ ~( =( mult( d, mult( b, mult( a, c ) ) ), mult( d, mult( b
% 0.66/1.07 , mult( a, c ) ) ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 45, [] )
% 0.66/1.07 , clause( 109, [] )
% 0.66/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 end.
% 0.66/1.07
% 0.66/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.66/1.07
% 0.66/1.07 Memory use:
% 0.66/1.07
% 0.66/1.07 space for terms: 1263
% 0.66/1.07 space for clauses: 9264
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 clauses generated: 403
% 0.66/1.07 clauses kept: 46
% 0.66/1.07 clauses selected: 11
% 0.66/1.07 clauses deleted: 2
% 0.66/1.07 clauses inuse deleted: 0
% 0.66/1.07
% 0.66/1.07 subsentry: 938
% 0.66/1.07 literals s-matched: 333
% 0.66/1.07 literals matched: 174
% 0.66/1.07 full subsumption: 0
% 0.66/1.07
% 0.66/1.07 checksum: -2105350823
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Bliksem ended
%------------------------------------------------------------------------------