TSTP Solution File: SEU641^2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU641^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 : n016.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:13:35 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 26 unt; 7 typ; 2 def)
% Number of atoms : 111 ( 61 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 147 ( 19 ~; 8 |; 2 &; 104 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_emptyset,type,
emptyset: $i ).
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_sK1_Xx,type,
sK1_Xx: $i ).
thf(tp_sK2_SY8,type,
sK2_SY8: $i ).
thf(tp_setadjoin,type,
setadjoin: $i > $i > $i ).
thf(tp_setadjoinIL,type,
setadjoinIL: $o ).
thf(tp_uniqinunit,type,
uniqinunit: $o ).
thf(setadjoinIL,definition,
( setadjoinIL
= ( ! [Xx: $i,Xy: $i] : ( in @ Xx @ ( setadjoin @ Xx @ Xy ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(uniqinunit,definition,
( uniqinunit
= ( ! [Xx: $i,Xy: $i] :
( ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(1,conjecture,
( setadjoinIL
=> ( uniqinunit
=> ! [Xx: $i,Xy: $i] :
( ( ( setadjoin @ Xx @ emptyset )
= ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletonsuniq) ).
thf(2,negated_conjecture,
( ( setadjoinIL
=> ( uniqinunit
=> ! [Xx: $i,Xy: $i] :
( ( ( setadjoin @ Xx @ emptyset )
= ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: $i,Xy: $i] : ( in @ Xx @ ( setadjoin @ Xx @ Xy ) )
=> ( ! [Xx: $i,Xy: $i] :
( ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) )
=> ! [Xx: $i,Xy: $i] :
( ( ( setadjoin @ Xx @ emptyset )
= ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,setadjoinIL,uniqinunit]) ).
thf(4,plain,
( ( ! [Xx: $i,Xy: $i] : ( in @ Xx @ ( setadjoin @ Xx @ Xy ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: $i,Xy: $i] :
( ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [Xx: $i,Xy: $i] :
( ( ( setadjoin @ Xx @ emptyset )
= ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ! [Xx: $i,Xy: $i] :
( ( ( setadjoin @ Xx @ emptyset )
= ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ( ( setadjoin @ sK1_Xx @ emptyset )
= ( setadjoin @ sK2_SY8 @ emptyset ) )
& ( sK1_Xx != sK2_SY8 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(9,plain,
( ( ! [Xx: $i,Xy: $i] :
( ~ ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
| ( Xx = Xy ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(10,plain,
( ( ! [Xx: $i,Xy: $i] :
( ~ ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
| ( Xx = Xy ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [Xx: $i,Xy: $i] : ( in @ Xx @ ( setadjoin @ Xx @ Xy ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(12,plain,
( ( ( ( setadjoin @ sK1_Xx @ emptyset )
= ( setadjoin @ sK2_SY8 @ emptyset ) )
& ( sK1_Xx != sK2_SY8 ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( ~ ( ( ( setadjoin @ sK1_Xx @ emptyset )
!= ( setadjoin @ sK2_SY8 @ emptyset ) )
| ~ ( ( sK1_Xx != sK2_SY8 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12,setadjoinIL,uniqinunit]) ).
thf(14,plain,
! [SV1: $i] :
( ( ! [SY9: $i] :
( ~ ( in @ SV1 @ ( setadjoin @ SY9 @ emptyset ) )
| ( SV1 = SY9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(15,plain,
! [SV2: $i] :
( ( ! [SY10: $i] : ( in @ SV2 @ ( setadjoin @ SV2 @ SY10 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(16,plain,
( ( ( ( setadjoin @ sK1_Xx @ emptyset )
!= ( setadjoin @ sK2_SY8 @ emptyset ) )
| ~ ( ( sK1_Xx != sK2_SY8 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV3: $i,SV1: $i] :
( ( ~ ( in @ SV1 @ ( setadjoin @ SV3 @ emptyset ) )
| ( SV1 = SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(18,plain,
! [SV4: $i,SV2: $i] :
( ( in @ SV2 @ ( setadjoin @ SV2 @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(19,plain,
( ( ( ( setadjoin @ sK1_Xx @ emptyset )
!= ( setadjoin @ sK2_SY8 @ emptyset ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(20,plain,
( ( ~ ( ( sK1_Xx != sK2_SY8 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(21,plain,
! [SV3: $i,SV1: $i] :
( ( ( ~ ( in @ SV1 @ ( setadjoin @ SV3 @ emptyset ) ) )
= $true )
| ( ( SV1 = SV3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[17]) ).
thf(22,plain,
( ( ( setadjoin @ sK1_Xx @ emptyset )
= ( setadjoin @ sK2_SY8 @ emptyset ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(23,plain,
( ( ( sK1_Xx != sK2_SY8 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[20]) ).
thf(24,plain,
! [SV3: $i,SV1: $i] :
( ( ( in @ SV1 @ ( setadjoin @ SV3 @ emptyset ) )
= $false )
| ( ( SV1 = SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(25,plain,
( ( sK1_Xx = sK2_SY8 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,25,24,22]) ).
thf(27,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU641^2 : TPTP v8.1.0. Released v3.7.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n016.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 13:16:25 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: 346
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.34 (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/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:26,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: 27 ****
% 0.13/0.37 %**** clause counter: 26 ****
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:26,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------