%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET607^3 : TPTP v9.3.1. Released v3.6.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 : 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 : Wed Sep 30 08:23:00 AM UTC 2026
% Result : Theorem 4.10s 2.26s
% Output : Refutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 13 unt; 0 typ; 4 def)
% Number of atoms : 65 ( 13 equ; 0 cnn)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 133 ( 30 ~; 25 |; 12 &; 66 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 25 ( 16 ^; 7 !; 0 ?; 25 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(union_decl,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(setminus_decl,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sk1_decl,type,
sk1: $i > $o ).
thf(sk2_decl,type,
sk2: $i > $o ).
thf(sk3_decl,type,
sk3: $i ).
thf(union_def,definition,
( union
= ( ^ [A: $i > $o,B: $i > $o,C: $i] :
( ( A @ C )
| ( B @ C ) ) ) ) ).
thf(setminus_def,definition,
( setminus
= ( ^ [A: $i > $o,B: $i > $o,C: $i] :
( ( A @ C )
& ~ ( B @ C ) ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i > $o] :
~ ! [B: $i > $o] :
( ( ^ [C: $i] :
( ( A @ C )
| ( ( B @ C )
& ~ ( A @ C ) ) ) )
= ( ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i > $o] :
( ( ^ [B: $i] :
( ( sk1 @ B )
| ( ( A @ B )
& ~ ( sk1 @ B ) ) ) )
!= ( ^ [B: $i] :
( ( sk1 @ B )
| ( A @ B ) ) ) ) ) ) ).
thf(1,conjecture,
! [A: $i > $o,B: $i > $o] :
( ( union @ A @ ( setminus @ B @ A ) )
= ( union @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ! [A: $i > $o,B: $i > $o] :
( ( union @ A @ ( setminus @ B @ A ) )
= ( union @ A @ B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $o,B: $i > $o] :
( ( ^ [C: $i] :
( ( A @ C )
| ( ( B @ C )
& ~ ( A @ C ) ) ) )
= ( ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: $i] :
( ( sk1 @ A )
| ( ( sk2 @ A )
& ~ ( sk1 @ A ) ) ) )
!= ( ^ [A: $i] :
( ( sk1 @ A )
| ( sk2 @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: $i] :
( ( sk1 @ A )
| ( ( sk2 @ A )
& ~ ( sk1 @ A ) ) ) )
!= ( ^ [A: $i] :
( ( sk1 @ A )
| ( sk2 @ A ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( ( sk1 @ sk3 )
| ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) )
!= ( ( sk1 @ sk3 )
| ( sk2 @ sk3 ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(21,plain,
( ~ ( ( sk1 @ sk3 )
| ( ( sk2 @ sk3 )
& ~ ( sk1 @ sk3 ) ) )
| ~ ( ( sk1 @ sk3 )
| ( sk2 @ sk3 ) ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(27,plain,
( ( ~ ( sk1 @ sk3 )
| ~ ( sk1 @ sk3 ) )
& ( ~ ( sk1 @ sk3 )
| ~ ( sk2 @ sk3 ) )
& ( ~ ( sk2 @ sk3 )
| ( sk1 @ sk3 )
| ~ ( sk1 @ sk3 ) )
& ( ~ ( sk2 @ sk3 )
| ( sk1 @ sk3 )
| ~ ( sk2 @ sk3 ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(28,plain,
( ~ ( sk1 @ sk3 )
| ~ ( sk1 @ sk3 ) ),
inference(cnfConj,[status(thm)],[27]) ).
thf(32,plain,
~ ( sk1 @ sk3 ),
inference(simp,[status(thm)],[28]) ).
thf(42,plain,
( ( $false
| ( ( sk2 @ sk3 )
& ~ $false ) )
!= ( $false
| ( sk2 @ sk3 ) ) ),
inference(rewrite,[status(thm)],[7,32]) ).
thf(43,plain,
$false,
inference(simp,[status(thm)],[42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET607^3 : TPTP v9.3.1. Released v3.6.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.07/0.18 % Computer : n006.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 13:38:39 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 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.91/0.76 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.26/0.98 % [INFO] Parsing done (222ms).
% 1.26/1.00 % [INFO] Running in sequential loop mode.
% 2.28/1.40 % [INFO] eprover registered as external prover.
% 2.28/1.40 % [INFO] Scanning for conjecture ...
% 2.49/1.52 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.49/1.55 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.49/1.55 % [INFO] Problem is higher-order (TPTP THF).
% 2.49/1.56 % [INFO] Type checking passed.
% 2.49/1.56 % [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 ...
% 4.10/2.25 % [INFO] Killing All external provers ...
% 4.10/2.25 % Time passed: 1927ms (effective reasoning time: 1246ms)
% 4.10/2.25 % 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)>
% 4.10/2.26 % Axioms used in derivation (0):
% 4.10/2.26 % No. of inferences in proof: 12
% 4.10/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1927 ms resp. 1246 ms w/o parsing
% 4.36/2.31 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.36/2.31 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------