%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU534^2 : 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:28:26 AM UTC 2026
% Result : Theorem 1.61s 1.08s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 6 ( 3 unt; 0 typ; 2 def)
% Number of atoms : 23 ( 5 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 56 ( 3 ~; 0 |; 3 &; 33 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 16 !; 3 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(emptyset_decl,type,
emptyset: $i ).
thf(dsetconstr_decl,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrI_decl,type,
dsetconstrI: $o ).
thf(emptysetE_decl,type,
emptysetE: $o ).
thf(dsetconstrI_def,definition,
( dsetconstrI
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) ) ) ) ).
thf(emptysetE_def,definition,
( emptysetE
= ( ! [A: $i] :
( ( in @ A @ emptyset )
=> ! [B: $o] : B ) ) ) ).
thf(1,conjecture,
( dsetconstrI
=> ( emptysetE
=> ! [A: $i,B: $i > $o] :
( ? [C: $i] :
( ( in @ C @ A )
& ( B @ C ) )
=> ( ( ( dsetconstr @ A @ B )
= emptyset )
=> $false ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptyE1) ).
thf(2,negated_conjecture,
~ ( dsetconstrI
=> ( emptysetE
=> ! [A: $i,B: $i > $o] :
( ? [C: $i] :
( ( in @ C @ A )
& ( B @ C ) )
=> ( ( ( dsetconstr @ A @ B )
= emptyset )
=> $false ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) )
=> ( ! [A: $i] :
( ( in @ A @ emptyset )
=> ! [B: $o] : B )
=> ! [A: $i,B: $i > $o] :
( ? [C: $i] :
( ( in @ C @ A )
& ( B @ C ) )
=> ( ( dsetconstr @ A @ B )
!= emptyset ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(13,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU534^2 : 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.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:48:18 UTC 2026
% 0.07/0.12 % CPUTime :
% 0.07/0.12 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.39/0.42 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.53/0.53 % [INFO] Parsing done (105ms).
% 0.73/0.53 % [INFO] Running in sequential loop mode.
% 0.97/0.73 % [INFO] eprover registered as external prover.
% 0.97/0.74 % [INFO] Scanning for conjecture ...
% 0.97/0.79 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.15/0.81 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.15/0.81 % [INFO] Problem is higher-order (TPTP THF).
% 1.15/0.81 % [INFO] Type checking passed.
% 1.15/0.82 % [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.61/1.08 % External prover 'e' found a proof!
% 1.61/1.08 % [INFO] Killing All external provers ...
% 1.61/1.08 % Time passed: 877ms (effective reasoning time: 542ms)
% 1.61/1.08 % 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.61/1.08 % Axioms used in derivation (0):
% 1.61/1.08 % No. of inferences in proof: 4
% 1.61/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 877 ms resp. 542 ms w/o parsing
% 1.61/1.10 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.61/1.10 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------