TSTP Solution File: SEU528^2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU528^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 : n006.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:37 EDT 2022
% Result : Theorem 0.22s 0.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 21 unt; 6 typ; 1 def)
% Number of atoms : 93 ( 45 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 130 ( 29 ~; 8 |; 2 &; 80 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% 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_SY6,type,
sK2_SY6: $i ).
thf(tp_setadjoin,type,
setadjoin: $i > $i > $i ).
thf(tp_uniqinunit,type,
uniqinunit: $o ).
thf(uniqinunit,definition,
( uniqinunit
= ( ! [Xx: $i,Xy: $i] :
( ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
thf(1,conjecture,
( uniqinunit
=> ! [Xx: $i,Xy: $i] :
( ( Xx != Xy )
=> ~ ( in @ Xy @ ( setadjoin @ Xx @ emptyset ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',notinsingleton) ).
thf(2,negated_conjecture,
( ( uniqinunit
=> ! [Xx: $i,Xy: $i] :
( ( Xx != Xy )
=> ~ ( in @ Xy @ ( setadjoin @ Xx @ emptyset ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: $i,Xy: $i] :
( ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) )
=> ! [Xx: $i,Xy: $i] :
( ( Xx != Xy )
=> ~ ( in @ Xy @ ( setadjoin @ Xx @ emptyset ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,uniqinunit]) ).
thf(4,plain,
( ( ! [Xx: $i,Xy: $i] :
( ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
=> ( Xx = Xy ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: $i,Xy: $i] :
( ( Xx != Xy )
=> ~ ( in @ Xy @ ( setadjoin @ Xx @ emptyset ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Xx: $i,Xy: $i] :
( ( Xx != Xy )
=> ~ ( in @ Xy @ ( setadjoin @ Xx @ emptyset ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ( sK1_Xx != sK2_SY6 )
& ( in @ sK2_SY6 @ ( setadjoin @ sK1_Xx @ emptyset ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [Xx: $i,Xy: $i] :
( ~ ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
| ( Xx = Xy ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [Xx: $i,Xy: $i] :
( ~ ( in @ Xx @ ( setadjoin @ Xy @ emptyset ) )
| ( Xx = Xy ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ( sK1_Xx != sK2_SY6 )
& ( in @ sK2_SY6 @ ( setadjoin @ sK1_Xx @ emptyset ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( ~ ( ( sK1_Xx != sK2_SY6 ) )
| ~ ( in @ sK2_SY6 @ ( setadjoin @ sK1_Xx @ emptyset ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10,uniqinunit]) ).
thf(12,plain,
! [SV1: $i] :
( ( ! [SY7: $i] :
( ~ ( in @ SV1 @ ( setadjoin @ SY7 @ emptyset ) )
| ( SV1 = SY7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(13,plain,
( ( ~ ( ( sK1_Xx != sK2_SY6 ) )
| ~ ( in @ sK2_SY6 @ ( setadjoin @ sK1_Xx @ emptyset ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
! [SV2: $i,SV1: $i] :
( ( ~ ( in @ SV1 @ ( setadjoin @ SV2 @ emptyset ) )
| ( SV1 = SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( ( sK1_Xx != sK2_SY6 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( in @ sK2_SY6 @ ( setadjoin @ sK1_Xx @ emptyset ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( in @ SV1 @ ( setadjoin @ SV2 @ emptyset ) ) )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( ( sK1_Xx != sK2_SY6 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( in @ sK2_SY6 @ ( setadjoin @ sK1_Xx @ emptyset ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(20,plain,
! [SV2: $i,SV1: $i] :
( ( ( in @ SV1 @ ( setadjoin @ SV2 @ emptyset ) )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( sK1_Xx = sK2_SY6 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(22,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,21,20]) ).
thf(23,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU528^2 : TPTP v8.1.0. Released v3.7.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 10:19:10 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.36
% 0.14/0.36 No.of.Axioms: 0
% 0.14/0.36
% 0.14/0.36 Length.of.Defs: 183
% 0.14/0.36
% 0.14/0.36 Contains.Choice.Funs: false
% 0.14/0.36 (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.22/0.39 ********************************
% 0.22/0.39 * All subproblems solved! *
% 0.22/0.39 ********************************
% 0.22/0.39 % 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:22,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.22/0.39
% 0.22/0.39 %**** Beginning of derivation protocol ****
% 0.22/0.39 % SZS output start CNFRefutation
% See solution above
% 0.22/0.39
% 0.22/0.39 %**** End of derivation protocol ****
% 0.22/0.39 %**** no. of clauses in derivation: 23 ****
% 0.22/0.39 %**** clause counter: 22 ****
% 0.22/0.39
% 0.22/0.39 % 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:22,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------