TSTP Solution File: SET627+3 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 03:03:42 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 91 ( 56 unt; 8 typ; 0 def)
% Number of atoms : 406 ( 102 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 691 ( 133 ~; 101 |; 10 &; 439 @)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 177 ( 0 ^ 175 !; 2 ?; 177 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_disjoint,type,
disjoint: $i > $i > $o ).
thf(tp_empty,type,
empty: $i > $o ).
thf(tp_empty_set,type,
empty_set: $i ).
thf(tp_intersect,type,
intersect: $i > $i > $o ).
thf(tp_member,type,
member: $i > $i > $o ).
thf(tp_sK1_B,type,
sK1_B: $i ).
thf(tp_sK2_C,type,
sK2_C: $i > $i ).
thf(tp_sK3_D,type,
sK3_D: $i > $i > $i ).
thf(1,axiom,
! [B: $i] :
( ( empty @ B )
<=> ! [C: $i] :
~ ( member @ C @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_defn) ).
thf(2,axiom,
! [B: $i,C: $i] :
( ( intersect @ B @ C )
=> ( intersect @ C @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_intersect) ).
thf(3,axiom,
! [B: $i,C: $i] :
( ( disjoint @ B @ C )
<=> ~ ( intersect @ B @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
thf(4,axiom,
! [B: $i,C: $i] :
( ( intersect @ B @ C )
<=> ? [D: $i] :
( ( member @ D @ B )
& ( member @ D @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
thf(5,axiom,
! [B: $i] :
~ ( member @ B @ empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
thf(6,conjecture,
! [B: $i] : ( disjoint @ B @ empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th104) ).
thf(7,negated_conjecture,
( ( ! [B: $i] : ( disjoint @ B @ empty_set ) )
= $false ),
inference(negate_conjecture,[status(cth)],[6]) ).
thf(8,plain,
( ( ! [B: $i] : ( disjoint @ B @ empty_set ) )
= $false ),
inference(unfold_def,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [B: $i] :
( ( empty @ B )
<=> ! [C: $i] :
~ ( member @ C @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(10,plain,
( ( ! [B: $i,C: $i] :
( ( intersect @ B @ C )
=> ( intersect @ C @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(11,plain,
( ( ! [B: $i,C: $i] :
( ( disjoint @ B @ C )
<=> ~ ( intersect @ B @ C ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(12,plain,
( ( ! [B: $i,C: $i] :
( ( intersect @ B @ C )
<=> ? [D: $i] :
( ( member @ D @ B )
& ( member @ D @ C ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(13,plain,
( ( ! [B: $i] :
~ ( member @ B @ empty_set ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(14,plain,
( ( disjoint @ sK1_B @ empty_set )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[8]) ).
thf(15,plain,
( ( ~ ( disjoint @ sK1_B @ empty_set ) )
= $true ),
inference(polarity_switch,[status(thm)],[14]) ).
thf(16,plain,
( ( ! [B: $i] :
( ( member @ ( sK2_C @ B ) @ B )
| ( empty @ B ) )
& ! [B: $i] :
( ~ ( empty @ B )
| ! [C: $i] :
~ ( member @ C @ B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(17,plain,
( ( ! [B: $i,C: $i] :
( ~ ( intersect @ B @ C )
| ( intersect @ C @ B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(18,plain,
( ( ! [B: $i,C: $i] :
( ~ ( disjoint @ B @ C )
| ~ ( intersect @ B @ C ) )
& ! [B: $i,C: $i] :
( ( intersect @ B @ C )
| ( disjoint @ B @ C ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(19,plain,
( ( ! [B: $i,C: $i] :
( ! [D: $i] :
( ~ ( member @ D @ B )
| ~ ( member @ D @ C ) )
| ( intersect @ B @ C ) )
& ! [B: $i,C: $i] :
( ~ ( intersect @ B @ C )
| ( ( member @ ( sK3_D @ C @ B ) @ B )
& ( member @ ( sK3_D @ C @ B ) @ C ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(20,plain,
( ( ! [B: $i] :
~ ( member @ B @ empty_set ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(21,plain,
( ( ! [B: $i,C: $i] :
( ! [D: $i] :
( ~ ( member @ D @ B )
| ~ ( member @ D @ C ) )
| ( intersect @ B @ C ) )
& ! [B: $i,C: $i] :
( ~ ( intersect @ B @ C )
| ( ( member @ ( sK3_D @ C @ B ) @ B )
& ( member @ ( sK3_D @ C @ B ) @ C ) ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(22,plain,
( ( ! [B: $i,C: $i] :
( ~ ( disjoint @ B @ C )
| ~ ( intersect @ B @ C ) )
& ! [B: $i,C: $i] :
( ( intersect @ B @ C )
| ( disjoint @ B @ C ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(23,plain,
( ( ! [B: $i,C: $i] :
( ~ ( intersect @ B @ C )
| ( intersect @ C @ B ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(24,plain,
( ( ! [B: $i] :
( ( member @ ( sK2_C @ B ) @ B )
| ( empty @ B ) )
& ! [B: $i] :
( ~ ( empty @ B )
| ! [C: $i] :
~ ( member @ C @ B ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(25,plain,
( ( ~ ( disjoint @ sK1_B @ empty_set ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(26,plain,
( ( ~ ( ~ ! [SX0: $i,SX1: $i] :
( ! [SX2: $i] :
( ~ ( member @ SX2 @ SX0 )
| ~ ( member @ SX2 @ SX1 ) )
| ( intersect @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ~ ( intersect @ SX0 @ SX1 )
| ~ ( ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX0 )
| ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX1 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[21]) ).
thf(27,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ( member @ ( sK2_C @ SX0 ) @ SX0 )
| ( empty @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( empty @ SX0 )
| ! [SX1: $i] :
~ ( member @ SX1 @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[24]) ).
thf(28,plain,
( ( ~ ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ~ ( intersect @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ( intersect @ SX0 @ SX1 )
| ( disjoint @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[22]) ).
thf(29,plain,
! [SV1: $i] :
( ( ~ ( member @ SV1 @ empty_set ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(30,plain,
! [SV2: $i] :
( ( ! [SY11: $i] :
( ~ ( intersect @ SV2 @ SY11 )
| ( intersect @ SY11 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(31,plain,
( ( disjoint @ sK1_B @ empty_set )
= $false ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(32,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ! [SX2: $i] :
( ~ ( member @ SX2 @ SX0 )
| ~ ( member @ SX2 @ SX1 ) )
| ( intersect @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ~ ( intersect @ SX0 @ SX1 )
| ~ ( ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX0 )
| ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX1 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(33,plain,
( ( ~ ! [SX0: $i] :
( ( member @ ( sK2_C @ SX0 ) @ SX0 )
| ( empty @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( empty @ SX0 )
| ! [SX1: $i] :
~ ( member @ SX1 @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(34,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ~ ( intersect @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ( intersect @ SX0 @ SX1 )
| ( disjoint @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(35,plain,
! [SV1: $i] :
( ( member @ SV1 @ empty_set )
= $false ),
inference(extcnf_not_pos,[status(thm)],[29]) ).
thf(36,plain,
! [SV3: $i,SV2: $i] :
( ( ~ ( intersect @ SV2 @ SV3 )
| ( intersect @ SV3 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(37,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ! [SX2: $i] :
( ~ ( member @ SX2 @ SX0 )
| ~ ( member @ SX2 @ SX1 ) )
| ( intersect @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[32]) ).
thf(38,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( intersect @ SX0 @ SX1 )
| ~ ( ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX0 )
| ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX1 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[32]) ).
thf(39,plain,
( ( ~ ! [SX0: $i] :
( ( member @ ( sK2_C @ SX0 ) @ SX0 )
| ( empty @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[33]) ).
thf(40,plain,
( ( ~ ! [SX0: $i] :
( ~ ( empty @ SX0 )
| ! [SX1: $i] :
~ ( member @ SX1 @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[33]) ).
thf(41,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ~ ( intersect @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(42,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ( intersect @ SX0 @ SX1 )
| ( disjoint @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(43,plain,
! [SV3: $i,SV2: $i] :
( ( ( ~ ( intersect @ SV2 @ SV3 ) )
= $true )
| ( ( intersect @ SV3 @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(44,plain,
( ( ! [SX0: $i,SX1: $i] :
( ! [SX2: $i] :
( ~ ( member @ SX2 @ SX0 )
| ~ ( member @ SX2 @ SX1 ) )
| ( intersect @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[37]) ).
thf(45,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( intersect @ SX0 @ SX1 )
| ~ ( ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX0 )
| ~ ( member @ ( sK3_D @ SX1 @ SX0 ) @ SX1 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[38]) ).
thf(46,plain,
( ( ! [SX0: $i] :
( ( member @ ( sK2_C @ SX0 ) @ SX0 )
| ( empty @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[39]) ).
thf(47,plain,
( ( ! [SX0: $i] :
( ~ ( empty @ SX0 )
| ! [SX1: $i] :
~ ( member @ SX1 @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[40]) ).
thf(48,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ~ ( intersect @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[41]) ).
thf(49,plain,
( ( ! [SX0: $i,SX1: $i] :
( ( intersect @ SX0 @ SX1 )
| ( disjoint @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[42]) ).
thf(50,plain,
! [SV3: $i,SV2: $i] :
( ( ( intersect @ SV2 @ SV3 )
= $false )
| ( ( intersect @ SV3 @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[43]) ).
thf(51,plain,
! [SV4: $i] :
( ( ! [SY12: $i] :
( ! [SY13: $i] :
( ~ ( member @ SY13 @ SV4 )
| ~ ( member @ SY13 @ SY12 ) )
| ( intersect @ SV4 @ SY12 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(52,plain,
! [SV5: $i] :
( ( ! [SY14: $i] :
( ~ ( intersect @ SV5 @ SY14 )
| ~ ( ~ ( member @ ( sK3_D @ SY14 @ SV5 ) @ SV5 )
| ~ ( member @ ( sK3_D @ SY14 @ SV5 ) @ SY14 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(53,plain,
! [SV6: $i] :
( ( ( member @ ( sK2_C @ SV6 ) @ SV6 )
| ( empty @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(54,plain,
! [SV7: $i] :
( ( ~ ( empty @ SV7 )
| ! [SY15: $i] :
~ ( member @ SY15 @ SV7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(55,plain,
! [SV8: $i] :
( ( ! [SY16: $i] :
( ~ ( disjoint @ SV8 @ SY16 )
| ~ ( intersect @ SV8 @ SY16 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[48]) ).
thf(56,plain,
! [SV9: $i] :
( ( ! [SY17: $i] :
( ( intersect @ SV9 @ SY17 )
| ( disjoint @ SV9 @ SY17 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[49]) ).
thf(57,plain,
! [SV10: $i,SV4: $i] :
( ( ! [SY18: $i] :
( ~ ( member @ SY18 @ SV4 )
| ~ ( member @ SY18 @ SV10 ) )
| ( intersect @ SV4 @ SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(58,plain,
! [SV11: $i,SV5: $i] :
( ( ~ ( intersect @ SV5 @ SV11 )
| ~ ( ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV5 )
| ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[52]) ).
thf(59,plain,
! [SV6: $i] :
( ( ( member @ ( sK2_C @ SV6 ) @ SV6 )
= $true )
| ( ( empty @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(60,plain,
! [SV7: $i] :
( ( ( ~ ( empty @ SV7 ) )
= $true )
| ( ( ! [SY15: $i] :
~ ( member @ SY15 @ SV7 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[54]) ).
thf(61,plain,
! [SV12: $i,SV8: $i] :
( ( ~ ( disjoint @ SV8 @ SV12 )
| ~ ( intersect @ SV8 @ SV12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[55]) ).
thf(62,plain,
! [SV13: $i,SV9: $i] :
( ( ( intersect @ SV9 @ SV13 )
| ( disjoint @ SV9 @ SV13 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[56]) ).
thf(63,plain,
! [SV10: $i,SV4: $i] :
( ( ( ! [SY18: $i] :
( ~ ( member @ SY18 @ SV4 )
| ~ ( member @ SY18 @ SV10 ) ) )
= $true )
| ( ( intersect @ SV4 @ SV10 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[57]) ).
thf(64,plain,
! [SV11: $i,SV5: $i] :
( ( ( ~ ( intersect @ SV5 @ SV11 ) )
= $true )
| ( ( ~ ( ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV5 )
| ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV11 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[58]) ).
thf(65,plain,
! [SV7: $i] :
( ( ( empty @ SV7 )
= $false )
| ( ( ! [SY15: $i] :
~ ( member @ SY15 @ SV7 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[60]) ).
thf(66,plain,
! [SV12: $i,SV8: $i] :
( ( ( ~ ( disjoint @ SV8 @ SV12 ) )
= $true )
| ( ( ~ ( intersect @ SV8 @ SV12 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[61]) ).
thf(67,plain,
! [SV13: $i,SV9: $i] :
( ( ( intersect @ SV9 @ SV13 )
= $true )
| ( ( disjoint @ SV9 @ SV13 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[62]) ).
thf(68,plain,
! [SV10: $i,SV4: $i,SV14: $i] :
( ( ( ~ ( member @ SV14 @ SV4 )
| ~ ( member @ SV14 @ SV10 ) )
= $true )
| ( ( intersect @ SV4 @ SV10 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[63]) ).
thf(69,plain,
! [SV11: $i,SV5: $i] :
( ( ( intersect @ SV5 @ SV11 )
= $false )
| ( ( ~ ( ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV5 )
| ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV11 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[64]) ).
thf(70,plain,
! [SV7: $i,SV15: $i] :
( ( ( ~ ( member @ SV15 @ SV7 ) )
= $true )
| ( ( empty @ SV7 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[65]) ).
thf(71,plain,
! [SV12: $i,SV8: $i] :
( ( ( disjoint @ SV8 @ SV12 )
= $false )
| ( ( ~ ( intersect @ SV8 @ SV12 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[66]) ).
thf(72,plain,
! [SV10: $i,SV4: $i,SV14: $i] :
( ( ( ~ ( member @ SV14 @ SV4 ) )
= $true )
| ( ( ~ ( member @ SV14 @ SV10 ) )
= $true )
| ( ( intersect @ SV4 @ SV10 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[68]) ).
thf(73,plain,
! [SV5: $i,SV11: $i] :
( ( ( ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV5 )
| ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV11 ) )
= $false )
| ( ( intersect @ SV5 @ SV11 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[69]) ).
thf(74,plain,
! [SV7: $i,SV15: $i] :
( ( ( member @ SV15 @ SV7 )
= $false )
| ( ( empty @ SV7 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[70]) ).
thf(75,plain,
! [SV12: $i,SV8: $i] :
( ( ( intersect @ SV8 @ SV12 )
= $false )
| ( ( disjoint @ SV8 @ SV12 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[71]) ).
thf(76,plain,
! [SV10: $i,SV4: $i,SV14: $i] :
( ( ( member @ SV14 @ SV4 )
= $false )
| ( ( ~ ( member @ SV14 @ SV10 ) )
= $true )
| ( ( intersect @ SV4 @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[72]) ).
thf(77,plain,
! [SV5: $i,SV11: $i] :
( ( ( ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV5 ) )
= $false )
| ( ( intersect @ SV5 @ SV11 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[73]) ).
thf(78,plain,
! [SV5: $i,SV11: $i] :
( ( ( ~ ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV11 ) )
= $false )
| ( ( intersect @ SV5 @ SV11 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[73]) ).
thf(79,plain,
! [SV4: $i,SV10: $i,SV14: $i] :
( ( ( member @ SV14 @ SV10 )
= $false )
| ( ( member @ SV14 @ SV4 )
= $false )
| ( ( intersect @ SV4 @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[76]) ).
thf(80,plain,
! [SV5: $i,SV11: $i] :
( ( ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV5 )
= $true )
| ( ( intersect @ SV5 @ SV11 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[77]) ).
thf(81,plain,
! [SV5: $i,SV11: $i] :
( ( ( member @ ( sK3_D @ SV11 @ SV5 ) @ SV11 )
= $true )
| ( ( intersect @ SV5 @ SV11 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[78]) ).
thf(82,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[31,81,80,79,75,74,67,59,50,35]) ).
thf(83,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 15:05:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 5
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:5,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:7,loop_count:0,foatp_calls:0,translation:fof_full).....
% 0.20/0.40
% 0.20/0.40 ********************************
% 0.20/0.40 * All subproblems solved! *
% 0.20/0.40 ********************************
% 0.20/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:5,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:82,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.40
% 0.20/0.40 %**** Beginning of derivation protocol ****
% 0.20/0.40 % SZS output start CNFRefutation
% See solution above
% 0.20/0.40
% 0.20/0.40 %**** End of derivation protocol ****
% 0.20/0.40 %**** no. of clauses in derivation: 83 ****
% 0.20/0.40 %**** clause counter: 82 ****
% 0.20/0.40
% 0.20/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:5,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:82,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------