%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU686^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 : n017.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:01 AM UTC 2026
% Result : Theorem 5.18s 2.66s
% Output : Refutation 5.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 7 def)
% Number of atoms : 80 ( 17 equ; 0 cnn)
% Maximal formula atoms : 28 ( 7 avg)
% Number of connectives : 248 ( 2 ~; 0 |; 9 &; 194 @)
% ( 0 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 5 con; 0-4 aty)
% Number of variables : 64 ( 16 ^; 43 !; 5 ?; 64 :)
% 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(subset_decl,type,
subset: $i > $i > $o ).
thf(kpair_decl,type,
kpair: $i > $i > $i ).
thf(cartprod_decl,type,
cartprod: $i > $i > $i ).
thf(singleton_decl,type,
singleton: $i > $o ).
thf(ex1_decl,type,
ex1: $i > ( $i > $o ) > $o ).
thf(breln_decl,type,
breln: $i > $i > $i > $o ).
thf(func_decl,type,
func: $i > $i > $i > $o ).
thf(ap_decl,type,
ap: $i > $i > $i > $i > $i ).
thf(app_decl,type,
app: $o ).
thf(ex1E2_decl,type,
ex1E2: $o ).
thf(funcGraphProp1_decl,type,
funcGraphProp1: $o ).
thf(singleton_def,definition,
( singleton
= ( ^ [A: $i] :
? [B: $i] :
( ( in @ B @ A )
& ( A
= ( setadjoin @ B @ emptyset ) ) ) ) ) ).
thf(ex1_def,definition,
( ex1
= ( ^ [A: $i,B: $i > $o] : ( singleton @ ( dsetconstr @ A @ B ) ) ) ) ).
thf(breln_def,definition,
( breln
= ( ^ [A: $i,B: $i,C: $i] : ( subset @ C @ ( cartprod @ A @ B ) ) ) ) ).
thf(func_def,definition,
( func
= ( ^ [A: $i,B: $i,C: $i] :
( ( breln @ A @ B @ C )
& ! [D: $i] :
( ( in @ D @ A )
=> ( ex1 @ B
@ ^ [E: $i] : ( in @ ( kpair @ D @ E ) @ C ) ) ) ) ) ) ).
thf(app_def,definition,
( app
= ( ! [A: $i,B: $i,C: $i] :
( ( func @ A @ B @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( in @ ( ap @ A @ B @ C @ D ) @ B ) ) ) ) ) ).
thf(ex1E2_def,definition,
( ex1E2
= ( ! [A: $i,B: $i > $o] :
( ( ex1 @ A @ B )
=> ! [C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ( B @ C )
=> ( ( B @ D )
=> ( C = D ) ) ) ) ) ) ) ) ).
thf(funcGraphProp1_def,definition,
( funcGraphProp1
= ( ! [A: $i,B: $i,C: $i] :
( ( func @ A @ B @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( in @ ( kpair @ D @ ( ap @ A @ B @ C @ D ) ) @ C ) ) ) ) ) ).
thf(1,conjecture,
( app
=> ( ex1E2
=> ( funcGraphProp1
=> ! [A: $i,B: $i,C: $i] :
( ( func @ A @ B @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ! [E: $i] :
( ( in @ E @ B )
=> ( ( in @ ( kpair @ D @ E ) @ C )
=> ( ( ap @ A @ B @ C @ D )
= E ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcGraphProp2) ).
thf(2,negated_conjecture,
~ ( app
=> ( ex1E2
=> ( funcGraphProp1
=> ! [A: $i,B: $i,C: $i] :
( ( func @ A @ B @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ! [E: $i] :
( ( in @ E @ B )
=> ( ( in @ ( kpair @ D @ E ) @ C )
=> ( ( ap @ A @ B @ C @ D )
= E ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i,C: $i] :
( ( ( subset @ C @ ( cartprod @ A @ B ) )
& ! [D: $i] :
( ( in @ D @ A )
=> ? [E: $i] :
( ( in @ E
@ ( dsetconstr @ B
@ ^ [F: $i] : ( in @ ( kpair @ D @ F ) @ C ) ) )
& ( ( dsetconstr @ B
@ ^ [F: $i] : ( in @ ( kpair @ D @ F ) @ C ) )
= ( setadjoin @ E @ emptyset ) ) ) ) )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( in @ ( ap @ A @ B @ C @ D ) @ B ) ) )
=> ( ! [A: $i,B: $i > $o] :
( ? [C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
& ( ( dsetconstr @ A @ B )
= ( setadjoin @ C @ emptyset ) ) )
=> ! [C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ( B @ C )
=> ( ( B @ D )
=> ( C = D ) ) ) ) ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( ( subset @ C @ ( cartprod @ A @ B ) )
& ! [D: $i] :
( ( in @ D @ A )
=> ? [E: $i] :
( ( in @ E
@ ( dsetconstr @ B
@ ^ [F: $i] : ( in @ ( kpair @ D @ F ) @ C ) ) )
& ( ( dsetconstr @ B
@ ^ [F: $i] : ( in @ ( kpair @ D @ F ) @ C ) )
= ( setadjoin @ E @ emptyset ) ) ) ) )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( in @ ( kpair @ D @ ( ap @ A @ B @ C @ D ) ) @ C ) ) )
=> ! [A: $i,B: $i,C: $i] :
( ( ( subset @ C @ ( cartprod @ A @ B ) )
& ! [D: $i] :
( ( in @ D @ A )
=> ? [E: $i] :
( ( in @ E
@ ( dsetconstr @ B
@ ^ [F: $i] : ( in @ ( kpair @ D @ F ) @ C ) ) )
& ( ( dsetconstr @ B
@ ^ [F: $i] : ( in @ ( kpair @ D @ F ) @ C ) )
= ( setadjoin @ E @ emptyset ) ) ) ) )
=> ! [D: $i] :
( ( in @ D @ A )
=> ! [E: $i] :
( ( in @ E @ B )
=> ( ( in @ ( kpair @ D @ E ) @ C )
=> ( ( ap @ A @ B @ C @ D )
= E ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(28,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU686^2 : TPTP v9.3.1. Released v3.7.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.09/0.21 % Computer : n017.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 14:04:22 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 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.89/0.61 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.12/0.80 % [INFO] Parsing done (181ms).
% 1.37/0.81 % [INFO] Running in sequential loop mode.
% 2.21/1.21 % [INFO] eprover registered as external prover.
% 2.21/1.22 % [INFO] Scanning for conjecture ...
% 2.59/1.43 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.59/1.48 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.59/1.48 % [INFO] Problem is higher-order (TPTP THF).
% 2.59/1.49 % [INFO] Type checking passed.
% 2.59/1.50 % [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.18/2.65 % External prover 'e' found a proof!
% 5.18/2.65 % [INFO] Killing All external provers ...
% 5.18/2.65 % Time passed: 2350ms (effective reasoning time: 1837ms)
% 5.18/2.65 % 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.18/2.65 % Axioms used in derivation (0):
% 5.18/2.65 % No. of inferences in proof: 4
% 5.18/2.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2350 ms resp. 1837 ms w/o parsing
% 5.57/2.74 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.57/2.74 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------