%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LAT382+1 : TPTP v9.3.1. Released v4.0.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 : n015.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 07:47:37 AM UTC 2026
% Result : Theorem 3.06s 1.59s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 32 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 146 ( 7 equ; 0 cnn)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 389 ( 5 ~; 0 |; 41 &; 270 @)
% ( 6 <=>; 67 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 72 ( 0 ^; 69 !; 3 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(aSet0_decl,type,
aSet0: $i > $o ).
thf(isEmpty0_decl,type,
isEmpty0: $i > $o ).
thf(aElementOf0_decl,type,
aElementOf0: $i > $i > $o ).
thf(aSubsetOf0_decl,type,
aSubsetOf0: $i > $i > $o ).
thf(aLowerBoundOfIn0_decl,type,
aLowerBoundOfIn0: $i > $i > $i > $o ).
thf(sdtlseqdt0_decl,type,
sdtlseqdt0: $i > $i > $o ).
thf(aUpperBoundOfIn0_decl,type,
aUpperBoundOfIn0: $i > $i > $i > $o ).
thf(aInfimumOfIn0_decl,type,
aInfimumOfIn0: $i > $i > $i > $o ).
thf(aSupremumOfIn0_decl,type,
aSupremumOfIn0: $i > $i > $i > $o ).
thf(xu_decl,type,
xu: $i ).
thf(xv_decl,type,
xv: $i ).
thf(aElement0_decl,type,
aElement0: $i > $o ).
thf(xT_decl,type,
xT: $i ).
thf(xS_decl,type,
xS: $i ).
thf(12,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i,D: $i] :
( ( ( A @ ( B @ ( D @ aSupremumOfIn0 ) ) )
& ( A @ ( B @ ( C @ aSupremumOfIn0 ) ) ) )
=> ( C = D ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSupUn) ).
thf(69,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i,D: $i] :
( ( ( A @ ( B @ ( D @ aSupremumOfIn0 ) ) )
& ( A @ ( B @ ( C @ aSupremumOfIn0 ) ) ) )
=> ( C = D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ aElement0 )
& ( B @ aElement0 )
& ( A @ aElement0 ) )
=> ( ( ( C @ ( B @ sdtlseqdt0 ) )
& ( B @ ( A @ sdtlseqdt0 ) ) )
=> ( C @ ( A @ sdtlseqdt0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTrans) ).
thf(24,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ aElement0 )
& ( B @ aElement0 )
& ( A @ aElement0 ) )
=> ( ( ( C @ ( B @ sdtlseqdt0 ) )
& ( B @ ( A @ sdtlseqdt0 ) ) )
=> ( C @ ( A @ sdtlseqdt0 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(16,axiom,
( ( xT @ ( xS @ ( xv @ aInfimumOfIn0 ) ) )
& ( xT @ ( xS @ ( xu @ aInfimumOfIn0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__792) ).
thf(84,plain,
( ( xT @ ( xS @ ( xv @ aInfimumOfIn0 ) ) )
& ( xT @ ( xS @ ( xu @ aInfimumOfIn0 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(15,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( A @ ( B @ ( C @ aInfimumOfIn0 ) ) )
<=> ( ! [D: $i] :
( ( A @ ( B @ ( D @ aLowerBoundOfIn0 ) ) )
=> ( C @ ( D @ sdtlseqdt0 ) ) )
& ( A @ ( B @ ( C @ aLowerBoundOfIn0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefInf) ).
thf(74,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( ( ! [D: $i] :
( ( A @ ( B @ ( D @ aLowerBoundOfIn0 ) ) )
=> ( C @ ( D @ sdtlseqdt0 ) ) )
& ( A @ ( B @ ( C @ aLowerBoundOfIn0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) )
=> ( A @ ( B @ ( C @ aInfimumOfIn0 ) ) ) )
& ( ( A @ ( B @ ( C @ aInfimumOfIn0 ) ) )
=> ( ! [D: $i] :
( ( A @ ( B @ ( D @ aLowerBoundOfIn0 ) ) )
=> ( C @ ( D @ sdtlseqdt0 ) ) )
& ( A @ ( B @ ( C @ aLowerBoundOfIn0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(14,axiom,
xT @ ( xS @ aSubsetOf0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773_01) ).
thf(73,plain,
xT @ ( xS @ aSubsetOf0 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(1,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
xu != xv,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(17,plain,
xu != xv,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
<=> ( ! [C: $i] :
( ( B @ ( C @ aElementOf0 ) )
=> ( A @ ( C @ aElementOf0 ) ) )
& ( B @ aSet0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
thf(39,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( ( ! [C: $i] :
( ( B @ ( C @ aElementOf0 ) )
=> ( A @ ( C @ aElementOf0 ) ) )
& ( B @ aSet0 ) )
=> ( A @ ( B @ aSubsetOf0 ) ) )
& ( ( A @ ( B @ aSubsetOf0 ) )
=> ( ! [C: $i] :
( ( B @ ( C @ aElementOf0 ) )
=> ( A @ ( C @ aElementOf0 ) ) )
& ( B @ aSet0 ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(7,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ( ( A @ isEmpty0 )
<=> ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmpty) ).
thf(35,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ( ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
=> ( A @ isEmpty0 ) )
& ( ( A @ isEmpty0 )
=> ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(9,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aElementOf0 ) )
=> ( B @ aElement0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
thf(48,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aElementOf0 ) )
=> ( B @ aElement0 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(10,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( A @ ( B @ ( C @ aLowerBoundOfIn0 ) ) )
<=> ( ! [D: $i] :
( ( B @ ( D @ aElementOf0 ) )
=> ( D @ ( C @ sdtlseqdt0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLB) ).
thf(50,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( ( ! [D: $i] :
( ( B @ ( D @ aElementOf0 ) )
=> ( D @ ( C @ sdtlseqdt0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) )
=> ( A @ ( B @ ( C @ aLowerBoundOfIn0 ) ) ) )
& ( ( A @ ( B @ ( C @ aLowerBoundOfIn0 ) ) )
=> ( ! [D: $i] :
( ( B @ ( D @ aElementOf0 ) )
=> ( D @ ( C @ sdtlseqdt0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(13,axiom,
xT @ aSet0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773) ).
thf(72,plain,
xT @ aSet0,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(6,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( A @ ( B @ ( C @ aUpperBoundOfIn0 ) ) )
<=> ( ! [D: $i] :
( ( B @ ( D @ aElementOf0 ) )
=> ( C @ ( D @ sdtlseqdt0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefUB) ).
thf(26,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( ( ! [D: $i] :
( ( B @ ( D @ aElementOf0 ) )
=> ( C @ ( D @ sdtlseqdt0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) )
=> ( A @ ( B @ ( C @ aUpperBoundOfIn0 ) ) ) )
& ( ( A @ ( B @ ( C @ aUpperBoundOfIn0 ) ) )
=> ( ! [D: $i] :
( ( B @ ( D @ aElementOf0 ) )
=> ( C @ ( D @ sdtlseqdt0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( ( B @ aElement0 )
& ( A @ aElement0 ) )
=> ( ( ( A @ ( B @ sdtlseqdt0 ) )
& ( B @ ( A @ sdtlseqdt0 ) ) )
=> ( A = B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
thf(19,plain,
! [A: $i,B: $i] :
( ( ( B @ aElement0 )
& ( A @ aElement0 ) )
=> ( ( ( A @ ( B @ sdtlseqdt0 ) )
& ( B @ ( A @ sdtlseqdt0 ) ) )
=> ( A = B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i] :
( ( A @ aElement0 )
=> ( A @ ( A @ sdtlseqdt0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mARefl) ).
thf(22,plain,
! [A: $i] :
( ( A @ aElement0 )
=> ( A @ ( A @ sdtlseqdt0 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(11,axiom,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( A @ ( B @ ( C @ aSupremumOfIn0 ) ) )
<=> ( ! [D: $i] :
( ( A @ ( B @ ( D @ aUpperBoundOfIn0 ) ) )
=> ( D @ ( C @ sdtlseqdt0 ) ) )
& ( A @ ( B @ ( C @ aUpperBoundOfIn0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSup) ).
thf(59,plain,
! [A: $i] :
( ( A @ aSet0 )
=> ! [B: $i] :
( ( A @ ( B @ aSubsetOf0 ) )
=> ! [C: $i] :
( ( ( ! [D: $i] :
( ( A @ ( B @ ( D @ aUpperBoundOfIn0 ) ) )
=> ( D @ ( C @ sdtlseqdt0 ) ) )
& ( A @ ( B @ ( C @ aUpperBoundOfIn0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) )
=> ( A @ ( B @ ( C @ aSupremumOfIn0 ) ) ) )
& ( ( A @ ( B @ ( C @ aSupremumOfIn0 ) ) )
=> ( ! [D: $i] :
( ( A @ ( B @ ( D @ aUpperBoundOfIn0 ) ) )
=> ( D @ ( C @ sdtlseqdt0 ) ) )
& ( A @ ( B @ ( C @ aUpperBoundOfIn0 ) ) )
& ( A @ ( C @ aElementOf0 ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(92,plain,
$false,
inference(e,[status(thm)],[69,24,84,74,73,17,39,35,48,50,72,26,19,22,59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT382+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % 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.14/0.39 % Computer : n015.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Fri Sep 25 21:40:59 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 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.59/0.69 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.99/0.80 % [INFO] Parsing done (105ms).
% 0.99/0.81 % [INFO] Running in sequential loop mode.
% 1.25/0.99 % [INFO] eprover registered as external prover.
% 1.25/1.00 % [INFO] Scanning for conjecture ...
% 1.25/1.02 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.03 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.04 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.04 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.04 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.05 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.06 % [INFO] Found a conjecture (or negated_conjecture) and 17 axioms. Running axiom selection ...
% 1.55/1.09 % [INFO] Axiom selection finished. Selected 14 axioms (removed 3 axioms).
% 1.55/1.10 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.10 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.10 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.11 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.11 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.11 % [INFO] Definitions in FOF are currently treated as axioms.
% 1.55/1.11 % [INFO] Problem is first-order (TPTP FOF).
% 1.55/1.11 % [INFO] Type checking passed.
% 1.55/1.12 % [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.06/1.59 % External prover 'e' found a proof!
% 3.06/1.59 % [INFO] Killing All external provers ...
% 3.06/1.59 % Time passed: 1108ms (effective reasoning time: 784ms)
% 3.06/1.59 % 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.06/1.59 % Axioms used in derivation (14): mDefSup, mDefUB, mTrans, mARefl, mDefLB, m__792, mDefInf, m__773_01, mASymm, m__773, mDefSub, mSupUn, mEOfElem, mDefEmpty
% 3.06/1.59 % No. of inferences in proof: 32
% 3.06/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1108 ms resp. 784 ms w/o parsing
% 3.48/1.63 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.48/1.63 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------