%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SEU295+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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 Oct 7 10:43:50 AM UTC 2026
% Result : Theorem 0.07s 0.31s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 92 ( 67 unt; 0 typ; 0 def)
% Number of atoms : 384 ( 118 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 474 ( 91 ~; 55 |; 9 &; 299 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 25 usr; 7 con; 0-2 aty)
% Number of variables : 132 ( 0 ^; 129 !; 3 ?; 132 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_being_limit_ordinal,type,
being_limit_ordinal: $i > $o ).
thf(tp_element,type,
element: $i > $i > $o ).
thf(tp_empty,type,
empty: $i > $o ).
thf(tp_empty_set,type,
empty_set: $i ).
thf(tp_epsilon_connected,type,
epsilon_connected: $i > $o ).
thf(tp_epsilon_transitive,type,
epsilon_transitive: $i > $o ).
thf(tp_finite,type,
finite: $i > $o ).
thf(tp_function,type,
function: $i > $o ).
thf(tp_function_yielding,type,
function_yielding: $i > $o ).
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_natural,type,
natural: $i > $o ).
thf(tp_one_to_one,type,
one_to_one: $i > $o ).
thf(tp_ordinal,type,
ordinal: $i > $o ).
thf(tp_ordinal_yielding,type,
ordinal_yielding: $i > $o ).
thf(tp_positive_rationals,type,
positive_rationals: $i ).
thf(tp_powerset,type,
powerset: $i > $i ).
thf(tp_relation,type,
relation: $i > $o ).
thf(tp_relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
thf(tp_relation_non_empty,type,
relation_non_empty: $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY19,type,
sK2_SY19: $i ).
thf(tp_sK3_SX0,type,
sK3_SX0: $i ).
thf(tp_set_intersection2,type,
set_intersection2: $i > $i > $i ).
thf(tp_subset,type,
subset: $i > $i > $o ).
thf(tp_transfinite_sequence,type,
transfinite_sequence: $i > $o ).
thf(8,axiom,
! [A: $i] :
( ( set_intersection2 @ A @ empty_set )
= empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_boole) ).
thf(10,axiom,
! [A: $i,B: $i] : ( subset @ ( set_intersection2 @ A @ B ) @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
thf(11,axiom,
! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( finite @ B ) )
=> ( finite @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
thf(36,axiom,
? [A: $i] :
( ~ ( empty @ A )
& ( finite @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_finset_1) ).
thf(38,axiom,
! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
thf(44,axiom,
! [A: $i,B: $i] :
( ( ( relation @ A )
& ( relation @ B ) )
=> ( relation @ ( set_intersection2 @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_relat_1) ).
thf(46,axiom,
! [A: $i,B: $i] :
( ( finite @ A )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc11_finset_1) ).
thf(47,axiom,
! [A: $i,B: $i] :
( ( finite @ B )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc10_finset_1) ).
thf(49,axiom,
! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
thf(59,axiom,
! [A: $i] :
( ( empty @ A )
=> ( finite @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_finset_1) ).
thf(62,conjecture,
! [A: $i,B: $i] :
( ( finite @ A )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_finset_1) ).
thf(63,negated_conjecture,
( ( ! [A: $i,B: $i] :
( ( finite @ A )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[62]) ).
thf(64,plain,
( ( ! [A: $i,B: $i] :
( ( finite @ A )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[63]) ).
thf(65,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ empty_set )
= empty_set ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(66,plain,
( ( ! [A: $i,B: $i] : ( subset @ ( set_intersection2 @ A @ B ) @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(67,plain,
( ( ! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( finite @ B ) )
=> ( finite @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(68,plain,
( ( ? [A: $i] :
( ~ ( empty @ A )
& ( finite @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[36]) ).
thf(69,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[38]) ).
thf(70,plain,
( ( ! [A: $i,B: $i] :
( ( ( relation @ A )
& ( relation @ B ) )
=> ( relation @ ( set_intersection2 @ A @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[44]) ).
thf(71,plain,
( ( ! [A: $i,B: $i] :
( ( finite @ A )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[46]) ).
thf(72,plain,
( ( ! [A: $i,B: $i] :
( ( finite @ B )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[47]) ).
thf(73,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[49]) ).
thf(74,plain,
( ( ! [A: $i] :
( ( empty @ A )
=> ( finite @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[59]) ).
thf(75,plain,
( ( ! [SY19: $i] :
( ( finite @ sK1_A )
=> ( finite @ ( set_intersection2 @ sK1_A @ SY19 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[64]) ).
thf(76,plain,
( ( ( finite @ sK1_A )
=> ( finite @ ( set_intersection2 @ sK1_A @ sK2_SY19 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[75]) ).
thf(77,plain,
( ( finite @ sK1_A )
= $true ),
inference(standard_cnf,[status(thm)],[76]) ).
thf(78,plain,
( ( finite @ ( set_intersection2 @ sK1_A @ sK2_SY19 ) )
= $false ),
inference(standard_cnf,[status(thm)],[76]) ).
thf(79,plain,
( ( ~ ( finite @ ( set_intersection2 @ sK1_A @ sK2_SY19 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[78]) ).
thf(80,plain,
( ( ! [A: $i] :
( ( empty @ A )
=> ( finite @ A ) ) )
= $true ),
inference(copy,[status(thm)],[74]) ).
thf(81,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[73]) ).
thf(82,plain,
( ( ! [A: $i,B: $i] :
( ( finite @ B )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[72]) ).
thf(83,plain,
( ( ! [A: $i,B: $i] :
( ( finite @ A )
=> ( finite @ ( set_intersection2 @ A @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[71]) ).
thf(84,plain,
( ( ! [A: $i,B: $i] :
( ( ( relation @ A )
& ( relation @ B ) )
=> ( relation @ ( set_intersection2 @ A @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[70]) ).
thf(85,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(copy,[status(thm)],[69]) ).
thf(86,plain,
( ( ? [A: $i] :
( ~ ( empty @ A )
& ( finite @ A ) ) )
= $true ),
inference(copy,[status(thm)],[68]) ).
thf(87,plain,
( ( ! [A: $i,B: $i] :
( ( ( subset @ A @ B )
& ( finite @ B ) )
=> ( finite @ A ) ) )
= $true ),
inference(copy,[status(thm)],[67]) ).
thf(88,plain,
( ( ! [A: $i,B: $i] : ( subset @ ( set_intersection2 @ A @ B ) @ A ) )
= $true ),
inference(copy,[status(thm)],[66]) ).
thf(89,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ empty_set )
= empty_set ) )
= $true ),
inference(copy,[status(thm)],[65]) ).
thf(90,plain,
( ( finite @ sK1_A )
= $true ),
inference(copy,[status(thm)],[77]) ).
thf(91,plain,
( ( ~ ( finite @ ( set_intersection2 @ sK1_A @ sK2_SY19 ) ) )
= $true ),
inference(copy,[status(thm)],[79]) ).
thf(92,plain,
( ( ~ ! [SX0: $i] :
~ ~ ( ~ ~ ( empty @ SX0 )
| ~ ( finite @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[86]) ).
thf(93,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( finite @ SX0 )
| ( finite @ ( set_intersection2 @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[83]) ).
thf(94,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ~ ( ~ ( relation @ SX0 )
| ~ ( relation @ SX1 ) )
| ( relation @ ( set_intersection2 @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[84]) ).
thf(95,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ~ ( ~ ( subset @ SX0 @ SX1 )
| ~ ( finite @ SX1 ) )
| ( finite @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[87]) ).
thf(96,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( finite @ SX1 )
| ( finite @ ( set_intersection2 @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[82]) ).
thf(97,plain,
( ( ! [SX0: $i] :
( ~ ( empty @ SX0 )
| ( finite @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[80]) ).
thf(98,plain,
! [SV1: $i] :
( ( ! [SY20: $i] :
( ( set_intersection2 @ SV1 @ SY20 )
= ( set_intersection2 @ SY20 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[81]) ).
thf(99,plain,
! [SV2: $i] :
( ( ! [SY21: $i] :
( ( set_intersection2 @ SV2 @ SV2 )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[85]) ).
thf(100,plain,
! [SV3: $i] :
( ( ! [SY22: $i] : ( subset @ ( set_intersection2 @ SV3 @ SY22 ) @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[88]) ).
thf(101,plain,
! [SV4: $i] :
( ( ( set_intersection2 @ SV4 @ empty_set )
= empty_set )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[89]) ).
thf(102,plain,
( ( finite @ ( set_intersection2 @ sK1_A @ sK2_SY19 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[91]) ).
thf(103,plain,
( ( ! [SX0: $i] :
~ ~ ( ~ ~ ( empty @ SX0 )
| ~ ( finite @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[92]) ).
thf(104,plain,
! [SV5: $i] :
( ( ! [SY23: $i] :
( ~ ( finite @ SV5 )
| ( finite @ ( set_intersection2 @ SV5 @ SY23 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[93]) ).
thf(105,plain,
! [SV6: $i] :
( ( ! [SY24: $i] :
( ~ ~ ( ~ ( relation @ SV6 )
| ~ ( relation @ SY24 ) )
| ( relation @ ( set_intersection2 @ SV6 @ SY24 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[94]) ).
thf(106,plain,
! [SV7: $i] :
( ( ! [SY25: $i] :
( ~ ~ ( ~ ( subset @ SV7 @ SY25 )
| ~ ( finite @ SY25 ) )
| ( finite @ SV7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[95]) ).
thf(107,plain,
! [SV8: $i] :
( ( ! [SY26: $i] :
( ~ ( finite @ SY26 )
| ( finite @ ( set_intersection2 @ SV8 @ SY26 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[96]) ).
thf(108,plain,
! [SV9: $i] :
( ( ~ ( empty @ SV9 )
| ( finite @ SV9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[97]) ).
thf(109,plain,
! [SV10: $i,SV1: $i] :
( ( ( set_intersection2 @ SV1 @ SV10 )
= ( set_intersection2 @ SV10 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[98]) ).
thf(110,plain,
! [SV2: $i] :
( ( ( set_intersection2 @ SV2 @ SV2 )
= SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[99]) ).
thf(111,plain,
! [SV12: $i,SV3: $i] :
( ( subset @ ( set_intersection2 @ SV3 @ SV12 ) @ SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[100]) ).
thf(112,plain,
( ( ~ ~ ( ~ ~ ( empty @ sK3_SX0 )
| ~ ( finite @ sK3_SX0 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[103]) ).
thf(113,plain,
! [SV13: $i,SV5: $i] :
( ( ~ ( finite @ SV5 )
| ( finite @ ( set_intersection2 @ SV5 @ SV13 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[104]) ).
thf(114,plain,
! [SV14: $i,SV6: $i] :
( ( ~ ~ ( ~ ( relation @ SV6 )
| ~ ( relation @ SV14 ) )
| ( relation @ ( set_intersection2 @ SV6 @ SV14 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[105]) ).
thf(115,plain,
! [SV15: $i,SV7: $i] :
( ( ~ ~ ( ~ ( subset @ SV7 @ SV15 )
| ~ ( finite @ SV15 ) )
| ( finite @ SV7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[106]) ).
thf(116,plain,
! [SV8: $i,SV16: $i] :
( ( ~ ( finite @ SV16 )
| ( finite @ ( set_intersection2 @ SV8 @ SV16 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[107]) ).
thf(117,plain,
! [SV9: $i] :
( ( ( ~ ( empty @ SV9 ) )
= $true )
| ( ( finite @ SV9 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[108]) ).
thf(118,plain,
( ( ~ ( ~ ~ ( empty @ sK3_SX0 )
| ~ ( finite @ sK3_SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[112]) ).
thf(119,plain,
! [SV13: $i,SV5: $i] :
( ( ( ~ ( finite @ SV5 ) )
= $true )
| ( ( finite @ ( set_intersection2 @ SV5 @ SV13 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[113]) ).
thf(120,plain,
! [SV14: $i,SV6: $i] :
( ( ( ~ ~ ( ~ ( relation @ SV6 )
| ~ ( relation @ SV14 ) ) )
= $true )
| ( ( relation @ ( set_intersection2 @ SV6 @ SV14 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[114]) ).
thf(121,plain,
! [SV15: $i,SV7: $i] :
( ( ( ~ ~ ( ~ ( subset @ SV7 @ SV15 )
| ~ ( finite @ SV15 ) ) )
= $true )
| ( ( finite @ SV7 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[115]) ).
thf(122,plain,
! [SV8: $i,SV16: $i] :
( ( ( ~ ( finite @ SV16 ) )
= $true )
| ( ( finite @ ( set_intersection2 @ SV8 @ SV16 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[116]) ).
thf(123,plain,
! [SV9: $i] :
( ( ( empty @ SV9 )
= $false )
| ( ( finite @ SV9 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[117]) ).
thf(124,plain,
( ( ~ ~ ( empty @ sK3_SX0 )
| ~ ( finite @ sK3_SX0 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[118]) ).
thf(125,plain,
! [SV13: $i,SV5: $i] :
( ( ( finite @ SV5 )
= $false )
| ( ( finite @ ( set_intersection2 @ SV5 @ SV13 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[119]) ).
thf(126,plain,
! [SV14: $i,SV6: $i] :
( ( ( ~ ( ~ ( relation @ SV6 )
| ~ ( relation @ SV14 ) ) )
= $false )
| ( ( relation @ ( set_intersection2 @ SV6 @ SV14 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[120]) ).
thf(127,plain,
! [SV15: $i,SV7: $i] :
( ( ( ~ ( ~ ( subset @ SV7 @ SV15 )
| ~ ( finite @ SV15 ) ) )
= $false )
| ( ( finite @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[121]) ).
thf(128,plain,
! [SV8: $i,SV16: $i] :
( ( ( finite @ SV16 )
= $false )
| ( ( finite @ ( set_intersection2 @ SV8 @ SV16 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[122]) ).
thf(129,plain,
( ( ~ ~ ( empty @ sK3_SX0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[124]) ).
thf(130,plain,
( ( ~ ( finite @ sK3_SX0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[124]) ).
thf(131,plain,
! [SV14: $i,SV6: $i] :
( ( ( ~ ( relation @ SV6 )
| ~ ( relation @ SV14 ) )
= $true )
| ( ( relation @ ( set_intersection2 @ SV6 @ SV14 ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[126]) ).
thf(132,plain,
! [SV15: $i,SV7: $i] :
( ( ( ~ ( subset @ SV7 @ SV15 )
| ~ ( finite @ SV15 ) )
= $true )
| ( ( finite @ SV7 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[127]) ).
thf(133,plain,
( ( ~ ( empty @ sK3_SX0 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[129]) ).
thf(134,plain,
( ( finite @ sK3_SX0 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[130]) ).
thf(135,plain,
! [SV14: $i,SV6: $i] :
( ( ( ~ ( relation @ SV6 ) )
= $true )
| ( ( ~ ( relation @ SV14 ) )
= $true )
| ( ( relation @ ( set_intersection2 @ SV6 @ SV14 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[131]) ).
thf(136,plain,
! [SV15: $i,SV7: $i] :
( ( ( ~ ( subset @ SV7 @ SV15 ) )
= $true )
| ( ( ~ ( finite @ SV15 ) )
= $true )
| ( ( finite @ SV7 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[132]) ).
thf(137,plain,
( ( empty @ sK3_SX0 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[133]) ).
thf(138,plain,
! [SV14: $i,SV6: $i] :
( ( ( relation @ SV6 )
= $false )
| ( ( ~ ( relation @ SV14 ) )
= $true )
| ( ( relation @ ( set_intersection2 @ SV6 @ SV14 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[135]) ).
thf(139,plain,
! [SV15: $i,SV7: $i] :
( ( ( subset @ SV7 @ SV15 )
= $false )
| ( ( ~ ( finite @ SV15 ) )
= $true )
| ( ( finite @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[136]) ).
thf(140,plain,
! [SV6: $i,SV14: $i] :
( ( ( relation @ SV14 )
= $false )
| ( ( relation @ SV6 )
= $false )
| ( ( relation @ ( set_intersection2 @ SV6 @ SV14 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[138]) ).
thf(141,plain,
! [SV7: $i,SV15: $i] :
( ( ( finite @ SV15 )
= $false )
| ( ( subset @ SV7 @ SV15 )
= $false )
| ( ( finite @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[139]) ).
thf(142,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[90,141,140,137,134,128,125,123,111,110,109,102,101]) ).
thf(143,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU295+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.19 % Computer : n020.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Oct 6 15:13:06 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.31
% 0.07/0.31 No.of.Axioms: 10
% 0.07/0.31
% 0.07/0.31 Length.of.Defs: 0
% 0.07/0.31
% 0.07/0.31 Contains.Choice.Funs: false
% 0.07/0.31 ..
% 0.07/0.31
% 0.07/0.31 ********************************
% 0.07/0.31 * All subproblems solved! *
% 0.07/0.31 ********************************
% 0.07/0.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:11,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:142,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.31
% 0.07/0.31 %**** Beginning of derivation protocol ****
% 0.07/0.31 % SZS output start CNFRefutation
% See solution above
% 0.07/0.31
% 0.07/0.31 %**** End of derivation protocol ****
% 0.07/0.31 %**** no. of clauses in derivation: 92 ****
% 0.07/0.31 %**** clause counter: 142 ****
% 0.07/0.31
% 0.07/0.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:11,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:142,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------