%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM016-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:16:02 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.36s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 19 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nothing_is_less_than_itself,axiom,
! [VAR_0] : ~ less(VAR_0,VAR_0),
file('theBenchmark.p',nothing_is_less_than_itself) ).
cnf(c_1,plain,
~ less(A,A),
inference(clausify,[status(thm)],[nothing_is_less_than_itself]) ).
fof(numbers_are_different,axiom,
! [VAR_0,VAR_1] :
( ~ less(VAR_1,VAR_0)
| ~ less(VAR_0,VAR_1) ),
file('theBenchmark.p',numbers_are_different) ).
cnf(c_2,plain,
( ~ less(B,A)
| ~ less(A,B) ),
inference(clausify,[status(thm)],[numbers_are_different]) ).
fof(a_prime_is_less_than_the_next_one,axiom,
! [VAR_0] : less(VAR_0,factorial_plus_one(VAR_0)),
file('theBenchmark.p',a_prime_is_less_than_the_next_one) ).
cnf(c_6,plain,
less(A,factorial_plus_one(A)),
inference(clausify,[status(thm)],[a_prime_is_less_than_the_next_one]) ).
fof(divisor_is_smaller,axiom,
! [VAR_0,VAR_1] :
( less(VAR_1,VAR_0)
| ~ divides(VAR_0,factorial_plus_one(VAR_1)) ),
file('theBenchmark.p',divisor_is_smaller) ).
cnf(c_7,plain,
( less(B,A)
| ~ divides(A,factorial_plus_one(B)) ),
inference(clausify,[status(thm)],[divisor_is_smaller]) ).
fof(division_by_prime_divisor,axiom,
! [VAR_0] :
( divides(prime_divisor(VAR_0),VAR_0)
| prime(VAR_0) ),
file('theBenchmark.p',division_by_prime_divisor) ).
cnf(c_8,plain,
( divides(prime_divisor(A),A)
| prime(A) ),
inference(clausify,[status(thm)],[division_by_prime_divisor]) ).
fof(prime_divsiors,axiom,
! [VAR_0] :
( prime(prime_divisor(VAR_0))
| prime(VAR_0) ),
file('theBenchmark.p',prime_divsiors) ).
cnf(c_9,plain,
( prime(prime_divisor(A))
| prime(A) ),
inference(clausify,[status(thm)],[prime_divsiors]) ).
fof(smaller_prime_divisors,axiom,
! [VAR_0] :
( less(prime_divisor(VAR_0),VAR_0)
| prime(VAR_0) ),
file('theBenchmark.p',smaller_prime_divisors) ).
cnf(c_10,plain,
( less(prime_divisor(A),A)
| prime(A) ),
inference(clausify,[status(thm)],[smaller_prime_divisors]) ).
fof(prove_there_is_another_prime,axiom,
! [VAR_0] :
( less(factorial_plus_one(a),VAR_0)
| ~ less(a,VAR_0)
| ~ prime(VAR_0) ),
file('theBenchmark.p',prove_there_is_another_prime) ).
cnf(c_12,plain,
( less(factorial_plus_one(a),A)
| ~ less(a,A)
| ~ prime(A) ),
inference(clausify,[status(thm)],[prove_there_is_another_prime]) ).
cnf(c_16,plain,
( less(A,prime_divisor(factorial_plus_one(A)))
| prime(factorial_plus_one(A)) ),
inference(resolve,[status(thm)],[c_8,c_7]) ).
cnf(c_20,plain,
( ~ less(A,prime_divisor(A))
| prime(A) ),
inference(resolve,[status(thm)],[c_10,c_2]) ).
cnf(c_32,plain,
( less(factorial_plus_one(a),factorial_plus_one(a))
| ~ prime(factorial_plus_one(a)) ),
inference(resolve,[status(thm)],[c_12,c_6]) ).
cnf(c_21,plain,
~ prime(factorial_plus_one(a)),
inference(resolve,[status(thm)],[c_1,c_32]) ).
cnf(c_24,plain,
~ less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))),
inference(resolve,[status(thm)],[c_20,c_21]) ).
cnf(c_33,plain,
( less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a)))
| ~ prime(prime_divisor(factorial_plus_one(a)))
| prime(factorial_plus_one(a)) ),
inference(resolve,[status(thm)],[c_16,c_12]) ).
cnf(c_34,plain,
( less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a)))
| ~ prime(prime_divisor(factorial_plus_one(a))) ),
inference(resolve,[status(thm)],[c_21,c_33]) ).
cnf(c_25,plain,
~ prime(prime_divisor(factorial_plus_one(a))),
inference(resolve,[status(thm)],[c_24,c_34]) ).
cnf(c_35,plain,
prime(factorial_plus_one(a)),
inference(resolve,[status(thm)],[c_25,c_9]) ).
cnf(c_31,plain,
$false,
inference(resolve,[status(thm)],[c_21,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM016-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n009.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 26 01:53:28 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.34 % Process 3110126 was started by sandbox on n009,
% 0.09/0.34 % Sat Sep 26 01:53:28 2026
% 0.09/0.34 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.35
% 0.09/0.35 % From the command line: assign(max_seconds, 300).
% 0.09/0.36
% 0.09/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.36
% 0.09/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.36 % Length of proof is 14.
% 0.09/0.36 % Level of proof is 4.
% 0.09/0.36 % Maximum clause weight is 9.000.
% 0.09/0.36 % Given clauses 23.
% 0.09/0.36
% 0.09/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------