%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : KLE057+1 : 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 : n011.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:25:54 AM UTC 2026
% Result : Theorem 0.10s 0.22s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 106 ( 74 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 120 ( 6 ~; 2 |; 0 &; 106 @)
% ( 0 <=>; 0 =>; 6 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 0 ^; 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_addition,type,
addition: $i > $i > $i ).
thf(tp_domain,type,
domain: $i > $i ).
thf(tp_leq,type,
leq: $i > $i > $o ).
thf(tp_multiplication,type,
multiplication: $i > $i > $i ).
thf(tp_one,type,
one: $i ).
thf(tp_sK1_X0,type,
sK1_X0: $i ).
thf(tp_zero,type,
zero: $i ).
thf(1,axiom,
! [X0: $i,X1: $i] :
( ( domain @ ( addition @ X0 @ X1 ) )
= ( addition @ ( domain @ X0 ) @ ( domain @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain5) ).
thf(2,axiom,
( ( domain @ zero )
= zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain4) ).
thf(4,axiom,
! [X0: $i,X1: $i] :
( ( domain @ ( multiplication @ X0 @ X1 ) )
= ( domain @ ( multiplication @ X0 @ ( domain @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain2) ).
thf(7,axiom,
! [A: $i] :
( ( multiplication @ zero @ A )
= zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
thf(8,axiom,
! [A: $i] :
( ( multiplication @ A @ zero )
= zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_annihilation) ).
thf(15,axiom,
! [A: $i] :
( ( addition @ A @ zero )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
thf(18,conjecture,
! [X0: $i] :
( ( ( domain @ X0 )
= zero )
<= ( X0 = zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
thf(19,negated_conjecture,
( ( ! [X0: $i] :
( ( ( domain @ X0 )
= zero )
<= ( X0 = zero ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[18]) ).
thf(20,plain,
( ( ! [X0: $i] :
( ( ( domain @ X0 )
= zero )
<= ( X0 = zero ) ) )
= $false ),
inference(unfold_def,[status(thm)],[19]) ).
thf(21,plain,
( ( ! [X0: $i,X1: $i] :
( ( domain @ ( addition @ X0 @ X1 ) )
= ( addition @ ( domain @ X0 ) @ ( domain @ X1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(22,plain,
( ( ( domain @ zero )
= zero )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(23,plain,
( ( ! [X0: $i,X1: $i] :
( ( domain @ ( multiplication @ X0 @ X1 ) )
= ( domain @ ( multiplication @ X0 @ ( domain @ X1 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(24,plain,
( ( ! [A: $i] :
( ( multiplication @ zero @ A )
= zero ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(25,plain,
( ( ! [A: $i] :
( ( multiplication @ A @ zero )
= zero ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(26,plain,
( ( ! [A: $i] :
( ( addition @ A @ zero )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(27,plain,
( ( ( ( domain @ sK1_X0 )
= zero )
<= ( sK1_X0 = zero ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[20]) ).
thf(28,plain,
( ( ~ ( ( ( domain @ sK1_X0 )
= zero )
<= ( sK1_X0 = zero ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[27]) ).
thf(29,plain,
( ( ! [A: $i] :
( ( addition @ A @ zero )
= A ) )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(30,plain,
( ( ! [A: $i] :
( ( multiplication @ A @ zero )
= zero ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(31,plain,
( ( ! [A: $i] :
( ( multiplication @ zero @ A )
= zero ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(32,plain,
( ( ! [X0: $i,X1: $i] :
( ( domain @ ( multiplication @ X0 @ X1 ) )
= ( domain @ ( multiplication @ X0 @ ( domain @ X1 ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(33,plain,
( ( ( domain @ zero )
= zero )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(34,plain,
( ( ! [X0: $i,X1: $i] :
( ( domain @ ( addition @ X0 @ X1 ) )
= ( addition @ ( domain @ X0 ) @ ( domain @ X1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(35,plain,
( ( ~ ( ( ( domain @ sK1_X0 )
= zero )
<= ( sK1_X0 = zero ) ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(36,plain,
( ( ~ ( ( ( domain @ sK1_X0 )
= zero )
| ( sK1_X0 != zero ) ) )
= $true ),
inference(unfold_def,[status(thm)],[35]) ).
thf(37,plain,
! [SV1: $i] :
( ( ( addition @ SV1 @ zero )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(38,plain,
! [SV2: $i] :
( ( ( multiplication @ SV2 @ zero )
= zero )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(39,plain,
! [SV3: $i] :
( ( ( multiplication @ zero @ SV3 )
= zero )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(40,plain,
! [SV4: $i] :
( ( ! [SY8: $i] :
( ( domain @ ( multiplication @ SV4 @ SY8 ) )
= ( domain @ ( multiplication @ SV4 @ ( domain @ SY8 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(41,plain,
! [SV5: $i] :
( ( ! [SY9: $i] :
( ( domain @ ( addition @ SV5 @ SY9 ) )
= ( addition @ ( domain @ SV5 ) @ ( domain @ SY9 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(42,plain,
( ( ( ( domain @ sK1_X0 )
= zero )
| ( sK1_X0 != zero ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(43,plain,
! [SV6: $i,SV4: $i] :
( ( ( domain @ ( multiplication @ SV4 @ SV6 ) )
= ( domain @ ( multiplication @ SV4 @ ( domain @ SV6 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(44,plain,
! [SV7: $i,SV5: $i] :
( ( ( domain @ ( addition @ SV5 @ SV7 ) )
= ( addition @ ( domain @ SV5 ) @ ( domain @ SV7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(45,plain,
( ( ( domain @ sK1_X0 )
= zero )
= $false ),
inference(extcnf_or_neg,[status(thm)],[42]) ).
thf(46,plain,
( ( sK1_X0 != zero )
= $false ),
inference(extcnf_or_neg,[status(thm)],[42]) ).
thf(47,plain,
( ( sK1_X0 = zero )
= $true ),
inference(extcnf_not_neg,[status(thm)],[46]) ).
thf(48,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[33,47,45,44,43,39,38,37]) ).
thf(49,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE057+1 : 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.10/0.18 % Computer : n011.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Oct 6 11:33:51 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 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.10/0.22
% 0.10/0.22 No.of.Axioms: 6
% 0.10/0.22
% 0.10/0.22 Length.of.Defs: 0
% 0.10/0.22
% 0.10/0.22 Contains.Choice.Funs: false
% 0.10/0.22
% 0.10/0.22 ********************************
% 0.10/0.22 * All subproblems solved! *
% 0.10/0.22 ********************************
% 0.10/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:6,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:48,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.22
% 0.10/0.22 %**** Beginning of derivation protocol ****
% 0.10/0.22 % SZS output start CNFRefutation
% See solution above
% 0.10/0.22
% 0.10/0.22 %**** End of derivation protocol ****
% 0.10/0.22 %**** no. of clauses in derivation: 38 ****
% 0.10/0.22 %**** clause counter: 48 ****
% 0.10/0.22
% 0.10/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:6,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:48,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------