%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM016-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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 : Thu Sep 24 08:51:38 AM UTC 2026
% Result : Unsatisfiable 0.14s 10.42s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(nothing_is_less_than_itself,axiom,
~ less(X,X),
file('theBenchmark.p',nothing_is_less_than_itself) ).
cnf(numbers_are_different,axiom,
( ~ less(Y,X)
| ~ less(X,Y) ),
file('theBenchmark.p',numbers_are_different) ).
cnf(everything_divides_itself,axiom,
divides(X,X),
file('theBenchmark.p',everything_divides_itself) ).
cnf(transitivity_of_divides,axiom,
( divides(X,Z)
| ~ divides(Y,Z)
| ~ divides(X,Y) ),
file('theBenchmark.p',transitivity_of_divides) ).
cnf(small_divides_large,axiom,
( ~ less(Y,X)
| ~ divides(X,Y) ),
file('theBenchmark.p',small_divides_large) ).
cnf(a_prime_is_less_than_the_next_one,axiom,
less(X,factorial_plus_one(X)),
file('theBenchmark.p',a_prime_is_less_than_the_next_one) ).
cnf(divisor_is_smaller,axiom,
( less(Y,X)
| ~ divides(X,factorial_plus_one(Y)) ),
file('theBenchmark.p',divisor_is_smaller) ).
cnf(division_by_prime_divisor,axiom,
( divides(prime_divisor(X),X)
| prime(X) ),
file('theBenchmark.p',division_by_prime_divisor) ).
cnf(prime_divsiors,axiom,
( prime(prime_divisor(X))
| prime(X) ),
file('theBenchmark.p',prime_divsiors) ).
cnf(smaller_prime_divisors,axiom,
( less(prime_divisor(X),X)
| prime(X) ),
file('theBenchmark.p',smaller_prime_divisors) ).
cnf(a_is_prime,hypothesis,
prime(a),
file('theBenchmark.p',a_is_prime) ).
cnf(prove_there_is_another_prime,negated_conjecture,
( less(factorial_plus_one(a),X)
| ~ less(a,X)
| ~ prime(X) ),
file('theBenchmark.p',prove_there_is_another_prime) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM016-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.39 % Computer : n020.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Sat Sep 19 17:35:57 UTC 2026
% 0.11/10.40 % CPUTime :
% 0.14/10.42 % SZS status Unsatisfiable for theBenchmark
% 0.14/10.42 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------