TSTP Solution File: FLD056-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : FLD056-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.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.69s 1.05s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : FLD056-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n022.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 15:30:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.05 *** allocated 10000 integers for termspace/termends
% 0.69/1.05 *** allocated 10000 integers for clauses
% 0.69/1.05 *** allocated 10000 integers for justifications
% 0.69/1.05 Bliksem 1.12
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 Automatic Strategy Selection
% 0.69/1.05
% 0.69/1.05 Clauses:
% 0.69/1.05 [
% 0.69/1.05 [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ), ~( defined(
% 0.69/1.05 X ) ), ~( defined( Y ) ), ~( defined( Z ) ) ],
% 0.69/1.05 [ equalish( add( 'additive_identity', X ), X ), ~( defined( X ) ) ],
% 0.69/1.05 [ equalish( add( X, 'additive_inverse'( X ) ), 'additive_identity' ),
% 0.69/1.05 ~( defined( X ) ) ],
% 0.69/1.05 [ equalish( add( X, Y ), add( Y, X ) ), ~( defined( X ) ), ~( defined( Y
% 0.69/1.05 ) ) ],
% 0.69/1.05 [ equalish( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.69/1.05 , Z ) ), ~( defined( X ) ), ~( defined( Y ) ), ~( defined( Z ) ) ],
% 0.69/1.05 [ equalish( multiply( 'multiplicative_identity', X ), X ), ~( defined( X
% 0.69/1.05 ) ) ],
% 0.69/1.05 [ equalish( multiply( X, 'multiplicative_inverse'( X ) ),
% 0.69/1.05 'multiplicative_identity' ), ~( defined( X ) ), equalish( X,
% 0.69/1.05 'additive_identity' ) ],
% 0.69/1.05 [ equalish( multiply( X, Y ), multiply( Y, X ) ), ~( defined( X ) ), ~(
% 0.69/1.05 defined( Y ) ) ],
% 0.69/1.05 [ equalish( add( multiply( X, Y ), multiply( Z, Y ) ), multiply( add( X
% 0.69/1.05 , Z ), Y ) ), ~( defined( X ) ), ~( defined( Z ) ), ~( defined( Y ) ) ]
% 0.69/1.05 ,
% 0.69/1.05 [ defined( add( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ],
% 0.69/1.05 [ defined( 'additive_identity' ) ],
% 0.69/1.05 [ defined( 'additive_inverse'( X ) ), ~( defined( X ) ) ],
% 0.69/1.05 [ defined( multiply( X, Y ) ), ~( defined( X ) ), ~( defined( Y ) ) ]
% 0.69/1.05 ,
% 0.69/1.05 [ defined( 'multiplicative_identity' ) ],
% 0.69/1.05 [ defined( 'multiplicative_inverse'( X ) ), ~( defined( X ) ), equalish(
% 0.69/1.05 X, 'additive_identity' ) ],
% 0.69/1.05 [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( Y
% 0.69/1.05 , X ) ) ],
% 0.69/1.05 [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( X, Z ) ), ~(
% 0.69/1.05 'less_or_equal'( Z, Y ) ) ],
% 0.69/1.05 [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~( defined( X ) ),
% 0.69/1.05 ~( defined( Y ) ) ],
% 0.69/1.05 [ 'less_or_equal'( add( X, Y ), add( Z, Y ) ), ~( defined( Y ) ), ~(
% 0.69/1.05 'less_or_equal'( X, Z ) ) ],
% 0.69/1.05 [ 'less_or_equal'( 'additive_identity', multiply( X, Y ) ), ~(
% 0.69/1.05 'less_or_equal'( 'additive_identity', X ) ), ~( 'less_or_equal'(
% 0.69/1.05 'additive_identity', Y ) ) ],
% 0.69/1.05 [ equalish( X, X ), ~( defined( X ) ) ],
% 0.69/1.05 [ equalish( X, Y ), ~( equalish( Y, X ) ) ],
% 0.69/1.05 [ equalish( X, Y ), ~( equalish( X, Z ) ), ~( equalish( Z, Y ) ) ],
% 0.69/1.05 [ equalish( add( X, Y ), add( Z, Y ) ), ~( defined( Y ) ), ~( equalish(
% 0.69/1.05 X, Z ) ) ],
% 0.69/1.05 [ equalish( multiply( X, Y ), multiply( Z, Y ) ), ~( defined( Y ) ), ~(
% 0.69/1.05 equalish( X, Z ) ) ],
% 0.69/1.05 [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, Y ) ), ~( equalish( Z
% 0.69/1.05 , X ) ) ],
% 0.69/1.05 [ ~( equalish( 'additive_identity', 'multiplicative_identity' ) ) ],
% 0.69/1.05 [ defined( a ) ],
% 0.69/1.05 [ ~( 'less_or_equal'( a, a ) ) ]
% 0.69/1.05 ] .
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 percentage equality = 0.000000, percentage horn = 0.896552
% 0.69/1.05 This a non-horn, non-equality problem
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 Options Used:
% 0.69/1.05
% 0.69/1.05 useres = 1
% 0.69/1.05 useparamod = 0
% 0.69/1.05 useeqrefl = 0
% 0.69/1.05 useeqfact = 0
% 0.69/1.05 usefactor = 1
% 0.69/1.05 usesimpsplitting = 0
% 0.69/1.05 usesimpdemod = 0
% 0.69/1.05 usesimpres = 3
% 0.69/1.05
% 0.69/1.05 resimpinuse = 1000
% 0.69/1.05 resimpclauses = 20000
% 0.69/1.05 substype = standard
% 0.69/1.05 backwardsubs = 1
% 0.69/1.05 selectoldest = 5
% 0.69/1.05
% 0.69/1.05 litorderings [0] = split
% 0.69/1.05 litorderings [1] = liftord
% 0.69/1.05
% 0.69/1.05 termordering = none
% 0.69/1.05
% 0.69/1.05 litapriori = 1
% 0.69/1.05 termapriori = 0
% 0.69/1.05 litaposteriori = 0
% 0.69/1.05 termaposteriori = 0
% 0.69/1.05 demodaposteriori = 0
% 0.69/1.05 ordereqreflfact = 0
% 0.69/1.05
% 0.69/1.05 litselect = none
% 0.69/1.05
% 0.69/1.05 maxweight = 15
% 0.69/1.05 maxdepth = 30000
% 0.69/1.05 maxlength = 115
% 0.69/1.05 maxnrvars = 195
% 0.69/1.05 excuselevel = 1
% 0.69/1.05 increasemaxweight = 1
% 0.69/1.05
% 0.69/1.05 maxselected = 10000000
% 0.69/1.05 maxnrclauses = 10000000
% 0.69/1.05
% 0.69/1.05 showgenerated = 0
% 0.69/1.05 showkept = 0
% 0.69/1.05 showselected = 0
% 0.69/1.05 showdeleted = 0
% 0.69/1.05 showresimp = 1
% 0.69/1.05 showstatus = 2000
% 0.69/1.05
% 0.69/1.05 prologoutput = 1
% 0.69/1.05 nrgoals = 5000000
% 0.69/1.05 totalproof = 1
% 0.69/1.05
% 0.69/1.05 Symbols occurring in the translation:
% 0.69/1.05
% 0.69/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.05 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.05 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.69/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.05 add [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.69/1.05 equalish [43, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.69/1.05 defined [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.05 'additive_identity' [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.05 'additive_inverse' [46, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.05 multiply [47, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.69/1.05 'multiplicative_identity' [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.05 'multiplicative_inverse' [49, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.05 'less_or_equal' [50, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.69/1.05 a [51, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 Starting Search:
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 Bliksems!, er is een bewijs:
% 0.69/1.05 % SZS status Unsatisfiable
% 0.69/1.05 % SZS output start Refutation
% 0.69/1.05
% 0.69/1.05 clause( 17, [ ~( defined( X ) ), ~( defined( Y ) ), 'less_or_equal'( Y, X )
% 0.69/1.05 , 'less_or_equal'( X, Y ) ] )
% 0.69/1.05 .
% 0.69/1.05 clause( 27, [ defined( a ) ] )
% 0.69/1.05 .
% 0.69/1.05 clause( 28, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.69/1.05 .
% 0.69/1.05 clause( 46, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.05 .
% 0.69/1.05 clause( 48, [] )
% 0.69/1.05 .
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 % SZS output end Refutation
% 0.69/1.05 found a proof!
% 0.69/1.05
% 0.69/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.05
% 0.69/1.05 initialclauses(
% 0.69/1.05 [ clause( 50, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ),
% 0.69/1.05 ~( defined( X ) ), ~( defined( Y ) ), ~( defined( Z ) ) ] )
% 0.69/1.05 , clause( 51, [ equalish( add( 'additive_identity', X ), X ), ~( defined( X
% 0.69/1.05 ) ) ] )
% 0.69/1.05 , clause( 52, [ equalish( add( X, 'additive_inverse'( X ) ),
% 0.69/1.05 'additive_identity' ), ~( defined( X ) ) ] )
% 0.69/1.05 , clause( 53, [ equalish( add( X, Y ), add( Y, X ) ), ~( defined( X ) ),
% 0.69/1.05 ~( defined( Y ) ) ] )
% 0.69/1.05 , clause( 54, [ equalish( multiply( X, multiply( Y, Z ) ), multiply(
% 0.69/1.05 multiply( X, Y ), Z ) ), ~( defined( X ) ), ~( defined( Y ) ), ~( defined(
% 0.69/1.05 Z ) ) ] )
% 0.69/1.05 , clause( 55, [ equalish( multiply( 'multiplicative_identity', X ), X ),
% 0.69/1.05 ~( defined( X ) ) ] )
% 0.69/1.05 , clause( 56, [ equalish( multiply( X, 'multiplicative_inverse'( X ) ),
% 0.69/1.05 'multiplicative_identity' ), ~( defined( X ) ), equalish( X,
% 0.69/1.05 'additive_identity' ) ] )
% 0.69/1.05 , clause( 57, [ equalish( multiply( X, Y ), multiply( Y, X ) ), ~( defined(
% 0.69/1.05 X ) ), ~( defined( Y ) ) ] )
% 0.69/1.05 , clause( 58, [ equalish( add( multiply( X, Y ), multiply( Z, Y ) ),
% 0.69/1.05 multiply( add( X, Z ), Y ) ), ~( defined( X ) ), ~( defined( Z ) ), ~(
% 0.69/1.05 defined( Y ) ) ] )
% 0.69/1.05 , clause( 59, [ defined( add( X, Y ) ), ~( defined( X ) ), ~( defined( Y )
% 0.69/1.05 ) ] )
% 0.69/1.05 , clause( 60, [ defined( 'additive_identity' ) ] )
% 0.69/1.05 , clause( 61, [ defined( 'additive_inverse'( X ) ), ~( defined( X ) ) ] )
% 0.69/1.05 , clause( 62, [ defined( multiply( X, Y ) ), ~( defined( X ) ), ~( defined(
% 0.69/1.05 Y ) ) ] )
% 0.69/1.05 , clause( 63, [ defined( 'multiplicative_identity' ) ] )
% 0.69/1.05 , clause( 64, [ defined( 'multiplicative_inverse'( X ) ), ~( defined( X ) )
% 0.69/1.05 , equalish( X, 'additive_identity' ) ] )
% 0.69/1.05 , clause( 65, [ equalish( X, Y ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.69/1.05 'less_or_equal'( Y, X ) ) ] )
% 0.69/1.05 , clause( 66, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( X, Z ) ), ~(
% 0.69/1.05 'less_or_equal'( Z, Y ) ) ] )
% 0.69/1.05 , clause( 67, [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~(
% 0.69/1.05 defined( X ) ), ~( defined( Y ) ) ] )
% 0.69/1.05 , clause( 68, [ 'less_or_equal'( add( X, Y ), add( Z, Y ) ), ~( defined( Y
% 0.69/1.05 ) ), ~( 'less_or_equal'( X, Z ) ) ] )
% 0.69/1.05 , clause( 69, [ 'less_or_equal'( 'additive_identity', multiply( X, Y ) ),
% 0.69/1.05 ~( 'less_or_equal'( 'additive_identity', X ) ), ~( 'less_or_equal'(
% 0.69/1.05 'additive_identity', Y ) ) ] )
% 0.69/1.05 , clause( 70, [ equalish( X, X ), ~( defined( X ) ) ] )
% 0.69/1.05 , clause( 71, [ equalish( X, Y ), ~( equalish( Y, X ) ) ] )
% 0.69/1.05 , clause( 72, [ equalish( X, Y ), ~( equalish( X, Z ) ), ~( equalish( Z, Y
% 0.69/1.05 ) ) ] )
% 0.69/1.05 , clause( 73, [ equalish( add( X, Y ), add( Z, Y ) ), ~( defined( Y ) ),
% 0.69/1.05 ~( equalish( X, Z ) ) ] )
% 0.69/1.05 , clause( 74, [ equalish( multiply( X, Y ), multiply( Z, Y ) ), ~( defined(
% 0.69/1.05 Y ) ), ~( equalish( X, Z ) ) ] )
% 0.69/1.05 , clause( 75, [ 'less_or_equal'( X, Y ), ~( 'less_or_equal'( Z, Y ) ), ~(
% 0.69/1.05 equalish( Z, X ) ) ] )
% 0.69/1.05 , clause( 76, [ ~( equalish( 'additive_identity', 'multiplicative_identity'
% 0.69/1.05 ) ) ] )
% 0.69/1.05 , clause( 77, [ defined( a ) ] )
% 0.69/1.05 , clause( 78, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.69/1.05 ] ).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 subsumption(
% 0.69/1.05 clause( 17, [ ~( defined( X ) ), ~( defined( Y ) ), 'less_or_equal'( Y, X )
% 0.69/1.05 , 'less_or_equal'( X, Y ) ] )
% 0.69/1.05 , clause( 67, [ 'less_or_equal'( X, Y ), 'less_or_equal'( Y, X ), ~(
% 0.69/1.05 defined( X ) ), ~( defined( Y ) ) ] )
% 0.69/1.05 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 2
% 0.69/1.05 ), ==>( 1, 3 ), ==>( 2, 1 ), ==>( 3, 0 )] ) ).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 subsumption(
% 0.69/1.05 clause( 27, [ defined( a ) ] )
% 0.69/1.05 , clause( 77, [ defined( a ) ] )
% 0.69/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 subsumption(
% 0.69/1.05 clause( 28, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.69/1.05 , clause( 78, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.69/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 factor(
% 0.69/1.05 clause( 144, [ ~( defined( X ) ), ~( defined( X ) ), 'less_or_equal'( X, X
% 0.69/1.05 ) ] )
% 0.69/1.05 , clause( 17, [ ~( defined( X ) ), ~( defined( Y ) ), 'less_or_equal'( Y, X
% 0.69/1.05 ), 'less_or_equal'( X, Y ) ] )
% 0.69/1.05 , 2, 3, substitution( 0, [ :=( X, X ), :=( Y, X )] )).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 factor(
% 0.69/1.05 clause( 145, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.05 , clause( 144, [ ~( defined( X ) ), ~( defined( X ) ), 'less_or_equal'( X,
% 0.69/1.05 X ) ] )
% 0.69/1.05 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 subsumption(
% 0.69/1.05 clause( 46, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.05 , clause( 145, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.05 1 )] ) ).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 resolution(
% 0.69/1.05 clause( 146, [ ~( defined( a ) ) ] )
% 0.69/1.05 , clause( 28, [ ~( 'less_or_equal'( a, a ) ) ] )
% 0.69/1.05 , 0, clause( 46, [ ~( defined( X ) ), 'less_or_equal'( X, X ) ] )
% 0.69/1.05 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 resolution(
% 0.69/1.05 clause( 147, [] )
% 0.69/1.05 , clause( 146, [ ~( defined( a ) ) ] )
% 0.69/1.05 , 0, clause( 27, [ defined( a ) ] )
% 0.69/1.05 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 subsumption(
% 0.69/1.05 clause( 48, [] )
% 0.69/1.05 , clause( 147, [] )
% 0.69/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 end.
% 0.69/1.05
% 0.69/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.05
% 0.69/1.05 Memory use:
% 0.69/1.05
% 0.69/1.05 space for terms: 1368
% 0.69/1.05 space for clauses: 3270
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 clauses generated: 58
% 0.69/1.05 clauses kept: 49
% 0.69/1.05 clauses selected: 8
% 0.69/1.05 clauses deleted: 0
% 0.69/1.05 clauses inuse deleted: 0
% 0.69/1.05
% 0.69/1.05 subsentry: 163
% 0.69/1.05 literals s-matched: 104
% 0.69/1.05 literals matched: 45
% 0.69/1.05 full subsumption: 4
% 0.69/1.05
% 0.69/1.05 checksum: -1426394129
% 0.69/1.05
% 0.69/1.05
% 0.69/1.05 Bliksem ended
%------------------------------------------------------------------------------