TSTP Solution File: NUM016-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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:16 EDT 2022
% Result : Unsatisfiable 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n013.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 16:20:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.10 *** allocated 10000 integers for termspace/termends
% 0.70/1.10 *** allocated 10000 integers for clauses
% 0.70/1.10 *** allocated 10000 integers for justifications
% 0.70/1.10 Bliksem 1.12
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Automatic Strategy Selection
% 0.70/1.10
% 0.70/1.10 Clauses:
% 0.70/1.10 [
% 0.70/1.10 [ ~( less( X, X ) ) ],
% 0.70/1.10 [ ~( less( X, Y ) ), ~( less( Y, X ) ) ],
% 0.70/1.10 [ less( X, 'factorial_plus_one'( X ) ) ],
% 0.70/1.10 [ ~( divides( X, 'factorial_plus_one'( Y ) ) ), less( Y, X ) ],
% 0.70/1.10 [ prime( X ), divides( 'prime_divisor'( X ), X ) ],
% 0.70/1.10 [ prime( X ), prime( 'prime_divisor'( X ) ) ],
% 0.70/1.10 [ prime( X ), less( 'prime_divisor'( X ), X ) ],
% 0.70/1.10 [ ~( prime( X ) ), ~( less( a, X ) ), less( 'factorial_plus_one'( a ), X
% 0.70/1.10 ) ]
% 0.70/1.10 ] .
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 percentage equality = 0.000000, percentage horn = 0.625000
% 0.70/1.10 This a non-horn, non-equality problem
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Options Used:
% 0.70/1.10
% 0.70/1.10 useres = 1
% 0.70/1.10 useparamod = 0
% 0.70/1.10 useeqrefl = 0
% 0.70/1.10 useeqfact = 0
% 0.70/1.10 usefactor = 1
% 0.70/1.10 usesimpsplitting = 0
% 0.70/1.10 usesimpdemod = 0
% 0.70/1.10 usesimpres = 3
% 0.70/1.10
% 0.70/1.10 resimpinuse = 1000
% 0.70/1.10 resimpclauses = 20000
% 0.70/1.10 substype = standard
% 0.70/1.10 backwardsubs = 1
% 0.70/1.10 selectoldest = 5
% 0.70/1.10
% 0.70/1.10 litorderings [0] = split
% 0.70/1.10 litorderings [1] = liftord
% 0.70/1.10
% 0.70/1.10 termordering = none
% 0.70/1.10
% 0.70/1.10 litapriori = 1
% 0.70/1.10 termapriori = 0
% 0.70/1.10 litaposteriori = 0
% 0.70/1.10 termaposteriori = 0
% 0.70/1.10 demodaposteriori = 0
% 0.70/1.10 ordereqreflfact = 0
% 0.70/1.10
% 0.70/1.10 litselect = none
% 0.70/1.10
% 0.70/1.10 maxweight = 15
% 0.70/1.10 maxdepth = 30000
% 0.70/1.10 maxlength = 115
% 0.70/1.10 maxnrvars = 195
% 0.70/1.10 excuselevel = 1
% 0.70/1.10 increasemaxweight = 1
% 0.70/1.10
% 0.70/1.10 maxselected = 10000000
% 0.70/1.10 maxnrclauses = 10000000
% 0.70/1.10
% 0.70/1.10 showgenerated = 0
% 0.70/1.10 showkept = 0
% 0.70/1.10 showselected = 0
% 0.70/1.10 showdeleted = 0
% 0.70/1.10 showresimp = 1
% 0.70/1.10 showstatus = 2000
% 0.70/1.10
% 0.70/1.10 prologoutput = 1
% 0.70/1.10 nrgoals = 5000000
% 0.70/1.10 totalproof = 1
% 0.70/1.10
% 0.70/1.10 Symbols occurring in the translation:
% 0.70/1.10
% 0.70/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.10 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.10 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.70/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 less [40, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.70/1.10 'factorial_plus_one' [42, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.70/1.10 divides [43, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.10 prime [44, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.70/1.10 'prime_divisor' [45, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.10 a [46, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Starting Search:
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksems!, er is een bewijs:
% 0.70/1.10 % SZS status Unsatisfiable
% 0.70/1.10 % SZS output start Refutation
% 0.70/1.10
% 0.70/1.10 clause( 0, [ ~( less( X, X ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 1, [ ~( less( Y, X ) ), ~( less( X, Y ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 2, [ less( X, 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 3, [ less( Y, X ), ~( divides( X, 'factorial_plus_one'( Y ) ) ) ]
% 0.70/1.10 )
% 0.70/1.10 .
% 0.70/1.10 clause( 4, [ prime( X ), divides( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 5, [ prime( 'prime_divisor'( X ) ), prime( X ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 6, [ prime( X ), less( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 7, [ ~( prime( X ) ), ~( less( a, X ) ), less( 'factorial_plus_one'(
% 0.70/1.10 a ), X ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 9, [ prime( X ), ~( less( X, 'prime_divisor'( X ) ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 10, [ prime( 'factorial_plus_one'( X ) ), less( X, 'prime_divisor'(
% 0.70/1.10 'factorial_plus_one'( X ) ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 12, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 14, [ ~( prime( 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 16, [ ~( less( a, 'prime_divisor'( 'factorial_plus_one'( a ) ) ) )
% 0.70/1.10 ] )
% 0.70/1.10 .
% 0.70/1.10 clause( 18, [] )
% 0.70/1.10 .
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 % SZS output end Refutation
% 0.70/1.10 found a proof!
% 0.70/1.10
% 0.70/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.10
% 0.70/1.10 initialclauses(
% 0.70/1.10 [ clause( 20, [ ~( less( X, X ) ) ] )
% 0.70/1.10 , clause( 21, [ ~( less( X, Y ) ), ~( less( Y, X ) ) ] )
% 0.70/1.10 , clause( 22, [ less( X, 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 , clause( 23, [ ~( divides( X, 'factorial_plus_one'( Y ) ) ), less( Y, X )
% 0.70/1.10 ] )
% 0.70/1.10 , clause( 24, [ prime( X ), divides( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , clause( 25, [ prime( X ), prime( 'prime_divisor'( X ) ) ] )
% 0.70/1.10 , clause( 26, [ prime( X ), less( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , clause( 27, [ ~( prime( X ) ), ~( less( a, X ) ), less(
% 0.70/1.10 'factorial_plus_one'( a ), X ) ] )
% 0.70/1.10 ] ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 0, [ ~( less( X, X ) ) ] )
% 0.70/1.10 , clause( 20, [ ~( less( X, X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 1, [ ~( less( Y, X ) ), ~( less( X, Y ) ) ] )
% 0.70/1.10 , clause( 21, [ ~( less( X, Y ) ), ~( less( Y, X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.10 ), ==>( 1, 1 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 2, [ less( X, 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 , clause( 22, [ less( X, 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 3, [ less( Y, X ), ~( divides( X, 'factorial_plus_one'( Y ) ) ) ]
% 0.70/1.10 )
% 0.70/1.10 , clause( 23, [ ~( divides( X, 'factorial_plus_one'( Y ) ) ), less( Y, X )
% 0.70/1.10 ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.70/1.10 ), ==>( 1, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 4, [ prime( X ), divides( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , clause( 24, [ prime( X ), divides( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.70/1.10 1 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 5, [ prime( 'prime_divisor'( X ) ), prime( X ) ] )
% 0.70/1.10 , clause( 25, [ prime( X ), prime( 'prime_divisor'( X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 6, [ prime( X ), less( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , clause( 26, [ prime( X ), less( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.70/1.10 1 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 7, [ ~( prime( X ) ), ~( less( a, X ) ), less( 'factorial_plus_one'(
% 0.70/1.10 a ), X ) ] )
% 0.70/1.10 , clause( 27, [ ~( prime( X ) ), ~( less( a, X ) ), less(
% 0.70/1.10 'factorial_plus_one'( a ), X ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.70/1.10 1 ), ==>( 2, 2 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 35, [ ~( less( X, 'prime_divisor'( X ) ) ), prime( X ) ] )
% 0.70/1.10 , clause( 1, [ ~( less( Y, X ) ), ~( less( X, Y ) ) ] )
% 0.70/1.10 , 0, clause( 6, [ prime( X ), less( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , 1, substitution( 0, [ :=( X, X ), :=( Y, 'prime_divisor'( X ) )] ),
% 0.70/1.10 substitution( 1, [ :=( X, X )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 9, [ prime( X ), ~( less( X, 'prime_divisor'( X ) ) ) ] )
% 0.70/1.10 , clause( 35, [ ~( less( X, 'prime_divisor'( X ) ) ), prime( X ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 36, [ less( X, 'prime_divisor'( 'factorial_plus_one'( X ) ) ),
% 0.70/1.10 prime( 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 , clause( 3, [ less( Y, X ), ~( divides( X, 'factorial_plus_one'( Y ) ) ) ]
% 0.70/1.10 )
% 0.70/1.10 , 1, clause( 4, [ prime( X ), divides( 'prime_divisor'( X ), X ) ] )
% 0.70/1.10 , 1, substitution( 0, [ :=( X, 'prime_divisor'( 'factorial_plus_one'( X ) )
% 0.70/1.10 ), :=( Y, X )] ), substitution( 1, [ :=( X, 'factorial_plus_one'( X ) )] )
% 0.70/1.10 ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 10, [ prime( 'factorial_plus_one'( X ) ), less( X, 'prime_divisor'(
% 0.70/1.10 'factorial_plus_one'( X ) ) ) ] )
% 0.70/1.10 , clause( 36, [ less( X, 'prime_divisor'( 'factorial_plus_one'( X ) ) ),
% 0.70/1.10 prime( 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.10 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 38, [ prime( 'factorial_plus_one'( a ) ), ~( prime( 'prime_divisor'(
% 0.70/1.10 'factorial_plus_one'( a ) ) ) ), ~( less( a, 'prime_divisor'(
% 0.70/1.10 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 , clause( 9, [ prime( X ), ~( less( X, 'prime_divisor'( X ) ) ) ] )
% 0.70/1.10 , 1, clause( 7, [ ~( prime( X ) ), ~( less( a, X ) ), less(
% 0.70/1.10 'factorial_plus_one'( a ), X ) ] )
% 0.70/1.10 , 2, substitution( 0, [ :=( X, 'factorial_plus_one'( a ) )] ),
% 0.70/1.10 substitution( 1, [ :=( X, 'prime_divisor'( 'factorial_plus_one'( a ) ) )] )
% 0.70/1.10 ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 39, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ), prime(
% 0.70/1.10 'factorial_plus_one'( a ) ) ] )
% 0.70/1.10 , clause( 38, [ prime( 'factorial_plus_one'( a ) ), ~( prime(
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 , 1, clause( 5, [ prime( 'prime_divisor'( X ) ), prime( X ) ] )
% 0.70/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'factorial_plus_one'(
% 0.70/1.10 a ) )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 factor(
% 0.70/1.10 clause( 40, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 , clause( 39, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ), prime(
% 0.70/1.10 'factorial_plus_one'( a ) ) ] )
% 0.70/1.10 , 0, 2, substitution( 0, [] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 12, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 , clause( 40, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.70/1.10 ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 41, [ ~( prime( 'factorial_plus_one'( a ) ) ), ~( less( a,
% 0.70/1.10 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , clause( 0, [ ~( less( X, X ) ) ] )
% 0.70/1.10 , 0, clause( 7, [ ~( prime( X ) ), ~( less( a, X ) ), less(
% 0.70/1.10 'factorial_plus_one'( a ), X ) ] )
% 0.70/1.10 , 2, substitution( 0, [ :=( X, 'factorial_plus_one'( a ) )] ),
% 0.70/1.10 substitution( 1, [ :=( X, 'factorial_plus_one'( a ) )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 42, [ ~( prime( 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , clause( 41, [ ~( prime( 'factorial_plus_one'( a ) ) ), ~( less( a,
% 0.70/1.10 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , 1, clause( 2, [ less( X, 'factorial_plus_one'( X ) ) ] )
% 0.70/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 14, [ ~( prime( 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , clause( 42, [ ~( prime( 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 43, [ ~( less( a, 'prime_divisor'( 'factorial_plus_one'( a ) ) ) )
% 0.70/1.10 ] )
% 0.70/1.10 , clause( 14, [ ~( prime( 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , 0, clause( 12, [ prime( 'factorial_plus_one'( a ) ), ~( less( a,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( a ) ) ) ) ] )
% 0.70/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 16, [ ~( less( a, 'prime_divisor'( 'factorial_plus_one'( a ) ) ) )
% 0.70/1.10 ] )
% 0.70/1.10 , clause( 43, [ ~( less( a, 'prime_divisor'( 'factorial_plus_one'( a ) ) )
% 0.70/1.10 ) ] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 44, [ prime( 'factorial_plus_one'( a ) ) ] )
% 0.70/1.10 , clause( 16, [ ~( less( a, 'prime_divisor'( 'factorial_plus_one'( a ) ) )
% 0.70/1.10 ) ] )
% 0.70/1.10 , 0, clause( 10, [ prime( 'factorial_plus_one'( X ) ), less( X,
% 0.70/1.10 'prime_divisor'( 'factorial_plus_one'( X ) ) ) ] )
% 0.70/1.10 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 resolution(
% 0.70/1.10 clause( 45, [] )
% 0.70/1.10 , clause( 14, [ ~( prime( 'factorial_plus_one'( a ) ) ) ] )
% 0.70/1.10 , 0, clause( 44, [ prime( 'factorial_plus_one'( a ) ) ] )
% 0.70/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 subsumption(
% 0.70/1.10 clause( 18, [] )
% 0.70/1.10 , clause( 45, [] )
% 0.70/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 end.
% 0.70/1.10
% 0.70/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.10
% 0.70/1.10 Memory use:
% 0.70/1.10
% 0.70/1.10 space for terms: 283
% 0.70/1.10 space for clauses: 1197
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 clauses generated: 29
% 0.70/1.10 clauses kept: 19
% 0.70/1.10 clauses selected: 16
% 0.70/1.10 clauses deleted: 1
% 0.70/1.10 clauses inuse deleted: 0
% 0.70/1.10
% 0.70/1.10 subsentry: 38
% 0.70/1.10 literals s-matched: 30
% 0.70/1.10 literals matched: 30
% 0.70/1.10 full subsumption: 6
% 0.70/1.10
% 0.70/1.10 checksum: -1282841263
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksem ended
%------------------------------------------------------------------------------