%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET614^5 : TPTP v9.3.1. Released v4.0.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 : n010.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:02 AM UTC 2026
% Result : Theorem 3.32s 2.17s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 13 unt; 0 typ; 3 def)
% Number of atoms : 71 ( 16 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 191 ( 62 ~; 20 |; 32 &; 77 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 35 ( 20 ^; 12 !; 0 ?; 35 :)
% ( 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(sk5_decl,type,
sk5: a ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > $o] :
~ ! [B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( A @ D )
& ~ ( B @ D )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( A @ D )
& ~ ( ( B @ D )
| ( C @ D ) ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > $o] :
~ ! [B: a > $o] :
( ( ^ [C: a] :
( ( sk1 @ C )
& ~ ( A @ C )
& ~ ( B @ C ) ) )
= ( ^ [C: a] :
( ( sk1 @ C )
& ~ ( ( A @ C )
| ( B @ C ) ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a > $o] :
( ( ^ [B: a] :
( ( sk1 @ B )
& ~ ( sk2 @ B )
& ~ ( A @ B ) ) )
!= ( ^ [B: a] :
( ( sk1 @ B )
& ~ ( ( sk2 @ B )
| ( A @ B ) ) ) ) ) ) ) ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( A @ D )
& ~ ( B @ D )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( A @ D )
& ~ ( ( B @ D )
| ( C @ D ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_88_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( A @ D )
& ~ ( B @ D )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( A @ D )
& ~ ( ( B @ D )
| ( C @ 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 )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( A @ D )
& ~ ( ( B @ D )
| ( C @ D ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A )
& ~ ( sk3 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( ( sk2 @ A )
| ( sk3 @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( sk2 @ A )
& ~ ( sk3 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ~ ( ( sk2 @ A )
| ( sk3 @ A ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( sk1 != sk1 )
| ( ( ^ [A: a] :
( ~ ( sk2 @ A )
& ~ ( sk3 @ A ) ) )
!= ( ^ [A: a] :
~ ( ( sk2 @ A )
| ( sk3 @ A ) ) ) ) ),
inference(simp,[status(thm)],[5]) ).
thf(8,plain,
( ( ^ [A: a] :
( ~ ( sk2 @ A )
& ~ ( sk3 @ A ) ) )
!= ( ^ [A: a] :
~ ( ( sk2 @ A )
| ( sk3 @ A ) ) ) ),
inference(simp,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ( sk2 @ sk5 )
& ~ ( sk3 @ sk5 ) )
!= ( ~ ( ( sk2 @ sk5 )
| ( sk3 @ sk5 ) ) ) ),
inference(func_ext,[status(esa)],[8]) ).
thf(11,plain,
( ( ~ ( sk2 @ sk5 )
& ~ ( sk3 @ sk5 ) )
| ~ ( ( sk2 @ sk5 )
| ( sk3 @ sk5 ) ) ),
inference(bool_ext,[status(thm)],[9]) ).
thf(14,plain,
( ( ~ ( sk2 @ sk5 )
| ~ ( sk2 @ sk5 ) )
& ( ~ ( sk2 @ sk5 )
| ~ ( sk3 @ sk5 ) )
& ( ~ ( sk3 @ sk5 )
| ~ ( sk2 @ sk5 ) )
& ( ~ ( sk3 @ sk5 )
| ~ ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[11]) ).
thf(15,plain,
( ~ ( sk2 @ sk5 )
| ~ ( sk2 @ sk5 ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(18,plain,
~ ( sk2 @ sk5 ),
inference(simp,[status(thm)],[15]) ).
thf(20,plain,
( ( ~ $false
& ~ ( sk3 @ sk5 ) )
!= ( ~ ( $false
| ( sk3 @ sk5 ) ) ) ),
inference(rewrite,[status(thm)],[9,18]) ).
thf(21,plain,
$false,
inference(simp,[status(thm)],[20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET614^5 : TPTP v9.3.1. Released v4.0.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.10/0.21 % Computer : n010.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Tue Sep 29 13:39:48 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 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.14/0.99 % [INFO] Parsing done (173ms).
% 1.14/1.00 % [INFO] Running in sequential loop mode.
% 1.88/1.40 % [INFO] eprover registered as external prover.
% 1.88/1.41 % [INFO] Scanning for conjecture ...
% 1.88/1.49 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.02/1.53 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.02/1.53 % [INFO] Problem is higher-order (TPTP THF).
% 2.02/1.54 % [INFO] Type checking passed.
% 2.02/1.54 % [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.32/2.16 % [INFO] Killing All external provers ...
% 3.32/2.16 % Time passed: 1799ms (effective reasoning time: 1153ms)
% 3.32/2.16 % 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.32/2.17 % Axioms used in derivation (0):
% 3.32/2.17 % No. of inferences in proof: 14
% 3.32/2.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1799 ms resp. 1153 ms w/o parsing
% 3.47/2.22 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.47/2.22 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------