%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU849^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 : n012.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:29:28 AM UTC 2026
% Result : Theorem 3.35s 1.70s
% Output : Refutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 6
% Syntax : Number of formulae : 84 ( 12 unt; 0 typ; 5 def)
% Number of atoms : 447 ( 102 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 664 ( 126 ~; 144 |; 56 &; 318 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 78 ( 40 ^; 33 !; 0 ?; 78 :)
% ( 0 !>; 0 ?*; 0 @-; 5 @+)
% 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(sk4_decl,type,
sk4: a ).
thf(sk5_decl,type,
sk5: a ).
thf(sk7_decl,type,
sk7: a ).
thf(sk9_decl,type,
sk9: a ).
thf(sk10_decl,type,
sk10: a ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > $o] :
~ ! [B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > $o] :
( ( ( ^ [B: a] :
( ( sk1 @ B )
& ( A @ B ) ) )
= sk1 )
!= ( ! [B: a] :
( ( sk1 @ B )
=> ( A @ B ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a] :
~ ( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ) ).
thf(sk7_def,definition,
( sk7
= ( @+[A: a] :
~ ( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ) ).
thf(sk9_def,definition,
( sk9
= ( @+[A: a] :
~ ( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ) ).
thf(1,conjecture,
! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGAZING_THM39_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
& ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( A @ C )
=> ( B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(10,plain,
( ( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ( sk1 @ sk3 ) )
& ( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ~ ( sk2 @ sk3 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(12,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ~ ( sk2 @ sk3 ) ),
inference(cnfConj,[status(thm)],[10]) ).
thf(15,plain,
( ( ( ( sk1 @ sk5 )
& ( sk2 @ sk5 ) )
!= ( sk1 @ sk5 ) )
| ~ ( sk2 @ sk3 ) ),
inference(func_ext,[status(esa)],[12]) ).
thf(24,plain,
( ~ ( sk2 @ sk3 )
| ~ ( ( sk1 @ sk5 )
& ( sk2 @ sk5 ) )
| ~ ( sk1 @ sk5 ) ),
inference(bool_ext,[status(thm)],[15]) ).
thf(26,plain,
( ~ ( sk2 @ sk3 )
| ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 )
| ~ ( sk1 @ sk5 ) ),
inference(cnf,[status(esa)],[24]) ).
thf(27,plain,
( ~ ( sk2 @ sk3 )
| ~ ( sk1 @ sk5 )
| ~ ( sk2 @ sk5 ) ),
inference(simp,[status(thm)],[26]) ).
thf(32,plain,
( ~ ( sk2 @ sk3 )
| ~ ( sk1 @ sk5 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ sk3 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[27]) ).
thf(33,plain,
( ~ ( sk2 @ sk3 )
| ~ ( sk1 @ sk5 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ sk3 ) ) ),
inference(simp,[status(thm)],[32]) ).
thf(11,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ( sk1 @ sk3 ) ),
inference(cnfConj,[status(thm)],[10]) ).
thf(14,plain,
( ( ( ( sk1 @ sk4 )
& ( sk2 @ sk4 ) )
!= ( sk1 @ sk4 ) )
| ( sk1 @ sk3 ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(17,plain,
( ( sk1 @ sk3 )
| ( ( sk1 @ sk4 )
& ( sk2 @ sk4 ) )
| ( sk1 @ sk4 ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(20,plain,
( ( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk4 ) )
& ( ( sk1 @ sk3 )
| ( sk2 @ sk4 )
| ( sk1 @ sk4 ) ) ),
inference(cnf,[status(esa)],[17]) ).
thf(21,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 @ sk4 ) ),
inference(cnfConj,[status(thm)],[20]) ).
thf(23,plain,
( ( sk1 @ sk3 )
| ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[21]) ).
thf(7,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
| ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
| ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(13,plain,
! [A: a] :
( ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnf,[status(esa)],[9]) ).
thf(70,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ~ $true
| ( sk2 @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[23,13]) ).
thf(71,plain,
! [A: a] :
( ( sk1 @ sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ( sk2 @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[70]) ).
thf(72,plain,
( ( sk1 @ sk3 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
| ( sk2 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[71:[bind(A,$thf( sk4 ))]]) ).
thf(147,plain,
( ( sk1 @ sk3 )
| ( sk2 @ sk4 )
| ( sk1 != sk1 )
| ( sk1 @ sk3 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[72,11]) ).
thf(148,plain,
( ( sk1 @ sk3 )
| ( sk2 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) ) ) ),
inference(simp,[status(thm)],[147]) ).
thf(149,plain,
( ( sk1 @ sk3 )
| ( sk2 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[148:[]]) ).
thf(156,plain,
( ( sk1 @ sk3 )
| ( ( ( sk1 @ sk4 )
& $true )
!= ( sk1 @ sk4 ) )
| ( sk1 @ sk3 )
| ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[149,14]) ).
thf(157,plain,
( ( sk1 @ sk3 )
| ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) ) ),
inference(simp,[status(thm)],[156]) ).
thf(158,plain,
sk1 @ sk3,
inference(pattern_uni,[status(thm)],[157:[]]) ).
thf(197,plain,
! [A: a] :
( ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ~ $true
| ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[158,13]) ).
thf(198,plain,
! [A: a] :
( ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[197]) ).
thf(199,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
| ( sk2 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[198:[bind(A,$thf( sk3 ))]]) ).
thf(249,plain,
( ( sk2 @ sk3 )
| ( ( sk1 = sk1 )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[199,5]) ).
thf(250,plain,
( ( sk2 @ sk3 )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) ) ) ),
inference(simp,[status(thm)],[249]) ).
thf(251,plain,
( ( sk2 @ sk3 )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(pattern_uni,[status(thm)],[250:[]]) ).
thf(261,plain,
( ( ( sk2 @ sk3 )
| ( sk1 @ sk9 ) )
& ( ( sk2 @ sk3 )
| ~ ( sk2 @ sk9 ) ) ),
inference(cnf,[status(esa)],[251]) ).
thf(262,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk9 ) ),
inference(cnfConj,[status(thm)],[261]) ).
thf(25,plain,
( ~ ( sk2 @ sk3 )
| ( ( sk1 @ sk5 )
& ( sk2 @ sk5 ) )
| ( sk1 @ sk5 ) ),
inference(bool_ext,[status(thm)],[15]) ).
thf(28,plain,
( ( ~ ( sk2 @ sk3 )
| ( sk1 @ sk5 )
| ( sk1 @ sk5 ) )
& ( ~ ( sk2 @ sk3 )
| ( sk2 @ sk5 )
| ( sk1 @ sk5 ) ) ),
inference(cnf,[status(esa)],[25]) ).
thf(29,plain,
( ~ ( sk2 @ sk3 )
| ( sk1 @ sk5 )
| ( sk1 @ sk5 ) ),
inference(cnfConj,[status(thm)],[28]) ).
thf(31,plain,
( ~ ( sk2 @ sk3 )
| ( sk1 @ sk5 ) ),
inference(simp,[status(thm)],[29]) ).
thf(285,plain,
( ( sk1 @ sk9 )
| ~ $true
| ( sk1 @ sk5 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[262,31]) ).
thf(286,plain,
( ( sk1 @ sk9 )
| ( sk1 @ sk5 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(simp,[status(thm)],[285]) ).
thf(287,plain,
( ( sk1 @ sk9 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[286:[]]) ).
thf(322,plain,
( ( sk1 @ sk5 )
| ( ( sk1 @ sk9 )
!= ( sk1 @ sk5 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[287]) ).
thf(329,plain,
( ( sk1 @ sk5 )
| ( sk9 != sk5 ) ),
inference(simp,[status(thm)],[322]) ).
thf(277,plain,
( ( sk1 @ sk9 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ~ $true
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[262,12]) ).
thf(278,plain,
( ( sk1 @ sk9 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(simp,[status(thm)],[277]) ).
thf(279,plain,
( ( sk1 @ sk9 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= sk1 ) ),
inference(pattern_uni,[status(thm)],[278:[]]) ).
thf(195,plain,
( ~ ( sk2 @ sk3 )
| ~ $true
| ( ( sk2 @ sk5 )
!= ( sk2 @ sk3 ) )
| ( ( sk1 @ sk5 )
!= ( sk1 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[158,33]) ).
thf(196,plain,
( ~ ( sk2 @ sk3 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ sk3 ) )
| ( ( sk1 @ sk5 )
!= ( sk1 @ sk3 ) ) ),
inference(simp,[status(thm)],[195]) ).
thf(208,plain,
( ~ ( sk2 @ sk3 )
| ( sk5 != sk3 )
| ( sk5 != sk3 ) ),
inference(simp,[status(thm)],[196]) ).
thf(212,plain,
( ~ ( sk2 @ sk3 )
| ( sk5 != sk3 ) ),
inference(simp,[status(thm)],[208]) ).
thf(269,plain,
( ( sk1 @ sk9 )
| ~ $true
| ( sk5 != sk3 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[262,212]) ).
thf(270,plain,
( ( sk1 @ sk9 )
| ( sk5 != sk3 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(simp,[status(thm)],[269]) ).
thf(271,plain,
( ( sk1 @ sk9 )
| ( sk5 != sk3 ) ),
inference(pattern_uni,[status(thm)],[270:[]]) ).
thf(263,plain,
( ( sk2 @ sk3 )
| ~ ( sk2 @ sk9 ) ),
inference(cnfConj,[status(thm)],[261]) ).
thf(42,plain,
( ( sk1 @ sk3 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk3 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[23]) ).
thf(46,plain,
( ( sk1 @ sk3 )
| ( sk4 != sk3 ) ),
inference(simp,[status(thm)],[42]) ).
thf(61,plain,
! [A: a] :
( ( sk4 != sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ~ $true
| ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[46,13]) ).
thf(62,plain,
! [A: a] :
( ( sk4 != sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
& ( sk2 @ B ) ) )
= sk1 )
| ( sk2 @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[61]) ).
thf(63,plain,
( ( sk4 != sk3 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
= sk1 )
| ( sk2 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[62:[bind(A,$thf( sk3 ))]]) ).
thf(110,plain,
( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ( ( sk1 = sk1 )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[63,5]) ).
thf(111,plain,
( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) )
| ( ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
& ( sk2 @ A ) ) ) ) ),
inference(simp,[status(thm)],[110]) ).
thf(112,plain,
( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ~ ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ),
inference(pattern_uni,[status(thm)],[111:[]]) ).
thf(125,plain,
( ( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ( sk1 @ sk7 ) )
& ( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ~ ( sk2 @ sk7 ) ) ),
inference(cnf,[status(esa)],[112]) ).
thf(126,plain,
( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ( sk1 @ sk7 ) ),
inference(cnfConj,[status(thm)],[125]) ).
thf(282,plain,
( ( sk1 @ sk9 )
| ( ( ( sk1 @ sk5 )
& ( sk2 @ sk5 ) )
!= ( sk1 @ sk5 ) )
| ~ $true
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[262,15]) ).
thf(283,plain,
( ( sk1 @ sk9 )
| ( ( ( sk1 @ sk5 )
& ( sk2 @ sk5 ) )
!= ( sk1 @ sk5 ) )
| ( ( sk2 @ sk3 )
!= ( sk2 @ sk3 ) ) ),
inference(simp,[status(thm)],[282]) ).
thf(284,plain,
( ( sk1 @ sk9 )
| ( ( ( sk1 @ sk5 )
& ( sk2 @ sk5 ) )
!= ( sk1 @ sk5 ) ) ),
inference(pattern_uni,[status(thm)],[283:[]]) ).
thf(416,plain,
( ( ( ( sk1 @ sk10 )
& ( sk2 @ sk10 ) )
!= ( sk1 @ sk10 ) )
| ( sk1 @ sk9 ) ),
inference(func_ext,[status(esa)],[279]) ).
thf(57,plain,
! [B: a,A: a] :
( ( ( ( sk1 @ B )
& ( sk2 @ B ) )
= ( sk1 @ B ) )
| ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(func_ext,[status(esa)],[13]) ).
thf(328,plain,
( ( sk1 @ sk5 )
| ( ( sk1 @ sk9 )
!= ( sk1 @ sk5 ) ) ),
inference(simp,[status(thm)],[322]) ).
thf(127,plain,
( ( sk4 != sk3 )
| ( sk2 @ sk3 )
| ~ ( sk2 @ sk7 ) ),
inference(cnfConj,[status(thm)],[125]) ).
thf(605,plain,
$false,
inference(e,[status(thm)],[5,33,329,13,279,27,12,271,3,263,158,287,262,126,15,284,416,57,328,212,199,127,31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU849^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % 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.08/0.12 % Computer : n012.cluster.edu
% 0.08/0.12 % Model : x86_64 x86_64
% 0.08/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.12 % Memory : 8046.5625MB
% 0.08/0.12 % OS : Linux 6.8.0-71-generic
% 0.08/0.12 % CPULimit : 300
% 0.08/0.12 % WCLimit : 300
% 0.08/0.12 % DateTime : Tue Sep 29 14:39:33 UTC 2026
% 0.08/0.12 % CPUTime :
% 0.08/0.12 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.41/0.42 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.56/0.52 % [INFO] Parsing done (95ms).
% 0.56/0.52 % [INFO] Running in sequential loop mode.
% 0.99/0.73 % [INFO] eprover registered as external prover.
% 0.99/0.73 % [INFO] Scanning for conjecture ...
% 0.99/0.77 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 0.99/0.79 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 0.99/0.79 % [INFO] Problem is higher-order (TPTP THF).
% 0.99/0.79 % [INFO] Type checking passed.
% 0.99/0.79 % [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.35/1.69 % External prover 'e' found a proof!
% 3.35/1.69 % [INFO] Killing All external provers ...
% 3.35/1.69 % Time passed: 1494ms (effective reasoning time: 1166ms)
% 3.35/1.69 % 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.35/1.69 % Axioms used in derivation (0):
% 3.35/1.69 % No. of inferences in proof: 79
% 3.35/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1494 ms resp. 1166 ms w/o parsing
% 3.78/1.73 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.78/1.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------