TSTP Solution File: FLD056-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : FLD056-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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 01:51:18 EDT 2022
% Result : Unsatisfiable 0.65s 1.07s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD056-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jun 6 22:41:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/1.07 *** allocated 10000 integers for termspace/termends
% 0.65/1.07 *** allocated 10000 integers for clauses
% 0.65/1.07 *** allocated 10000 integers for justifications
% 0.65/1.07 Bliksem 1.12
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 Automatic Strategy Selection
% 0.65/1.07
% 0.65/1.07 Clauses:
% 0.65/1.07 [
% 0.65/1.07 [ sum( X, Y, Z ), ~( sum( X, T, U ) ), ~( sum( T, W, Y ) ), ~( sum( U, W
% 0.65/1.07 , Z ) ) ],
% 0.65/1.07 [ sum( X, Y, Z ), ~( sum( T, U, X ) ), ~( sum( U, Y, W ) ), ~( sum( T, W
% 0.65/1.07 , Z ) ) ],
% 0.65/1.07 [ sum( 'additive_identity', X, X ), ~( defined( X ) ) ],
% 0.65/1.07 [ sum( 'additive_inverse'( X ), X, 'additive_identity' ), ~( defined( X
% 0.65/1.07 ) ) ],
% 0.65/1.07 [ sum( X, Y, Z ), ~( sum( Y, X, Z ) ) ],
% 0.65/1.07 [ product( X, Y, Z ), ~( product( X, T, U ) ), ~( product( T, W, Y ) ),
% 0.65/1.07 ~( product( U, W, Z ) ) ],
% 0.65/1.07 [ product( X, Y, Z ), ~( product( T, U, X ) ), ~( product( U, Y, W ) ),
% 0.65/1.07 ~( product( T, W, Z ) ) ],
% 0.65/1.07 [ product( 'multiplicative_identity', X, X ), ~( defined( X ) ) ],
% 0.65/1.07 [ product( 'multiplicative_inverse'( X ), X, 'multiplicative_identity' )
% 0.65/1.07 , sum( 'additive_identity', X, 'additive_identity' ), ~( defined( X ) ) ]
% 0.65/1.07 ,
% 0.65/1.07 [ product( X, Y, Z ), ~( product( Y, X, Z ) ) ],
% 0.65/1.07 [ sum( X, Y, Z ), ~( sum( T, U, W ) ), ~( product( W, V0, Z ) ), ~(
% 0.65/1.07 product( T, V0, X ) ), ~( product( U, V0, Y ) ) ],
% 0.65/1.07 [ product( X, Y, Z ), ~( sum( T, U, X ) ), ~( product( T, Y, W ) ), ~(
% 0.65/1.07 product( U, Y, V0 ) ), ~( sum( W, V0, Z ) ) ],
% 0.65/1.07 [ defined( add( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ],
% 0.65/1.07 [ defined( 'additive_identity' ) ],
% 0.65/1.07 [ defined( 'additive_inverse'( X ) ), ~( defined( X ) ) ],
% 0.65/1.07 [ defined( multiply( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ]
% 0.65/1.07 ,
% 0.65/1.07 [ defined( 'multiplicative_identity' ) ],
% 0.65/1.07 [ defined( 'multiplicative_inverse'( X ) ), ~( defined( X ) ), sum(
% 0.65/1.07 'additive_identity', X, 'additive_identity' ) ],
% 0.65/1.07 [ sum( X, Y, add( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ],
% 0.65/1.07 [ product( X, Y, multiply( X, Y ) ), ~( defined( X ) ), ~( defined( Y )
% 0.65/1.07 ) ],
% 0.65/1.07 [ sum( 'additive_identity', X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.65/1.07 'less_or_equal'( Y, X ) ) ],
% 0.65/1.07 [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( X, Z ) ), ~(
% 0.65/1.07 'less_or_equal'( Z, Y ) ) ],
% 0.65/1.07 [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~( defined( X ) ),
% 0.65/1.07 ~( defined( Y ) ) ],
% 0.65/1.07 [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, T ) ), ~( sum( Z, U, X
% 0.65/1.07 ) ), ~( sum( T, U, Y ) ) ],
% 0.65/1.07 [ 'less_or_equal'( 'additive_identity', X ), ~( 'less_or_equal'(
% 0.65/1.07 'additive_identity', Y ) ), ~( 'less_or_equal'( 'additive_identity', Z )
% 0.65/1.07 ), ~( product( Y, Z, X ) ) ],
% 0.65/1.07 [ ~( sum( 'additive_identity', 'additive_identity',
% 0.65/1.07 'multiplicative_identity' ) ) ],
% 0.65/1.07 [ defined( a ) ],
% 0.65/1.07 [ ~( 'less_or_equal'( a, a ) ) ]
% 0.65/1.07 ] .
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 percentage equality = 0.000000, percentage horn = 0.892857
% 0.65/1.07 This a non-horn, non-equality problem
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 Options Used:
% 0.65/1.07
% 0.65/1.07 useres = 1
% 0.65/1.07 useparamod = 0
% 0.65/1.07 useeqrefl = 0
% 0.65/1.07 useeqfact = 0
% 0.65/1.07 usefactor = 1
% 0.65/1.07 usesimpsplitting = 0
% 0.65/1.07 usesimpdemod = 0
% 0.65/1.07 usesimpres = 3
% 0.65/1.07
% 0.65/1.07 resimpinuse = 1000
% 0.65/1.07 resimpclauses = 20000
% 0.65/1.07 substype = standard
% 0.65/1.07 backwardsubs = 1
% 0.65/1.07 selectoldest = 5
% 0.65/1.07
% 0.65/1.07 litorderings [0] = split
% 0.65/1.07 litorderings [1] = liftord
% 0.65/1.07
% 0.65/1.07 termordering = none
% 0.65/1.07
% 0.65/1.07 litapriori = 1
% 0.65/1.07 termapriori = 0
% 0.65/1.07 litaposteriori = 0
% 0.65/1.07 termaposteriori = 0
% 0.65/1.07 demodaposteriori = 0
% 0.65/1.07 ordereqreflfact = 0
% 0.65/1.07
% 0.65/1.07 litselect = none
% 0.65/1.07
% 0.65/1.07 maxweight = 15
% 0.65/1.07 maxdepth = 30000
% 0.65/1.07 maxlength = 115
% 0.65/1.07 maxnrvars = 195
% 0.65/1.07 excuselevel = 1
% 0.65/1.07 increasemaxweight = 1
% 0.65/1.07
% 0.65/1.07 maxselected = 10000000
% 0.65/1.07 maxnrclauses = 10000000
% 0.65/1.07
% 0.65/1.07 showgenerated = 0
% 0.65/1.07 showkept = 0
% 0.65/1.07 showselected = 0
% 0.65/1.07 showdeleted = 0
% 0.65/1.07 showresimp = 1
% 0.65/1.07 showstatus = 2000
% 0.65/1.07
% 0.65/1.07 prologoutput = 1
% 0.65/1.07 nrgoals = 5000000
% 0.65/1.07 totalproof = 1
% 0.65/1.07
% 0.65/1.07 Symbols occurring in the translation:
% 0.65/1.07
% 0.65/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.65/1.07 . [1, 2] (w:1, o:30, a:1, s:1, b:0),
% 0.65/1.07 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.65/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.07 sum [42, 3] (w:1, o:58, a:1, s:1, b:0),
% 0.65/1.07 'additive_identity' [46, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.65/1.07 defined [47, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.65/1.07 'additive_inverse' [48, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.65/1.07 product [49, 3] (w:1, o:59, a:1, s:1, b:0),
% 0.65/1.07 'multiplicative_identity' [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.65/1.07 'multiplicative_inverse' [51, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.65/1.07 add [56, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.65/1.07 multiply [57, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.65/1.07 'less_or_equal' [58, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.65/1.07 a [59, 0] (w:1, o:21, a:1, s:1, b:0).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 Starting Search:
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 Bliksems!, er is een bewijs:
% 0.65/1.07 % SZS status Unsatisfiable
% 0.65/1.07 % SZS output start Refutation
% 0.65/1.07
% 0.65/1.07 clause( 22, [ ~( defined( X ) ), ~( defined( Y ) ), 'less_or_equal'( Y, X )
% 0.65/1.07 , 'less_or_equal'( X, Y ) ] )
% 0.65/1.07 .
% 0.65/1.07 clause( 26, [ defined( a ) ] )
% 0.65/1.07 .
% 0.65/1.07 clause( 27, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.65/1.07 .
% 0.65/1.07 clause( 48, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.65/1.07 .
% 0.65/1.07 clause( 55, [] )
% 0.65/1.07 .
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 % SZS output end Refutation
% 0.65/1.07 found a proof!
% 0.65/1.07
% 0.65/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.65/1.07
% 0.65/1.07 initialclauses(
% 0.65/1.07 [ clause( 57, [ sum( X, Y, Z ), ~( sum( X, T, U ) ), ~( sum( T, W, Y ) ),
% 0.65/1.07 ~( sum( U, W, Z ) ) ] )
% 0.65/1.07 , clause( 58, [ sum( X, Y, Z ), ~( sum( T, U, X ) ), ~( sum( U, Y, W ) ),
% 0.65/1.07 ~( sum( T, W, Z ) ) ] )
% 0.65/1.07 , clause( 59, [ sum( 'additive_identity', X, X ), ~( defined( X ) ) ] )
% 0.65/1.07 , clause( 60, [ sum( 'additive_inverse'( X ), X, 'additive_identity' ), ~(
% 0.65/1.07 defined( X ) ) ] )
% 0.65/1.07 , clause( 61, [ sum( X, Y, Z ), ~( sum( Y, X, Z ) ) ] )
% 0.65/1.07 , clause( 62, [ product( X, Y, Z ), ~( product( X, T, U ) ), ~( product( T
% 0.65/1.07 , W, Y ) ), ~( product( U, W, Z ) ) ] )
% 0.65/1.07 , clause( 63, [ product( X, Y, Z ), ~( product( T, U, X ) ), ~( product( U
% 0.65/1.07 , Y, W ) ), ~( product( T, W, Z ) ) ] )
% 0.65/1.07 , clause( 64, [ product( 'multiplicative_identity', X, X ), ~( defined( X )
% 0.65/1.07 ) ] )
% 0.65/1.07 , clause( 65, [ product( 'multiplicative_inverse'( X ), X,
% 0.65/1.07 'multiplicative_identity' ), sum( 'additive_identity', X,
% 0.65/1.07 'additive_identity' ), ~( defined( X ) ) ] )
% 0.65/1.07 , clause( 66, [ product( X, Y, Z ), ~( product( Y, X, Z ) ) ] )
% 0.65/1.07 , clause( 67, [ sum( X, Y, Z ), ~( sum( T, U, W ) ), ~( product( W, V0, Z )
% 0.65/1.07 ), ~( product( T, V0, X ) ), ~( product( U, V0, Y ) ) ] )
% 0.65/1.07 , clause( 68, [ product( X, Y, Z ), ~( sum( T, U, X ) ), ~( product( T, Y,
% 0.65/1.07 W ) ), ~( product( U, Y, V0 ) ), ~( sum( W, V0, Z ) ) ] )
% 0.65/1.07 , clause( 69, [ defined( add( X, Y ) ), ~( defined( X ) ), ~( defined( Y )
% 0.65/1.07 ) ] )
% 0.65/1.07 , clause( 70, [ defined( 'additive_identity' ) ] )
% 0.65/1.07 , clause( 71, [ defined( 'additive_inverse'( X ) ), ~( defined( X ) ) ] )
% 0.65/1.07 , clause( 72, [ defined( multiply( X, Y ) ), ~( defined( X ) ), ~( defined(
% 0.65/1.07 Y ) ) ] )
% 0.65/1.07 , clause( 73, [ defined( 'multiplicative_identity' ) ] )
% 0.65/1.07 , clause( 74, [ defined( 'multiplicative_inverse'( X ) ), ~( defined( X ) )
% 0.65/1.07 , sum( 'additive_identity', X, 'additive_identity' ) ] )
% 0.65/1.07 , clause( 75, [ sum( X, Y, add( X, Y ) ), ~( defined( X ) ), ~( defined( Y
% 0.65/1.07 ) ) ] )
% 0.65/1.07 , clause( 76, [ product( X, Y, multiply( X, Y ) ), ~( defined( X ) ), ~(
% 0.65/1.07 defined( Y ) ) ] )
% 0.65/1.07 , clause( 77, [ sum( 'additive_identity', X, Y ), ~( 'less_or_equal'( X, Y
% 0.65/1.07 ) ), ~( 'less_or_equal'( Y, X ) ) ] )
% 0.65/1.07 , clause( 78, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( X, Z ) ), ~(
% 0.65/1.07 'less_or_equal'( Z, Y ) ) ] )
% 0.65/1.07 , clause( 79, [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~(
% 0.65/1.07 defined( X ) ), ~( defined( Y ) ) ] )
% 0.65/1.07 , clause( 80, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, T ) ), ~(
% 0.65/1.07 sum( Z, U, X ) ), ~( sum( T, U, Y ) ) ] )
% 0.65/1.07 , clause( 81, [ 'less_or_equal'( 'additive_identity', X ), ~(
% 0.65/1.07 'less_or_equal'( 'additive_identity', Y ) ), ~( 'less_or_equal'(
% 0.65/1.07 'additive_identity', Z ) ), ~( product( Y, Z, X ) ) ] )
% 0.65/1.07 , clause( 82, [ ~( sum( 'additive_identity', 'additive_identity',
% 0.65/1.07 'multiplicative_identity' ) ) ] )
% 0.65/1.07 , clause( 83, [ defined( a ) ] )
% 0.65/1.07 , clause( 84, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.65/1.07 ] ).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 subsumption(
% 0.65/1.07 clause( 22, [ ~( defined( X ) ), ~( defined( Y ) ), 'less_or_equal'( Y, X )
% 0.65/1.07 , 'less_or_equal'( X, Y ) ] )
% 0.65/1.07 , clause( 79, [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~(
% 0.65/1.07 defined( X ) ), ~( defined( Y ) ) ] )
% 0.65/1.07 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 2
% 0.65/1.07 ), ==>( 1, 3 ), ==>( 2, 1 ), ==>( 3, 0 )] ) ).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 subsumption(
% 0.65/1.07 clause( 26, [ defined( a ) ] )
% 0.65/1.07 , clause( 83, [ defined( a ) ] )
% 0.65/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 subsumption(
% 0.65/1.07 clause( 27, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.65/1.07 , clause( 84, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.65/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 factor(
% 0.65/1.07 clause( 183, [ ~( defined( X ) ), ~( defined( X ) ), 'less_or_equal'( X, X
% 0.65/1.07 ) ] )
% 0.65/1.07 , clause( 22, [ ~( defined( X ) ), ~( defined( Y ) ), 'less_or_equal'( Y, X
% 0.65/1.07 ), 'less_or_equal'( X, Y ) ] )
% 0.65/1.07 , 2, 3, substitution( 0, [ :=( X, X ), :=( Y, X )] )).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 factor(
% 0.65/1.07 clause( 184, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.65/1.07 , clause( 183, [ ~( defined( X ) ), ~( defined( X ) ), 'less_or_equal'( X,
% 0.65/1.07 X ) ] )
% 0.65/1.07 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 subsumption(
% 0.65/1.07 clause( 48, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.65/1.07 , clause( 184, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.65/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.65/1.07 1 )] ) ).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 resolution(
% 0.65/1.07 clause( 185, [ ~( defined( a ) ) ] )
% 0.65/1.07 , clause( 27, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.65/1.07 , 0, clause( 48, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.65/1.07 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 resolution(
% 0.65/1.07 clause( 186, [] )
% 0.65/1.07 , clause( 185, [ ~( defined( a ) ) ] )
% 0.65/1.07 , 0, clause( 26, [ defined( a ) ] )
% 0.65/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 subsumption(
% 0.65/1.07 clause( 55, [] )
% 0.65/1.07 , clause( 186, [] )
% 0.65/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 end.
% 0.65/1.07
% 0.65/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.65/1.07
% 0.65/1.07 Memory use:
% 0.65/1.07
% 0.65/1.07 space for terms: 1585
% 0.65/1.07 space for clauses: 2604
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 clauses generated: 107
% 0.65/1.07 clauses kept: 56
% 0.65/1.07 clauses selected: 7
% 0.65/1.07 clauses deleted: 0
% 0.65/1.07 clauses inuse deleted: 0
% 0.65/1.07
% 0.65/1.07 subsentry: 347
% 0.65/1.07 literals s-matched: 260
% 0.65/1.07 literals matched: 220
% 0.65/1.07 full subsumption: 137
% 0.65/1.07
% 0.65/1.07 checksum: 503760290
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 Bliksem ended
%------------------------------------------------------------------------------