%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET901+1 : TPTP v9.3.1. Released v3.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 : n009.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:17 AM UTC 2026
% Result : Theorem 4.71s 3.10s
% Output : Refutation 4.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 30 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 143 ( 39 ~; 0 |; 23 &; 74 @)
% ( 3 <=>; 4 =>; 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 : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 ^; 22 !; 4 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(unordered_pair_decl,type,
unordered_pair: $i > $i > $i ).
thf(empty_set_decl,type,
empty_set: $i ).
thf(singleton_decl,type,
singleton: $i > $i ).
thf(empty_decl,type,
empty: $i > $o ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ unordered_pair ) )
= ( A @ ( B @ unordered_pair ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(24,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ unordered_pair ) )
= ( A @ ( B @ unordered_pair ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
empty_set @ empty,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
thf(29,plain,
empty_set @ empty,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ subset ) )
<=> ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t42_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ subset ) )
<=> ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) )
=> ( C @ ( B @ unordered_pair ) @ ( A @ subset ) ) )
& ( ( C @ ( B @ unordered_pair ) @ ( A @ subset ) )
=> ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,axiom,
? [A: $i] :
~ ( A @ empty ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(32,plain,
? [A: $i] :
~ ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(4,axiom,
! [A: $i,B: $i] : ( A @ ( A @ subset ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(27,plain,
! [A: $i] : ( A @ ( A @ subset ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(8,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ unordered_pair ) @ ( A @ subset ) )
<=> ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l46_zfmisc_1) ).
thf(35,plain,
! [A: $i,B: $i,C: $i] :
( ( ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) )
=> ( C @ ( B @ unordered_pair ) @ ( A @ subset ) ) )
& ( ( C @ ( B @ unordered_pair ) @ ( A @ subset ) )
=> ~ ( ( A
!= ( C @ ( B @ unordered_pair ) ) )
& ( A
!= ( C @ singleton ) )
& ( A
!= ( B @ singleton ) )
& ( A != empty_set ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(6,axiom,
? [A: $i] : ( A @ empty ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(30,plain,
? [A: $i] : ( A @ empty ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(58,plain,
$false,
inference(e,[status(thm)],[24,29,9,32,27,35,30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET901+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.12 % 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.22/0.50 % Computer : n009.cluster.edu
% 0.22/0.50 % Model : x86_64 x86_64
% 0.22/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.50 % Memory : 8046.5625MB
% 0.22/0.50 % OS : Linux 6.8.0-71-generic
% 0.22/0.50 % CPULimit : 300
% 0.22/0.50 % WCLimit : 300
% 0.22/0.50 % DateTime : Sat Sep 26 08:25:00 UTC 2026
% 0.22/0.50 % CPUTime :
% 0.22/0.50 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.27/1.21 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.60/1.46 % [INFO] Parsing done (252ms).
% 1.60/1.48 % [INFO] Running in sequential loop mode.
% 2.57/2.08 % [INFO] eprover registered as external prover.
% 2.57/2.10 % [INFO] Scanning for conjecture ...
% 2.81/2.24 % [INFO] Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ...
% 2.81/2.29 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 2.96/2.30 % [INFO] Problem is first-order (TPTP FOF).
% 2.96/2.31 % [INFO] Type checking passed.
% 2.96/2.32 % [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.71/3.10 % External prover 'e' found a proof!
% 4.71/3.10 % [INFO] Killing All external provers ...
% 4.71/3.10 % Time passed: 2415ms (effective reasoning time: 1612ms)
% 4.71/3.10 % 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.71/3.10 % Axioms used in derivation (6): fc1_xboole_0, l46_zfmisc_1, commutativity_k2_tarski, reflexivity_r1_tarski, rc1_xboole_0, rc2_xboole_0
% 4.71/3.10 % No. of inferences in proof: 16
% 4.71/3.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2415 ms resp. 1612 ms w/o parsing
% 4.71/3.14 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.71/3.14 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------