%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET595+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 : n018.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:30:23 AM UTC 2026
% Result : Theorem 28.34s 8.30s
% Output : Refutation 28.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 20 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 68 ( 13 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 193 ( 5 ~; 3 |; 14 &; 140 @)
% ( 7 <=>; 24 =>; 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 : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 0 ^; 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(union_decl,type,
union: $i > $i > $i ).
thf(difference_decl,type,
difference: $i > $i > $i ).
thf(member_decl,type,
member: $i > $i > $o ).
thf(6,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(42,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)],[6]) ).
thf(9,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(65,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)],[9]) ).
thf(4,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(27,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)],[4]) ).
thf(10,axiom,
! [A: $i] : ( A @ ( A @ subset ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).
thf(86,plain,
! [A: $i] : ( A @ ( A @ subset ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ difference ) @ ( C @ member ) )
<=> ( ~ ( B @ ( C @ member ) )
& ( A @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
thf(35,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ~ ( B @ ( C @ member ) )
& ( A @ ( C @ member ) ) )
=> ( B @ ( A @ difference ) @ ( C @ member ) ) )
& ( ( B @ ( A @ difference ) @ ( C @ member ) )
=> ( ~ ( B @ ( C @ member ) )
& ( A @ ( C @ member ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
=> ( B
= ( A @ ( B @ difference ) @ ( A @ union ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th54) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
=> ( B
= ( A @ ( B @ difference ) @ ( A @ union ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(11,plain,
~ ! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
=> ( B
= ( A @ ( B @ difference ) @ ( A @ union ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ union ) )
= ( A @ ( B @ union ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
thf(62,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ union ) )
= ( A @ ( B @ union ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( A = B )
<=> ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
thf(50,plain,
! [A: $i,B: $i] :
( ( ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) )
=> ( A = B ) )
& ( ( A = B )
=> ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ! [C: $i] :
( ( A @ ( C @ member ) )
<=> ( B @ ( C @ member ) ) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_equal) ).
thf(16,plain,
! [A: $i,B: $i] :
( ! [C: $i] :
( ( ( B @ ( C @ member ) )
=> ( A @ ( C @ member ) ) )
& ( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12152,plain,
$false,
inference(e,[status(thm)],[42,65,27,86,35,11,62,50,16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET595+3 : TPTP v9.3.1. Released v2.2.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.13/0.39 % Computer : n018.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:00:21 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 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.89/0.98 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.28/1.17 % [INFO] Parsing done (188ms).
% 1.28/1.19 % [INFO] Running in sequential loop mode.
% 2.09/1.60 % [INFO] eprover registered as external prover.
% 2.09/1.61 % [INFO] Scanning for conjecture ...
% 2.26/1.71 % [INFO] Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ...
% 2.26/1.74 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 2.26/1.77 % [INFO] Problem is first-order (TPTP FOF).
% 2.26/1.77 % [INFO] Type checking passed.
% 2.26/1.78 % [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 ...
% 30.35/8.29 % External prover 'e' found a proof!
% 30.35/8.29 % [INFO] Killing All external provers ...
% 30.35/8.30 % Time passed: 7757ms (effective reasoning time: 7101ms)
% 30.35/8.30 % 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)>
% 28.34/8.30 % Axioms used in derivation (8): reflexivity_of_subset, equal_member_defn, member_equal, equal_defn, difference_defn, commutativity_of_union, union_defn, subset_defn
% 28.34/8.30 % No. of inferences in proof: 20
% 28.34/8.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 7757 ms resp. 7101 ms w/o parsing
% 28.34/8.33 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 28.34/8.33 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------