%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU527_8 : TPTP v9.3.1. Released v8.0.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 : n006.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:39:16 AM UTC 2026
% Result : Theorem 5.00s 12.75s
% Output : Refutation 5.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 20 unt; 0 typ; 2 def)
% Number of atoms : 96 ( 33 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 230 ( 28 ~; 35 |; 6 &; 126 @)
% ( 0 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 64 ( 0 ^; 62 !; 0 ?; 64 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(emptyset_decl,type,
emptyset: $i ).
thf(setadjoin_decl,type,
setadjoin: $i > $i > $i ).
thf(emptysetE_decl,type,
emptysetE: $o ).
thf(setadjoinE_decl,type,
setadjoinE: $o ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i] :
( ( emptyset @ ( B @ setadjoin ) @ ( A @ in ) )
=> ( A = B ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ( ( emptyset @ ( A @ setadjoin ) @ ( sk1 @ in ) )
=> ( sk1 = A ) ) ) ) ).
thf(4,axiom,
( emptysetE
= ( ! [A: $i] :
( ( emptyset @ ( A @ in ) )
=> ! [B: $o] : B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE) ).
thf(14,plain,
( emptysetE
= ( ! [A: $i] :
( ( emptyset @ ( A @ in ) )
=> ! [B: $o] : B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(15,plain,
( emptysetE
= ( ! [A: $i] :
( ( emptyset @ ( A @ in ) )
=> ! [B: $o] : B ) ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(1,conjecture,
( emptysetE
=> ( setadjoinE
=> ! [A: $i,B: $i] :
( ( emptyset @ ( B @ setadjoin ) @ ( A @ in ) )
=> ( A = B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(2,negated_conjecture,
~ ( emptysetE
=> ( setadjoinE
=> ! [A: $i,B: $i] :
( ( emptyset @ ( B @ setadjoin ) @ ( A @ in ) )
=> ( A = B ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ( emptysetE
=> ( setadjoinE
=> ! [A: $i,B: $i] :
( ( emptyset @ ( B @ setadjoin ) @ ( A @ in ) )
=> ( A = B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ( sk1 != sk2 )
& ( emptyset @ ( sk2 @ setadjoin ) @ ( sk1 @ in ) )
& setadjoinE
& emptysetE ),
inference(cnf,[status(esa)],[5]) ).
thf(7,plain,
emptysetE,
inference(cnfConj,[status(thm)],[6]) ).
thf(16,plain,
! [A: $i] :
( ( emptyset @ ( A @ in ) )
=> ! [B: $o] : B ),
inference(rewrite,[status(thm)],[15,7]) ).
thf(17,plain,
! [B: $o,A: $i] :
( B
| ~ ( emptyset @ ( A @ in ) ) ),
inference(cnf,[status(esa)],[16]) ).
thf(23,plain,
! [B: $o,A: $i] :
( ~ $true
| ( B
!= ( ~ ( emptyset @ ( A @ in ) ) ) )
| ~ ( emptyset @ ( A @ in ) ) ),
inference(eqfactor_ordered,[status(thm)],[17]) ).
thf(33,plain,
! [A: $i] :
~ ( emptyset @ ( A @ in ) ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( D )),bind(B,$thf( ~ ( emptyset @ ( D @ in ) ) ))]]) ).
thf(35,plain,
! [A: $i] :
~ ( emptyset @ ( A @ in ) ),
inference(simp,[status(thm)],[33]) ).
thf(9,plain,
emptyset @ ( sk2 @ setadjoin ) @ ( sk1 @ in ),
inference(cnfConj,[status(thm)],[6]) ).
thf(3,axiom,
( setadjoinE
= ( ! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ setadjoin ) @ ( C @ in ) )
=> ! [D: $o] :
( ( ( C = A )
=> D )
=> ( ( ( B @ ( C @ in ) )
=> D )
=> D ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinE) ).
thf(12,plain,
( setadjoinE
= ( ! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ setadjoin ) @ ( C @ in ) )
=> ! [D: $o] :
( ( ( C = A )
=> D )
=> ( ( ( B @ ( C @ in ) )
=> D )
=> D ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(13,plain,
( setadjoinE
= ( ! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ setadjoin ) @ ( C @ in ) )
=> ! [D: $o] :
( ( ( C = A )
=> D )
=> ( ( ( B @ ( C @ in ) )
=> D )
=> D ) ) ) ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(8,plain,
setadjoinE,
inference(cnfConj,[status(thm)],[6]) ).
thf(44,plain,
! [A: $i,B: $i,C: $i] :
( ( B @ ( A @ setadjoin ) @ ( C @ in ) )
=> ! [D: $o] :
( ( ( C = A )
=> D )
=> ( ( ( B @ ( C @ in ) )
=> D )
=> D ) ) ),
inference(rewrite,[status(thm)],[13,8]) ).
thf(45,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( D
| ~ D
| ~ D
| ~ ( B @ ( A @ setadjoin ) @ ( C @ in ) ) )
& ( D
| ( B @ ( C @ in ) )
| ~ D
| ~ ( B @ ( A @ setadjoin ) @ ( C @ in ) ) )
& ( D
| ~ D
| ( C = A )
| ~ ( B @ ( A @ setadjoin ) @ ( C @ in ) ) )
& ( D
| ( B @ ( C @ in ) )
| ( C = A )
| ~ ( B @ ( A @ setadjoin ) @ ( C @ in ) ) ) ),
inference(cnf,[status(esa)],[44]) ).
thf(46,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( D
| ( B @ ( C @ in ) )
| ( C = A )
| ~ ( B @ ( A @ setadjoin ) @ ( C @ in ) ) ),
inference(cnfConj,[status(thm)],[45]) ).
thf(78,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( D
| ( B @ ( C @ in ) )
| ~ ( B @ ( A @ setadjoin ) @ ( C @ in ) )
| ( C = A ) ),
inference(lifteq,[status(thm)],[46]) ).
thf(102,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( ( emptyset @ ( sk2 @ setadjoin ) @ ( sk1 @ in ) )
!= ( B @ ( A @ setadjoin ) @ ( C @ in ) ) )
| D
| ( B @ ( C @ in ) )
| ~ $true
| ( C = A ) ),
inference(paramod_ordered,[status(thm)],[9,78]) ).
thf(103,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( ( emptyset @ ( sk2 @ setadjoin ) @ ( sk1 @ in ) )
!= ( B @ ( A @ setadjoin ) @ ( C @ in ) ) )
| D
| ( B @ ( C @ in ) )
| ( C = A ) ),
inference(simp,[status(thm)],[102]) ).
thf(104,plain,
! [A: $o] :
( A
| ( emptyset @ ( sk1 @ in ) )
| ( sk2 = sk1 ) ),
inference(pattern_uni,[status(thm)],[103:[bind(A,$thf( sk2 )),bind(B,$thf( emptyset )),bind(C,$thf( sk1 ))]]) ).
thf(160,plain,
! [A: $o] :
( A
| ( emptyset @ ( sk1 @ in ) )
| ( sk2 = sk1 ) ),
inference(simp,[status(thm)],[104]) ).
thf(241,plain,
! [A: $o] :
( A
| $false
| ( sk2 = sk1 ) ),
inference(rewrite,[status(thm)],[160,35]) ).
thf(242,plain,
! [A: $o] :
( A
| ( sk2 = sk1 ) ),
inference(simp,[status(thm)],[241]) ).
thf(10,plain,
sk1 != sk2,
inference(cnfConj,[status(thm)],[6]) ).
thf(11,plain,
sk2 != sk1,
inference(lifteq,[status(thm)],[10]) ).
thf(243,plain,
! [A: $o] : A,
inference(simplifyReflect,[status(thm)],[242,11]) ).
thf(246,plain,
~ $true,
inference(rewrite,[status(thm)],[35,243]) ).
thf(247,plain,
$false,
inference(simp,[status(thm)],[246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU527_8 : TPTP v9.3.1. Released v8.0.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.15/10.41 % Computer : n006.cluster.edu
% 0.15/10.41 % Model : x86_64 x86_64
% 0.15/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/10.41 % Memory : 8046.5625MB
% 0.15/10.41 % OS : Linux 6.8.0-71-generic
% 0.15/10.41 % CPULimit : 300
% 0.15/10.41 % WCLimit : 300
% 0.15/10.41 % DateTime : Sat Sep 26 10:09:07 UTC 2026
% 0.15/10.41 % CPUTime :
% 0.15/10.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
% 0.18/11.00 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.27/11.20 % [INFO] Parsing done (190ms).
% 1.40/11.21 % [INFO] Running in sequential loop mode.
% 2.00/11.62 % [INFO] eprover registered as external prover.
% 2.00/11.63 % [INFO] Scanning for conjecture ...
% 2.00/11.70 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.20/11.71 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.20/11.75 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.20/11.79 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.20/11.79 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.20/11.80 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.37/11.80 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.37/11.80 % [INFO] Type checking passed.
% 2.37/11.81 % [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 ...
% 5.00/12.75 % [INFO] Killing All external provers ...
% 5.00/12.75 % Time passed: 2189ms (effective reasoning time: 1529ms)
% 5.00/12.75 % 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)>
% 5.00/12.75 % Axioms used in derivation (2): emptysetE, setadjoinE
% 5.00/12.75 % No. of inferences in proof: 33
% 5.00/12.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2189 ms resp. 1529 ms w/o parsing
% 5.00/12.78 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.00/12.78 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------