TSTP Solution File: FLD058-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : FLD058-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:19 EDT 2022
% Result : Unsatisfiable 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD058-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n023.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 6 11:37:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10 [
% 0.69/1.10 [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ), ~( defined(
% 0.69/1.10 X ) ), ~( defined( Y ) ), ~( defined( Z ) ) ],
% 0.69/1.10 [ equalish( add( 'additive_identity', X ), X ), ~( defined( X ) ) ],
% 0.69/1.10 [ equalish( add( X, 'additive_inverse'( X ) ), 'additive_identity' ),
% 0.69/1.10 ~( defined( X ) ) ],
% 0.69/1.10 [ equalish( add( X, Y ), add( Y, X ) ), ~( defined( X ) ), ~( defined( Y
% 0.69/1.10 ) ) ],
% 0.69/1.10 [ equalish( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.69/1.10 , Z ) ), ~( defined( X ) ), ~( defined( Y ) ), ~( defined( Z ) ) ],
% 0.69/1.10 [ equalish( multiply( 'multiplicative_identity', X ), X ), ~( defined( X
% 0.69/1.10 ) ) ],
% 0.69/1.10 [ equalish( multiply( X, 'multiplicative_inverse'( X ) ),
% 0.69/1.10 'multiplicative_identity' ), ~( defined( X ) ), equalish( X,
% 0.69/1.10 'additive_identity' ) ],
% 0.69/1.10 [ equalish( multiply( X, Y ), multiply( Y, X ) ), ~( defined( X ) ), ~(
% 0.69/1.10 defined( Y ) ) ],
% 0.69/1.10 [ equalish( add( multiply( X, Y ), multiply( Z, Y ) ), multiply( add( X
% 0.69/1.10 , Z ), Y ) ), ~( defined( X ) ), ~( defined( Z ) ), ~( defined( Y ) ) ]
% 0.69/1.10 ,
% 0.69/1.10 [ defined( add( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ],
% 0.69/1.10 [ defined( 'additive_identity' ) ],
% 0.69/1.10 [ defined( 'additive_inverse'( X ) ), ~( defined( X ) ) ],
% 0.69/1.10 [ defined( multiply( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ]
% 0.69/1.10 ,
% 0.69/1.10 [ defined( 'multiplicative_identity' ) ],
% 0.69/1.10 [ defined( 'multiplicative_inverse'( X ) ), ~( defined( X ) ), equalish(
% 0.69/1.10 X, 'additive_identity' ) ],
% 0.69/1.10 [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( Y
% 0.69/1.10 , X ) ) ],
% 0.69/1.10 [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( X, Z ) ), ~(
% 0.69/1.10 'less_or_equal'( Z, Y ) ) ],
% 0.69/1.10 [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~( defined( X ) ),
% 0.69/1.10 ~( defined( Y ) ) ],
% 0.69/1.10 [ 'less_or_equal'( add( X, Y ), add( Z, Y ) ), ~( defined( Y ) ), ~(
% 0.69/1.10 'less_or_equal'( X, Z ) ) ],
% 0.69/1.10 [ 'less_or_equal'( 'additive_identity', multiply( X, Y ) ), ~(
% 0.69/1.10 'less_or_equal'( 'additive_identity', X ) ), ~( 'less_or_equal'(
% 0.69/1.10 'additive_identity', Y ) ) ],
% 0.69/1.10 [ equalish( X, X ), ~( defined( X ) ) ],
% 0.69/1.10 [ equalish( X, Y ), ~( equalish( Y, X ) ) ],
% 0.69/1.10 [ equalish( X, Y ), ~( equalish( X, Z ) ), ~( equalish( Z, Y ) ) ],
% 0.69/1.10 [ equalish( add( X, Y ), add( Z, Y ) ), ~( defined( Y ) ), ~( equalish(
% 0.69/1.10 X, Z ) ) ],
% 0.69/1.10 [ equalish( multiply( X, Y ), multiply( Z, Y ) ), ~( defined( Y ) ), ~(
% 0.69/1.10 equalish( X, Z ) ) ],
% 0.69/1.10 [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, Y ) ), ~( equalish( Z
% 0.69/1.10 , X ) ) ],
% 0.69/1.10 [ ~( equalish( 'additive_identity', 'multiplicative_identity' ) ) ],
% 0.69/1.10 [ defined( a ) ],
% 0.69/1.10 [ defined( b ) ],
% 0.69/1.10 [ 'less_or_equal'( 'additive_identity', a ) ],
% 0.69/1.10 [ 'less_or_equal'( a, b ) ],
% 0.69/1.10 [ ~( equalish( a, 'additive_identity' ) ) ],
% 0.69/1.10 [ equalish( b, 'additive_identity' ) ]
% 0.69/1.10 ] .
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.000000, percentage horn = 0.909091
% 0.69/1.10 This is a near-Horn, non-equality problem
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 0
% 0.69/1.10 useeqrefl = 0
% 0.69/1.10 useeqfact = 0
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 0
% 0.69/1.10 usesimpres = 4
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = standard
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = liftord
% 0.69/1.10
% 0.69/1.10 termordering = none
% 0.69/1.10
% 0.69/1.10 litapriori = 1
% 0.69/1.10 termapriori = 0
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negative
% 0.69/1.10
% 0.69/1.10 maxweight = 30000
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 0
% 0.69/1.10 increasemaxweight = 0
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 1
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 add [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.69/1.10 equalish [43, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.69/1.10 defined [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.10 'additive_identity' [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.10 'additive_inverse' [46, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.10 multiply [47, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.69/1.10 'multiplicative_identity' [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.10 'multiplicative_inverse' [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.10 'less_or_equal' [50, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.69/1.10 a [51, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.10 b [52, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Unsatisfiable
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 clause( 10, [ defined( 'additive_identity' ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 15, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.10 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 17, [ ~( defined( X ) ), 'less_or_equal'( X, Y ), 'less_or_equal'(
% 0.69/1.10 Y, X ), ~( defined( Y ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 21, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 25, [ ~( 'less_or_equal'( Z, Y ) ), 'less_or_equal'( X, Y ), ~(
% 0.69/1.10 equalish( Z, X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 29, [ 'less_or_equal'( 'additive_identity', a ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 30, [ 'less_or_equal'( a, b ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 31, [ ~( equalish( a, 'additive_identity' ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 32, [ equalish( b, 'additive_identity' ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 50, [ 'less_or_equal'( X, X ), ~( defined( X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 76, [ 'less_or_equal'( 'additive_identity', 'additive_identity' ) ]
% 0.69/1.10 )
% 0.69/1.10 .
% 0.69/1.10 clause( 372, [ ~( 'less_or_equal'( a, 'additive_identity' ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 546, [ equalish( 'additive_identity', b ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 726, [ 'less_or_equal'( b, X ), ~( 'less_or_equal'(
% 0.69/1.10 'additive_identity', X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 761, [ 'less_or_equal'( b, 'additive_identity' ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 762, [ 'less_or_equal'( b, a ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 765, [ equalish( a, b ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 770, [ equalish( b, a ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 771, [ 'less_or_equal'( a, X ), ~( 'less_or_equal'( b, X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 775, [] )
% 0.69/1.10 .
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.10
% 0.69/1.10 initialclauses(
% 0.69/1.10 [ clause( 777, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ),
% 0.69/1.10 ~( defined( X ) ), ~( defined( Y ) ), ~( defined( Z ) ) ] )
% 0.69/1.10 , clause( 778, [ equalish( add( 'additive_identity', X ), X ), ~( defined(
% 0.69/1.10 X ) ) ] )
% 0.69/1.10 , clause( 779, [ equalish( add( X, 'additive_inverse'( X ) ),
% 0.69/1.10 'additive_identity' ), ~( defined( X ) ) ] )
% 0.69/1.10 , clause( 780, [ equalish( add( X, Y ), add( Y, X ) ), ~( defined( X ) ),
% 0.69/1.10 ~( defined( Y ) ) ] )
% 0.69/1.10 , clause( 781, [ equalish( multiply( X, multiply( Y, Z ) ), multiply(
% 0.69/1.10 multiply( X, Y ), Z ) ), ~( defined( X ) ), ~( defined( Y ) ), ~( defined(
% 0.69/1.10 Z ) ) ] )
% 0.69/1.10 , clause( 782, [ equalish( multiply( 'multiplicative_identity', X ), X ),
% 0.69/1.10 ~( defined( X ) ) ] )
% 0.69/1.10 , clause( 783, [ equalish( multiply( X, 'multiplicative_inverse'( X ) ),
% 0.69/1.10 'multiplicative_identity' ), ~( defined( X ) ), equalish( X,
% 0.69/1.10 'additive_identity' ) ] )
% 0.69/1.10 , clause( 784, [ equalish( multiply( X, Y ), multiply( Y, X ) ), ~( defined(
% 0.69/1.10 X ) ), ~( defined( Y ) ) ] )
% 0.69/1.10 , clause( 785, [ equalish( add( multiply( X, Y ), multiply( Z, Y ) ),
% 0.69/1.10 multiply( add( X, Z ), Y ) ), ~( defined( X ) ), ~( defined( Z ) ), ~(
% 0.69/1.10 defined( Y ) ) ] )
% 0.69/1.10 , clause( 786, [ defined( add( X, Y ) ), ~( defined( X ) ), ~( defined( Y )
% 0.69/1.10 ) ] )
% 0.69/1.10 , clause( 787, [ defined( 'additive_identity' ) ] )
% 0.69/1.10 , clause( 788, [ defined( 'additive_inverse'( X ) ), ~( defined( X ) ) ] )
% 0.69/1.10 , clause( 789, [ defined( multiply( X, Y ) ), ~( defined( X ) ), ~( defined(
% 0.69/1.10 Y ) ) ] )
% 0.69/1.10 , clause( 790, [ defined( 'multiplicative_identity' ) ] )
% 0.69/1.10 , clause( 791, [ defined( 'multiplicative_inverse'( X ) ), ~( defined( X )
% 0.69/1.10 ), equalish( X, 'additive_identity' ) ] )
% 0.69/1.10 , clause( 792, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.10 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.10 , clause( 793, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( X, Z ) ), ~(
% 0.69/1.10 'less_or_equal'( Z, Y ) ) ] )
% 0.69/1.10 , clause( 794, [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~(
% 0.69/1.10 defined( X ) ), ~( defined( Y ) ) ] )
% 0.69/1.10 , clause( 795, [ 'less_or_equal'( add( X, Y ), add( Z, Y ) ), ~( defined( Y
% 0.69/1.10 ) ), ~( 'less_or_equal'( X, Z ) ) ] )
% 0.69/1.10 , clause( 796, [ 'less_or_equal'( 'additive_identity', multiply( X, Y ) ),
% 0.69/1.10 ~( 'less_or_equal'( 'additive_identity', X ) ), ~( 'less_or_equal'(
% 0.69/1.10 'additive_identity', Y ) ) ] )
% 0.69/1.10 , clause( 797, [ equalish( X, X ), ~( defined( X ) ) ] )
% 0.69/1.10 , clause( 798, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.10 , clause( 799, [ equalish( X, Y ), ~( equalish( X, Z ) ), ~( equalish( Z, Y
% 0.69/1.10 ) ) ] )
% 0.69/1.10 , clause( 800, [ equalish( add( X, Y ), add( Z, Y ) ), ~( defined( Y ) ),
% 0.69/1.10 ~( equalish( X, Z ) ) ] )
% 0.69/1.10 , clause( 801, [ equalish( multiply( X, Y ), multiply( Z, Y ) ), ~( defined(
% 0.69/1.10 Y ) ), ~( equalish( X, Z ) ) ] )
% 0.69/1.10 , clause( 802, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, Y ) ), ~(
% 0.69/1.10 equalish( Z, X ) ) ] )
% 0.69/1.10 , clause( 803, [ ~( equalish( 'additive_identity',
% 0.69/1.10 'multiplicative_identity' ) ) ] )
% 0.69/1.10 , clause( 804, [ defined( a ) ] )
% 0.69/1.10 , clause( 805, [ defined( b ) ] )
% 0.69/1.10 , clause( 806, [ 'less_or_equal'( 'additive_identity', a ) ] )
% 0.69/1.10 , clause( 807, [ 'less_or_equal'( a, b ) ] )
% 0.69/1.10 , clause( 808, [ ~( equalish( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , clause( 809, [ equalish( b, 'additive_identity' ) ] )
% 0.69/1.10 ] ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 10, [ defined( 'additive_identity' ) ] )
% 0.69/1.10 , clause( 787, [ defined( 'additive_identity' ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 15, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.10 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.10 , clause( 792, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.10 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.10 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 17, [ ~( defined( X ) ), 'less_or_equal'( X, Y ), 'less_or_equal'(
% 0.69/1.10 Y, X ), ~( defined( Y ) ) ] )
% 0.69/1.10 , clause( 794, [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~(
% 0.69/1.10 defined( X ) ), ~( defined( Y ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.10 ), ==>( 1, 2 ), ==>( 2, 0 ), ==>( 3, 3 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 21, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.10 , clause( 798, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.10 ), ==>( 1, 1 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 25, [ ~( 'less_or_equal'( Z, Y ) ), 'less_or_equal'( X, Y ), ~(
% 0.69/1.10 equalish( Z, X ) ) ] )
% 0.69/1.10 , clause( 802, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, Y ) ), ~(
% 0.69/1.10 equalish( Z, X ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 29, [ 'less_or_equal'( 'additive_identity', a ) ] )
% 0.69/1.10 , clause( 806, [ 'less_or_equal'( 'additive_identity', a ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 30, [ 'less_or_equal'( a, b ) ] )
% 0.69/1.10 , clause( 807, [ 'less_or_equal'( a, b ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 31, [ ~( equalish( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , clause( 808, [ ~( equalish( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 32, [ equalish( b, 'additive_identity' ) ] )
% 0.69/1.10 , clause( 809, [ equalish( b, 'additive_identity' ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 factor(
% 0.69/1.10 clause( 993, [ ~( defined( X ) ), 'less_or_equal'( X, X ), 'less_or_equal'(
% 0.69/1.10 X, X ) ] )
% 0.69/1.10 , clause( 17, [ ~( defined( X ) ), 'less_or_equal'( X, Y ), 'less_or_equal'(
% 0.69/1.10 Y, X ), ~( defined( Y ) ) ] )
% 0.69/1.10 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, X )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 factor(
% 0.69/1.10 clause( 994, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.10 , clause( 993, [ ~( defined( X ) ), 'less_or_equal'( X, X ),
% 0.69/1.10 'less_or_equal'( X, X ) ] )
% 0.69/1.10 , 1, 2, substitution( 0, [ :=( X, X )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 50, [ 'less_or_equal'( X, X ), ~( defined( X ) ) ] )
% 0.69/1.10 , clause( 994, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.10 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 995, [ 'less_or_equal'( 'additive_identity', 'additive_identity' )
% 0.69/1.10 ] )
% 0.69/1.10 , clause( 50, [ 'less_or_equal'( X, X ), ~( defined( X ) ) ] )
% 0.69/1.10 , 1, clause( 10, [ defined( 'additive_identity' ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, 'additive_identity' )] ), substitution( 1, [] )
% 0.69/1.10 ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 76, [ 'less_or_equal'( 'additive_identity', 'additive_identity' ) ]
% 0.69/1.10 )
% 0.69/1.10 , clause( 995, [ 'less_or_equal'( 'additive_identity', 'additive_identity'
% 0.69/1.10 ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 997, [ equalish( a, 'additive_identity' ), ~( 'less_or_equal'( a,
% 0.69/1.10 'additive_identity' ) ) ] )
% 0.69/1.10 , clause( 15, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.10 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.10 , 2, clause( 29, [ 'less_or_equal'( 'additive_identity', a ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, 'additive_identity' )] ),
% 0.69/1.10 substitution( 1, [] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 998, [ ~( 'less_or_equal'( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , clause( 31, [ ~( equalish( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , 0, clause( 997, [ equalish( a, 'additive_identity' ), ~( 'less_or_equal'(
% 0.69/1.10 a, 'additive_identity' ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 372, [ ~( 'less_or_equal'( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , clause( 998, [ ~( 'less_or_equal'( a, 'additive_identity' ) ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 999, [ equalish( 'additive_identity', b ) ] )
% 0.69/1.10 , clause( 21, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.10 , 1, clause( 32, [ equalish( b, 'additive_identity' ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, 'additive_identity' ), :=( Y, b )] ),
% 0.69/1.10 substitution( 1, [] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 546, [ equalish( 'additive_identity', b ) ] )
% 0.69/1.10 , clause( 999, [ equalish( 'additive_identity', b ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 1000, [ ~( 'less_or_equal'( 'additive_identity', X ) ),
% 0.69/1.10 'less_or_equal'( b, X ) ] )
% 0.69/1.11 , clause( 25, [ ~( 'less_or_equal'( Z, Y ) ), 'less_or_equal'( X, Y ), ~(
% 0.69/1.11 equalish( Z, X ) ) ] )
% 0.69/1.11 , 2, clause( 546, [ equalish( 'additive_identity', b ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, 'additive_identity'
% 0.69/1.11 )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 726, [ 'less_or_equal'( b, X ), ~( 'less_or_equal'(
% 0.69/1.11 'additive_identity', X ) ) ] )
% 0.69/1.11 , clause( 1000, [ ~( 'less_or_equal'( 'additive_identity', X ) ),
% 0.69/1.11 'less_or_equal'( b, X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1001, [ 'less_or_equal'( b, 'additive_identity' ) ] )
% 0.69/1.11 , clause( 726, [ 'less_or_equal'( b, X ), ~( 'less_or_equal'(
% 0.69/1.11 'additive_identity', X ) ) ] )
% 0.69/1.11 , 1, clause( 76, [ 'less_or_equal'( 'additive_identity',
% 0.69/1.11 'additive_identity' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'additive_identity' )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 761, [ 'less_or_equal'( b, 'additive_identity' ) ] )
% 0.69/1.11 , clause( 1001, [ 'less_or_equal'( b, 'additive_identity' ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1002, [ 'less_or_equal'( b, a ) ] )
% 0.69/1.11 , clause( 726, [ 'less_or_equal'( b, X ), ~( 'less_or_equal'(
% 0.69/1.11 'additive_identity', X ) ) ] )
% 0.69/1.11 , 1, clause( 29, [ 'less_or_equal'( 'additive_identity', a ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 762, [ 'less_or_equal'( b, a ) ] )
% 0.69/1.11 , clause( 1002, [ 'less_or_equal'( b, a ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1004, [ equalish( a, b ), ~( 'less_or_equal'( a, b ) ) ] )
% 0.69/1.11 , clause( 15, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.11 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.11 , 2, clause( 762, [ 'less_or_equal'( b, a ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1006, [ equalish( a, b ) ] )
% 0.69/1.11 , clause( 1004, [ equalish( a, b ), ~( 'less_or_equal'( a, b ) ) ] )
% 0.69/1.11 , 1, clause( 30, [ 'less_or_equal'( a, b ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 765, [ equalish( a, b ) ] )
% 0.69/1.11 , clause( 1006, [ equalish( a, b ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1007, [ equalish( b, a ) ] )
% 0.69/1.11 , clause( 21, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.11 , 1, clause( 765, [ equalish( a, b ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, b ), :=( Y, a )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 770, [ equalish( b, a ) ] )
% 0.69/1.11 , clause( 1007, [ equalish( b, a ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1008, [ ~( 'less_or_equal'( b, X ) ), 'less_or_equal'( a, X ) ] )
% 0.69/1.11 , clause( 25, [ ~( 'less_or_equal'( Z, Y ) ), 'less_or_equal'( X, Y ), ~(
% 0.69/1.11 equalish( Z, X ) ) ] )
% 0.69/1.11 , 2, clause( 770, [ equalish( b, a ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, a ), :=( Y, X ), :=( Z, b )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 771, [ 'less_or_equal'( a, X ), ~( 'less_or_equal'( b, X ) ) ] )
% 0.69/1.11 , clause( 1008, [ ~( 'less_or_equal'( b, X ) ), 'less_or_equal'( a, X ) ]
% 0.69/1.11 )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1009, [ 'less_or_equal'( a, 'additive_identity' ) ] )
% 0.69/1.11 , clause( 771, [ 'less_or_equal'( a, X ), ~( 'less_or_equal'( b, X ) ) ] )
% 0.69/1.11 , 1, clause( 761, [ 'less_or_equal'( b, 'additive_identity' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'additive_identity' )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1010, [] )
% 0.69/1.11 , clause( 372, [ ~( 'less_or_equal'( a, 'additive_identity' ) ) ] )
% 0.69/1.11 , 0, clause( 1009, [ 'less_or_equal'( a, 'additive_identity' ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 775, [] )
% 0.69/1.11 , clause( 1010, [] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 end.
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 10646
% 0.69/1.11 space for clauses: 60909
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 916
% 0.69/1.11 clauses kept: 776
% 0.69/1.11 clauses selected: 114
% 0.69/1.11 clauses deleted: 0
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 1075
% 0.69/1.11 literals s-matched: 327
% 0.69/1.11 literals matched: 246
% 0.69/1.11 full subsumption: 8
% 0.69/1.11
% 0.69/1.11 checksum: -1689036168
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------