%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET941+1 : TPTP v9.3.1. Released v3.2.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 : n005.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 : Sun Sep 27 08:31:23 AM UTC 2026
% Result : Theorem 3.83s 2.44s
% Output : Refutation 4.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 3 equ; 0 cnn)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 125 ( 6 ~; 0 |; 9 &; 88 @)
% ( 3 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 0 ^; 30 !; 9 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(union_decl,type,
union: $i > $i ).
thf(empty_decl,type,
empty: $i > $o ).
thf(7,axiom,
? [A: $i] :
~ ( A @ empty ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(52,plain,
? [A: $i] :
~ ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ! [C: $i] :
( ( A @ ( C @ in ) )
=> ( B @ ( C @ subset ) ) )
=> ( B @ ( A @ union @ subset ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t94_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ! [C: $i] :
( ( A @ ( C @ in ) )
=> ( B @ ( C @ subset ) ) )
=> ( B @ ( A @ union @ subset ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
~ ! [A: $i,B: $i] :
( ! [C: $i] :
( ( A @ ( C @ in ) )
=> ( B @ ( C @ subset ) ) )
=> ( B @ ( A @ union @ subset ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ in ) )
=> ~ ( A @ ( B @ in ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(13,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ in ) )
=> ~ ( A @ ( B @ in ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(6,axiom,
? [A: $i] : ( A @ empty ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(50,plain,
? [A: $i] : ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
<=> ! [C: $i] :
( ( A @ ( C @ in ) )
=> ( B @ ( C @ in ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
thf(15,plain,
! [A: $i,B: $i] :
( ( ! [C: $i] :
( ( A @ ( C @ in ) )
=> ( B @ ( C @ in ) ) )
=> ( B @ ( A @ subset ) ) )
& ( ( B @ ( A @ subset ) )
=> ! [C: $i] :
( ( A @ ( C @ in ) )
=> ( B @ ( C @ in ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(8,axiom,
! [A: $i,B: $i] : ( A @ ( A @ subset ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(55,plain,
! [A: $i] : ( A @ ( A @ subset ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( B
= ( A @ union ) )
<=> ! [C: $i] :
( ( B @ ( C @ in ) )
<=> ? [D: $i] :
( ( A @ ( D @ in ) )
& ( D @ ( C @ in ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
thf(23,plain,
! [A: $i,B: $i] :
( ( ! [C: $i] :
( ( ? [D: $i] :
( ( A @ ( D @ in ) )
& ( D @ ( C @ in ) ) )
=> ( B @ ( C @ in ) ) )
& ( ( B @ ( C @ in ) )
=> ? [D: $i] :
( ( A @ ( D @ in ) )
& ( D @ ( C @ in ) ) ) ) )
=> ( B
= ( A @ union ) ) )
& ( ( B
= ( A @ union ) )
=> ! [C: $i] :
( ( ? [D: $i] :
( ( A @ ( D @ in ) )
& ( D @ ( C @ in ) ) )
=> ( B @ ( C @ in ) ) )
& ( ( B @ ( C @ in ) )
=> ? [D: $i] :
( ( A @ ( D @ in ) )
& ( D @ ( C @ in ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(60,plain,
$false,
inference(e,[status(thm)],[52,9,13,50,15,55,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET941+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % 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.13/0.39 % Computer : n005.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sat Sep 26 08:27:17 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 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.88/0.99 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.26/1.17 % [INFO] Parsing done (186ms).
% 1.26/1.19 % [INFO] Running in sequential loop mode.
% 1.84/1.59 % [INFO] eprover registered as external prover.
% 2.04/1.60 % [INFO] Scanning for conjecture ...
% 2.21/1.70 % [INFO] Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ...
% 2.21/1.74 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 2.21/1.75 % [INFO] Problem is first-order (TPTP FOF).
% 2.21/1.76 % [INFO] Type checking passed.
% 2.21/1.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 ...
% 3.83/2.44 % External prover 'e' found a proof!
% 3.83/2.44 % [INFO] Killing All external provers ...
% 3.83/2.44 % Time passed: 1898ms (effective reasoning time: 1245ms)
% 3.83/2.44 % 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.83/2.44 % Axioms used in derivation (6): d4_tarski, rc1_xboole_0, rc2_xboole_0, antisymmetry_r2_hidden, d3_tarski, reflexivity_r1_tarski
% 3.83/2.44 % No. of inferences in proof: 16
% 3.83/2.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1898 ms resp. 1245 ms w/o parsing
% 4.08/2.50 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.08/2.50 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------