TSTP Solution File: SEU565^2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU565^2 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n011.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:12:55 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 26 unt; 6 typ; 1 def)
% Number of atoms : 154 ( 37 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 256 ( 56 ~; 25 |; 4 &; 152 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 0 ^ 51 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY9,type,
sK2_SY9: $i ).
thf(tp_sK3_SY11,type,
sK3_SY11: $i ).
thf(tp_subset,type,
subset: $i > $i > $o ).
thf(tp_subsetE,type,
subsetE: $o ).
thf(subsetE,definition,
( subsetE
= ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(1,conjecture,
( subsetE
=> ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ~ ( in @ Xx @ B )
=> ~ ( in @ Xx @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE2) ).
thf(2,negated_conjecture,
( ( subsetE
=> ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ~ ( in @ Xx @ B )
=> ~ ( in @ Xx @ A ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) )
=> ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ~ ( in @ Xx @ B )
=> ~ ( in @ Xx @ A ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,subsetE]) ).
thf(4,plain,
( ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ( in @ Xx @ A )
=> ( in @ Xx @ B ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ~ ( in @ Xx @ B )
=> ~ ( in @ Xx @ A ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [A: $i,B: $i,Xx: $i] :
( ( subset @ A @ B )
=> ( ~ ( in @ Xx @ B )
=> ~ ( in @ Xx @ A ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ( subset @ sK1_A @ sK2_SY9 )
& ~ ( in @ sK3_SY11 @ sK2_SY9 )
& ( in @ sK3_SY11 @ sK1_A ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [A: $i,B: $i] :
( ~ ( subset @ A @ B )
| ! [Xx: $i] :
( ~ ( in @ Xx @ A )
| ( in @ Xx @ B ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [A: $i,B: $i] :
( ~ ( subset @ A @ B )
| ! [Xx: $i] :
( ~ ( in @ Xx @ A )
| ( in @ Xx @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ( subset @ sK1_A @ sK2_SY9 )
& ~ ( in @ sK3_SY11 @ sK2_SY9 )
& ( in @ sK3_SY11 @ sK1_A ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( ~ ( subset @ sK1_A @ sK2_SY9 )
| ~ ~ ( ~ ~ ( in @ sK3_SY11 @ sK2_SY9 )
| ~ ( in @ sK3_SY11 @ sK1_A ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10,subsetE]) ).
thf(12,plain,
! [SV1: $i] :
( ( ! [SY12: $i] :
( ~ ( subset @ SV1 @ SY12 )
| ! [SY13: $i] :
( ~ ( in @ SY13 @ SV1 )
| ( in @ SY13 @ SY12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(13,plain,
( ( ~ ( subset @ sK1_A @ sK2_SY9 )
| ~ ~ ( ~ ~ ( in @ sK3_SY11 @ sK2_SY9 )
| ~ ( in @ sK3_SY11 @ sK1_A ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
! [SV2: $i,SV1: $i] :
( ( ~ ( subset @ SV1 @ SV2 )
| ! [SY14: $i] :
( ~ ( in @ SY14 @ SV1 )
| ( in @ SY14 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( subset @ sK1_A @ sK2_SY9 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ~ ( ~ ~ ( in @ sK3_SY11 @ sK2_SY9 )
| ~ ( in @ sK3_SY11 @ sK1_A ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( subset @ SV1 @ SV2 ) )
= $true )
| ( ( ! [SY14: $i] :
( ~ ( in @ SY14 @ SV1 )
| ( in @ SY14 @ SV2 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( subset @ sK1_A @ sK2_SY9 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( ~ ( ~ ~ ( in @ sK3_SY11 @ sK2_SY9 )
| ~ ( in @ sK3_SY11 @ sK1_A ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(20,plain,
! [SV2: $i,SV1: $i] :
( ( ( subset @ SV1 @ SV2 )
= $false )
| ( ( ! [SY14: $i] :
( ~ ( in @ SY14 @ SV1 )
| ( in @ SY14 @ SV2 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( ~ ~ ( in @ sK3_SY11 @ sK2_SY9 )
| ~ ( in @ sK3_SY11 @ sK1_A ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV2: $i,SV1: $i,SV3: $i] :
( ( ( ~ ( in @ SV3 @ SV1 )
| ( in @ SV3 @ SV2 ) )
= $true )
| ( ( subset @ SV1 @ SV2 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(23,plain,
( ( ~ ~ ( in @ sK3_SY11 @ sK2_SY9 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(24,plain,
( ( ~ ( in @ sK3_SY11 @ sK1_A ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(25,plain,
! [SV2: $i,SV1: $i,SV3: $i] :
( ( ( ~ ( in @ SV3 @ SV1 ) )
= $true )
| ( ( in @ SV3 @ SV2 )
= $true )
| ( ( subset @ SV1 @ SV2 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[22]) ).
thf(26,plain,
( ( ~ ( in @ sK3_SY11 @ sK2_SY9 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(27,plain,
( ( in @ sK3_SY11 @ sK1_A )
= $true ),
inference(extcnf_not_neg,[status(thm)],[24]) ).
thf(28,plain,
! [SV2: $i,SV1: $i,SV3: $i] :
( ( ( in @ SV3 @ SV1 )
= $false )
| ( ( in @ SV3 @ SV2 )
= $true )
| ( ( subset @ SV1 @ SV2 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(29,plain,
( ( in @ sK3_SY11 @ sK2_SY9 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(30,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,29,28,27]) ).
thf(31,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU565^2 : TPTP v8.1.0. Released v3.7.0.
% 0.06/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n011.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 : Mon Jun 20 01:45:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 0
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 176
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:0,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.13/0.37
% 0.13/0.37 ********************************
% 0.13/0.37 * All subproblems solved! *
% 0.13/0.37 ********************************
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:30,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.37
% 0.13/0.37 %**** Beginning of derivation protocol ****
% 0.13/0.37 % SZS output start CNFRefutation
% See solution above
% 0.13/0.37
% 0.13/0.37 %**** End of derivation protocol ****
% 0.13/0.37 %**** no. of clauses in derivation: 31 ****
% 0.13/0.37 %**** clause counter: 30 ****
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:30,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------