TSTP Solution File: SET917+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n024.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:06:14 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 78 ( 56 unt; 9 typ; 0 def)
% Number of atoms : 245 ( 98 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 372 ( 49 ~; 32 |; 2 &; 281 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 92 ( 0 ^ 88 !; 4 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_disjoint,type,
disjoint: $i > $i > $o ).
thf(tp_empty,type,
empty: $i > $o ).
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY16,type,
sK2_SY16: $i ).
thf(tp_sK3_A,type,
sK3_A: $i ).
thf(tp_sK4_A,type,
sK4_A: $i ).
thf(tp_set_intersection2,type,
set_intersection2: $i > $i > $i ).
thf(tp_singleton,type,
singleton: $i > $i ).
thf(1,axiom,
! [A: $i,B: $i] :
( ( disjoint @ A @ B )
=> ( disjoint @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
thf(2,axiom,
? [A: $i] :
~ ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(3,axiom,
? [A: $i] : ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( ( set_intersection2 @ B @ ( singleton @ A ) )
= ( singleton @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_zfmisc_1) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ~ ( in @ A @ B )
=> ( disjoint @ ( singleton @ A ) @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
thf(7,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(8,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(9,conjecture,
! [A: $i,B: $i] :
( ( disjoint @ ( singleton @ A ) @ B )
| ( ( set_intersection2 @ ( singleton @ A ) @ B )
= ( singleton @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t58_zfmisc_1) ).
thf(10,negated_conjecture,
( ( ! [A: $i,B: $i] :
( ( disjoint @ ( singleton @ A ) @ B )
| ( ( set_intersection2 @ ( singleton @ A ) @ B )
= ( singleton @ A ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[9]) ).
thf(11,plain,
( ( ! [A: $i,B: $i] :
( ( disjoint @ ( singleton @ A ) @ B )
| ( ( set_intersection2 @ ( singleton @ A ) @ B )
= ( singleton @ A ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
( ( ! [A: $i,B: $i] :
( ( disjoint @ A @ B )
=> ( disjoint @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(13,plain,
( ( ? [A: $i] :
~ ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(14,plain,
( ( ? [A: $i] : ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(15,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( ( set_intersection2 @ B @ ( singleton @ A ) )
= ( singleton @ A ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(16,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
=> ( disjoint @ ( singleton @ A ) @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(17,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(20,plain,
( ( ! [SY16: $i] :
( ( disjoint @ ( singleton @ sK1_A ) @ SY16 )
| ( ( set_intersection2 @ ( singleton @ sK1_A ) @ SY16 )
= ( singleton @ sK1_A ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[11]) ).
thf(21,plain,
( ( ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 )
| ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
= ( singleton @ sK1_A ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[20]) ).
thf(22,plain,
( ( ~ ( ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 )
| ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
= ( singleton @ sK1_A ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[21]) ).
thf(23,plain,
( ( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
!= ( singleton @ sK1_A ) )
& ~ ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[22]) ).
thf(24,plain,
( ( ! [A: $i,B: $i] :
( ~ ( disjoint @ A @ B )
| ( disjoint @ B @ A ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(25,plain,
( ( ~ ( empty @ sK3_A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(26,plain,
( ( empty @ sK4_A )
= $true ),
inference(extcnf_combined,[status(esa)],[14]) ).
thf(27,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ( ( set_intersection2 @ B @ ( singleton @ A ) )
= ( singleton @ A ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(28,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
| ( disjoint @ ( singleton @ A ) @ B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[16]) ).
thf(29,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[17]) ).
thf(30,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[19]) ).
thf(31,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(32,plain,
( ( ! [A: $i,B: $i] :
( ( set_intersection2 @ A @ B )
= ( set_intersection2 @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(33,plain,
( ( ! [A: $i] :
( ( set_intersection2 @ A @ A )
= A ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(34,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
| ( disjoint @ ( singleton @ A ) @ B ) ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(35,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ( ( set_intersection2 @ B @ ( singleton @ A ) )
= ( singleton @ A ) ) ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(36,plain,
( ( empty @ sK4_A )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(37,plain,
( ( ~ ( empty @ sK3_A ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(38,plain,
( ( ! [A: $i,B: $i] :
( ~ ( disjoint @ A @ B )
| ( disjoint @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(39,plain,
( ( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
!= ( singleton @ sK1_A ) )
& ~ ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(40,plain,
( ( ~ ( ~ ( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
!= ( singleton @ sK1_A ) ) )
| ~ ~ ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[39]) ).
thf(41,plain,
! [SV1: $i] :
( ( ! [SY17: $i] :
( ~ ( in @ SV1 @ SY17 )
| ~ ( in @ SY17 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(42,plain,
! [SV2: $i] :
( ( ! [SY18: $i] :
( ( set_intersection2 @ SV2 @ SY18 )
= ( set_intersection2 @ SY18 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(43,plain,
! [SV3: $i] :
( ( ( set_intersection2 @ SV3 @ SV3 )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(44,plain,
! [SV4: $i] :
( ( ! [SY19: $i] :
( ( in @ SV4 @ SY19 )
| ( disjoint @ ( singleton @ SV4 ) @ SY19 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(45,plain,
! [SV5: $i] :
( ( ! [SY20: $i] :
( ~ ( in @ SV5 @ SY20 )
| ( ( set_intersection2 @ SY20 @ ( singleton @ SV5 ) )
= ( singleton @ SV5 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(46,plain,
( ( empty @ sK3_A )
= $false ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(47,plain,
! [SV6: $i] :
( ( ! [SY21: $i] :
( ~ ( disjoint @ SV6 @ SY21 )
| ( disjoint @ SY21 @ SV6 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(48,plain,
( ( ~ ( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
!= ( singleton @ sK1_A ) ) )
| ~ ~ ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(49,plain,
! [SV7: $i,SV1: $i] :
( ( ~ ( in @ SV1 @ SV7 )
| ~ ( in @ SV7 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(50,plain,
! [SV8: $i,SV2: $i] :
( ( ( set_intersection2 @ SV2 @ SV8 )
= ( set_intersection2 @ SV8 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(51,plain,
! [SV9: $i,SV4: $i] :
( ( ( in @ SV4 @ SV9 )
| ( disjoint @ ( singleton @ SV4 ) @ SV9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(52,plain,
! [SV10: $i,SV5: $i] :
( ( ~ ( in @ SV5 @ SV10 )
| ( ( set_intersection2 @ SV10 @ ( singleton @ SV5 ) )
= ( singleton @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(53,plain,
! [SV11: $i,SV6: $i] :
( ( ~ ( disjoint @ SV6 @ SV11 )
| ( disjoint @ SV11 @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(54,plain,
( ( ~ ( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
!= ( singleton @ sK1_A ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[48]) ).
thf(55,plain,
( ( ~ ~ ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[48]) ).
thf(56,plain,
! [SV7: $i,SV1: $i] :
( ( ( ~ ( in @ SV1 @ SV7 ) )
= $true )
| ( ( ~ ( in @ SV7 @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[49]) ).
thf(57,plain,
! [SV9: $i,SV4: $i] :
( ( ( in @ SV4 @ SV9 )
= $true )
| ( ( disjoint @ ( singleton @ SV4 ) @ SV9 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[51]) ).
thf(58,plain,
! [SV10: $i,SV5: $i] :
( ( ( ~ ( in @ SV5 @ SV10 ) )
= $true )
| ( ( ( set_intersection2 @ SV10 @ ( singleton @ SV5 ) )
= ( singleton @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[52]) ).
thf(59,plain,
! [SV11: $i,SV6: $i] :
( ( ( ~ ( disjoint @ SV6 @ SV11 ) )
= $true )
| ( ( disjoint @ SV11 @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(60,plain,
( ( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
!= ( singleton @ sK1_A ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[54]) ).
thf(61,plain,
( ( ~ ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[55]) ).
thf(62,plain,
! [SV7: $i,SV1: $i] :
( ( ( in @ SV1 @ SV7 )
= $false )
| ( ( ~ ( in @ SV7 @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(63,plain,
! [SV10: $i,SV5: $i] :
( ( ( in @ SV5 @ SV10 )
= $false )
| ( ( ( set_intersection2 @ SV10 @ ( singleton @ SV5 ) )
= ( singleton @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[58]) ).
thf(64,plain,
! [SV11: $i,SV6: $i] :
( ( ( disjoint @ SV6 @ SV11 )
= $false )
| ( ( disjoint @ SV11 @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[59]) ).
thf(65,plain,
( ( ( set_intersection2 @ ( singleton @ sK1_A ) @ sK2_SY16 )
= ( singleton @ sK1_A ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[60]) ).
thf(66,plain,
( ( disjoint @ ( singleton @ sK1_A ) @ sK2_SY16 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[61]) ).
thf(67,plain,
! [SV1: $i,SV7: $i] :
( ( ( in @ SV7 @ SV1 )
= $false )
| ( ( in @ SV1 @ SV7 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[62]) ).
thf(68,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[36,67,66,65,64,63,57,50,46,43]) ).
thf(69,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n024.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 12:20:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 8
% 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.36 (rf:0,axioms:8,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:10,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.20/0.39
% 0.20/0.39 ********************************
% 0.20/0.39 * All subproblems solved! *
% 0.20/0.39 ********************************
% 0.20/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:8,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:68,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.39
% 0.20/0.39 %**** Beginning of derivation protocol ****
% 0.20/0.39 % SZS output start CNFRefutation
% See solution above
% 0.20/0.39
% 0.20/0.39 %**** End of derivation protocol ****
% 0.20/0.39 %**** no. of clauses in derivation: 69 ****
% 0.20/0.39 %**** clause counter: 68 ****
% 0.20/0.39
% 0.20/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:8,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:68,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------