%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET014+3 : TPTP v9.3.1. Released v2.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 : n003.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:28:50 AM UTC 2026
% Result : Theorem 5.61s 3.65s
% Output : Refutation 6.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 45 ( 5 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 131 ( 2 ~; 3 |; 8 &; 98 @)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 35 ( 0 ^; 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(union_decl,type,
union: $i > $i > $i ).
thf(member_decl,type,
member: $i > $i > $o ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ union ) )
= ( A @ ( B @ union ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
thf(29,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ union ) )
= ( A @ ( B @ union ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
<=> ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
thf(21,plain,
! [A: $i,B: $i] :
( ( ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) )
=> ( B @ ( A @ subset ) ) )
& ( ( B @ ( A @ subset ) )
=> ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ union ) @ ( C @ member ) )
<=> ( ( B @ ( C @ member ) )
| ( A @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
thf(13,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( B @ ( C @ member ) )
| ( A @ ( C @ member ) ) )
=> ( B @ ( A @ union ) @ ( C @ member ) ) )
& ( ( B @ ( A @ union ) @ ( C @ member ) )
=> ( ( B @ ( C @ member ) )
| ( A @ ( C @ member ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( B @ ( C @ subset ) )
& ( B @ ( A @ subset ) ) )
=> ( B @ ( C @ ( A @ union ) @ subset ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_subset) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( B @ ( C @ subset ) )
& ( B @ ( A @ subset ) ) )
=> ( B @ ( C @ ( A @ union ) @ subset ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( B @ ( C @ subset ) )
& ( B @ ( A @ subset ) ) )
=> ( B @ ( C @ ( A @ union ) @ subset ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,axiom,
! [A: $i] : ( A @ ( A @ subset ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).
thf(32,plain,
! [A: $i] : ( A @ ( A @ subset ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( A = B )
<=> ! [C: $i] :
( ( A @ ( C @ member ) )
<=> ( B @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
thf(34,plain,
! [A: $i,B: $i] :
( ( ! [C: $i] :
( ( ( B @ ( C @ member ) )
=> ( A @ ( C @ member ) ) )
& ( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) )
=> ( A = B ) )
& ( ( A = B )
=> ! [C: $i] :
( ( ( B @ ( C @ member ) )
=> ( A @ ( C @ member ) ) )
& ( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(82,plain,
$false,
inference(e,[status(thm)],[29,21,13,8,32,34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET014+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.13 % 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.22/0.48 % Computer : n003.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Sat Sep 26 06:51:54 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 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
% 1.40/1.34 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.87/1.63 % [INFO] Parsing done (277ms).
% 1.87/1.65 % [INFO] Running in sequential loop mode.
% 2.77/2.25 % [INFO] eprover registered as external prover.
% 2.77/2.26 % [INFO] Scanning for conjecture ...
% 3.13/2.40 % [INFO] Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ...
% 3.13/2.45 % [INFO] Axiom selection finished. Selected 5 axioms (removed 0 axioms).
% 3.13/2.47 % [INFO] Problem is first-order (TPTP FOF).
% 3.13/2.48 % [INFO] Type checking passed.
% 3.13/2.49 % [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 ...
% 5.61/3.65 % External prover 'e' found a proof!
% 5.61/3.65 % [INFO] Killing All external provers ...
% 5.61/3.65 % Time passed: 2957ms (effective reasoning time: 1992ms)
% 5.61/3.65 % 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)>
% 5.61/3.65 % Axioms used in derivation (5): reflexivity_of_subset, equal_member_defn, commutativity_of_union, union_defn, subset_defn
% 5.61/3.65 % No. of inferences in proof: 14
% 5.61/3.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2957 ms resp. 1992 ms w/o parsing
% 6.17/3.71 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.17/3.71 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------