TSTP Solution File: NUM023-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:20 EDT 2022
% Result : Unsatisfiable 0.68s 1.08s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n026.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 : Wed Jul 6 03:40:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.08 *** allocated 10000 integers for termspace/termends
% 0.68/1.08 *** allocated 10000 integers for clauses
% 0.68/1.08 *** allocated 10000 integers for justifications
% 0.68/1.08 Bliksem 1.12
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Automatic Strategy Selection
% 0.68/1.08
% 0.68/1.08 Clauses:
% 0.68/1.08 [
% 0.68/1.08 [ equalish( add( X, n0 ), X ) ],
% 0.68/1.08 [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.68/1.08 [ equalish( multiply( X, n0 ), n0 ) ],
% 0.68/1.08 [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.68/1.08 ],
% 0.68/1.08 [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.68/1.08 ,
% 0.68/1.08 [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.68/1.08 ,
% 0.68/1.08 [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ],
% 0.68/1.08 [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z ) ],
% 0.68/1.08 [ ~( less( X, Y ) ), equalish( add( successor(
% 0.68/1.08 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ],
% 0.68/1.08 [ equalish( X, X ) ],
% 0.68/1.08 [ ~( equalish( X, Y ) ), equalish( Y, X ) ],
% 0.68/1.08 [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.68/1.08 [ ~( equalish( successor( X ), n0 ) ) ],
% 0.68/1.08 [ less( X, successor( X ) ) ],
% 0.68/1.08 [ ~( less( n0, successor( a ) ) ) ]
% 0.68/1.08 ] .
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.68/1.08 This is a near-Horn, non-equality problem
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Options Used:
% 0.68/1.08
% 0.68/1.08 useres = 1
% 0.68/1.08 useparamod = 0
% 0.68/1.08 useeqrefl = 0
% 0.68/1.08 useeqfact = 0
% 0.68/1.08 usefactor = 1
% 0.68/1.08 usesimpsplitting = 0
% 0.68/1.08 usesimpdemod = 0
% 0.68/1.08 usesimpres = 4
% 0.68/1.08
% 0.68/1.08 resimpinuse = 1000
% 0.68/1.08 resimpclauses = 20000
% 0.68/1.08 substype = standard
% 0.68/1.08 backwardsubs = 1
% 0.68/1.08 selectoldest = 5
% 0.68/1.08
% 0.68/1.08 litorderings [0] = split
% 0.68/1.08 litorderings [1] = liftord
% 0.68/1.08
% 0.68/1.08 termordering = none
% 0.68/1.08
% 0.68/1.08 litapriori = 1
% 0.68/1.08 termapriori = 0
% 0.68/1.08 litaposteriori = 0
% 0.68/1.08 termaposteriori = 0
% 0.68/1.08 demodaposteriori = 0
% 0.68/1.08 ordereqreflfact = 0
% 0.68/1.08
% 0.68/1.08 litselect = negative
% 0.68/1.08
% 0.68/1.08 maxweight = 30000
% 0.68/1.08 maxdepth = 30000
% 0.68/1.08 maxlength = 115
% 0.68/1.08 maxnrvars = 195
% 0.68/1.08 excuselevel = 0
% 0.68/1.08 increasemaxweight = 0
% 0.68/1.08
% 0.68/1.08 maxselected = 10000000
% 0.68/1.08 maxnrclauses = 10000000
% 0.68/1.08
% 0.68/1.08 showgenerated = 0
% 0.68/1.08 showkept = 0
% 0.68/1.08 showselected = 0
% 0.68/1.08 showdeleted = 0
% 0.68/1.08 showresimp = 1
% 0.68/1.08 showstatus = 2000
% 0.68/1.08
% 0.68/1.08 prologoutput = 1
% 0.68/1.08 nrgoals = 5000000
% 0.68/1.08 totalproof = 1
% 0.68/1.08
% 0.68/1.08 Symbols occurring in the translation:
% 0.68/1.08
% 0.68/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.08 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.68/1.08 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.68/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.08 n0 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.68/1.08 add [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.68/1.08 equalish [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.68/1.08 successor [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.68/1.08 multiply [45, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.68/1.08 less [46, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.68/1.08 'predecessor_of_1st_minus_2nd' [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.68/1.08 a [52, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Starting Search:
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Bliksems!, er is een bewijs:
% 0.68/1.08 % SZS status Unsatisfiable
% 0.68/1.08 % SZS output start Refutation
% 0.68/1.08
% 0.68/1.08 clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.68/1.08 .
% 0.68/1.08 clause( 7, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.68/1.08 )
% 0.68/1.08 .
% 0.68/1.08 clause( 14, [ ~( less( n0, successor( a ) ) ) ] )
% 0.68/1.08 .
% 0.68/1.08 clause( 42, [ less( n0, successor( X ) ) ] )
% 0.68/1.08 .
% 0.68/1.08 clause( 45, [] )
% 0.68/1.08 .
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 % SZS output end Refutation
% 0.68/1.08 found a proof!
% 0.68/1.08
% 0.68/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.08
% 0.68/1.08 initialclauses(
% 0.68/1.08 [ clause( 47, [ equalish( add( X, n0 ), X ) ] )
% 0.68/1.08 , clause( 48, [ equalish( add( X, successor( Y ) ), successor( add( X, Y )
% 0.68/1.08 ) ) ] )
% 0.68/1.08 , clause( 49, [ equalish( multiply( X, n0 ), n0 ) ] )
% 0.68/1.08 , clause( 50, [ equalish( multiply( X, successor( Y ) ), add( multiply( X,
% 0.68/1.08 Y ), X ) ) ] )
% 0.68/1.08 , clause( 51, [ ~( equalish( successor( X ), successor( Y ) ) ), equalish(
% 0.68/1.08 X, Y ) ] )
% 0.68/1.08 , clause( 52, [ ~( equalish( X, Y ) ), equalish( successor( X ), successor(
% 0.68/1.08 Y ) ) ] )
% 0.68/1.08 , clause( 53, [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ] )
% 0.68/1.08 , clause( 54, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z )
% 0.68/1.08 ] )
% 0.68/1.08 , clause( 55, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.68/1.08 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.68/1.08 , clause( 56, [ equalish( X, X ) ] )
% 0.68/1.08 , clause( 57, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.68/1.08 , clause( 58, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X,
% 0.68/1.08 Z ) ] )
% 0.68/1.08 , clause( 59, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.68/1.08 , clause( 60, [ less( X, successor( X ) ) ] )
% 0.68/1.08 , clause( 61, [ ~( less( n0, successor( a ) ) ) ] )
% 0.68/1.08 ] ).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 subsumption(
% 0.68/1.08 clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.68/1.08 , clause( 47, [ equalish( add( X, n0 ), X ) ] )
% 0.68/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 subsumption(
% 0.68/1.08 clause( 7, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.68/1.08 )
% 0.68/1.08 , clause( 54, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z )
% 0.68/1.08 ] )
% 0.68/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 subsumption(
% 0.68/1.08 clause( 14, [ ~( less( n0, successor( a ) ) ) ] )
% 0.68/1.08 , clause( 61, [ ~( less( n0, successor( a ) ) ) ] )
% 0.68/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 resolution(
% 0.68/1.08 clause( 65, [ less( n0, successor( X ) ) ] )
% 0.68/1.08 , clause( 7, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.68/1.08 )
% 0.68/1.08 , 1, clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.68/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, n0 ), :=( Z, successor( X ) )] )
% 0.68/1.08 , substitution( 1, [ :=( X, successor( X ) )] )).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 subsumption(
% 0.68/1.08 clause( 42, [ less( n0, successor( X ) ) ] )
% 0.68/1.08 , clause( 65, [ less( n0, successor( X ) ) ] )
% 0.68/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 resolution(
% 0.68/1.08 clause( 66, [] )
% 0.68/1.08 , clause( 14, [ ~( less( n0, successor( a ) ) ) ] )
% 0.68/1.08 , 0, clause( 42, [ less( n0, successor( X ) ) ] )
% 0.68/1.08 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 subsumption(
% 0.68/1.08 clause( 45, [] )
% 0.68/1.08 , clause( 66, [] )
% 0.68/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 end.
% 0.68/1.08
% 0.68/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.08
% 0.68/1.08 Memory use:
% 0.68/1.08
% 0.68/1.08 space for terms: 677
% 0.68/1.08 space for clauses: 3239
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 clauses generated: 66
% 0.68/1.08 clauses kept: 46
% 0.68/1.08 clauses selected: 27
% 0.68/1.08 clauses deleted: 0
% 0.68/1.08 clauses inuse deleted: 0
% 0.68/1.08
% 0.68/1.08 subsentry: 38
% 0.68/1.08 literals s-matched: 29
% 0.68/1.08 literals matched: 29
% 0.68/1.08 full subsumption: 2
% 0.68/1.08
% 0.68/1.08 checksum: 1129220954
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Bliksem ended
%------------------------------------------------------------------------------