TSTP Solution File: SEU140+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n027.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 12:07:01 EDT 2022
% Result : Theorem 0.13s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 29
% Syntax : Number of formulae : 141 ( 98 unt; 11 typ; 0 def)
% Number of atoms : 511 ( 197 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 607 ( 92 ~; 75 |; 14 &; 408 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 201 ( 0 ^ 197 !; 4 ?; 201 :)
% 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_in,type,
in: $i > $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY27,type,
sK2_SY27: $i ).
thf(tp_sK3_SY29,type,
sK3_SY29: $i ).
thf(tp_sK4_A,type,
sK4_A: $i ).
thf(tp_sK5_A,type,
sK5_A: $i ).
thf(tp_set_intersection2,type,
set_intersection2: $i > $i > $i ).
thf(tp_subset,type,
subset: $i > $i > $o ).
thf(1,axiom,
! [A: $i,B: $i] :
~ ( ( empty @ A )
& ( A != B )
& ( empty @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
thf(2,axiom,
! [A: $i,B: $i] :
~ ( ( in @ A @ B )
& ( empty @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
thf(3,axiom,
! [A: $i] :
( ( empty @ A )
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
thf(4,axiom,
! [A: $i] :
( ( subset @ A @ empty_set )
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
thf(5,axiom,
! [A: $i] :
( ( set_intersection2 @ A @ empty_set )
= empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_boole) ).
thf(6,axiom,
! [A: $i,B: $i,C: $i] :
( ( subset @ A @ B )
=> ( subset @ ( set_intersection2 @ A @ C ) @ ( set_intersection2 @ B @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( disjoint @ A @ B )
=> ( disjoint @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
thf(8,axiom,
! [A: $i,B: $i] : ( subset @ A @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(9,axiom,
? [A: $i] :
~ ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(10,axiom,
? [A: $i] : ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(11,axiom,
! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
thf(12,axiom,
empty @ empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
thf(13,axiom,
$true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_xboole_0) ).
thf(14,axiom,
$true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_xboole_0) ).
thf(15,axiom,
! [A: $i,B: $i] :
( ( disjoint @ A @ B )
<=> ( ( set_intersection2 @ A @ B )
= empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
thf(16,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(17,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(18,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( subset @ A @ B )
& ( disjoint @ B @ C ) )
=> ( disjoint @ A @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
thf(19,negated_conjecture,
( ( ! [A: $i,B: $i,C: $i] :
( ( ( subset @ A @ B )
& ( disjoint @ B @ C ) )
=> ( disjoint @ A @ C ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[18]) ).
thf(20,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( ( subset @ A @ B )
& ( disjoint @ B @ C ) )
=> ( disjoint @ A @ C ) ) )
= $false ),
inference(unfold_def,[status(thm)],[19]) ).
thf(21,plain,
( ( ! [A: $i,B: $i] :
~ ( ( empty @ A )
& ( A != B )
& ( empty @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(22,plain,
( ( ! [A: $i,B: $i] :
~ ( ( in @ A @ B )
& ( empty @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(23,plain,
( ( ! [A: $i] :
( ( empty @ A )
=> ( A = empty_set ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(24,plain,
( ( ! [A: $i] :
( ( subset @ A @ empty_set )
=> ( A = empty_set ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(25,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ empty_set )
= empty_set ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(26,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( subset @ A @ B )
=> ( subset @ ( set_intersection2 @ A @ C ) @ ( set_intersection2 @ B @ C ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(27,plain,
( ( ! [A: $i,B: $i] :
( ( disjoint @ A @ B )
=> ( disjoint @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(28,plain,
( ( ! [A: $i,B: $i] : ( subset @ A @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(29,plain,
( ( ? [A: $i] :
~ ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(30,plain,
( ( ? [A: $i] : ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(31,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(32,plain,
( ( empty @ empty_set )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(33,plain,
$true = $true,
inference(unfold_def,[status(thm)],[13]) ).
thf(34,plain,
$true = $true,
inference(unfold_def,[status(thm)],[14]) ).
thf(35,plain,
( ( ! [A: $i,B: $i] :
( ( disjoint @ A @ B )
<=> ( ( set_intersection2 @ A @ B )
= empty_set ) ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(36,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[16]) ).
thf(37,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[17]) ).
thf(38,plain,
( ( ! [SY27: $i,SY28: $i] :
( ( ( subset @ sK1_A @ SY27 )
& ( disjoint @ SY27 @ SY28 ) )
=> ( disjoint @ sK1_A @ SY28 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[20]) ).
thf(39,plain,
( ( ! [SY29: $i] :
( ( ( subset @ sK1_A @ sK2_SY27 )
& ( disjoint @ sK2_SY27 @ SY29 ) )
=> ( disjoint @ sK1_A @ SY29 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[38]) ).
thf(40,plain,
( ( ( ( subset @ sK1_A @ sK2_SY27 )
& ( disjoint @ sK2_SY27 @ sK3_SY29 ) )
=> ( disjoint @ sK1_A @ sK3_SY29 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[39]) ).
thf(41,plain,
( ( subset @ sK1_A @ sK2_SY27 )
= $true ),
inference(standard_cnf,[status(thm)],[40]) ).
thf(42,plain,
( ( disjoint @ sK2_SY27 @ sK3_SY29 )
= $true ),
inference(standard_cnf,[status(thm)],[40]) ).
thf(43,plain,
( ( disjoint @ sK1_A @ sK3_SY29 )
= $false ),
inference(standard_cnf,[status(thm)],[40]) ).
thf(44,plain,
( ( ~ ( disjoint @ sK1_A @ sK3_SY29 ) )
= $true ),
inference(polarity_switch,[status(thm)],[43]) ).
thf(45,plain,
( ( ! [A: $i,B: $i] :
( ( A = B )
| ~ ( empty @ A )
| ~ ( empty @ B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[21]) ).
thf(46,plain,
( ( ! [A: $i,B: $i] :
( ~ ( empty @ B )
| ~ ( in @ A @ B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[22]) ).
thf(47,plain,
( ( ! [A: $i] :
( ~ ( empty @ A )
| ( A = empty_set ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[23]) ).
thf(48,plain,
( ( ! [A: $i] :
( ~ ( subset @ A @ empty_set )
| ( A = empty_set ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[24]) ).
thf(49,plain,
( ( ! [A: $i,B: $i] :
( ~ ( subset @ A @ B )
| ! [C: $i] : ( subset @ ( set_intersection2 @ A @ C ) @ ( set_intersection2 @ B @ C ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[26]) ).
thf(50,plain,
( ( ! [A: $i,B: $i] :
( ~ ( disjoint @ A @ B )
| ( disjoint @ B @ A ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[27]) ).
thf(51,plain,
( ( ! [A: $i] : ( subset @ A @ A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[28]) ).
thf(52,plain,
( ( ~ ( empty @ sK4_A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[29]) ).
thf(53,plain,
( ( empty @ sK5_A )
= $true ),
inference(extcnf_combined,[status(esa)],[30]) ).
thf(54,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[31]) ).
thf(55,plain,
( ( ! [A: $i,B: $i] :
( ( ( set_intersection2 @ A @ B )
!= empty_set )
| ( disjoint @ A @ B ) )
& ! [A: $i,B: $i] :
( ~ ( disjoint @ A @ B )
| ( ( set_intersection2 @ A @ B )
= empty_set ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[35]) ).
thf(56,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[37]) ).
thf(57,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[56]) ).
thf(58,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[36]) ).
thf(59,plain,
( ( ! [A: $i,B: $i] :
( ( ( set_intersection2 @ A @ B )
!= empty_set )
| ( disjoint @ A @ B ) )
& ! [A: $i,B: $i] :
( ~ ( disjoint @ A @ B )
| ( ( set_intersection2 @ A @ B )
= empty_set ) ) )
= $true ),
inference(copy,[status(thm)],[55]) ).
thf(60,plain,
$true = $true,
inference(copy,[status(thm)],[34]) ).
thf(61,plain,
$true = $true,
inference(copy,[status(thm)],[33]) ).
thf(62,plain,
( ( empty @ empty_set )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(63,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(copy,[status(thm)],[54]) ).
thf(64,plain,
( ( empty @ sK5_A )
= $true ),
inference(copy,[status(thm)],[53]) ).
thf(65,plain,
( ( ~ ( empty @ sK4_A ) )
= $true ),
inference(copy,[status(thm)],[52]) ).
thf(66,plain,
( ( ! [A: $i] : ( subset @ A @ A ) )
= $true ),
inference(copy,[status(thm)],[51]) ).
thf(67,plain,
( ( ! [A: $i,B: $i] :
( ~ ( disjoint @ A @ B )
| ( disjoint @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[50]) ).
thf(68,plain,
( ( ! [A: $i,B: $i] :
( ~ ( subset @ A @ B )
| ! [C: $i] : ( subset @ ( set_intersection2 @ A @ C ) @ ( set_intersection2 @ B @ C ) ) ) )
= $true ),
inference(copy,[status(thm)],[49]) ).
thf(69,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ empty_set )
= empty_set ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(70,plain,
( ( ! [A: $i] :
( ~ ( subset @ A @ empty_set )
| ( A = empty_set ) ) )
= $true ),
inference(copy,[status(thm)],[48]) ).
thf(71,plain,
( ( ! [A: $i] :
( ~ ( empty @ A )
| ( A = empty_set ) ) )
= $true ),
inference(copy,[status(thm)],[47]) ).
thf(72,plain,
( ( ! [A: $i,B: $i] :
( ~ ( empty @ B )
| ~ ( in @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[46]) ).
thf(73,plain,
( ( ! [A: $i,B: $i] :
( ( A = B )
| ~ ( empty @ A )
| ~ ( empty @ B ) ) )
= $true ),
inference(copy,[status(thm)],[45]) ).
thf(74,plain,
( ( disjoint @ sK2_SY27 @ sK3_SY29 )
= $true ),
inference(copy,[status(thm)],[42]) ).
thf(75,plain,
( ( subset @ sK1_A @ sK2_SY27 )
= $true ),
inference(copy,[status(thm)],[41]) ).
thf(76,plain,
( ( ~ ( disjoint @ sK1_A @ sK3_SY29 ) )
= $true ),
inference(copy,[status(thm)],[44]) ).
thf(77,plain,
( ( ~ ( ~ ! [SX0: $i,SX1: $i] :
( ( ( set_intersection2 @ SX0 @ SX1 )
!= empty_set )
| ( disjoint @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ( ( set_intersection2 @ SX0 @ SX1 )
= empty_set ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[59]) ).
thf(78,plain,
! [SV1: $i] :
( ( ! [SY30: $i] :
( ~ ( in @ SV1 @ SY30 )
| ~ ( in @ SY30 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[57]) ).
thf(79,plain,
! [SV2: $i] :
( ( ! [SY31: $i] :
( ( set_intersection2 @ SV2 @ SY31 )
= ( set_intersection2 @ SY31 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[58]) ).
thf(80,plain,
! [SV3: $i] :
( ( ( set_intersection2 @ SV3 @ SV3 )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[63]) ).
thf(81,plain,
( ( empty @ sK4_A )
= $false ),
inference(extcnf_not_pos,[status(thm)],[65]) ).
thf(82,plain,
! [SV4: $i] :
( ( subset @ SV4 @ SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[66]) ).
thf(83,plain,
! [SV5: $i] :
( ( ! [SY32: $i] :
( ~ ( disjoint @ SV5 @ SY32 )
| ( disjoint @ SY32 @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[67]) ).
thf(84,plain,
! [SV6: $i] :
( ( ! [SY33: $i] :
( ~ ( subset @ SV6 @ SY33 )
| ! [SY34: $i] : ( subset @ ( set_intersection2 @ SV6 @ SY34 ) @ ( set_intersection2 @ SY33 @ SY34 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[68]) ).
thf(85,plain,
! [SV7: $i] :
( ( ( set_intersection2 @ SV7 @ empty_set )
= empty_set )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[69]) ).
thf(86,plain,
! [SV8: $i] :
( ( ~ ( subset @ SV8 @ empty_set )
| ( SV8 = empty_set ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[70]) ).
thf(87,plain,
! [SV9: $i] :
( ( ~ ( empty @ SV9 )
| ( SV9 = empty_set ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[71]) ).
thf(88,plain,
! [SV10: $i] :
( ( ! [SY35: $i] :
( ~ ( empty @ SY35 )
| ~ ( in @ SV10 @ SY35 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[72]) ).
thf(89,plain,
! [SV11: $i] :
( ( ! [SY36: $i] :
( ( SV11 = SY36 )
| ~ ( empty @ SV11 )
| ~ ( empty @ SY36 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[73]) ).
thf(90,plain,
( ( disjoint @ sK1_A @ sK3_SY29 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[76]) ).
thf(91,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ( ( set_intersection2 @ SX0 @ SX1 )
!= empty_set )
| ( disjoint @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ( ( set_intersection2 @ SX0 @ SX1 )
= empty_set ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[77]) ).
thf(92,plain,
! [SV12: $i,SV1: $i] :
( ( ~ ( in @ SV1 @ SV12 )
| ~ ( in @ SV12 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[78]) ).
thf(93,plain,
! [SV13: $i,SV2: $i] :
( ( ( set_intersection2 @ SV2 @ SV13 )
= ( set_intersection2 @ SV13 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[79]) ).
thf(94,plain,
! [SV14: $i,SV5: $i] :
( ( ~ ( disjoint @ SV5 @ SV14 )
| ( disjoint @ SV14 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[83]) ).
thf(95,plain,
! [SV15: $i,SV6: $i] :
( ( ~ ( subset @ SV6 @ SV15 )
| ! [SY37: $i] : ( subset @ ( set_intersection2 @ SV6 @ SY37 ) @ ( set_intersection2 @ SV15 @ SY37 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[84]) ).
thf(96,plain,
! [SV8: $i] :
( ( ( ~ ( subset @ SV8 @ empty_set ) )
= $true )
| ( ( SV8 = empty_set )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[86]) ).
thf(97,plain,
! [SV9: $i] :
( ( ( ~ ( empty @ SV9 ) )
= $true )
| ( ( SV9 = empty_set )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[87]) ).
thf(98,plain,
! [SV10: $i,SV16: $i] :
( ( ~ ( empty @ SV16 )
| ~ ( in @ SV10 @ SV16 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[88]) ).
thf(99,plain,
! [SV17: $i,SV11: $i] :
( ( ( SV11 = SV17 )
| ~ ( empty @ SV11 )
| ~ ( empty @ SV17 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[89]) ).
thf(100,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ( ( set_intersection2 @ SX0 @ SX1 )
!= empty_set )
| ( disjoint @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[91]) ).
thf(101,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ( ( set_intersection2 @ SX0 @ SX1 )
= empty_set ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[91]) ).
thf(102,plain,
! [SV12: $i,SV1: $i] :
( ( ( ~ ( in @ SV1 @ SV12 ) )
= $true )
| ( ( ~ ( in @ SV12 @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[92]) ).
thf(103,plain,
! [SV14: $i,SV5: $i] :
( ( ( ~ ( disjoint @ SV5 @ SV14 ) )
= $true )
| ( ( disjoint @ SV14 @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[94]) ).
thf(104,plain,
! [SV15: $i,SV6: $i] :
( ( ( ~ ( subset @ SV6 @ SV15 ) )
= $true )
| ( ( ! [SY37: $i] : ( subset @ ( set_intersection2 @ SV6 @ SY37 ) @ ( set_intersection2 @ SV15 @ SY37 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[95]) ).
thf(105,plain,
! [SV8: $i] :
( ( ( subset @ SV8 @ empty_set )
= $false )
| ( ( SV8 = empty_set )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[96]) ).
thf(106,plain,
! [SV9: $i] :
( ( ( empty @ SV9 )
= $false )
| ( ( SV9 = empty_set )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[97]) ).
thf(107,plain,
! [SV10: $i,SV16: $i] :
( ( ( ~ ( empty @ SV16 ) )
= $true )
| ( ( ~ ( in @ SV10 @ SV16 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[98]) ).
thf(108,plain,
! [SV17: $i,SV11: $i] :
( ( ( ( SV11 = SV17 )
| ~ ( empty @ SV11 ) )
= $true )
| ( ( ~ ( empty @ SV17 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[99]) ).
thf(109,plain,
( ( ! [SX0: $i,SX1: $i] :
( ( ( set_intersection2 @ SX0 @ SX1 )
!= empty_set )
| ( disjoint @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[100]) ).
thf(110,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( disjoint @ SX0 @ SX1 )
| ( ( set_intersection2 @ SX0 @ SX1 )
= empty_set ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[101]) ).
thf(111,plain,
! [SV12: $i,SV1: $i] :
( ( ( in @ SV1 @ SV12 )
= $false )
| ( ( ~ ( in @ SV12 @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[102]) ).
thf(112,plain,
! [SV14: $i,SV5: $i] :
( ( ( disjoint @ SV5 @ SV14 )
= $false )
| ( ( disjoint @ SV14 @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[103]) ).
thf(113,plain,
! [SV15: $i,SV6: $i] :
( ( ( subset @ SV6 @ SV15 )
= $false )
| ( ( ! [SY37: $i] : ( subset @ ( set_intersection2 @ SV6 @ SY37 ) @ ( set_intersection2 @ SV15 @ SY37 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[104]) ).
thf(114,plain,
! [SV10: $i,SV16: $i] :
( ( ( empty @ SV16 )
= $false )
| ( ( ~ ( in @ SV10 @ SV16 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[107]) ).
thf(115,plain,
! [SV17: $i,SV11: $i] :
( ( ( SV11 = SV17 )
= $true )
| ( ( ~ ( empty @ SV11 ) )
= $true )
| ( ( ~ ( empty @ SV17 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[108]) ).
thf(116,plain,
! [SV18: $i] :
( ( ! [SY38: $i] :
( ( ( set_intersection2 @ SV18 @ SY38 )
!= empty_set )
| ( disjoint @ SV18 @ SY38 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[109]) ).
thf(117,plain,
! [SV19: $i] :
( ( ! [SY39: $i] :
( ~ ( disjoint @ SV19 @ SY39 )
| ( ( set_intersection2 @ SV19 @ SY39 )
= empty_set ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[110]) ).
thf(118,plain,
! [SV1: $i,SV12: $i] :
( ( ( in @ SV12 @ SV1 )
= $false )
| ( ( in @ SV1 @ SV12 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[111]) ).
thf(119,plain,
! [SV15: $i,SV20: $i,SV6: $i] :
( ( ( subset @ ( set_intersection2 @ SV6 @ SV20 ) @ ( set_intersection2 @ SV15 @ SV20 ) )
= $true )
| ( ( subset @ SV6 @ SV15 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[113]) ).
thf(120,plain,
! [SV16: $i,SV10: $i] :
( ( ( in @ SV10 @ SV16 )
= $false )
| ( ( empty @ SV16 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[114]) ).
thf(121,plain,
! [SV17: $i,SV11: $i] :
( ( ( empty @ SV11 )
= $false )
| ( ( SV11 = SV17 )
= $true )
| ( ( ~ ( empty @ SV17 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[115]) ).
thf(122,plain,
! [SV21: $i,SV18: $i] :
( ( ( ( set_intersection2 @ SV18 @ SV21 )
!= empty_set )
| ( disjoint @ SV18 @ SV21 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[116]) ).
thf(123,plain,
! [SV22: $i,SV19: $i] :
( ( ~ ( disjoint @ SV19 @ SV22 )
| ( ( set_intersection2 @ SV19 @ SV22 )
= empty_set ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[117]) ).
thf(124,plain,
! [SV11: $i,SV17: $i] :
( ( ( empty @ SV17 )
= $false )
| ( ( SV11 = SV17 )
= $true )
| ( ( empty @ SV11 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[121]) ).
thf(125,plain,
! [SV21: $i,SV18: $i] :
( ( ( ( ( set_intersection2 @ SV18 @ SV21 )
!= empty_set ) )
= $true )
| ( ( disjoint @ SV18 @ SV21 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[122]) ).
thf(126,plain,
! [SV22: $i,SV19: $i] :
( ( ( ~ ( disjoint @ SV19 @ SV22 ) )
= $true )
| ( ( ( set_intersection2 @ SV19 @ SV22 )
= empty_set )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[123]) ).
thf(127,plain,
! [SV21: $i,SV18: $i] :
( ( ( ( set_intersection2 @ SV18 @ SV21 )
= empty_set )
= $false )
| ( ( disjoint @ SV18 @ SV21 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[125]) ).
thf(128,plain,
! [SV22: $i,SV19: $i] :
( ( ( disjoint @ SV19 @ SV22 )
= $false )
| ( ( ( set_intersection2 @ SV19 @ SV22 )
= empty_set )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[126]) ).
thf(129,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[60,128,127,124,120,119,118,112,106,105,93,90,85,82,81,80,75,74,64,62,61]) ).
thf(130,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 05:14:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 17
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:17,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:19,loop_count:0,foatp_calls:0,translation:fof_full).....
% 0.13/0.41
% 0.13/0.41 ********************************
% 0.13/0.41 * All subproblems solved! *
% 0.13/0.41 ********************************
% 0.13/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:19,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:129,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.41
% 0.20/0.41 %**** Beginning of derivation protocol ****
% 0.20/0.41 % SZS output start CNFRefutation
% See solution above
% 0.20/0.41
% 0.20/0.41 %**** End of derivation protocol ****
% 0.20/0.41 %**** no. of clauses in derivation: 130 ****
% 0.20/0.41 %**** clause counter: 129 ****
% 0.20/0.41
% 0.20/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:19,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:129,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------