%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU778^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 : n019.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:17 AM UTC 2026
% Result : Theorem 5.00s 2.43s
% Output : Refutation 5.00s
% 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 : 29 ( 4 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 89 ( 2 ~; 0 |; 4 &; 74 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 26 ( 11 ^; 13 !; 2 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
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(breln_decl,type,
breln: $i > $i > $i > $o ).
thf(dpsetconstr_decl,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(breln1_decl,type,
breln1: $i > $i > $o ).
thf(setOfPairsIsBReln1_decl,type,
setOfPairsIsBReln1: $o ).
thf(breln1compset_decl,type,
breln1compset: $i > $i > $i > $i ).
thf(breln_def,definition,
( breln
= ( ^ [A: $i,B: $i,C: $i] : ( subset @ C @ ( cartprod @ A @ B ) ) ) ) ).
thf(breln1_def,definition,
( breln1
= ( ^ [A: $i] : ( breln @ A @ A ) ) ) ).
thf(setOfPairsIsBReln1_def,definition,
( setOfPairsIsBReln1
= ( ! [A: $i,B: $i > $i > $o] : ( breln1 @ A @ ( dpsetconstr @ A @ A @ B ) ) ) ) ).
thf(breln1compset_def,definition,
( breln1compset
= ( ^ [A: $i,B: $i,C: $i] :
( dpsetconstr @ A @ A
@ ^ [D: $i,E: $i] :
? [F: $i] :
( ( in @ F @ A )
& ( in @ ( kpair @ D @ F ) @ B )
& ( in @ ( kpair @ F @ E ) @ C ) ) ) ) ) ).
thf(1,conjecture,
( setOfPairsIsBReln1
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ( breln1 @ A @ ( breln1compset @ A @ B @ C ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compprop) ).
thf(2,negated_conjecture,
~ ( setOfPairsIsBReln1
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ( breln1 @ A @ ( breln1compset @ A @ B @ C ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $i > $o] : ( subset @ ( dpsetconstr @ A @ A @ B ) @ ( cartprod @ A @ A ) )
=> ! [A: $i,B: $i] :
( ( subset @ B @ ( cartprod @ A @ A ) )
=> ! [C: $i] :
( ( subset @ C @ ( cartprod @ A @ A ) )
=> ( subset
@ ( dpsetconstr @ A @ A
@ ^ [D: $i,E: $i] :
? [F: $i] :
( ( in @ F @ A )
& ( in @ ( kpair @ D @ F ) @ B )
& ( in @ ( kpair @ F @ E ) @ C ) ) )
@ ( cartprod @ A @ A ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU778^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % 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.11/0.23 % Computer : n019.cluster.edu
% 0.11/0.23 % Model : x86_64 x86_64
% 0.11/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.23 % Memory : 8046.5625MB
% 0.11/0.23 % OS : Linux 6.8.0-71-generic
% 0.11/0.23 % CPULimit : 300
% 0.11/0.23 % WCLimit : 300
% 0.11/0.23 % DateTime : Tue Sep 29 14:28:02 UTC 2026
% 0.11/0.23 % CPUTime :
% 0.11/0.23 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
% 1.04/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.52/1.03 % [INFO] Parsing done (193ms).
% 1.52/1.05 % [INFO] Running in sequential loop mode.
% 2.14/1.46 % [INFO] eprover registered as external prover.
% 2.14/1.47 % [INFO] Scanning for conjecture ...
% 2.36/1.58 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.55/1.62 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.55/1.62 % [INFO] Problem is higher-order (TPTP THF).
% 2.55/1.62 % [INFO] Type checking passed.
% 2.55/1.63 % [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/2.43 % External prover 'e' found a proof!
% 5.00/2.43 % [INFO] Killing All external provers ...
% 5.00/2.43 % Time passed: 2040ms (effective reasoning time: 1376ms)
% 5.00/2.43 % 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/2.43 % Axioms used in derivation (0):
% 5.00/2.43 % No. of inferences in proof: 4
% 5.00/2.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2040 ms resp. 1376 ms w/o parsing
% 5.00/2.48 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.00/2.48 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------