TSTP Solution File: SET891+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SET891+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 : n013.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:01 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of formulae : 69 ( 52 unt; 9 typ; 0 def)
% Number of atoms : 186 ( 88 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 274 ( 24 ~; 12 |; 0 &; 234 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 90 ( 0 ^ 86 !; 4 ?; 90 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_empty,type,
empty: $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY18,type,
sK2_SY18: $i ).
thf(tp_sK3_A,type,
sK3_A: $i ).
thf(tp_sK4_A,type,
sK4_A: $i ).
thf(tp_set_union2,type,
set_union2: $i > $i > $i ).
thf(tp_singleton,type,
singleton: $i > $i ).
thf(tp_union,type,
union: $i > $i ).
thf(tp_unordered_pair,type,
unordered_pair: $i > $i > $i ).
thf(1,axiom,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( set_union2 @ ( singleton @ A ) @ ( singleton @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_enumset1) ).
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] :
( ( union @ ( unordered_pair @ A @ B ) )
= ( set_union2 @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l52_zfmisc_1) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( set_union2 @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ B @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_xboole_0) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_xboole_0) ).
thf(8,axiom,
! [A: $i,B: $i] :
( ( set_union2 @ A @ B )
= ( set_union2 @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
thf(9,axiom,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(10,conjecture,
! [A: $i,B: $i] :
( ( union @ ( unordered_pair @ ( singleton @ A ) @ ( singleton @ B ) ) )
= ( unordered_pair @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_zfmisc_1) ).
thf(11,negated_conjecture,
( ( ! [A: $i,B: $i] :
( ( union @ ( unordered_pair @ ( singleton @ A ) @ ( singleton @ B ) ) )
= ( unordered_pair @ A @ B ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[10]) ).
thf(12,plain,
( ( ! [A: $i,B: $i] :
( ( union @ ( unordered_pair @ ( singleton @ A ) @ ( singleton @ B ) ) )
= ( unordered_pair @ A @ B ) ) )
= $false ),
inference(unfold_def,[status(thm)],[11]) ).
thf(13,plain,
( ( ! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( set_union2 @ ( singleton @ A ) @ ( singleton @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(14,plain,
( ( ? [A: $i] :
~ ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(15,plain,
( ( ? [A: $i] : ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(16,plain,
( ( ! [A: $i,B: $i] :
( ( union @ ( unordered_pair @ A @ B ) )
= ( set_union2 @ A @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(17,plain,
( ( ! [A: $i,B: $i] :
( ( set_union2 @ A @ A )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ B @ A ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ A @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(20,plain,
( ( ! [A: $i,B: $i] :
( ( set_union2 @ A @ B )
= ( set_union2 @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(21,plain,
( ( ! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(22,plain,
( ( ! [SY18: $i] :
( ( union @ ( unordered_pair @ ( singleton @ sK1_A ) @ ( singleton @ SY18 ) ) )
= ( unordered_pair @ sK1_A @ SY18 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[12]) ).
thf(23,plain,
( ( ( union @ ( unordered_pair @ ( singleton @ sK1_A ) @ ( singleton @ sK2_SY18 ) ) )
= ( unordered_pair @ sK1_A @ sK2_SY18 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[22]) ).
thf(24,plain,
( ( ( ( union @ ( unordered_pair @ ( singleton @ sK1_A ) @ ( singleton @ sK2_SY18 ) ) )
!= ( unordered_pair @ sK1_A @ sK2_SY18 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[23]) ).
thf(25,plain,
( ( ~ ( empty @ sK3_A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[14]) ).
thf(26,plain,
( ( empty @ sK4_A )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(27,plain,
( ( ! [A: $i] :
( ( set_union2 @ A @ A )
= A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[17]) ).
thf(28,plain,
( ( ! [A: $i] :
( ( empty @ A )
| ! [B: $i] :
~ ( empty @ ( set_union2 @ B @ A ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[18]) ).
thf(29,plain,
( ( ! [A: $i] :
( ( empty @ A )
| ! [B: $i] :
~ ( empty @ ( set_union2 @ A @ B ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[19]) ).
thf(30,plain,
( ( ! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(31,plain,
( ( ! [A: $i,B: $i] :
( ( set_union2 @ A @ B )
= ( set_union2 @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(32,plain,
( ( ! [A: $i] :
( ( empty @ A )
| ! [B: $i] :
~ ( empty @ ( set_union2 @ A @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(33,plain,
( ( ! [A: $i] :
( ( empty @ A )
| ! [B: $i] :
~ ( empty @ ( set_union2 @ B @ A ) ) ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(34,plain,
( ( ! [A: $i] :
( ( set_union2 @ A @ A )
= A ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(35,plain,
( ( ! [A: $i,B: $i] :
( ( union @ ( unordered_pair @ A @ B ) )
= ( set_union2 @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
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] :
( ( unordered_pair @ A @ B )
= ( set_union2 @ ( singleton @ A ) @ ( singleton @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(39,plain,
( ( ( ( union @ ( unordered_pair @ ( singleton @ sK1_A ) @ ( singleton @ sK2_SY18 ) ) )
!= ( unordered_pair @ sK1_A @ sK2_SY18 ) ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(40,plain,
! [SV1: $i] :
( ( ! [SY19: $i] :
( ( unordered_pair @ SV1 @ SY19 )
= ( unordered_pair @ SY19 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(41,plain,
! [SV2: $i] :
( ( ! [SY20: $i] :
( ( set_union2 @ SV2 @ SY20 )
= ( set_union2 @ SY20 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(42,plain,
! [SV3: $i] :
( ( ( empty @ SV3 )
| ! [SY21: $i] :
~ ( empty @ ( set_union2 @ SV3 @ SY21 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(43,plain,
! [SV4: $i] :
( ( ( empty @ SV4 )
| ! [SY22: $i] :
~ ( empty @ ( set_union2 @ SY22 @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(44,plain,
! [SV5: $i] :
( ( ( set_union2 @ SV5 @ SV5 )
= SV5 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(45,plain,
! [SV6: $i] :
( ( ! [SY23: $i] :
( ( union @ ( unordered_pair @ SV6 @ SY23 ) )
= ( set_union2 @ SV6 @ SY23 ) ) )
= $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,
! [SV7: $i] :
( ( ! [SY24: $i] :
( ( unordered_pair @ SV7 @ SY24 )
= ( set_union2 @ ( singleton @ SV7 ) @ ( singleton @ SY24 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(48,plain,
( ( ( union @ ( unordered_pair @ ( singleton @ sK1_A ) @ ( singleton @ sK2_SY18 ) ) )
= ( unordered_pair @ sK1_A @ sK2_SY18 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(49,plain,
! [SV8: $i,SV1: $i] :
( ( ( unordered_pair @ SV1 @ SV8 )
= ( unordered_pair @ SV8 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(50,plain,
! [SV9: $i,SV2: $i] :
( ( ( set_union2 @ SV2 @ SV9 )
= ( set_union2 @ SV9 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(51,plain,
! [SV3: $i] :
( ( ( empty @ SV3 )
= $true )
| ( ( ! [SY21: $i] :
~ ( empty @ ( set_union2 @ SV3 @ SY21 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[42]) ).
thf(52,plain,
! [SV4: $i] :
( ( ( empty @ SV4 )
= $true )
| ( ( ! [SY22: $i] :
~ ( empty @ ( set_union2 @ SY22 @ SV4 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[43]) ).
thf(53,plain,
! [SV10: $i,SV6: $i] :
( ( ( union @ ( unordered_pair @ SV6 @ SV10 ) )
= ( set_union2 @ SV6 @ SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(54,plain,
! [SV11: $i,SV7: $i] :
( ( ( unordered_pair @ SV7 @ SV11 )
= ( set_union2 @ ( singleton @ SV7 ) @ ( singleton @ SV11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(55,plain,
! [SV12: $i,SV3: $i] :
( ( ( ~ ( empty @ ( set_union2 @ SV3 @ SV12 ) ) )
= $true )
| ( ( empty @ SV3 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(56,plain,
! [SV4: $i,SV13: $i] :
( ( ( ~ ( empty @ ( set_union2 @ SV13 @ SV4 ) ) )
= $true )
| ( ( empty @ SV4 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[52]) ).
thf(57,plain,
! [SV12: $i,SV3: $i] :
( ( ( empty @ ( set_union2 @ SV3 @ SV12 ) )
= $false )
| ( ( empty @ SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(58,plain,
! [SV4: $i,SV13: $i] :
( ( ( empty @ ( set_union2 @ SV13 @ SV4 ) )
= $false )
| ( ( empty @ SV4 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(59,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[36,58,57,54,53,50,49,48,46,44]) ).
thf(60,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET891+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n013.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:52:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 9
% 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:9,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:11,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.13/0.39
% 0.13/0.39 ********************************
% 0.13/0.39 * All subproblems solved! *
% 0.13/0.39 ********************************
% 0.13/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:9,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:59,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.39
% 0.13/0.39 %**** Beginning of derivation protocol ****
% 0.13/0.39 % SZS output start CNFRefutation
% See solution above
% 0.13/0.39
% 0.13/0.39 %**** End of derivation protocol ****
% 0.13/0.39 %**** no. of clauses in derivation: 60 ****
% 0.13/0.39 %**** clause counter: 59 ****
% 0.13/0.39
% 0.13/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:9,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:59,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------