%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM693^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/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:18:00 AM UTC 2026
% Result : Theorem 2.48s 1.34s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 16 unt; 0 typ; 1 def)
% Number of atoms : 48 ( 34 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 105 ( 29 ~; 7 |; 1 &; 62 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 1 ^; 28 !; 1 ?; 31 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_decl,type,
x: nat ).
thf(more_decl,type,
more: nat > nat > $o ).
thf(n_1_decl,type,
n_1: nat ).
thf(suc_decl,type,
suc: nat > nat ).
thf(pl_decl,type,
pl: nat > nat > nat ).
thf(sk1_decl,type,
sk1: nat > nat ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: nat] :
@+[B: nat] :
( A
= ( suc @ B ) ) ) ) ).
thf(4,axiom,
! [A: nat] :
( ( A != n_1 )
=> ~ ! [B: nat] :
( A
!= ( suc @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz3) ).
thf(13,plain,
! [A: nat] :
( ( A != n_1 )
=> ~ ! [B: nat] :
( A
!= ( suc @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(14,plain,
! [A: nat] :
( ( A != n_1 )
=> ~ ~ ? [B: nat] :
( A
= ( suc @ B ) ) ),
inference(miniscope,[status(thm)],[13]) ).
thf(15,plain,
! [A: nat] :
( ( A = n_1 )
| ( A
= ( suc @ ( sk1 @ A ) ) ) ),
inference(cnf,[status(esa)],[14]) ).
thf(16,plain,
! [A: nat] :
( ( A = n_1 )
| ( ( suc @ ( sk1 @ A ) )
= A ) ),
inference(lifteq,[status(thm)],[15]) ).
thf(5,axiom,
! [A: nat,B: nat] : ( more @ ( pl @ A @ B ) @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz18) ).
thf(17,plain,
! [A: nat,B: nat] : ( more @ ( pl @ A @ B ) @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(18,plain,
! [B: nat,A: nat] : ( more @ ( pl @ A @ B ) @ A ),
inference(cnf,[status(esa)],[17]) ).
thf(1,conjecture,
( ~ ( more @ x @ n_1 )
=> ( x = n_1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz24) ).
thf(2,negated_conjecture,
~ ( ~ ( more @ x @ n_1 )
=> ( x = n_1 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(7,plain,
~ ( ~ ( more @ x @ n_1 )
=> ( x = n_1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,plain,
( ~ ( more @ x @ n_1 )
& ( x != n_1 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(9,plain,
~ ( more @ x @ n_1 ),
inference(cnfConj,[status(thm)],[8]) ).
thf(24,plain,
! [B: nat,A: nat] :
( ~ $true
| ( ( more @ ( pl @ A @ B ) @ A )
!= ( more @ x @ n_1 ) ) ),
inference(paramod_ordered,[status(thm)],[18,9]) ).
thf(25,plain,
! [B: nat,A: nat] :
( ( more @ ( pl @ A @ B ) @ A )
!= ( more @ x @ n_1 ) ),
inference(simp,[status(thm)],[24]) ).
thf(26,plain,
! [B: nat,A: nat] :
( ( ( pl @ A @ B )
!= x )
| ( A != n_1 ) ),
inference(simp,[status(thm)],[25]) ).
thf(27,plain,
! [A: nat] :
( ( pl @ n_1 @ A )
!= x ),
inference(simp,[status(thm)],[26]) ).
thf(6,axiom,
! [A: nat] :
( ( suc @ A )
= ( pl @ n_1 @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz4g) ).
thf(19,plain,
! [A: nat] :
( ( suc @ A )
= ( pl @ n_1 @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(20,plain,
! [A: nat] :
( ( suc @ A )
= ( pl @ n_1 @ A ) ),
inference(cnf,[status(esa)],[19]) ).
thf(21,plain,
! [A: nat] :
( ( pl @ n_1 @ A )
= ( suc @ A ) ),
inference(lifteq,[status(thm)],[20]) ).
thf(28,plain,
! [A: nat] :
( ( suc @ A )
!= x ),
inference(rewrite,[status(thm)],[27,21]) ).
thf(35,plain,
! [B: nat,A: nat] :
( ( A = n_1 )
| ( A != x )
| ( ( suc @ ( sk1 @ A ) )
!= ( suc @ B ) ) ),
inference(paramod_ordered,[status(thm)],[16,28]) ).
thf(36,plain,
! [A: nat] :
( ( A = n_1 )
| ( A != x ) ),
inference(pattern_uni,[status(thm)],[35:[bind(A,$thf( C )),bind(B,$thf( sk1 @ C ))]]) ).
thf(39,plain,
n_1 = x,
inference(simp,[status(thm)],[36]) ).
thf(10,plain,
x != n_1,
inference(cnfConj,[status(thm)],[8]) ).
thf(11,plain,
n_1 != x,
inference(lifteq,[status(thm)],[10]) ).
thf(40,plain,
$false,
inference(simplifyReflect,[status(thm)],[39,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM693^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 12:39:18 UTC 2026
% 0.06/0.11 % CPUTime :
% 0.06/0.11 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.41/0.41 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.60/0.50 % [INFO] Parsing done (97ms).
% 0.60/0.51 % [INFO] Running in sequential loop mode.
% 1.02/0.76 % [INFO] eprover registered as external prover.
% 1.02/0.76 % [INFO] Scanning for conjecture ...
% 1.24/0.81 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 1.24/0.83 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 1.24/0.84 % [INFO] Problem is higher-order (TPTP THF).
% 1.24/0.84 % [INFO] Type checking passed.
% 1.24/0.85 % [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 ...
% 2.48/1.34 % [INFO] Killing All external provers ...
% 2.48/1.34 % Time passed: 1156ms (effective reasoning time: 826ms)
% 2.48/1.34 % 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)>
% 2.48/1.34 % Axioms used in derivation (3): satz3, satz18, satz4g
% 2.48/1.34 % No. of inferences in proof: 28
% 2.48/1.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1156 ms resp. 826 ms w/o parsing
% 2.48/1.38 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.48/1.38 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------