%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET183^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 : 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:22:55 AM UTC 2026
% Result : Theorem 3.43s 2.19s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 13 unt; 0 typ; 2 def)
% Number of atoms : 57 ( 13 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 99 ( 15 ~; 9 |; 13 &; 52 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 8 ^; 16 !; 0 ?; 26 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% 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 ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > $o] :
~ ! [B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > $o] :
~ ( ! [B: a] :
( ( sk1 @ B )
=> ( A @ B ) )
=> ( ( ^ [B: a] :
( ( sk1 @ B )
& ( A @ B ) ) )
= sk1 ) ) ) ) ).
thf(1,conjecture,
! [A: a > $o,B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_42_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
=> ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: a] :
( ( ~ ( sk1 @ A )
| ( sk2 @ A ) )
& ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
!= sk1 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 ),
inference(lifteq,[status(thm)],[6]) ).
thf(8,plain,
( ( ( sk1 @ sk3 )
& ( sk2 @ sk3 ) )
!= ( sk1 @ sk3 ) ),
inference(func_ext,[status(esa)],[7]) ).
thf(10,plain,
( ( ( sk1 @ sk3 )
& ( sk2 @ sk3 ) )
| ( sk1 @ sk3 ) ),
inference(bool_ext,[status(thm)],[8]) ).
thf(13,plain,
( ( ( sk1 @ sk3 )
| ( sk1 @ sk3 ) )
& ( ( sk2 @ sk3 )
| ( sk1 @ sk3 ) ) ),
inference(cnf,[status(esa)],[10]) ).
thf(14,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk3 ) ),
inference(cnfConj,[status(thm)],[13]) ).
thf(16,plain,
sk1 @ sk3,
inference(simp,[status(thm)],[14]) ).
thf(5,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(21,plain,
! [A: a] :
( ~ $true
| ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[16,5]) ).
thf(22,plain,
! [A: a] :
( ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[21]) ).
thf(23,plain,
sk2 @ sk3,
inference(pattern_uni,[status(thm)],[22:[bind(A,$thf( sk3 ))]]) ).
thf(17,plain,
~ ( $true
& ( sk2 @ sk3 ) ),
inference(rewrite,[status(thm)],[8,16]) ).
thf(18,plain,
~ ( sk2 @ sk3 ),
inference(simp,[status(thm)],[17]) ).
thf(27,plain,
$false,
inference(rewrite,[status(thm)],[23,18]) ).
thf(28,plain,
$false,
inference(simp,[status(thm)],[27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET183^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 : n018.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:26 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/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.85/0.79 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.98 % [INFO] Parsing done (186ms).
% 1.17/1.00 % [INFO] Running in sequential loop mode.
% 1.74/1.38 % [INFO] eprover registered as external prover.
% 1.74/1.39 % [INFO] Scanning for conjecture ...
% 1.90/1.47 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.06/1.50 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.06/1.50 % [INFO] Problem is higher-order (TPTP THF).
% 2.06/1.51 % [INFO] Type checking passed.
% 2.06/1.51 % [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.43/2.18 % [INFO] Killing All external provers ...
% 3.43/2.19 % Time passed: 1830ms (effective reasoning time: 1183ms)
% 3.43/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.43/2.19 % Axioms used in derivation (0):
% 3.43/2.19 % No. of inferences in proof: 19
% 3.43/2.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1830 ms resp. 1183 ms w/o parsing
% 3.57/2.24 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.57/2.24 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------