TSTP Solution File: SEU163+3 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU163+3 : 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 : n008.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:26 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 36 unt; 8 typ; 0 def)
% Number of atoms : 150 ( 42 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 182 ( 24 ~; 13 |; 0 &; 136 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 52 ( 0 ^ 48 !; 4 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
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_SY10,type,
sK2_SY10: $i ).
thf(tp_sK3_A,type,
sK3_A: $i ).
thf(tp_sK4_A,type,
sK4_A: $i ).
thf(tp_subset,type,
subset: $i > $i > $o ).
thf(tp_union,type,
union: $i > $i ).
thf(1,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( subset @ A @ ( union @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).
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 )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(5,axiom,
! [A: $i,B: $i] : ( subset @ A @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(6,conjecture,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( subset @ A @ ( union @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).
thf(7,negated_conjecture,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( subset @ A @ ( union @ B ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[6]) ).
thf(8,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( subset @ A @ ( union @ B ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ( subset @ A @ ( union @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(10,plain,
( ( ? [A: $i] :
~ ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(11,plain,
( ( ? [A: $i] : ( empty @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(12,plain,
( ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(13,plain,
( ( ! [A: $i,B: $i] : ( subset @ A @ A ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(14,plain,
( ( ! [SY10: $i] :
( ( in @ sK1_A @ SY10 )
=> ( subset @ sK1_A @ ( union @ SY10 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[8]) ).
thf(15,plain,
( ( ( in @ sK1_A @ sK2_SY10 )
=> ( subset @ sK1_A @ ( union @ sK2_SY10 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[14]) ).
thf(16,plain,
( ( in @ sK1_A @ sK2_SY10 )
= $true ),
inference(standard_cnf,[status(thm)],[15]) ).
thf(17,plain,
( ( subset @ sK1_A @ ( union @ sK2_SY10 ) )
= $false ),
inference(standard_cnf,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ( subset @ sK1_A @ ( union @ sK2_SY10 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[17]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ( subset @ A @ ( union @ B ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(20,plain,
( ( ~ ( empty @ sK3_A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(21,plain,
( ( empty @ sK4_A )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(22,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(23,plain,
( ( ! [A: $i] : ( subset @ A @ A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(24,plain,
( ( ! [A: $i] : ( subset @ A @ A ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(25,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(26,plain,
( ( empty @ sK4_A )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(27,plain,
( ( ~ ( empty @ sK3_A ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(28,plain,
( ( ! [A: $i,B: $i] :
( ~ ( in @ A @ B )
| ( subset @ A @ ( union @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(29,plain,
( ( in @ sK1_A @ sK2_SY10 )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(30,plain,
( ( ~ ( subset @ sK1_A @ ( union @ sK2_SY10 ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(31,plain,
! [SV1: $i] :
( ( subset @ SV1 @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(32,plain,
! [SV2: $i] :
( ( ! [SY11: $i] :
( ~ ( in @ SV2 @ SY11 )
| ~ ( in @ SY11 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(33,plain,
( ( empty @ sK3_A )
= $false ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(34,plain,
! [SV3: $i] :
( ( ! [SY12: $i] :
( ~ ( in @ SV3 @ SY12 )
| ( subset @ SV3 @ ( union @ SY12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(35,plain,
( ( subset @ sK1_A @ ( union @ sK2_SY10 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[30]) ).
thf(36,plain,
! [SV4: $i,SV2: $i] :
( ( ~ ( in @ SV2 @ SV4 )
| ~ ( in @ SV4 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(37,plain,
! [SV5: $i,SV3: $i] :
( ( ~ ( in @ SV3 @ SV5 )
| ( subset @ SV3 @ ( union @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(38,plain,
! [SV4: $i,SV2: $i] :
( ( ( ~ ( in @ SV2 @ SV4 ) )
= $true )
| ( ( ~ ( in @ SV4 @ SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(39,plain,
! [SV5: $i,SV3: $i] :
( ( ( ~ ( in @ SV3 @ SV5 ) )
= $true )
| ( ( subset @ SV3 @ ( union @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[37]) ).
thf(40,plain,
! [SV4: $i,SV2: $i] :
( ( ( in @ SV2 @ SV4 )
= $false )
| ( ( ~ ( in @ SV4 @ SV2 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(41,plain,
! [SV5: $i,SV3: $i] :
( ( ( in @ SV3 @ SV5 )
= $false )
| ( ( subset @ SV3 @ ( union @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(42,plain,
! [SV2: $i,SV4: $i] :
( ( ( in @ SV4 @ SV2 )
= $false )
| ( ( in @ SV2 @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(43,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[26,42,41,35,33,31,29]) ).
thf(44,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 22:02:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 5
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (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.12/0.37
% 0.12/0.37 ********************************
% 0.12/0.37 * All subproblems solved! *
% 0.12/0.37 ********************************
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:6,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:43,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.37
% 0.12/0.37 %**** Beginning of derivation protocol ****
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
% 0.12/0.37
% 0.12/0.37 %**** End of derivation protocol ****
% 0.12/0.37 %**** no. of clauses in derivation: 44 ****
% 0.12/0.37 %**** clause counter: 43 ****
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:6,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:43,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------