%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM559+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:34:27 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 15 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 48 ( 12 ~; 0 |; 0 &; 36 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 25 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_aElement0,type,
aElement0: $i > $o ).
thf(tp_aElementOf0,type,
aElementOf0: $i > $i > $o ).
thf(tp_aSet0,type,
aSet0: $i > $o ).
thf(tp_aSubsetOf0,type,
aSubsetOf0: $i > $i > $o ).
thf(tp_iLess0,type,
iLess0: $i > $i > $o ).
thf(tp_isCountable0,type,
isCountable0: $i > $o ).
thf(tp_isFinite0,type,
isFinite0: $i > $o ).
thf(tp_sbrdtbr0,type,
sbrdtbr0: $i > $i ).
thf(tp_sdtlseqdt0,type,
sdtlseqdt0: $i > $i > $o ).
thf(tp_sdtmndt0,type,
sdtmndt0: $i > $i > $i ).
thf(tp_sdtpldt0,type,
sdtpldt0: $i > $i > $i ).
thf(tp_slbdtrb0,type,
slbdtrb0: $i > $i ).
thf(tp_slbdtsldtrb0,type,
slbdtsldtrb0: $i > $i > $i ).
thf(tp_slcrc0,type,
slcrc0: $i ).
thf(tp_sz00,type,
sz00: $i ).
thf(tp_szNzAzT0,type,
szNzAzT0: $i ).
thf(tp_szmzazxdt0,type,
szmzazxdt0: $i > $i ).
thf(tp_szmzizndt0,type,
szmzizndt0: $i > $i ).
thf(tp_szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
thf(tp_xQ,type,
xQ: $i ).
thf(tp_xS,type,
xS: $i ).
thf(tp_xT,type,
xT: $i ).
thf(tp_xk,type,
xk: $i ).
thf(tp_xx,type,
xx: $i ).
thf(tp_xy,type,
xy: $i ).
thf(53,axiom,
~ ~ ( aElementOf0 @ xx @ xQ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2338) ).
thf(54,axiom,
~ ( aElementOf0 @ xx @ xQ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2323) ).
thf(58,axiom,
aElementOf0 @ xx @ xS,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2256) ).
thf(62,conjecture,
aElementOf0 @ xx @ xT,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
thf(63,negated_conjecture,
( ( aElementOf0 @ xx @ xT )
= $false ),
inference(negate_conjecture,[status(cth)],[62]) ).
thf(64,plain,
( ( aElementOf0 @ xx @ xT )
= $false ),
inference(unfold_def,[status(thm)],[63]) ).
thf(65,plain,
( ( ~ ~ ( aElementOf0 @ xx @ xQ ) )
= $true ),
inference(unfold_def,[status(thm)],[53]) ).
thf(66,plain,
( ( ~ ( aElementOf0 @ xx @ xQ ) )
= $true ),
inference(unfold_def,[status(thm)],[54]) ).
thf(67,plain,
( ( aElementOf0 @ xx @ xS )
= $true ),
inference(unfold_def,[status(thm)],[58]) ).
thf(68,plain,
( ( ~ ( aElementOf0 @ xx @ xT ) )
= $true ),
inference(polarity_switch,[status(thm)],[64]) ).
thf(69,plain,
( ( aElementOf0 @ xx @ xS )
= $true ),
inference(copy,[status(thm)],[67]) ).
thf(70,plain,
( ( ~ ( aElementOf0 @ xx @ xQ ) )
= $true ),
inference(copy,[status(thm)],[66]) ).
thf(71,plain,
( ( ~ ~ ( aElementOf0 @ xx @ xQ ) )
= $true ),
inference(copy,[status(thm)],[65]) ).
thf(72,plain,
( ( ~ ( aElementOf0 @ xx @ xT ) )
= $true ),
inference(copy,[status(thm)],[68]) ).
thf(73,plain,
( ( aElementOf0 @ xx @ xQ )
= $false ),
inference(extcnf_not_pos,[status(thm)],[70]) ).
thf(74,plain,
( ( ~ ( aElementOf0 @ xx @ xQ ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[71]) ).
thf(75,plain,
( ( aElementOf0 @ xx @ xT )
= $false ),
inference(extcnf_not_pos,[status(thm)],[72]) ).
thf(76,plain,
( ( aElementOf0 @ xx @ xQ )
= $true ),
inference(extcnf_not_neg,[status(thm)],[74]) ).
thf(77,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[69,76,75,73]) ).
thf(78,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM559+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.17 % Computer : n020.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Oct 6 13:26:21 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.25
% 0.07/0.25 No.of.Axioms: 3
% 0.07/0.25
% 0.07/0.25 Length.of.Defs: 0
% 0.07/0.25
% 0.07/0.25 Contains.Choice.Funs: false
% 0.07/0.25 .
% 0.07/0.25
% 0.07/0.25 ********************************
% 0.07/0.25 * All subproblems solved! *
% 0.07/0.25 ********************************
% 0.07/0.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:77,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.25
% 0.07/0.25 %**** Beginning of derivation protocol ****
% 0.07/0.25 % SZS output start CNFRefutation
% See solution above
% 0.07/0.25
% 0.07/0.25 %**** End of derivation protocol ****
% 0.07/0.25 %**** no. of clauses in derivation: 20 ****
% 0.07/0.25 %**** clause counter: 77 ****
% 0.07/0.25
% 0.07/0.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:77,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------