%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM016-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n003.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:08:06 AM UTC 2026
% Result : Unsatisfiable 3.27s 2.32s
% Output : Refutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 88 ( 12 ~; 14 |; 0 &; 62 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 ^; 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(prime_decl,type,
prime: $i > $o ).
thf(less_decl,type,
less: $i > $i > $o ).
thf(a_decl,type,
a: $i ).
thf(factorial_plus_one_decl,type,
factorial_plus_one: $i > $i ).
thf(divides_decl,type,
divides: $i > $i > $o ).
thf(prime_divisor_decl,type,
prime_divisor: $i > $i ).
thf(7,axiom,
! [A: $i] :
( ( A @ prime_divisor @ prime )
| ( A @ prime ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime_divsiors) ).
thf(20,plain,
! [A: $i] :
( ( A @ prime_divisor @ prime )
| ( A @ prime ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(1,negated_conjecture,
! [A: $i] :
( ( A @ ( a @ factorial_plus_one @ less ) )
| ~ ( A @ ( a @ less ) )
| ~ ( A @ prime ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_another_prime) ).
thf(9,plain,
! [A: $i] :
( ( A @ ( a @ factorial_plus_one @ less ) )
| ~ ( A @ ( a @ less ) )
| ~ ( A @ prime ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ less ) )
| ~ ( B @ ( A @ less ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',numbers_are_different) ).
thf(13,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ less ) )
| ~ ( B @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,axiom,
! [A: $i] :
( ( A @ ( A @ prime_divisor @ less ) )
| ( A @ prime ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',smaller_prime_divisors) ).
thf(22,plain,
! [A: $i] :
( ( A @ ( A @ prime_divisor @ less ) )
| ( A @ prime ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(6,axiom,
! [A: $i] :
( ( A @ ( A @ prime_divisor @ divides ) )
| ( A @ prime ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',division_by_prime_divisor) ).
thf(18,plain,
! [A: $i] :
( ( A @ ( A @ prime_divisor @ divides ) )
| ( A @ prime ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(5,axiom,
! [B: $i,A: $i] :
( ( A @ ( B @ less ) )
| ~ ( B @ factorial_plus_one @ ( A @ divides ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_is_smaller) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ less ) )
| ~ ( B @ factorial_plus_one @ ( A @ divides ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(2,axiom,
! [A: $i] :
~ ( A @ ( A @ less ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).
thf(11,plain,
! [A: $i] :
~ ( A @ ( A @ less ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,axiom,
! [A: $i] : ( A @ factorial_plus_one @ ( A @ less ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_prime_is_less_than_the_next_one) ).
thf(15,plain,
! [A: $i] : ( A @ factorial_plus_one @ ( A @ less ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(28,plain,
$false,
inference(e,[status(thm)],[20,9,13,22,18,16,11,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM016-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.40 % Computer : n003.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sat Sep 26 01:55:08 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.86/1.00 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.21/1.18 % [INFO] Parsing done (181ms).
% 1.34/1.20 % [INFO] Running in sequential loop mode.
% 1.72/1.59 % [INFO] eprover registered as external prover.
% 1.72/1.59 % [INFO] Scanning for conjecture ...
% 1.89/1.68 % [INFO] Found a conjecture (or negated_conjecture) and 7 axioms. Running axiom selection ...
% 2.06/1.72 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 2.06/1.73 % [INFO] Problem is propositional (TPTP CNF).
% 2.06/1.73 % [INFO] Type checking passed.
% 2.06/1.74 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.27/2.32 % External prover 'e' found a proof!
% 3.27/2.32 % [INFO] Killing All external provers ...
% 3.27/2.32 % Time passed: 1762ms (effective reasoning time: 1113ms)
% 3.27/2.32 % Axioms used in derivation (7): prime_divsiors, divisor_is_smaller, smaller_prime_divisors, numbers_are_different, nothing_is_less_than_itself, a_prime_is_less_than_the_next_one, division_by_prime_divisor
% 3.27/2.32 % No. of inferences in proof: 17
% 3.27/2.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1762 ms resp. 1113 ms w/o parsing
% 3.27/2.34 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.27/2.34 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------