%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU159+3 : 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 : 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:37:49 AM UTC 2026
% Result : Theorem 3.89s 18.14s
% Output : Refutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 18 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 52 ( 15 equ; 0 cnn)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 130 ( 6 ~; 5 |; 9 &; 90 @)
% ( 5 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 40 ( 0 ^; 36 !; 4 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(unordered_pair_decl,type,
unordered_pair: $i > $i > $i ).
thf(in_decl,type,
in: $i > $i > $o ).
thf(empty_decl,type,
empty: $i > $o ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ unordered_pair ) @ subset ) )
<=> ( ( C @ ( B @ in ) )
& ( C @ ( A @ in ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ unordered_pair ) @ subset ) )
<=> ( ( C @ ( B @ in ) )
& ( C @ ( A @ in ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(10,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( ( C @ ( B @ in ) )
& ( C @ ( A @ in ) ) )
=> ( C @ ( B @ ( A @ unordered_pair ) @ subset ) ) )
& ( ( C @ ( B @ ( A @ unordered_pair ) @ subset ) )
=> ( ( C @ ( B @ in ) )
& ( C @ ( A @ in ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ unordered_pair ) )
= ( A @ ( B @ unordered_pair ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(20,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ unordered_pair ) )
= ( A @ ( B @ unordered_pair ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(8,axiom,
? [A: $i] :
~ ( A @ empty ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(60,plain,
? [A: $i] :
~ ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(6,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(50,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)],[6]) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( C
= ( B @ ( A @ unordered_pair ) ) )
<=> ! [D: $i] :
( ( C @ ( D @ in ) )
<=> ( ( D = B )
| ( D = A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
thf(23,plain,
! [A: $i,B: $i,C: $i] :
( ( ! [D: $i] :
( ( ( ( D = B )
| ( D = A ) )
=> ( C @ ( D @ in ) ) )
& ( ( C @ ( D @ in ) )
=> ( ( D = B )
| ( D = A ) ) ) )
=> ( C
= ( B @ ( A @ unordered_pair ) ) ) )
& ( ( C
= ( B @ ( A @ unordered_pair ) ) )
=> ! [D: $i] :
( ( ( ( D = B )
| ( D = A ) )
=> ( C @ ( D @ in ) ) )
& ( ( C @ ( D @ in ) )
=> ( ( D = B )
| ( D = A ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(7,axiom,
? [A: $i] : ( A @ empty ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(58,plain,
? [A: $i] : ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(9,axiom,
! [A: $i,B: $i] : ( A @ ( A @ subset ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(63,plain,
! [A: $i] : ( A @ ( A @ subset ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ in ) )
=> ~ ( A @ ( B @ in ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(18,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ in ) )
=> ~ ( A @ ( B @ in ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(68,plain,
$false,
inference(e,[status(thm)],[10,20,60,50,23,58,63,18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU159+3 : TPTP v9.3.1. Released v3.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.09/5.38 % Computer : n016.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.31/16.10 % CPULimit : 300
% 0.31/16.10 % WCLimit : 300
% 0.31/16.10 % DateTime : Sat Sep 26 08:43:26 UTC 2026
% 0.31/16.10 % CPUTime :
% 0.31/16.10 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.39/16.69 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.39/16.87 % [INFO] Parsing done (176ms).
% 0.39/16.88 % [INFO] Running in sequential loop mode.
% 1.93/17.30 % [INFO] eprover registered as external prover.
% 2.12/17.31 % [INFO] Scanning for conjecture ...
% 2.27/17.40 % [INFO] Found a conjecture (or negated_conjecture) and 7 axioms. Running axiom selection ...
% 2.27/17.44 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 2.27/17.45 % [INFO] Problem is first-order (TPTP FOF).
% 2.27/17.46 % [INFO] Type checking passed.
% 2.27/17.47 % [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.89/18.14 % External prover 'e' found a proof!
% 3.89/18.14 % [INFO] Killing All external provers ...
% 3.89/18.14 % Time passed: 1892ms (effective reasoning time: 1252ms)
% 3.89/18.14 % 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.89/18.14 % Axioms used in derivation (7): d2_tarski, commutativity_k2_tarski, rc1_xboole_0, rc2_xboole_0, antisymmetry_r2_hidden, d3_tarski, reflexivity_r1_tarski
% 3.89/18.14 % No. of inferences in proof: 18
% 3.89/18.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1892 ms resp. 1252 ms w/o parsing
% 3.89/18.19 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.89/18.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------