%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU632^2 : TPTP v9.3.1. Released v3.7.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 : n018.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:28:50 AM UTC 2026
% Result : Theorem 3.53s 2.19s
% Output : Refutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 8 ( 5 unt; 0 typ; 4 def)
% Number of atoms : 35 ( 9 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 156 ( 2 ~; 0 |; 10 &; 133 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 3 ^; 19 !; 10 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(emptyset_decl,type,
emptyset: $i ).
thf(setadjoin_decl,type,
setadjoin: $i > $i > $i ).
thf(setunion_decl,type,
setunion: $i > $i ).
thf(iskpair_decl,type,
iskpair: $i > $o ).
thf(kpair_decl,type,
kpair: $i > $i > $i ).
thf(kpairp_decl,type,
kpairp: $o ).
thf(cartprod_decl,type,
cartprod: $i > $i > $i ).
thf(cartprodmempair1_decl,type,
cartprodmempair1: $o ).
thf(iskpair_def,definition,
( iskpair
= ( ^ [A: $i] :
? [B: $i] :
( ( in @ B @ ( setunion @ A ) )
& ? [C: $i] :
( ( in @ C @ ( setunion @ A ) )
& ( A
= ( setadjoin @ ( setadjoin @ B @ emptyset ) @ ( setadjoin @ ( setadjoin @ B @ ( setadjoin @ C @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ).
thf(kpair_def,definition,
( kpair
= ( ^ [A: $i,B: $i] : ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) ) ).
thf(kpairp_def,definition,
( kpairp
= ( ! [A: $i,B: $i] : ( iskpair @ ( kpair @ A @ B ) ) ) ) ).
thf(cartprodmempair1_def,definition,
( cartprodmempair1
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( cartprod @ A @ B ) )
=> ? [D: $i] :
( ( in @ D @ A )
& ? [E: $i] :
( ( in @ E @ B )
& ( C
= ( kpair @ D @ E ) ) ) ) ) ) ) ).
thf(1,conjecture,
( kpairp
=> ( cartprodmempair1
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( cartprod @ A @ B ) )
=> ( iskpair @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartprodmempair) ).
thf(2,negated_conjecture,
~ ( kpairp
=> ( cartprodmempair1
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( cartprod @ A @ B ) )
=> ( iskpair @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
? [C: $i] :
( ( in @ C @ ( setunion @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) )
& ? [D: $i] :
( ( in @ D @ ( setunion @ ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) ) ) )
& ( ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ C @ emptyset ) @ ( setadjoin @ ( setadjoin @ C @ ( setadjoin @ D @ emptyset ) ) @ emptyset ) ) ) ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( cartprod @ A @ B ) )
=> ? [D: $i] :
( ( in @ D @ A )
& ? [E: $i] :
( ( in @ E @ B )
& ( C
= ( setadjoin @ ( setadjoin @ D @ emptyset ) @ ( setadjoin @ ( setadjoin @ D @ ( setadjoin @ E @ emptyset ) ) @ emptyset ) ) ) ) ) )
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( cartprod @ A @ B ) )
=> ? [D: $i] :
( ( in @ D @ ( setunion @ C ) )
& ? [E: $i] :
( ( in @ E @ ( setunion @ C ) )
& ( C
= ( setadjoin @ ( setadjoin @ D @ emptyset ) @ ( setadjoin @ ( setadjoin @ D @ ( setadjoin @ E @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(20,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU632^2 : TPTP v9.3.1. Released v3.7.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.09/0.21 % Computer : n018.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:02:37 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 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.98/0.81 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.15/0.99 % [INFO] Parsing done (177ms).
% 1.15/1.01 % [INFO] Running in sequential loop mode.
% 1.97/1.40 % [INFO] eprover registered as external prover.
% 1.97/1.41 % [INFO] Scanning for conjecture ...
% 2.14/1.53 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.14/1.56 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.14/1.57 % [INFO] Problem is higher-order (TPTP THF).
% 2.14/1.57 % [INFO] Type checking passed.
% 2.14/1.57 % [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.53/2.19 % External prover 'e' found a proof!
% 3.53/2.19 % [INFO] Killing All external provers ...
% 3.53/2.19 % Time passed: 1830ms (effective reasoning time: 1175ms)
% 3.53/2.19 % 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.53/2.19 % Axioms used in derivation (0):
% 3.53/2.19 % No. of inferences in proof: 4
% 3.53/2.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1830 ms resp. 1175 ms w/o parsing
% 3.72/2.24 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.72/2.24 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------