%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SEU625^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:45:43 AM UTC 2026
% Result : Theorem 0.09s 0.21s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 63 ( 49 unt; 0 typ; 5 def)
% Number of atoms : 325 ( 99 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 589 ( 45 ~; 61 |; 0 &; 436 @)
% ( 0 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 167 ( 0 ^; 167 !; 0 ?; 167 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_binunion,type,
binunion: $i > $i > $i ).
thf(tp_binunionLsub,type,
binunionLsub: $o ).
thf(tp_binunionRsub,type,
binunionRsub: $o ).
thf(tp_emptyset,type,
emptyset: $i ).
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_sK1_SX0,type,
sK1_SX0: $i ).
thf(tp_sK2_SY30,type,
sK2_SY30: $i ).
thf(tp_sK3_SY35,type,
sK3_SY35: $i ).
thf(tp_sK4_SY34,type,
sK4_SY34: $i > $i > $i ).
thf(tp_sK5_SY37,type,
sK5_SY37: $i ).
thf(tp_setadjoin,type,
setadjoin: $i > $i > $i ).
thf(tp_subset,type,
subset: $i > $i > $o ).
thf(tp_subsetE,type,
subsetE: $o ).
thf(tp_subsetI2,type,
subsetI2: $o ).
thf(tp_upairset2E,type,
upairset2E: $o ).
thf(binunionLsub,definition,
( binunionLsub
= ( ! [A: $i,B: $i] : ( subset @ A @ ( binunion @ A @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionLsub) ).
thf(binunionRsub,definition,
( binunionRsub
= ( ! [A: $i,B: $i] : ( subset @ B @ ( binunion @ A @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionRsub) ).
thf(subsetE,definition,
( subsetE
= ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(subsetI2,definition,
( subsetI2
= ( ! [A: $i,B: $i] :
( ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( in @ Xx @ B ) )
=> ( subset @ A @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI2) ).
thf(upairset2E,definition,
( upairset2E
= ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( in @ Xz @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) )
=> ( ( Xz = Xx )
| ( Xz = Xy ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairset2E) ).
thf(1,conjecture,
( subsetI2
=> ( subsetE
=> ( binunionLsub
=> ( binunionRsub
=> ( upairset2E
=> ! [A: $i,B: $i,Xx: $i] :
( ( in @ Xx @ A )
=> ! [Xy: $i] :
( ( in @ Xy @ B )
=> ( subset @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ ( binunion @ A @ B ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairsubunion) ).
thf(2,negated_conjecture,
( ( subsetI2
=> ( subsetE
=> ( binunionLsub
=> ( binunionRsub
=> ( upairset2E
=> ! [A: $i,B: $i,Xx: $i] :
( ( in @ Xx @ A )
=> ! [Xy: $i] :
( ( in @ Xy @ B )
=> ( subset @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ ( binunion @ A @ B ) ) ) ) ) ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i,B: $i] :
( ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( in @ Xx @ B ) )
=> ( subset @ A @ B ) )
=> ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) )
=> ( ! [A: $i,B: $i] : ( subset @ A @ ( binunion @ A @ B ) )
=> ( ! [A: $i,B: $i] : ( subset @ B @ ( binunion @ A @ B ) )
=> ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( in @ Xz @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) )
=> ( ( Xz = Xx )
| ( Xz = Xy ) ) )
=> ! [A: $i,B: $i,Xx: $i] :
( ( in @ Xx @ A )
=> ! [Xy: $i] :
( ( in @ Xy @ B )
=> ( subset @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ ( binunion @ A @ B ) ) ) ) ) ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,binunionLsub,binunionRsub,subsetE,subsetI2,upairset2E]) ).
thf(4,plain,
( ( ! [A: $i,B: $i] :
( ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( in @ Xx @ B ) )
=> ( subset @ A @ B ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [A: $i,B: $i] : ( subset @ A @ ( binunion @ A @ B ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ! [A: $i,B: $i] : ( subset @ B @ ( binunion @ A @ B ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( in @ Xz @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) )
=> ( ( Xz = Xx )
| ( Xz = Xy ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(9,plain,
( ( ! [A: $i,B: $i,Xx: $i] :
( ( in @ Xx @ A )
=> ! [Xy: $i] :
( ( in @ Xy @ B )
=> ( subset @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ ( binunion @ A @ B ) ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(10,plain,
( ( ~ ! [A: $i,B: $i,Xx: $i] :
( ( in @ Xx @ A )
=> ! [Xy: $i] :
( ( in @ Xy @ B )
=> ( subset @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ ( binunion @ A @ B ) ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( in @ Xz @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) )
=> ( ( Xz = Xx )
| ( Xz = Xy ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,plain,
( ( ! [A: $i,B: $i] : ( subset @ B @ ( binunion @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(13,plain,
( ( ! [A: $i,B: $i] : ( subset @ A @ ( binunion @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(14,plain,
( ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(15,plain,
( ( ! [A: $i,B: $i] :
( ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( in @ Xx @ B ) )
=> ( subset @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(16,plain,
( ( ~ ! [A: $i,B: $i,Xx: $i] :
( ( in @ Xx @ A )
=> ! [Xy: $i] :
( ( in @ Xy @ B )
=> ( subset @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ ( binunion @ A @ B ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(17,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( subset @ SX0 @ SX1 )
| ~ ( in @ SX2 @ SX0 )
| ( in @ SX2 @ SX1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[14,binunionLsub,binunionRsub,subsetE,subsetI2,upairset2E]) ).
thf(18,plain,
( ( ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( in @ SX2 @ SX0 )
| ! [SX3: $i] :
( ~ ( in @ SX3 @ SX1 )
| ( subset @ ( setadjoin @ SX2 @ ( setadjoin @ SX3 @ emptyset ) ) @ ( binunion @ SX0 @ SX1 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[16,binunionLsub,binunionRsub,subsetE,subsetI2,upairset2E]) ).
thf(19,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( in @ SX2 @ ( setadjoin @ SX0 @ ( setadjoin @ SX1 @ emptyset ) ) )
| ( SX2 = SX0 )
| ( SX2 = SX1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11,binunionLsub,binunionRsub,subsetE,subsetI2,upairset2E]) ).
thf(20,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ! [SX2: $i] :
( ~ ( in @ SX2 @ SX0 )
| ( in @ SX2 @ SX1 ) )
| ( subset @ SX0 @ SX1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[15,binunionLsub,binunionRsub,subsetE,subsetI2,upairset2E]) ).
thf(21,plain,
! [SV1: $i] :
( ( ! [SY21: $i] : ( subset @ SY21 @ ( binunion @ SV1 @ SY21 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(22,plain,
! [SV2: $i] :
( ( ! [SY22: $i] : ( subset @ SV2 @ ( binunion @ SV2 @ SY22 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(23,plain,
! [SV3: $i] :
( ( ! [SY23: $i,SY24: $i] :
( ~ ( subset @ SV3 @ SY23 )
| ~ ( in @ SY24 @ SV3 )
| ( in @ SY24 @ SY23 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(24,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( in @ SX2 @ SX0 )
| ! [SX3: $i] :
( ~ ( in @ SX3 @ SX1 )
| ( subset @ ( setadjoin @ SX2 @ ( setadjoin @ SX3 @ emptyset ) ) @ ( binunion @ SX0 @ SX1 ) ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(25,plain,
! [SV4: $i] :
( ( ! [SY25: $i,SY26: $i] :
( ~ ( in @ SY26 @ ( setadjoin @ SV4 @ ( setadjoin @ SY25 @ emptyset ) ) )
| ( SY26 = SV4 )
| ( SY26 = SY25 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(26,plain,
! [SV5: $i] :
( ( ! [SY27: $i] :
( ~ ! [SY28: $i] :
( ~ ( in @ SY28 @ SV5 )
| ( in @ SY28 @ SY27 ) )
| ( subset @ SV5 @ SY27 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(27,plain,
! [SV1: $i,SV6: $i] :
( ( subset @ SV6 @ ( binunion @ SV1 @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(28,plain,
! [SV7: $i,SV2: $i] :
( ( subset @ SV2 @ ( binunion @ SV2 @ SV7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(29,plain,
! [SV8: $i,SV3: $i] :
( ( ! [SY29: $i] :
( ~ ( subset @ SV3 @ SV8 )
| ~ ( in @ SY29 @ SV3 )
| ( in @ SY29 @ SV8 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(30,plain,
( ( ! [SY30: $i,SY31: $i] :
( ~ ( in @ SY31 @ sK1_SX0 )
| ! [SY32: $i] :
( ~ ( in @ SY32 @ SY30 )
| ( subset @ ( setadjoin @ SY31 @ ( setadjoin @ SY32 @ emptyset ) ) @ ( binunion @ sK1_SX0 @ SY30 ) ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[24]) ).
thf(31,plain,
! [SV9: $i,SV4: $i] :
( ( ! [SY33: $i] :
( ~ ( in @ SY33 @ ( setadjoin @ SV4 @ ( setadjoin @ SV9 @ emptyset ) ) )
| ( SY33 = SV4 )
| ( SY33 = SV9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(32,plain,
! [SV10: $i,SV5: $i] :
( ( ~ ! [SY34: $i] :
( ~ ( in @ SY34 @ SV5 )
| ( in @ SY34 @ SV10 ) )
| ( subset @ SV5 @ SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(33,plain,
! [SV11: $i,SV8: $i,SV3: $i] :
( ( ~ ( subset @ SV3 @ SV8 )
| ~ ( in @ SV11 @ SV3 )
| ( in @ SV11 @ SV8 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(34,plain,
( ( ! [SY35: $i] :
( ~ ( in @ SY35 @ sK1_SX0 )
| ! [SY36: $i] :
( ~ ( in @ SY36 @ sK2_SY30 )
| ( subset @ ( setadjoin @ SY35 @ ( setadjoin @ SY36 @ emptyset ) ) @ ( binunion @ sK1_SX0 @ sK2_SY30 ) ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[30]) ).
thf(35,plain,
! [SV9: $i,SV4: $i,SV12: $i] :
( ( ~ ( in @ SV12 @ ( setadjoin @ SV4 @ ( setadjoin @ SV9 @ emptyset ) ) )
| ( SV12 = SV4 )
| ( SV12 = SV9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(36,plain,
! [SV10: $i,SV5: $i] :
( ( ( ~ ! [SY34: $i] :
( ~ ( in @ SY34 @ SV5 )
| ( in @ SY34 @ SV10 ) ) )
= $true )
| ( ( subset @ SV5 @ SV10 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[32]) ).
thf(37,plain,
! [SV11: $i,SV8: $i,SV3: $i] :
( ( ( ~ ( subset @ SV3 @ SV8 ) )
= $true )
| ( ( ~ ( in @ SV11 @ SV3 )
| ( in @ SV11 @ SV8 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(38,plain,
( ( ~ ( in @ sK3_SY35 @ sK1_SX0 )
| ! [SY37: $i] :
( ~ ( in @ SY37 @ sK2_SY30 )
| ( subset @ ( setadjoin @ sK3_SY35 @ ( setadjoin @ SY37 @ emptyset ) ) @ ( binunion @ sK1_SX0 @ sK2_SY30 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[34]) ).
thf(39,plain,
! [SV9: $i,SV4: $i,SV12: $i] :
( ( ( ~ ( in @ SV12 @ ( setadjoin @ SV4 @ ( setadjoin @ SV9 @ emptyset ) ) ) )
= $true )
| ( ( ( SV12 = SV4 )
| ( SV12 = SV9 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(40,plain,
! [SV10: $i,SV5: $i] :
( ( ( ! [SY34: $i] :
( ~ ( in @ SY34 @ SV5 )
| ( in @ SY34 @ SV10 ) ) )
= $false )
| ( ( subset @ SV5 @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(41,plain,
! [SV11: $i,SV8: $i,SV3: $i] :
( ( ( subset @ SV3 @ SV8 )
= $false )
| ( ( ~ ( in @ SV11 @ SV3 )
| ( in @ SV11 @ SV8 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(42,plain,
( ( ~ ( in @ sK3_SY35 @ sK1_SX0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[38]) ).
thf(43,plain,
( ( ! [SY37: $i] :
( ~ ( in @ SY37 @ sK2_SY30 )
| ( subset @ ( setadjoin @ sK3_SY35 @ ( setadjoin @ SY37 @ emptyset ) ) @ ( binunion @ sK1_SX0 @ sK2_SY30 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[38]) ).
thf(44,plain,
! [SV9: $i,SV4: $i,SV12: $i] :
( ( ( in @ SV12 @ ( setadjoin @ SV4 @ ( setadjoin @ SV9 @ emptyset ) ) )
= $false )
| ( ( ( SV12 = SV4 )
| ( SV12 = SV9 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(45,plain,
! [SV5: $i,SV10: $i] :
( ( ( ~ ( in @ ( sK4_SY34 @ SV10 @ SV5 ) @ SV5 )
| ( in @ ( sK4_SY34 @ SV10 @ SV5 ) @ SV10 ) )
= $false )
| ( ( subset @ SV5 @ SV10 )
= $true ) ),
inference(extcnf_forall_neg,[status(esa)],[40]) ).
thf(46,plain,
! [SV8: $i,SV3: $i,SV11: $i] :
( ( ( ~ ( in @ SV11 @ SV3 ) )
= $true )
| ( ( in @ SV11 @ SV8 )
= $true )
| ( ( subset @ SV3 @ SV8 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[41]) ).
thf(47,plain,
( ( in @ sK3_SY35 @ sK1_SX0 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[42]) ).
thf(48,plain,
( ( ~ ( in @ sK5_SY37 @ sK2_SY30 )
| ( subset @ ( setadjoin @ sK3_SY35 @ ( setadjoin @ sK5_SY37 @ emptyset ) ) @ ( binunion @ sK1_SX0 @ sK2_SY30 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[43]) ).
thf(49,plain,
! [SV9: $i,SV4: $i,SV12: $i] :
( ( ( SV12 = SV4 )
= $true )
| ( ( SV12 = SV9 )
= $true )
| ( ( in @ SV12 @ ( setadjoin @ SV4 @ ( setadjoin @ SV9 @ emptyset ) ) )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[44]) ).
thf(50,plain,
! [SV5: $i,SV10: $i] :
( ( ( ~ ( in @ ( sK4_SY34 @ SV10 @ SV5 ) @ SV5 ) )
= $false )
| ( ( subset @ SV5 @ SV10 )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(51,plain,
! [SV5: $i,SV10: $i] :
( ( ( in @ ( sK4_SY34 @ SV10 @ SV5 ) @ SV10 )
= $false )
| ( ( subset @ SV5 @ SV10 )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(52,plain,
! [SV8: $i,SV3: $i,SV11: $i] :
( ( ( in @ SV11 @ SV3 )
= $false )
| ( ( in @ SV11 @ SV8 )
= $true )
| ( ( subset @ SV3 @ SV8 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[46]) ).
thf(53,plain,
( ( ~ ( in @ sK5_SY37 @ sK2_SY30 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[48]) ).
thf(54,plain,
( ( subset @ ( setadjoin @ sK3_SY35 @ ( setadjoin @ sK5_SY37 @ emptyset ) ) @ ( binunion @ sK1_SX0 @ sK2_SY30 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[48]) ).
thf(55,plain,
! [SV5: $i,SV10: $i] :
( ( ( in @ ( sK4_SY34 @ SV10 @ SV5 ) @ SV5 )
= $true )
| ( ( subset @ SV5 @ SV10 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[50]) ).
thf(56,plain,
( ( in @ sK5_SY37 @ sK2_SY30 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[53]) ).
thf(57,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[27,56,55,54,52,51,49,47,28]) ).
thf(58,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU625^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.16 % Computer : n011.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Oct 6 15:29:51 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.21
% 0.09/0.21 No.of.Axioms: 0
% 0.09/0.21
% 0.09/0.21 Length.of.Defs: 913
% 0.09/0.21
% 0.09/0.21 Contains.Choice.Funs: false
% 0.09/0.21 ..
% 0.09/0.21
% 0.09/0.21 ********************************
% 0.09/0.21 * All subproblems solved! *
% 0.09/0.21 ********************************
% 0.09/0.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:5,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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:57,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.21
% 0.09/0.21 %**** Beginning of derivation protocol ****
% 0.09/0.21 % SZS output start CNFRefutation
% See solution above
% 0.09/0.21
% 0.09/0.21 %**** End of derivation protocol ****
% 0.09/0.21 %**** no. of clauses in derivation: 58 ****
% 0.09/0.21 %**** clause counter: 57 ****
% 0.09/0.21
% 0.09/0.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:5,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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:57,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------