%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET601^5 : TPTP v9.3.1. Released v4.0.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:22:59 AM UTC 2026
% Result : Theorem 4.55s 2.45s
% Output : Refutation 4.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 3 def)
% Number of atoms : 64 ( 12 equ; 0 cnn)
% Maximal formula atoms : 1 ( 6 avg)
% Number of connectives : 206 ( 8 ~; 45 |; 45 &; 108 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 16 ^; 12 !; 0 ?; 31 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_decl,type,
sk1: a > $o ).
thf(sk2_decl,type,
sk2: a > $o ).
thf(sk3_decl,type,
sk3: a > $o ).
thf(sk4_decl,type,
sk4: a ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > $o] :
~ ! [B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( A @ D )
& ( B @ D ) )
| ( ( B @ D )
& ( C @ D ) )
| ( ( C @ D )
& ( A @ D ) ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
| ( B @ D ) )
& ( ( B @ D )
| ( C @ D ) )
& ( ( C @ D )
| ( A @ D ) ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > $o] :
~ ! [B: a > $o] :
( ( ^ [C: a] :
( ( ( sk1 @ C )
& ( A @ C ) )
| ( ( A @ C )
& ( B @ C ) )
| ( ( B @ C )
& ( sk1 @ C ) ) ) )
= ( ^ [C: a] :
( ( ( sk1 @ C )
| ( A @ C ) )
& ( ( A @ C )
| ( B @ C ) )
& ( ( B @ C )
| ( sk1 @ C ) ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a > $o] :
( ( ^ [B: a] :
( ( ( sk1 @ B )
& ( sk2 @ B ) )
| ( ( sk2 @ B )
& ( A @ B ) )
| ( ( A @ B )
& ( sk1 @ B ) ) ) )
!= ( ^ [B: a] :
( ( ( sk1 @ B )
| ( sk2 @ B ) )
& ( ( sk2 @ B )
| ( A @ B ) )
& ( ( A @ B )
| ( sk1 @ B ) ) ) ) ) ) ) ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( A @ D )
& ( B @ D ) )
| ( ( B @ D )
& ( C @ D ) )
| ( ( C @ D )
& ( A @ D ) ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
| ( B @ D ) )
& ( ( B @ D )
| ( C @ D ) )
& ( ( C @ D )
| ( A @ D ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_72_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( A @ D )
& ( B @ D ) )
| ( ( B @ D )
& ( C @ D ) )
| ( ( C @ D )
& ( A @ D ) ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
| ( B @ D ) )
& ( ( B @ D )
| ( C @ D ) )
& ( ( C @ D )
| ( A @ D ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( A @ D )
& ( B @ D ) )
| ( ( B @ D )
& ( C @ D ) )
| ( ( C @ D )
& ( A @ D ) ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
| ( B @ D ) )
& ( ( B @ D )
| ( C @ D ) )
& ( ( C @ D )
| ( A @ D ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a] :
( ( ( sk1 @ A )
& ( sk2 @ A ) )
| ( ( sk2 @ A )
& ( sk3 @ A ) )
| ( ( sk3 @ A )
& ( sk1 @ A ) ) ) )
!= ( ^ [A: a] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( ( sk2 @ A )
| ( sk3 @ A ) )
& ( ( sk3 @ A )
| ( sk1 @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: a] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( ( sk2 @ A )
| ( sk3 @ A ) )
& ( ( sk3 @ A )
| ( sk1 @ A ) ) ) )
!= ( ^ [A: a] :
( ( ( sk1 @ A )
& ( sk2 @ A ) )
| ( ( sk2 @ A )
& ( sk3 @ A ) )
| ( ( sk3 @ A )
& ( sk1 @ A ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( ( ( sk1 @ sk4 )
| ( sk2 @ sk4 ) )
& ( ( sk2 @ sk4 )
| ( sk3 @ sk4 ) )
& ( ( sk3 @ sk4 )
| ( sk1 @ sk4 ) ) )
!= ( ( ( sk1 @ sk4 )
& ( sk2 @ sk4 ) )
| ( ( sk2 @ sk4 )
& ( sk3 @ sk4 ) )
| ( ( sk3 @ sk4 )
& ( sk1 @ sk4 ) ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(76,plain,
$false,
inference(e,[status(thm)],[3,5,6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET601^5 : TPTP v9.3.1. Released v4.0.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 : n015.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 13:42:02 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.22 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.85/0.79 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.16/0.98 % [INFO] Parsing done (183ms).
% 1.16/0.99 % [INFO] Running in sequential loop mode.
% 1.72/1.38 % [INFO] eprover registered as external prover.
% 1.72/1.39 % [INFO] Scanning for conjecture ...
% 1.89/1.47 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.04/1.51 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.04/1.51 % [INFO] Problem is higher-order (TPTP THF).
% 2.04/1.51 % [INFO] Type checking passed.
% 2.04/1.52 % [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.55/2.45 % External prover 'e' found a proof!
% 4.55/2.45 % [INFO] Killing All external provers ...
% 4.55/2.45 % Time passed: 2100ms (effective reasoning time: 1454ms)
% 4.55/2.45 % 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.55/2.45 % Axioms used in derivation (0):
% 4.55/2.45 % No. of inferences in proof: 7
% 4.55/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2100 ms resp. 1454 ms w/o parsing
% 4.55/2.50 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.55/2.50 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------