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