%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET591+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n016.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:22 AM UTC 2026
% Result : Theorem 4.55s 2.89s
% Output : Refutation 4.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 44 ( 6 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 121 ( 10 ~; 0 |; 10 &; 83 @)
% ( 4 <=>; 14 =>; 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 : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(difference_decl,type,
difference: $i > $i > $i ).
thf(empty_set_decl,type,
empty_set: $i ).
thf(member_decl,type,
member: $i > $i > $o ).
thf(empty_decl,type,
empty: $i > $o ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( A = B )
<=> ( ( A @ ( B @ subset ) )
& ( B @ ( A @ subset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
thf(33,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)],[6]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( A @ ( B @ difference ) @ ( A @ subset ) )
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th50) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( A @ ( B @ difference ) @ ( A @ subset ) )
=> ( A = empty_set ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
~ ! [A: $i,B: $i] :
( ( A @ ( B @ difference ) @ ( A @ subset ) )
=> ( A = empty_set ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,axiom,
! [A: $i] : ( A @ ( A @ subset ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
thf(45,plain,
! [A: $i] : ( A @ ( A @ subset ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ difference ) @ ( C @ member ) )
<=> ( ~ ( B @ ( C @ member ) )
& ( A @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
thf(23,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)],[4]) ).
thf(5,axiom,
! [A: $i] :
~ ( empty_set @ ( A @ member ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
thf(30,plain,
! [A: $i] :
~ ( empty_set @ ( A @ member ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(8,axiom,
! [A: $i] :
( ( A @ empty )
<=> ! [B: $i] :
~ ( A @ ( B @ member ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_defn) ).
thf(47,plain,
! [A: $i] :
( ( ! [B: $i] :
~ ( A @ ( B @ member ) )
=> ( A @ empty ) )
& ( ( A @ empty )
=> ! [B: $i] :
~ ( A @ ( B @ member ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ subset ) )
<=> ! [C: $i] :
( ( A @ ( C @ member ) )
=> ( B @ ( C @ member ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
thf(15,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)],[3]) ).
thf(57,plain,
$false,
inference(e,[status(thm)],[33,9,45,23,30,47,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET591+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.41 % Computer : n016.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Sat Sep 26 08:02:46 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 1.07/1.15 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.53/1.39 % [INFO] Parsing done (240ms).
% 1.74/1.41 % [INFO] Running in sequential loop mode.
% 2.61/1.91 % [INFO] eprover registered as external prover.
% 2.61/1.92 % [INFO] Scanning for conjecture ...
% 2.61/2.02 % [INFO] Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ...
% 2.91/2.05 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 2.91/2.07 % [INFO] Problem is first-order (TPTP FOF).
% 2.91/2.07 % [INFO] Type checking passed.
% 2.91/2.08 % [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 ...
% 4.55/2.89 % External prover 'e' found a proof!
% 4.55/2.89 % [INFO] Killing All external provers ...
% 4.55/2.89 % Time passed: 2283ms (effective reasoning time: 1468ms)
% 4.55/2.89 % 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)>
% 4.55/2.89 % Axioms used in derivation (6): reflexivity_of_subset, empty_set_defn, empty_defn, difference_defn, equal_defn, subset_defn
% 4.55/2.89 % No. of inferences in proof: 16
% 4.55/2.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2283 ms resp. 1468 ms w/o parsing
% 4.96/2.93 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.96/2.93 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------