%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU819^2 : TPTP v9.3.1. Released v3.7.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 : 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 : Wed Sep 30 08:29:24 AM UTC 2026
% Result : Theorem 3.78s 2.23s
% Output : Refutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 10 ( 7 unt; 0 typ; 6 def)
% Number of atoms : 78 ( 12 equ; 0 cnn)
% Maximal formula atoms : 29 ( 7 avg)
% Number of connectives : 175 ( 6 ~; 6 |; 12 &; 113 @)
% ( 0 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 5 ^; 31 !; 2 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(emptyset_decl,type,
emptyset: $i ).
thf(powerset_decl,type,
powerset: $i > $i ).
thf(setunion_decl,type,
setunion: $i > $i ).
thf(nonempty_decl,type,
nonempty: $i > $o ).
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(transitiveset_decl,type,
transitiveset: $i > $o ).
thf(setunionTransitive_decl,type,
setunionTransitive: $o ).
thf(stricttotalorderedByIn_decl,type,
stricttotalorderedByIn: $i > $o ).
thf(wellorderedByIn_decl,type,
wellorderedByIn: $i > $o ).
thf(ordinal_decl,type,
ordinal: $i > $o ).
thf(nonempty_def,definition,
( nonempty
= ( ^ [A: $i] : ( A != emptyset ) ) ) ).
thf(transitiveset_def,definition,
( transitiveset
= ( ^ [A: $i] :
! [B: $i] :
( ( in @ B @ A )
=> ( subset @ B @ A ) ) ) ) ).
thf(setunionTransitive_def,definition,
( setunionTransitive
= ( ! [A: $i] :
( ! [B: $i] :
( ( in @ B @ A )
=> ( transitiveset @ B ) )
=> ( transitiveset @ ( setunion @ A ) ) ) ) ) ).
thf(stricttotalorderedByIn_def,definition,
( stricttotalorderedByIn
= ( ^ [A: $i] :
( ! [B: $i] :
( ( in @ B @ A )
=> ! [C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ( ( in @ B @ C )
& ( in @ C @ D ) )
=> ( in @ B @ D ) ) ) ) )
& ! [B: $i] :
( ( in @ B @ A )
=> ! [C: $i] :
( ( in @ C @ A )
=> ( ( B = C )
| ( in @ B @ C )
| ( in @ C @ B ) ) ) )
& ! [B: $i] :
( ( in @ B @ A )
=> ~ ( in @ B @ B ) ) ) ) ) ).
thf(wellorderedByIn_def,definition,
( wellorderedByIn
= ( ^ [A: $i] :
( ( stricttotalorderedByIn @ A )
& ! [B: $i] :
( ( in @ B @ ( powerset @ A ) )
=> ( ( nonempty @ B )
=> ? [C: $i] :
( ( in @ C @ B )
& ! [D: $i] :
( ( in @ D @ B )
=> ( ( C = D )
| ( in @ C @ D ) ) ) ) ) ) ) ) ) ).
thf(ordinal_def,definition,
( ordinal
= ( ^ [A: $i] :
( ( transitiveset @ A )
& ( wellorderedByIn @ A ) ) ) ) ).
thf(1,conjecture,
( setunionTransitive
=> ! [A: $i] :
( ! [B: $i] :
( ( in @ B @ A )
=> ( ordinal @ B ) )
=> ( transitiveset @ ( setunion @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionOrdinalLem1) ).
thf(2,negated_conjecture,
~ ( setunionTransitive
=> ! [A: $i] :
( ! [B: $i] :
( ( in @ B @ A )
=> ( ordinal @ B ) )
=> ( transitiveset @ ( setunion @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i] :
( ! [B: $i] :
( ( in @ B @ A )
=> ! [C: $i] :
( ( in @ C @ B )
=> ( subset @ C @ B ) ) )
=> ! [B: $i] :
( ( in @ B @ ( setunion @ A ) )
=> ( subset @ B @ ( setunion @ A ) ) ) )
=> ! [A: $i] :
( ! [B: $i] :
( ( in @ B @ A )
=> ( ! [C: $i] :
( ( in @ C @ B )
=> ( subset @ C @ B ) )
& ! [C: $i] :
( ( in @ C @ B )
=> ! [D: $i] :
( ( in @ D @ B )
=> ! [E: $i] :
( ( in @ E @ B )
=> ( ( ( in @ C @ D )
& ( in @ D @ E ) )
=> ( in @ C @ E ) ) ) ) )
& ! [C: $i] :
( ( in @ C @ B )
=> ! [D: $i] :
( ( in @ D @ B )
=> ( ( C = D )
| ( in @ C @ D )
| ( in @ D @ C ) ) ) )
& ! [C: $i] :
( ( in @ C @ B )
=> ~ ( in @ C @ C ) )
& ! [C: $i] :
( ( in @ C @ ( powerset @ B ) )
=> ( ( C != emptyset )
=> ? [D: $i] :
( ( in @ D @ C )
& ! [E: $i] :
( ( in @ E @ C )
=> ( ( D = E )
| ( in @ D @ E ) ) ) ) ) ) ) )
=> ! [B: $i] :
( ( in @ B @ ( setunion @ A ) )
=> ( subset @ B @ ( setunion @ A ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(25,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU819^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % 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.10/0.20 % Computer : n020.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 14:35:19 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 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
% 1.02/0.80 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/1.00 % [INFO] Parsing done (202ms).
% 1.20/1.02 % [INFO] Running in sequential loop mode.
% 2.08/1.41 % [INFO] eprover registered as external prover.
% 2.08/1.42 % [INFO] Scanning for conjecture ...
% 2.27/1.55 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.27/1.59 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.27/1.59 % [INFO] Problem is higher-order (TPTP THF).
% 2.27/1.59 % [INFO] Type checking passed.
% 2.46/1.60 % [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.78/2.23 % External prover 'e' found a proof!
% 3.78/2.23 % [INFO] Killing All external provers ...
% 3.78/2.23 % Time passed: 1880ms (effective reasoning time: 1206ms)
% 3.78/2.23 % 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)>
% 3.78/2.23 % Axioms used in derivation (0):
% 3.78/2.23 % No. of inferences in proof: 4
% 3.78/2.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1880 ms resp. 1206 ms w/o parsing
% 3.78/2.28 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.78/2.29 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------