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