TSTP Solution File: KLE002+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n017.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 : Sun Jul 17 02:10:44 EDT 2022
% Result : Theorem 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 21
% Syntax : Number of formulae : 93 ( 79 unt; 8 typ; 0 def)
% Number of atoms : 267 ( 150 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 507 ( 27 ~; 22 |; 2 &; 448 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 162 ( 0 ^ 162 !; 0 ?; 162 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_addition,type,
addition: $i > $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_sK2_SY25,type,
sK2_SY25: $i ).
thf(tp_sK3_SY27,type,
sK3_SY27: $i ).
thf(tp_zero,type,
zero: $i ).
thf(1,axiom,
! [A: $i,B: $i] :
( ( leq @ A @ B )
<=> ( ( addition @ A @ B )
= B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
thf(2,axiom,
! [A: $i] :
( ( multiplication @ zero @ A )
= zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
thf(3,axiom,
! [A: $i] :
( ( multiplication @ A @ zero )
= zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_annihilation) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( multiplication @ ( addition @ A @ B ) @ C )
= ( addition @ ( multiplication @ A @ C ) @ ( multiplication @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( addition @ B @ C ) )
= ( addition @ ( multiplication @ A @ B ) @ ( multiplication @ A @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
thf(6,axiom,
! [A: $i] :
( ( multiplication @ one @ A )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
thf(7,axiom,
! [A: $i] :
( ( multiplication @ A @ one )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
thf(8,axiom,
! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( multiplication @ B @ C ) )
= ( multiplication @ ( multiplication @ A @ B ) @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
thf(9,axiom,
! [A: $i] :
( ( addition @ A @ A )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).
thf(10,axiom,
! [A: $i] :
( ( addition @ A @ zero )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
thf(11,axiom,
! [C: $i,B: $i,A: $i] :
( ( addition @ A @ ( addition @ B @ C ) )
= ( addition @ ( addition @ A @ B ) @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
thf(12,axiom,
! [A: $i,B: $i] :
( ( addition @ A @ B )
= ( addition @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
thf(13,conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ( leq @ X0 @ X1 )
=> ( leq @ ( multiplication @ X0 @ X2 ) @ ( multiplication @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
thf(14,negated_conjecture,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( leq @ X0 @ X1 )
=> ( leq @ ( multiplication @ X0 @ X2 ) @ ( multiplication @ X1 @ X2 ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[13]) ).
thf(15,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( leq @ X0 @ X1 )
=> ( leq @ ( multiplication @ X0 @ X2 ) @ ( multiplication @ X1 @ X2 ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[14]) ).
thf(16,plain,
( ( ! [A: $i,B: $i] :
( ( leq @ A @ B )
<=> ( ( addition @ A @ B )
= B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(17,plain,
( ( ! [A: $i] :
( ( multiplication @ zero @ A )
= zero ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(18,plain,
( ( ! [A: $i] :
( ( multiplication @ A @ zero )
= zero ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(19,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiplication @ ( addition @ A @ B ) @ C )
= ( addition @ ( multiplication @ A @ C ) @ ( multiplication @ B @ C ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(20,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( addition @ B @ C ) )
= ( addition @ ( multiplication @ A @ B ) @ ( multiplication @ A @ C ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(21,plain,
( ( ! [A: $i] :
( ( multiplication @ one @ A )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(22,plain,
( ( ! [A: $i] :
( ( multiplication @ A @ one )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(23,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( multiplication @ B @ C ) )
= ( multiplication @ ( multiplication @ A @ B ) @ C ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(24,plain,
( ( ! [A: $i] :
( ( addition @ A @ A )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(25,plain,
( ( ! [A: $i] :
( ( addition @ A @ zero )
= A ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(26,plain,
( ( ! [C: $i,B: $i,A: $i] :
( ( addition @ A @ ( addition @ B @ C ) )
= ( addition @ ( addition @ A @ B ) @ C ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(27,plain,
( ( ! [A: $i,B: $i] :
( ( addition @ A @ B )
= ( addition @ B @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(28,plain,
( ( ! [SY25: $i,SY26: $i] :
( ( leq @ sK1_X0 @ SY25 )
=> ( leq @ ( multiplication @ sK1_X0 @ SY26 ) @ ( multiplication @ SY25 @ SY26 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[15]) ).
thf(29,plain,
( ( ! [SY27: $i] :
( ( leq @ sK1_X0 @ sK2_SY25 )
=> ( leq @ ( multiplication @ sK1_X0 @ SY27 ) @ ( multiplication @ sK2_SY25 @ SY27 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[28]) ).
thf(30,plain,
( ( ( leq @ sK1_X0 @ sK2_SY25 )
=> ( leq @ ( multiplication @ sK1_X0 @ sK3_SY27 ) @ ( multiplication @ sK2_SY25 @ sK3_SY27 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[29]) ).
thf(31,plain,
( ( leq @ sK1_X0 @ sK2_SY25 )
= $true ),
inference(standard_cnf,[status(thm)],[30]) ).
thf(32,plain,
( ( leq @ ( multiplication @ sK1_X0 @ sK3_SY27 ) @ ( multiplication @ sK2_SY25 @ sK3_SY27 ) )
= $false ),
inference(standard_cnf,[status(thm)],[30]) ).
thf(33,plain,
( ( ~ ( leq @ ( multiplication @ sK1_X0 @ sK3_SY27 ) @ ( multiplication @ sK2_SY25 @ sK3_SY27 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[32]) ).
thf(34,plain,
( ( ! [A: $i,B: $i] :
( ( ( addition @ A @ B )
!= B )
| ( leq @ A @ B ) )
& ! [A: $i,B: $i] :
( ~ ( leq @ A @ B )
| ( ( addition @ A @ B )
= B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[16]) ).
thf(35,plain,
( ( ! [A: $i,B: $i] :
( ( addition @ A @ B )
= ( addition @ B @ A ) ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(36,plain,
( ( ! [C: $i,B: $i,A: $i] :
( ( addition @ A @ ( addition @ B @ C ) )
= ( addition @ ( addition @ A @ B ) @ C ) ) )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(37,plain,
( ( ! [A: $i] :
( ( addition @ A @ zero )
= A ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(38,plain,
( ( ! [A: $i] :
( ( addition @ A @ A )
= A ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(39,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( multiplication @ B @ C ) )
= ( multiplication @ ( multiplication @ A @ B ) @ C ) ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(40,plain,
( ( ! [A: $i] :
( ( multiplication @ A @ one )
= A ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(41,plain,
( ( ! [A: $i] :
( ( multiplication @ one @ A )
= A ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(42,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiplication @ A @ ( addition @ B @ C ) )
= ( addition @ ( multiplication @ A @ B ) @ ( multiplication @ A @ C ) ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(43,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( multiplication @ ( addition @ A @ B ) @ C )
= ( addition @ ( multiplication @ A @ C ) @ ( multiplication @ B @ C ) ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(44,plain,
( ( ! [A: $i] :
( ( multiplication @ A @ zero )
= zero ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(45,plain,
( ( ! [A: $i] :
( ( multiplication @ zero @ A )
= zero ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(46,plain,
( ( ! [A: $i,B: $i] :
( ( ( addition @ A @ B )
!= B )
| ( leq @ A @ B ) )
& ! [A: $i,B: $i] :
( ~ ( leq @ A @ B )
| ( ( addition @ A @ B )
= B ) ) )
= $true ),
inference(copy,[status(thm)],[34]) ).
thf(47,plain,
( ( leq @ sK1_X0 @ sK2_SY25 )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(48,plain,
( ( ~ ( leq @ ( multiplication @ sK1_X0 @ sK3_SY27 ) @ ( multiplication @ sK2_SY25 @ sK3_SY27 ) ) )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(49,plain,
( ( ~ ( ~ ! [SX0: $i,SX1: $i] :
( ( ( addition @ SX0 @ SX1 )
!= SX1 )
| ( leq @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ~ ( leq @ SX0 @ SX1 )
| ( ( addition @ SX0 @ SX1 )
= SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[46]) ).
thf(50,plain,
! [SV1: $i] :
( ( ! [SY28: $i] :
( ( addition @ SV1 @ SY28 )
= ( addition @ SY28 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(51,plain,
! [SV2: $i] :
( ( ! [SY29: $i,SY30: $i] :
( ( addition @ SY30 @ ( addition @ SY29 @ SV2 ) )
= ( addition @ ( addition @ SY30 @ SY29 ) @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[36]) ).
thf(52,plain,
! [SV3: $i] :
( ( ( addition @ SV3 @ zero )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(53,plain,
! [SV4: $i] :
( ( ( addition @ SV4 @ SV4 )
= SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(54,plain,
! [SV5: $i] :
( ( ! [SY31: $i,SY32: $i] :
( ( multiplication @ SV5 @ ( multiplication @ SY31 @ SY32 ) )
= ( multiplication @ ( multiplication @ SV5 @ SY31 ) @ SY32 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(55,plain,
! [SV6: $i] :
( ( ( multiplication @ SV6 @ one )
= SV6 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(56,plain,
! [SV7: $i] :
( ( ( multiplication @ one @ SV7 )
= SV7 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(57,plain,
! [SV8: $i] :
( ( ! [SY33: $i,SY34: $i] :
( ( multiplication @ SV8 @ ( addition @ SY33 @ SY34 ) )
= ( addition @ ( multiplication @ SV8 @ SY33 ) @ ( multiplication @ SV8 @ SY34 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(58,plain,
! [SV9: $i] :
( ( ! [SY35: $i,SY36: $i] :
( ( multiplication @ ( addition @ SV9 @ SY35 ) @ SY36 )
= ( addition @ ( multiplication @ SV9 @ SY36 ) @ ( multiplication @ SY35 @ SY36 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(59,plain,
! [SV10: $i] :
( ( ( multiplication @ SV10 @ zero )
= zero )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(60,plain,
! [SV11: $i] :
( ( ( multiplication @ zero @ SV11 )
= zero )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(61,plain,
( ( leq @ ( multiplication @ sK1_X0 @ sK3_SY27 ) @ ( multiplication @ sK2_SY25 @ sK3_SY27 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(62,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ( ( addition @ SX0 @ SX1 )
!= SX1 )
| ( leq @ SX0 @ SX1 ) )
| ~ ! [SX0: $i,SX1: $i] :
( ~ ( leq @ SX0 @ SX1 )
| ( ( addition @ SX0 @ SX1 )
= SX1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(63,plain,
! [SV12: $i,SV1: $i] :
( ( ( addition @ SV1 @ SV12 )
= ( addition @ SV12 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[50]) ).
thf(64,plain,
! [SV2: $i,SV13: $i] :
( ( ! [SY37: $i] :
( ( addition @ SY37 @ ( addition @ SV13 @ SV2 ) )
= ( addition @ ( addition @ SY37 @ SV13 ) @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(65,plain,
! [SV14: $i,SV5: $i] :
( ( ! [SY38: $i] :
( ( multiplication @ SV5 @ ( multiplication @ SV14 @ SY38 ) )
= ( multiplication @ ( multiplication @ SV5 @ SV14 ) @ SY38 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[54]) ).
thf(66,plain,
! [SV15: $i,SV8: $i] :
( ( ! [SY39: $i] :
( ( multiplication @ SV8 @ ( addition @ SV15 @ SY39 ) )
= ( addition @ ( multiplication @ SV8 @ SV15 ) @ ( multiplication @ SV8 @ SY39 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[57]) ).
thf(67,plain,
! [SV16: $i,SV9: $i] :
( ( ! [SY40: $i] :
( ( multiplication @ ( addition @ SV9 @ SV16 ) @ SY40 )
= ( addition @ ( multiplication @ SV9 @ SY40 ) @ ( multiplication @ SV16 @ SY40 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[58]) ).
thf(68,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ( ( addition @ SX0 @ SX1 )
!= SX1 )
| ( leq @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[62]) ).
thf(69,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( leq @ SX0 @ SX1 )
| ( ( addition @ SX0 @ SX1 )
= SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[62]) ).
thf(70,plain,
! [SV2: $i,SV13: $i,SV17: $i] :
( ( ( addition @ SV17 @ ( addition @ SV13 @ SV2 ) )
= ( addition @ ( addition @ SV17 @ SV13 ) @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[64]) ).
thf(71,plain,
! [SV18: $i,SV14: $i,SV5: $i] :
( ( ( multiplication @ SV5 @ ( multiplication @ SV14 @ SV18 ) )
= ( multiplication @ ( multiplication @ SV5 @ SV14 ) @ SV18 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[65]) ).
thf(72,plain,
! [SV19: $i,SV15: $i,SV8: $i] :
( ( ( multiplication @ SV8 @ ( addition @ SV15 @ SV19 ) )
= ( addition @ ( multiplication @ SV8 @ SV15 ) @ ( multiplication @ SV8 @ SV19 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[66]) ).
thf(73,plain,
! [SV20: $i,SV16: $i,SV9: $i] :
( ( ( multiplication @ ( addition @ SV9 @ SV16 ) @ SV20 )
= ( addition @ ( multiplication @ SV9 @ SV20 ) @ ( multiplication @ SV16 @ SV20 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[67]) ).
thf(74,plain,
( ( ! [SX0: $i,SX1: $i] :
( ( ( addition @ SX0 @ SX1 )
!= SX1 )
| ( leq @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[68]) ).
thf(75,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( leq @ SX0 @ SX1 )
| ( ( addition @ SX0 @ SX1 )
= SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[69]) ).
thf(76,plain,
! [SV21: $i] :
( ( ! [SY41: $i] :
( ( ( addition @ SV21 @ SY41 )
!= SY41 )
| ( leq @ SV21 @ SY41 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[74]) ).
thf(77,plain,
! [SV22: $i] :
( ( ! [SY42: $i] :
( ~ ( leq @ SV22 @ SY42 )
| ( ( addition @ SV22 @ SY42 )
= SY42 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[75]) ).
thf(78,plain,
! [SV23: $i,SV21: $i] :
( ( ( ( addition @ SV21 @ SV23 )
!= SV23 )
| ( leq @ SV21 @ SV23 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[76]) ).
thf(79,plain,
! [SV24: $i,SV22: $i] :
( ( ~ ( leq @ SV22 @ SV24 )
| ( ( addition @ SV22 @ SV24 )
= SV24 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[77]) ).
thf(80,plain,
! [SV23: $i,SV21: $i] :
( ( ( ( ( addition @ SV21 @ SV23 )
!= SV23 ) )
= $true )
| ( ( leq @ SV21 @ SV23 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[78]) ).
thf(81,plain,
! [SV24: $i,SV22: $i] :
( ( ( ~ ( leq @ SV22 @ SV24 ) )
= $true )
| ( ( ( addition @ SV22 @ SV24 )
= SV24 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[79]) ).
thf(82,plain,
! [SV23: $i,SV21: $i] :
( ( ( ( addition @ SV21 @ SV23 )
= SV23 )
= $false )
| ( ( leq @ SV21 @ SV23 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[80]) ).
thf(83,plain,
! [SV24: $i,SV22: $i] :
( ( ( leq @ SV22 @ SV24 )
= $false )
| ( ( ( addition @ SV22 @ SV24 )
= SV24 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[81]) ).
thf(84,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[47,83,82,73,72,71,70,63,61,60,59,56,55,53,52]) ).
thf(85,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n017.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 : Thu Jun 16 12:32:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 12
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.36 (rf:0,axioms:12,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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:0,translation:fof_full).....
% 0.13/0.41
% 0.13/0.41 ********************************
% 0.13/0.41 * All subproblems solved! *
% 0.13/0.41 ********************************
% 0.13/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:13,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:84,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.41
% 0.13/0.41 %**** Beginning of derivation protocol ****
% 0.13/0.41 % SZS output start CNFRefutation
% See solution above
% 0.13/0.41
% 0.13/0.41 %**** End of derivation protocol ****
% 0.13/0.41 %**** no. of clauses in derivation: 85 ****
% 0.13/0.41 %**** clause counter: 84 ****
% 0.13/0.41
% 0.13/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:13,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:84,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------