TSTP Solution File: NUM001-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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 : Mon Jul 18 06:19:09 EDT 2022
% Result : Unsatisfiable 0.69s 1.07s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Wed Jul 6 03:32:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.69/1.07 *** allocated 10000 integers for termspace/termends
% 0.69/1.07 *** allocated 10000 integers for clauses
% 0.69/1.07 *** allocated 10000 integers for justifications
% 0.69/1.07 Bliksem 1.12
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 Automatic Strategy Selection
% 0.69/1.07
% 0.69/1.07 Clauses:
% 0.69/1.07 [
% 0.69/1.07 [ equalish( X, X ) ],
% 0.69/1.07 [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.69/1.07 [ equalish( add( X, Y ), add( Y, X ) ) ],
% 0.69/1.07 [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ) ],
% 0.69/1.07 [ equalish( subtract( add( X, Y ), Y ), X ) ],
% 0.69/1.07 [ equalish( X, subtract( add( X, Y ), Y ) ) ],
% 0.69/1.07 [ equalish( add( subtract( X, Y ), Z ), subtract( add( X, Z ), Y ) ) ]
% 0.69/1.07 ,
% 0.69/1.07 [ equalish( subtract( add( X, Y ), Z ), add( subtract( X, Z ), Y ) ) ]
% 0.69/1.07 ,
% 0.69/1.07 [ ~( equalish( X, Y ) ), ~( equalish( Z, add( X, T ) ) ), equalish( Z,
% 0.69/1.07 add( Y, T ) ) ],
% 0.69/1.07 [ ~( equalish( X, Y ) ), ~( equalish( Z, add( T, X ) ) ), equalish( Z,
% 0.69/1.07 add( T, Y ) ) ],
% 0.69/1.07 [ ~( equalish( X, Y ) ), ~( equalish( Z, subtract( X, T ) ) ), equalish(
% 0.69/1.07 Z, subtract( Y, T ) ) ],
% 0.69/1.07 [ ~( equalish( X, Y ) ), ~( equalish( Z, subtract( T, X ) ) ), equalish(
% 0.69/1.07 Z, subtract( T, Y ) ) ],
% 0.69/1.07 [ ~( equalish( add( add( a, b ), c ), add( a, add( b, c ) ) ) ) ]
% 0.69/1.07 ] .
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.07 This is a near-Horn, non-equality problem
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 Options Used:
% 0.69/1.07
% 0.69/1.07 useres = 1
% 0.69/1.07 useparamod = 0
% 0.69/1.07 useeqrefl = 0
% 0.69/1.07 useeqfact = 0
% 0.69/1.07 usefactor = 1
% 0.69/1.07 usesimpsplitting = 0
% 0.69/1.07 usesimpdemod = 0
% 0.69/1.07 usesimpres = 4
% 0.69/1.07
% 0.69/1.07 resimpinuse = 1000
% 0.69/1.07 resimpclauses = 20000
% 0.69/1.07 substype = standard
% 0.69/1.07 backwardsubs = 1
% 0.69/1.07 selectoldest = 5
% 0.69/1.07
% 0.69/1.07 litorderings [0] = split
% 0.69/1.07 litorderings [1] = liftord
% 0.69/1.07
% 0.69/1.07 termordering = none
% 0.69/1.07
% 0.69/1.07 litapriori = 1
% 0.69/1.07 termapriori = 0
% 0.69/1.07 litaposteriori = 0
% 0.69/1.07 termaposteriori = 0
% 0.69/1.07 demodaposteriori = 0
% 0.69/1.07 ordereqreflfact = 0
% 0.69/1.07
% 0.69/1.07 litselect = negative
% 0.69/1.07
% 0.69/1.07 maxweight = 30000
% 0.69/1.07 maxdepth = 30000
% 0.69/1.07 maxlength = 115
% 0.69/1.07 maxnrvars = 195
% 0.69/1.07 excuselevel = 0
% 0.69/1.07 increasemaxweight = 0
% 0.69/1.07
% 0.69/1.07 maxselected = 10000000
% 0.69/1.07 maxnrclauses = 10000000
% 0.69/1.07
% 0.69/1.07 showgenerated = 0
% 0.69/1.07 showkept = 0
% 0.69/1.07 showselected = 0
% 0.69/1.07 showdeleted = 0
% 0.69/1.07 showresimp = 1
% 0.69/1.07 showstatus = 2000
% 0.69/1.07
% 0.69/1.07 prologoutput = 1
% 0.69/1.07 nrgoals = 5000000
% 0.69/1.07 totalproof = 1
% 0.69/1.07
% 0.69/1.07 Symbols occurring in the translation:
% 0.69/1.07
% 0.69/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.07 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.69/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.07 equalish [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.07 add [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.69/1.07 subtract [44, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.69/1.07 a [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.07 b [47, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.07 c [48, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 Starting Search:
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 Bliksems!, er is een bewijs:
% 0.69/1.07 % SZS status Unsatisfiable
% 0.69/1.07 % SZS output start Refutation
% 0.69/1.07
% 0.69/1.07 clause( 1, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z ) )
% 0.69/1.07 ] )
% 0.69/1.07 .
% 0.69/1.07 clause( 2, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.69/1.07 .
% 0.69/1.07 clause( 3, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ) ] )
% 0.69/1.07 .
% 0.69/1.07 clause( 12, [ ~( equalish( add( add( a, b ), c ), add( a, add( b, c ) ) ) )
% 0.69/1.07 ] )
% 0.69/1.07 .
% 0.69/1.07 clause( 19, [ equalish( X, add( Z, Y ) ), ~( equalish( X, add( Y, Z ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 .
% 0.69/1.07 clause( 21, [ equalish( add( X, add( Y, Z ) ), add( Z, add( X, Y ) ) ) ] )
% 0.69/1.07 .
% 0.69/1.07 clause( 23, [ equalish( X, add( T, add( Y, Z ) ) ), ~( equalish( X, add( Y
% 0.69/1.07 , add( Z, T ) ) ) ) ] )
% 0.69/1.07 .
% 0.69/1.07 clause( 692, [ equalish( add( add( X, Y ), Z ), add( Y, add( Z, X ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 .
% 0.69/1.07 clause( 706, [ equalish( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 .
% 0.69/1.07 clause( 722, [] )
% 0.69/1.07 .
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 % SZS output end Refutation
% 0.69/1.07 found a proof!
% 0.69/1.07
% 0.69/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.07
% 0.69/1.07 initialclauses(
% 0.69/1.07 [ clause( 724, [ equalish( X, X ) ] )
% 0.69/1.07 , clause( 725, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.69/1.07 , Z ) ] )
% 0.69/1.07 , clause( 726, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.69/1.07 , clause( 727, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 728, [ equalish( subtract( add( X, Y ), Y ), X ) ] )
% 0.69/1.07 , clause( 729, [ equalish( X, subtract( add( X, Y ), Y ) ) ] )
% 0.69/1.07 , clause( 730, [ equalish( add( subtract( X, Y ), Z ), subtract( add( X, Z
% 0.69/1.07 ), Y ) ) ] )
% 0.69/1.07 , clause( 731, [ equalish( subtract( add( X, Y ), Z ), add( subtract( X, Z
% 0.69/1.07 ), Y ) ) ] )
% 0.69/1.07 , clause( 732, [ ~( equalish( X, Y ) ), ~( equalish( Z, add( X, T ) ) ),
% 0.69/1.07 equalish( Z, add( Y, T ) ) ] )
% 0.69/1.07 , clause( 733, [ ~( equalish( X, Y ) ), ~( equalish( Z, add( T, X ) ) ),
% 0.69/1.07 equalish( Z, add( T, Y ) ) ] )
% 0.69/1.07 , clause( 734, [ ~( equalish( X, Y ) ), ~( equalish( Z, subtract( X, T ) )
% 0.69/1.07 ), equalish( Z, subtract( Y, T ) ) ] )
% 0.69/1.07 , clause( 735, [ ~( equalish( X, Y ) ), ~( equalish( Z, subtract( T, X ) )
% 0.69/1.07 ), equalish( Z, subtract( T, Y ) ) ] )
% 0.69/1.07 , clause( 736, [ ~( equalish( add( add( a, b ), c ), add( a, add( b, c ) )
% 0.69/1.07 ) ) ] )
% 0.69/1.07 ] ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 1, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z ) )
% 0.69/1.07 ] )
% 0.69/1.07 , clause( 725, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.69/1.07 , Z ) ] )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 2, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.69/1.07 , clause( 726, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.07 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 3, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ) ] )
% 0.69/1.07 , clause( 727, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 12, [ ~( equalish( add( add( a, b ), c ), add( a, add( b, c ) ) ) )
% 0.69/1.07 ] )
% 0.69/1.07 , clause( 736, [ ~( equalish( add( add( a, b ), c ), add( a, add( b, c ) )
% 0.69/1.07 ) ) ] )
% 0.69/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 resolution(
% 0.69/1.07 clause( 746, [ ~( equalish( X, add( Y, Z ) ) ), equalish( X, add( Z, Y ) )
% 0.69/1.07 ] )
% 0.69/1.07 , clause( 1, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.69/1.07 ) ] )
% 0.69/1.07 , 2, clause( 2, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.69/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, add( Y, Z ) ), :=( Z, add( Z, Y
% 0.69/1.07 ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 19, [ equalish( X, add( Z, Y ) ), ~( equalish( X, add( Y, Z ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 746, [ ~( equalish( X, add( Y, Z ) ) ), equalish( X, add( Z, Y )
% 0.69/1.07 ) ] )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 resolution(
% 0.69/1.07 clause( 747, [ equalish( add( X, add( Y, Z ) ), add( Z, add( X, Y ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 19, [ equalish( X, add( Z, Y ) ), ~( equalish( X, add( Y, Z ) ) )
% 0.69/1.07 ] )
% 0.69/1.07 , 1, clause( 3, [ equalish( add( X, add( Y, Z ) ), add( add( X, Y ), Z ) )
% 0.69/1.07 ] )
% 0.69/1.07 , 0, substitution( 0, [ :=( X, add( X, add( Y, Z ) ) ), :=( Y, add( X, Y )
% 0.69/1.07 ), :=( Z, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.69/1.07 ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 21, [ equalish( add( X, add( Y, Z ) ), add( Z, add( X, Y ) ) ) ] )
% 0.69/1.07 , clause( 747, [ equalish( add( X, add( Y, Z ) ), add( Z, add( X, Y ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 resolution(
% 0.69/1.07 clause( 749, [ ~( equalish( X, add( Y, add( Z, T ) ) ) ), equalish( X, add(
% 0.69/1.07 T, add( Y, Z ) ) ) ] )
% 0.69/1.07 , clause( 1, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.69/1.07 ) ] )
% 0.69/1.07 , 2, clause( 21, [ equalish( add( X, add( Y, Z ) ), add( Z, add( X, Y ) ) )
% 0.69/1.07 ] )
% 0.69/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, add( Y, add( Z, T ) ) ), :=( Z,
% 0.69/1.07 add( T, add( Y, Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ),
% 0.69/1.07 :=( Z, T )] )).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 23, [ equalish( X, add( T, add( Y, Z ) ) ), ~( equalish( X, add( Y
% 0.69/1.07 , add( Z, T ) ) ) ) ] )
% 0.69/1.07 , clause( 749, [ ~( equalish( X, add( Y, add( Z, T ) ) ) ), equalish( X,
% 0.69/1.07 add( T, add( Y, Z ) ) ) ] )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 resolution(
% 0.69/1.07 clause( 750, [ equalish( add( add( X, Y ), Z ), add( Y, add( Z, X ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 23, [ equalish( X, add( T, add( Y, Z ) ) ), ~( equalish( X, add(
% 0.69/1.07 Y, add( Z, T ) ) ) ) ] )
% 0.69/1.07 , 1, clause( 2, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.69/1.07 , 0, substitution( 0, [ :=( X, add( add( X, Y ), Z ) ), :=( Y, Z ), :=( Z,
% 0.69/1.07 X ), :=( T, Y )] ), substitution( 1, [ :=( X, add( X, Y ) ), :=( Y, Z )] )
% 0.69/1.07 ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 692, [ equalish( add( add( X, Y ), Z ), add( Y, add( Z, X ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 750, [ equalish( add( add( X, Y ), Z ), add( Y, add( Z, X ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 resolution(
% 0.69/1.07 clause( 751, [ equalish( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 23, [ equalish( X, add( T, add( Y, Z ) ) ), ~( equalish( X, add(
% 0.69/1.07 Y, add( Z, T ) ) ) ) ] )
% 0.69/1.07 , 1, clause( 692, [ equalish( add( add( X, Y ), Z ), add( Y, add( Z, X ) )
% 0.69/1.07 ) ] )
% 0.69/1.07 , 0, substitution( 0, [ :=( X, add( add( X, Y ), Z ) ), :=( Y, Y ), :=( Z,
% 0.69/1.07 Z ), :=( T, X )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.69/1.07 ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 706, [ equalish( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , clause( 751, [ equalish( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ]
% 0.69/1.07 )
% 0.69/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 resolution(
% 0.69/1.07 clause( 752, [] )
% 0.69/1.07 , clause( 12, [ ~( equalish( add( add( a, b ), c ), add( a, add( b, c ) ) )
% 0.69/1.07 ) ] )
% 0.69/1.07 , 0, clause( 706, [ equalish( add( add( X, Y ), Z ), add( X, add( Y, Z ) )
% 0.69/1.07 ) ] )
% 0.69/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.69/1.07 Z, c )] )).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 subsumption(
% 0.69/1.07 clause( 722, [] )
% 0.69/1.07 , clause( 752, [] )
% 0.69/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 end.
% 0.69/1.07
% 0.69/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.07
% 0.69/1.07 Memory use:
% 0.69/1.07
% 0.69/1.07 space for terms: 10142
% 0.69/1.07 space for clauses: 55154
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 clauses generated: 888
% 0.69/1.07 clauses kept: 723
% 0.69/1.07 clauses selected: 78
% 0.69/1.07 clauses deleted: 1
% 0.69/1.07 clauses inuse deleted: 0
% 0.69/1.07
% 0.69/1.07 subsentry: 583
% 0.69/1.07 literals s-matched: 317
% 0.69/1.07 literals matched: 310
% 0.69/1.07 full subsumption: 22
% 0.69/1.07
% 0.69/1.07 checksum: 878465487
% 0.69/1.07
% 0.69/1.07
% 0.69/1.07 Bliksem ended
%------------------------------------------------------------------------------