%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SEU575^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Oct 7 10:45:16 AM UTC 2026
% Result : Theorem 0.07s 0.21s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 25 unt; 0 typ; 2 def)
% Number of atoms : 135 ( 57 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 139 ( 26 ~; 18 |; 2 &; 76 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_emptyset,type,
emptyset: $i ).
thf(tp_emptysetsubset,type,
emptysetsubset: $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_setextsub,type,
setextsub: $o ).
thf(tp_subset,type,
subset: $i > $i > $o ).
thf(emptysetsubset,definition,
( emptysetsubset
= ( ! [A: $i] : ( subset @ emptyset @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetsubset) ).
thf(setextsub,definition,
( setextsub
= ( ! [A: $i,B: $i] :
( ( subset @ A @ B )
=> ( ( subset @ B @ A )
=> ( A = B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextsub) ).
thf(1,conjecture,
( emptysetsubset
=> ( setextsub
=> ! [A: $i] :
( ( subset @ A @ emptyset )
=> ( A = emptyset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetemptysetimpeq) ).
thf(2,negated_conjecture,
( ( emptysetsubset
=> ( setextsub
=> ! [A: $i] :
( ( subset @ A @ emptyset )
=> ( A = emptyset ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i] : ( subset @ emptyset @ A )
=> ( ! [A: $i,B: $i] :
( ( subset @ A @ B )
=> ( ( subset @ B @ A )
=> ( A = B ) ) )
=> ! [A: $i] :
( ( subset @ A @ emptyset )
=> ( A = emptyset ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,emptysetsubset,setextsub]) ).
thf(4,plain,
( ( ! [A: $i] : ( subset @ emptyset @ A ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [A: $i,B: $i] :
( ( subset @ A @ B )
=> ( ( subset @ B @ A )
=> ( A = B ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [A: $i] :
( ( subset @ A @ emptyset )
=> ( A = emptyset ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ! [A: $i] :
( ( subset @ A @ emptyset )
=> ( A = emptyset ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ( subset @ sK1_A @ emptyset )
& ( sK1_A != emptyset ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(9,plain,
( ( ! [A: $i,B: $i] :
( ~ ( subset @ A @ B )
| ~ ( subset @ B @ A )
| ( A = B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(10,plain,
( ( ! [A: $i,B: $i] :
( ~ ( subset @ A @ B )
| ~ ( subset @ B @ A )
| ( A = B ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [A: $i] : ( subset @ emptyset @ A ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(12,plain,
( ( ( subset @ sK1_A @ emptyset )
& ( sK1_A != emptyset ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( ~ ( ~ ( subset @ sK1_A @ emptyset )
| ~ ( ( sK1_A != emptyset ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12,emptysetsubset,setextsub]) ).
thf(14,plain,
! [SV1: $i] :
( ( ! [SY5: $i] :
( ~ ( subset @ SV1 @ SY5 )
| ~ ( subset @ SY5 @ SV1 )
| ( SV1 = SY5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(15,plain,
! [SV2: $i] :
( ( subset @ emptyset @ SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(16,plain,
( ( ~ ( subset @ sK1_A @ emptyset )
| ~ ( ( sK1_A != emptyset ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV3: $i,SV1: $i] :
( ( ~ ( subset @ SV1 @ SV3 )
| ~ ( subset @ SV3 @ SV1 )
| ( SV1 = SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( ~ ( subset @ sK1_A @ emptyset ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ( ( sK1_A != emptyset ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(20,plain,
! [SV3: $i,SV1: $i] :
( ( ( ~ ( subset @ SV1 @ SV3 ) )
= $true )
| ( ( ~ ( subset @ SV3 @ SV1 )
| ( SV1 = SV3 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( subset @ sK1_A @ emptyset )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(22,plain,
( ( sK1_A != emptyset )
= $true ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(23,plain,
! [SV3: $i,SV1: $i] :
( ( ( subset @ SV1 @ SV3 )
= $false )
| ( ( ~ ( subset @ SV3 @ SV1 )
| ( SV1 = SV3 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(24,plain,
( ( sK1_A = emptyset )
= $false ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(25,plain,
! [SV1: $i,SV3: $i] :
( ( ( ~ ( subset @ SV3 @ SV1 ) )
= $true )
| ( ( SV1 = SV3 )
= $true )
| ( ( subset @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV1: $i,SV3: $i] :
( ( ( subset @ SV3 @ SV1 )
= $false )
| ( ( SV1 = SV3 )
= $true )
| ( ( subset @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(27,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,26,24,21]) ).
thf(28,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU575^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.18 % Computer : n001.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Oct 6 15:34:39 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.21
% 0.07/0.21 No.of.Axioms: 0
% 0.07/0.21
% 0.07/0.21 Length.of.Defs: 332
% 0.07/0.21
% 0.07/0.21 Contains.Choice.Funs: false
% 0.07/0.21
% 0.07/0.21 ********************************
% 0.07/0.21 * All subproblems solved! *
% 0.07/0.21 ********************************
% 0.07/0.21 % 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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:27,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.21
% 0.07/0.21 %**** Beginning of derivation protocol ****
% 0.07/0.21 % SZS output start CNFRefutation
% See solution above
% 0.07/0.21
% 0.07/0.21 %**** End of derivation protocol ****
% 0.07/0.21 %**** no. of clauses in derivation: 28 ****
% 0.07/0.21 %**** clause counter: 27 ****
% 0.07/0.21
% 0.07/0.21 % 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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:27,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------