TSTP Solution File: NUM019-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM019-1 : TPTP v8.1.0. Bugfixed 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 : Mon Jul 18 06:19:18 EDT 2022
% Result : Unsatisfiable 0.41s 1.04s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM019-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.11 % Command : bliksem %s
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % DateTime : Thu Jul 7 06:09:44 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.41/1.04 *** allocated 10000 integers for termspace/termends
% 0.41/1.04 *** allocated 10000 integers for clauses
% 0.41/1.04 *** allocated 10000 integers for justifications
% 0.41/1.04 Bliksem 1.12
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Automatic Strategy Selection
% 0.41/1.04
% 0.41/1.04 Clauses:
% 0.41/1.04 [
% 0.41/1.04 [ equalish( add( X, n0 ), X ) ],
% 0.41/1.04 [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.41/1.04 [ equalish( multiply( X, n0 ), n0 ) ],
% 0.41/1.04 [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.41/1.04 ],
% 0.41/1.04 [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.41/1.04 ,
% 0.41/1.04 [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.41/1.04 ,
% 0.41/1.04 [ equalish( X, X ) ],
% 0.41/1.04 [ ~( equalish( X, Y ) ), ~( equalish( X, Z ) ), equalish( Y, Z ) ],
% 0.41/1.04 [ ~( equalish( successor( X ), n0 ) ) ],
% 0.41/1.04 [ equalish( a, aa ) ],
% 0.41/1.04 [ ~( equalish( aa, a ) ) ]
% 0.41/1.04 ] .
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 percentage equality = 0.000000, percentage horn = 1.000000
% 0.41/1.04 This is a near-Horn, non-equality problem
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Options Used:
% 0.41/1.04
% 0.41/1.04 useres = 1
% 0.41/1.04 useparamod = 0
% 0.41/1.04 useeqrefl = 0
% 0.41/1.04 useeqfact = 0
% 0.41/1.04 usefactor = 1
% 0.41/1.04 usesimpsplitting = 0
% 0.41/1.04 usesimpdemod = 0
% 0.41/1.04 usesimpres = 4
% 0.41/1.04
% 0.41/1.04 resimpinuse = 1000
% 0.41/1.04 resimpclauses = 20000
% 0.41/1.04 substype = standard
% 0.41/1.04 backwardsubs = 1
% 0.41/1.04 selectoldest = 5
% 0.41/1.04
% 0.41/1.04 litorderings [0] = split
% 0.41/1.04 litorderings [1] = liftord
% 0.41/1.04
% 0.41/1.04 termordering = none
% 0.41/1.04
% 0.41/1.04 litapriori = 1
% 0.41/1.04 termapriori = 0
% 0.41/1.04 litaposteriori = 0
% 0.41/1.04 termaposteriori = 0
% 0.41/1.04 demodaposteriori = 0
% 0.41/1.04 ordereqreflfact = 0
% 0.41/1.04
% 0.41/1.04 litselect = negative
% 0.41/1.04
% 0.41/1.04 maxweight = 30000
% 0.41/1.04 maxdepth = 30000
% 0.41/1.04 maxlength = 115
% 0.41/1.04 maxnrvars = 195
% 0.41/1.04 excuselevel = 0
% 0.41/1.04 increasemaxweight = 0
% 0.41/1.04
% 0.41/1.04 maxselected = 10000000
% 0.41/1.04 maxnrclauses = 10000000
% 0.41/1.04
% 0.41/1.04 showgenerated = 0
% 0.41/1.04 showkept = 0
% 0.41/1.04 showselected = 0
% 0.41/1.04 showdeleted = 0
% 0.41/1.04 showresimp = 1
% 0.41/1.04 showstatus = 2000
% 0.41/1.04
% 0.41/1.04 prologoutput = 1
% 0.41/1.04 nrgoals = 5000000
% 0.41/1.04 totalproof = 1
% 0.41/1.04
% 0.41/1.04 Symbols occurring in the translation:
% 0.41/1.04
% 0.41/1.04 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.04 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.41/1.04 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.41/1.04 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.04 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.04 n0 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.41/1.04 add [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.41/1.04 equalish [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.41/1.04 successor [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.41/1.04 multiply [45, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.41/1.04 a [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.41/1.04 aa [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Starting Search:
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Bliksems!, er is een bewijs:
% 0.41/1.04 % SZS status Unsatisfiable
% 0.41/1.04 % SZS output start Refutation
% 0.41/1.04
% 0.41/1.04 clause( 6, [ equalish( X, X ) ] )
% 0.41/1.04 .
% 0.41/1.04 clause( 7, [ ~( equalish( X, Y ) ), equalish( Y, Z ), ~( equalish( X, Z ) )
% 0.41/1.04 ] )
% 0.41/1.04 .
% 0.41/1.04 clause( 9, [ equalish( a, aa ) ] )
% 0.41/1.04 .
% 0.41/1.04 clause( 10, [ ~( equalish( aa, a ) ) ] )
% 0.41/1.04 .
% 0.41/1.04 clause( 35, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.41/1.04 .
% 0.41/1.04 clause( 47, [] )
% 0.41/1.04 .
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 % SZS output end Refutation
% 0.41/1.04 found a proof!
% 0.41/1.04
% 0.41/1.04 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.04
% 0.41/1.04 initialclauses(
% 0.41/1.04 [ clause( 49, [ equalish( add( X, n0 ), X ) ] )
% 0.41/1.04 , clause( 50, [ equalish( add( X, successor( Y ) ), successor( add( X, Y )
% 0.41/1.04 ) ) ] )
% 0.41/1.04 , clause( 51, [ equalish( multiply( X, n0 ), n0 ) ] )
% 0.41/1.04 , clause( 52, [ equalish( multiply( X, successor( Y ) ), add( multiply( X,
% 0.41/1.04 Y ), X ) ) ] )
% 0.41/1.04 , clause( 53, [ ~( equalish( successor( X ), successor( Y ) ) ), equalish(
% 0.41/1.04 X, Y ) ] )
% 0.41/1.04 , clause( 54, [ ~( equalish( X, Y ) ), equalish( successor( X ), successor(
% 0.41/1.04 Y ) ) ] )
% 0.41/1.04 , clause( 55, [ equalish( X, X ) ] )
% 0.41/1.04 , clause( 56, [ ~( equalish( X, Y ) ), ~( equalish( X, Z ) ), equalish( Y,
% 0.41/1.04 Z ) ] )
% 0.41/1.04 , clause( 57, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.41/1.04 , clause( 58, [ equalish( a, aa ) ] )
% 0.41/1.04 , clause( 59, [ ~( equalish( aa, a ) ) ] )
% 0.41/1.04 ] ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 subsumption(
% 0.41/1.04 clause( 6, [ equalish( X, X ) ] )
% 0.41/1.04 , clause( 55, [ equalish( X, X ) ] )
% 0.41/1.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 subsumption(
% 0.41/1.04 clause( 7, [ ~( equalish( X, Y ) ), equalish( Y, Z ), ~( equalish( X, Z ) )
% 0.41/1.04 ] )
% 0.41/1.04 , clause( 56, [ ~( equalish( X, Y ) ), ~( equalish( X, Z ) ), equalish( Y,
% 0.41/1.04 Z ) ] )
% 0.41/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.41/1.04 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 subsumption(
% 0.41/1.04 clause( 9, [ equalish( a, aa ) ] )
% 0.41/1.04 , clause( 58, [ equalish( a, aa ) ] )
% 0.41/1.04 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 subsumption(
% 0.41/1.04 clause( 10, [ ~( equalish( aa, a ) ) ] )
% 0.41/1.04 , clause( 59, [ ~( equalish( aa, a ) ) ] )
% 0.41/1.04 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 resolution(
% 0.41/1.04 clause( 64, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.41/1.04 , clause( 7, [ ~( equalish( X, Y ) ), equalish( Y, Z ), ~( equalish( X, Z )
% 0.41/1.04 ) ] )
% 0.41/1.04 , 2, clause( 6, [ equalish( X, X ) ] )
% 0.41/1.04 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, X )] ),
% 0.41/1.04 substitution( 1, [ :=( X, X )] )).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 subsumption(
% 0.41/1.04 clause( 35, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.41/1.04 , clause( 64, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.41/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.41/1.04 ), ==>( 1, 0 )] ) ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 resolution(
% 0.41/1.04 clause( 65, [ equalish( aa, a ) ] )
% 0.41/1.04 , clause( 35, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.41/1.04 , 1, clause( 9, [ equalish( a, aa ) ] )
% 0.41/1.04 , 0, substitution( 0, [ :=( X, a ), :=( Y, aa )] ), substitution( 1, [] )
% 0.41/1.04 ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 resolution(
% 0.41/1.04 clause( 66, [] )
% 0.41/1.04 , clause( 10, [ ~( equalish( aa, a ) ) ] )
% 0.41/1.04 , 0, clause( 65, [ equalish( aa, a ) ] )
% 0.41/1.04 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 subsumption(
% 0.41/1.04 clause( 47, [] )
% 0.41/1.04 , clause( 66, [] )
% 0.41/1.04 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 end.
% 0.41/1.04
% 0.41/1.04 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.04
% 0.41/1.04 Memory use:
% 0.41/1.04
% 0.41/1.04 space for terms: 609
% 0.41/1.04 space for clauses: 3469
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 clauses generated: 58
% 0.41/1.04 clauses kept: 48
% 0.41/1.04 clauses selected: 19
% 0.41/1.04 clauses deleted: 0
% 0.41/1.04 clauses inuse deleted: 0
% 0.41/1.04
% 0.41/1.04 subsentry: 28
% 0.41/1.04 literals s-matched: 11
% 0.41/1.04 literals matched: 11
% 0.41/1.04 full subsumption: 0
% 0.41/1.04
% 0.41/1.04 checksum: 1736680760
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Bliksem ended
%------------------------------------------------------------------------------