%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV417^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 : n008.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:37:16 AM UTC 2026
% Result : Theorem 4.00s 2.37s
% Output : Refutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 12 unt; 0 typ; 3 def)
% Number of atoms : 141 ( 29 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 241 ( 37 ~; 19 |; 49 &; 118 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 92 ( 48 ^; 36 !; 5 ?; 92 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cP_decl,type,
cP: ( a > $o ) > $o ).
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] :
( ( A @ C )
=> ( B @ C ) )
& ? [C: a > $o] :
( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) ) )
=> ( ( A
= ( ^ [B: a] : $false ) )
& ( cP
@ ^ [B: a] : $false ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > $o] :
( ! [B: a] :
( ( sk1 @ B )
=> ( A @ B ) )
& ? [B: a > $o] :
( ! [C: a] :
( ( sk1 @ C )
=> ( B @ C ) )
& ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= ( ^ [C: a] : $false ) )
& ( cP
@ ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a > $o] :
( ! [B: a] :
( ( sk1 @ B )
=> ( A @ B ) )
& ( ( ^ [B: a] :
( ( sk2 @ B )
& ( A @ B ) ) )
= ( ^ [B: a] : $false ) )
& ( cP
@ ^ [B: a] :
( ( sk2 @ B )
& ( A @ B ) ) ) ) ) ) ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) )
=> ( ( A
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] : $false ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM502_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) )
=> ( ( A
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] : $false ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) )
=> ( ( A
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] : $false ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ! [A: a > $o] :
( ? [B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
& ? [C: a > $o] :
( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) ) )
=> ( ( A
= ( ^ [B: a] : $false ) )
& ( cP
@ ^ [B: a] : $false ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [B: a,A: a] :
( ( ~ ( sk1 @ A )
| ( sk2 @ A ) )
& ( ~ ( sk1 @ B )
| ( sk3 @ B ) )
& ( ( ^ [C: a] :
( ( sk2 @ C )
& ( sk3 @ C ) ) )
= ( ^ [C: a] : $false ) )
& ( cP
@ ^ [C: a] :
( ( sk2 @ C )
& ( sk3 @ C ) ) )
& ( ( sk1
!= ( ^ [C: a] : $false ) )
| ~ ( cP
@ ^ [C: a] : $false ) ) ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(12,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(simp,[status(thm)],[9]) ).
thf(7,plain,
( ( sk1
!= ( ^ [A: a] : $false ) )
| ~ ( cP
@ ^ [A: a] : $false ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(13,plain,
( ( sk1
!= ( ^ [A: a] : $false ) )
| ~ ( cP
@ ^ [A: a] : $false ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(6,plain,
( cP
@ ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(10,plain,
( ( ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) )
= ( ^ [A: a] : $false ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(11,plain,
( ( ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) )
= ( ^ [A: a] : $false ) ),
inference(lifteq,[status(thm)],[10]) ).
thf(14,plain,
( cP
@ ^ [A: a] : $false ),
inference(rewrite,[status(thm)],[6,11]) ).
thf(17,plain,
( ( sk1
!= ( ^ [A: a] : $false ) )
| ~ $true ),
inference(rewrite,[status(thm)],[13,14]) ).
thf(18,plain,
( sk1
!= ( ^ [A: a] : $false ) ),
inference(simp,[status(thm)],[17]) ).
thf(19,plain,
sk1 @ sk4,
inference(func_ext,[status(esa)],[18]) ).
thf(8,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(23,plain,
! [A: a] :
( ~ $true
| ( sk2 @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[19,8]) ).
thf(24,plain,
! [A: a] :
( ( sk2 @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[23]) ).
thf(25,plain,
sk2 @ sk4,
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( sk4 ))]]) ).
thf(15,plain,
! [A: a] :
~ ( ( sk2 @ A )
& ( sk3 @ A ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(16,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ~ ( sk3 @ A ) ),
inference(cnf,[status(esa)],[15]) ).
thf(26,plain,
! [A: a] :
( ~ $true
| ~ ( sk3 @ A )
| ( ( sk2 @ sk4 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[25,16]) ).
thf(27,plain,
! [A: a] :
( ~ ( sk3 @ A )
| ( ( sk2 @ sk4 )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[26]) ).
thf(28,plain,
~ ( sk3 @ sk4 ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( sk4 ))]]) ).
thf(29,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ~ $true
| ( ( sk3 @ A )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[12,28]) ).
thf(30,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ sk4 ) ) ),
inference(simp,[status(thm)],[29]) ).
thf(31,plain,
~ ( sk1 @ sk4 ),
inference(pattern_uni,[status(thm)],[30:[bind(A,$thf( sk4 ))]]) ).
thf(38,plain,
~ $true,
inference(rewrite,[status(thm)],[31,19]) ).
thf(39,plain,
$false,
inference(simp,[status(thm)],[38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV417^5 : TPTP v9.3.1. Released v4.0.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.09/0.21 % Computer : n008.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 15:46:24 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/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
% 1.03/0.81 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/1.00 % [INFO] Parsing done (186ms).
% 1.22/1.01 % [INFO] Running in sequential loop mode.
% 2.01/1.42 % [INFO] eprover registered as external prover.
% 2.01/1.43 % [INFO] Scanning for conjecture ...
% 2.21/1.53 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.21/1.56 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.21/1.56 % [INFO] Problem is higher-order (TPTP THF).
% 2.21/1.57 % [INFO] Type checking passed.
% 2.21/1.57 % [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.00/2.36 % [INFO] Killing All external provers ...
% 4.00/2.37 % Time passed: 2005ms (effective reasoning time: 1349ms)
% 4.00/2.37 % 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.00/2.37 % Axioms used in derivation (0):
% 4.00/2.37 % No. of inferences in proof: 30
% 4.00/2.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2005 ms resp. 1349 ms w/o parsing
% 4.24/2.46 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.24/2.46 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------