%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : PUZ103^5 : TPTP v9.3.1. Bugfixed v5.2.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 : n012.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 : Wed Sep 30 08:20:47 AM UTC 2026
% Result : Theorem 1.69s 1.05s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 1 def)
% Number of atoms : 7 ( 1 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 36 ( 2 ~; 0 |; 3 &; 22 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 1 ^; 9 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(c1_decl,type,
c1: $i ).
thf(s_decl,type,
s: $i > $i ).
thf(cCKB6_NUM_decl,type,
cCKB6_NUM: $i > $o ).
thf(cCKB6_NUM_def,definition,
( cCKB6_NUM
= ( ^ [A: $i] :
! [B: $i > $o] :
( ( ( B @ c1 )
& ! [C: $i] :
( ( B @ C )
=> ( B @ ( s @ C ) ) ) )
=> ( B @ A ) ) ) ) ).
thf(1,conjecture,
! [A: $i] :
( ( cCKB6_NUM @ A )
=> ( cCKB6_NUM @ ( s @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCKB6_L3000) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( cCKB6_NUM @ A )
=> ( cCKB6_NUM @ ( s @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
( ! [B: $i > $o] :
( ( ( B @ c1 )
& ! [C: $i] :
( ( B @ C )
=> ( B @ ( s @ C ) ) ) )
=> ( B @ A ) )
=> ! [B: $i > $o] :
( ( ( B @ c1 )
& ! [C: $i] :
( ( B @ C )
=> ( B @ ( s @ C ) ) ) )
=> ( B @ ( s @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(20,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PUZ103^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.04 % 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.07/0.12 % Computer : n012.cluster.edu
% 0.07/0.12 % Model : x86_64 x86_64
% 0.07/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.12 % Memory : 8046.5625MB
% 0.07/0.12 % OS : Linux 6.8.0-71-generic
% 0.07/0.12 % CPULimit : 300
% 0.07/0.12 % WCLimit : 300
% 0.07/0.12 % DateTime : Tue Sep 29 13:23:49 UTC 2026
% 0.07/0.12 % CPUTime :
% 0.07/0.12 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.40/0.40 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.56/0.49 % [INFO] Parsing done (87ms).
% 0.56/0.50 % [INFO] Running in sequential loop mode.
% 0.85/0.69 % [INFO] eprover registered as external prover.
% 0.85/0.69 % [INFO] Scanning for conjecture ...
% 1.00/0.74 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.00/0.75 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.00/0.75 % [INFO] Problem is higher-order (TPTP THF).
% 1.00/0.75 % [INFO] Type checking passed.
% 1.00/0.76 % [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 ...
% 1.69/1.05 % External prover 'e' found a proof!
% 1.69/1.05 % [INFO] Killing All external provers ...
% 1.69/1.05 % Time passed: 856ms (effective reasoning time: 547ms)
% 1.69/1.05 % Solved by 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)>
% 1.69/1.05 % Axioms used in derivation (0):
% 1.69/1.05 % No. of inferences in proof: 4
% 1.69/1.05 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 856 ms resp. 547 ms w/o parsing
% 1.69/1.07 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.69/1.07 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------