%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU569^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 : n017.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:34 AM UTC 2026
% Result : Theorem 3.18s 2.06s
% Output : Refutation 3.18s
% 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 : 14 ( 1 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 2 ~; 0 |; 0 &; 18 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 ^; 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(subsetI2_decl,type,
subsetI2: $o ).
thf(subsetI2_def,definition,
( subsetI2
= ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) ) ) ) ).
thf(1,conjecture,
( subsetI2
=> ! [A: $i] : ( subset @ A @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetRefl) ).
thf(2,negated_conjecture,
~ ( subsetI2
=> ! [A: $i] : ( subset @ A @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) )
=> ! [A: $i] : ( subset @ A @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(11,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU569^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % 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.10/0.22 % Computer : n017.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Tue Sep 29 13:46:22 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 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.98/0.80 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.97 % [INFO] Parsing done (167ms).
% 1.17/0.99 % [INFO] Running in sequential loop mode.
% 1.73/1.39 % [INFO] eprover registered as external prover.
% 1.73/1.39 % [INFO] Scanning for conjecture ...
% 1.91/1.49 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.05/1.52 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.05/1.52 % [INFO] Problem is higher-order (TPTP THF).
% 2.05/1.52 % [INFO] Type checking passed.
% 2.05/1.53 % [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.18/2.05 % External prover 'e' found a proof!
% 3.18/2.05 % [INFO] Killing All external provers ...
% 3.18/2.05 % Time passed: 1688ms (effective reasoning time: 1061ms)
% 3.18/2.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)>
% 3.18/2.06 % Axioms used in derivation (0):
% 3.18/2.06 % No. of inferences in proof: 4
% 3.18/2.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1688 ms resp. 1061 ms w/o parsing
% 3.18/2.08 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.18/2.08 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------