%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU704^2 : TPTP v9.3.1. Released v3.7.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 : 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 : Wed Sep 30 08:29:05 AM UTC 2026
% Result : Theorem 6.95s 3.60s
% Output : Refutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 6 unt; 0 typ; 5 def)
% Number of atoms : 79 ( 35 equ; 0 cnn)
% Maximal formula atoms : 22 ( 8 avg)
% Number of connectives : 192 ( 18 ~; 12 |; 26 &; 94 @)
% ( 0 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 13 ^; 44 !; 2 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(emptyset_decl,type,
emptyset: $i ).
thf(setadjoin_decl,type,
setadjoin: $i > $i > $i ).
thf(dsetconstr_decl,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(singleton_decl,type,
singleton: $i > $o ).
thf(iffalseProp1_decl,type,
iffalseProp1: $o ).
thf(iffalseProp2_decl,type,
iffalseProp2: $o ).
thf(iftrueProp1_decl,type,
iftrueProp1: $o ).
thf(iftrueProp2_decl,type,
iftrueProp2: $o ).
thf(singleton_def,definition,
( singleton
= ( ^ [A: $i] :
? [B: $i] :
( ( in @ B @ A )
& ( A
= ( setadjoin @ B @ emptyset ) ) ) ) ) ).
thf(iffalseProp1_def,definition,
( iffalseProp1
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( in @ D
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ).
thf(iffalseProp2_def,definition,
( iffalseProp2
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ D @ emptyset ) ) ) ) ) ) ) ).
thf(iftrueProp1_def,definition,
( iftrueProp1
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( in @ C
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ).
thf(iftrueProp2_def,definition,
( iftrueProp2
= ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) ) ) ) ) ) ) ).
thf(1,conjecture,
( iffalseProp1
=> ( iffalseProp2
=> ( iftrueProp1
=> ( iftrueProp2
=> ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( singleton
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifSingleton) ).
thf(2,negated_conjecture,
~ ( iffalseProp1
=> ( iffalseProp2
=> ( iftrueProp1
=> ( iftrueProp2
=> ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( singleton
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( in @ D
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) )
=> ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ~ B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ D @ emptyset ) ) ) ) )
=> ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( in @ C
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) ) ) ) ) )
=> ( ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( B
=> ( ( dsetconstr @ A
@ ^ [E: $i] :
( ( B
& ( E = C ) )
| ( ~ B
& ( E = D ) ) ) )
= ( setadjoin @ C @ emptyset ) ) ) ) )
=> ! [A: $i,B: $o,C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ? [E: $i] :
( ( in @ E
@ ( dsetconstr @ A
@ ^ [F: $i] :
( ( B
& ( F = C ) )
| ( ~ B
& ( F = D ) ) ) ) )
& ( ( dsetconstr @ A
@ ^ [F: $i] :
( ( B
& ( F = C ) )
| ( ~ B
& ( F = D ) ) ) )
= ( setadjoin @ E @ emptyset ) ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(27,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU704^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.11 % 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.10/0.30 % Computer : n015.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8046.5625MB
% 0.10/0.30 % OS : Linux 6.8.0-71-generic
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Sep 29 14:15:47 UTC 2026
% 0.10/0.30 % CPUTime :
% 0.29/0.30 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.36/1.13 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 2.01/1.44 % [INFO] Parsing done (299ms).
% 2.01/1.46 % [INFO] Running in sequential loop mode.
% 3.29/2.07 % [INFO] eprover registered as external prover.
% 3.29/2.09 % [INFO] Scanning for conjecture ...
% 3.56/2.29 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 3.78/2.34 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 3.78/2.35 % [INFO] Problem is higher-order (TPTP THF).
% 3.78/2.35 % [INFO] Type checking passed.
% 3.78/2.36 % [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 ...
% 6.95/3.59 % External prover 'e' found a proof!
% 6.95/3.59 % [INFO] Killing All external provers ...
% 6.95/3.59 % Time passed: 3084ms (effective reasoning time: 2125ms)
% 6.95/3.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)>
% 6.95/3.60 % Axioms used in derivation (0):
% 6.95/3.60 % No. of inferences in proof: 4
% 6.95/3.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3084 ms resp. 2125 ms w/o parsing
% 7.37/3.67 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.37/3.67 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------