TSTP Solution File: KRS001-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n023.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 03:14:11 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 29
% Syntax : Number of formulae : 129 ( 61 unt; 12 typ; 0 def)
% Number of atoms : 597 ( 158 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 723 ( 124 ~; 164 |; 0 &; 435 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 156 ( 0 ^ 156 !; 0 ?; 156 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_c,type,
c: $i > $o ).
thf(tp_d,type,
d: $i > $o ).
thf(tp_e,type,
e: $i > $o ).
thf(tp_equalish,type,
equalish: $i > $i > $o ).
thf(tp_exist,type,
exist: $i ).
thf(tp_r,type,
r: $i > $i > $o ).
thf(tp_r1most,type,
r1most: $i > $o ).
thf(tp_r2least,type,
r2least: $i > $o ).
thf(tp_u1r1,type,
u1r1: $i > $i ).
thf(tp_u1r2,type,
u1r2: $i > $i ).
thf(tp_u3r1,type,
u3r1: $i > $i ).
thf(tp_u3r2,type,
u3r2: $i > $i ).
thf(1,axiom,
! [X1: $i] :
( ( e @ X1 )
| ~ ( c @ X1 )
| ~ ( d @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
thf(2,axiom,
! [X1: $i] :
( ( c @ X1 )
| ~ ( e @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
thf(3,axiom,
! [X1: $i] :
( ( d @ X1 )
| ~ ( e @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
thf(4,axiom,
! [X1: $i] :
( ( r1most @ X1 )
| ( r @ X1 @ ( u3r2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).
thf(5,axiom,
! [X1: $i] :
( ( r1most @ X1 )
| ( r @ X1 @ ( u3r1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
thf(6,axiom,
! [X1: $i] :
( ( r1most @ X1 )
| ~ ( equalish @ ( u3r2 @ X1 ) @ ( u3r1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
thf(7,axiom,
! [X3: $i,X2: $i,X1: $i] :
( ( equalish @ X3 @ X2 )
| ~ ( r1most @ X1 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
thf(8,axiom,
! [X1: $i] :
( ( d @ X1 )
| ~ ( r1most @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
thf(9,axiom,
! [X1: $i] :
( ( r1most @ X1 )
| ~ ( d @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
thf(10,axiom,
! [X1: $i,X3: $i,X2: $i] :
( ( r2least @ X1 )
| ( equalish @ X3 @ X2 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
thf(11,axiom,
! [X1: $i] :
( ( r @ X1 @ ( u1r2 @ X1 ) )
| ~ ( r2least @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
thf(12,axiom,
! [X1: $i] :
( ( r @ X1 @ ( u1r1 @ X1 ) )
| ~ ( r2least @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
thf(13,axiom,
! [X1: $i] :
( ~ ( r2least @ X1 )
| ~ ( equalish @ ( u1r2 @ X1 ) @ ( u1r1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
thf(14,axiom,
! [X1: $i] :
( ( c @ X1 )
| ~ ( r2least @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
thf(15,axiom,
! [X1: $i] :
( ( r2least @ X1 )
| ~ ( c @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
thf(16,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(17,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[16]) ).
thf(18,negated_conjecture,
e @ exist,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
thf(19,plain,
$false = $false,
inference(unfold_def,[status(thm)],[17]) ).
thf(20,plain,
( ( ! [X1: $i] :
( ( e @ X1 )
| ~ ( c @ X1 )
| ~ ( d @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(21,plain,
( ( ! [X1: $i] :
( ( c @ X1 )
| ~ ( e @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(22,plain,
( ( ! [X1: $i] :
( ( d @ X1 )
| ~ ( e @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(23,plain,
( ( ! [X1: $i] :
( ( r1most @ X1 )
| ( r @ X1 @ ( u3r2 @ X1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(24,plain,
( ( ! [X1: $i] :
( ( r1most @ X1 )
| ( r @ X1 @ ( u3r1 @ X1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(25,plain,
( ( ! [X1: $i] :
( ( r1most @ X1 )
| ~ ( equalish @ ( u3r2 @ X1 ) @ ( u3r1 @ X1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(26,plain,
( ( ! [X3: $i,X2: $i,X1: $i] :
( ( equalish @ X3 @ X2 )
| ~ ( r1most @ X1 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(27,plain,
( ( ! [X1: $i] :
( ( d @ X1 )
| ~ ( r1most @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(28,plain,
( ( ! [X1: $i] :
( ( r1most @ X1 )
| ~ ( d @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(29,plain,
( ( ! [X1: $i,X3: $i,X2: $i] :
( ( r2least @ X1 )
| ( equalish @ X3 @ X2 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(30,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u1r2 @ X1 ) )
| ~ ( r2least @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(31,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u1r1 @ X1 ) )
| ~ ( r2least @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(32,plain,
( ( ! [X1: $i] :
( ~ ( r2least @ X1 )
| ~ ( equalish @ ( u1r2 @ X1 ) @ ( u1r1 @ X1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(33,plain,
( ( ! [X1: $i] :
( ( c @ X1 )
| ~ ( r2least @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(34,plain,
( ( ! [X1: $i] :
( ( r2least @ X1 )
| ~ ( c @ X1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(35,plain,
( ( e @ exist )
= $true ),
inference(unfold_def,[status(thm)],[18]) ).
thf(36,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[19]) ).
thf(37,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u3r2 @ X1 ) )
| ( r1most @ X1 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[23]) ).
thf(38,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u3r1 @ X1 ) )
| ( r1most @ X1 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[24]) ).
thf(39,plain,
( ( ! [X3: $i,X2: $i] :
( ( equalish @ X3 @ X2 )
| ! [X1: $i] :
( ~ ( r1most @ X1 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[26]) ).
thf(40,plain,
( ( ! [X1: $i] :
( ( r2least @ X1 )
| ! [X3: $i,X2: $i] :
( ( equalish @ X3 @ X2 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[29]) ).
thf(41,plain,
( ( e @ exist )
= $true ),
inference(copy,[status(thm)],[35]) ).
thf(42,plain,
( ( ! [X1: $i] :
( ( r2least @ X1 )
| ~ ( c @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[34]) ).
thf(43,plain,
( ( ! [X1: $i] :
( ( c @ X1 )
| ~ ( r2least @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(44,plain,
( ( ! [X1: $i] :
( ~ ( r2least @ X1 )
| ~ ( equalish @ ( u1r2 @ X1 ) @ ( u1r1 @ X1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(45,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u1r1 @ X1 ) )
| ~ ( r2least @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(46,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u1r2 @ X1 ) )
| ~ ( r2least @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(47,plain,
( ( ! [X1: $i] :
( ( r2least @ X1 )
| ! [X3: $i,X2: $i] :
( ( equalish @ X3 @ X2 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ) ) )
= $true ),
inference(copy,[status(thm)],[40]) ).
thf(48,plain,
( ( ! [X1: $i] :
( ( r1most @ X1 )
| ~ ( d @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(49,plain,
( ( ! [X1: $i] :
( ( d @ X1 )
| ~ ( r1most @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(50,plain,
( ( ! [X3: $i,X2: $i] :
( ( equalish @ X3 @ X2 )
| ! [X1: $i] :
( ~ ( r1most @ X1 )
| ~ ( r @ X1 @ X3 )
| ~ ( r @ X1 @ X2 ) ) ) )
= $true ),
inference(copy,[status(thm)],[39]) ).
thf(51,plain,
( ( ! [X1: $i] :
( ( r1most @ X1 )
| ~ ( equalish @ ( u3r2 @ X1 ) @ ( u3r1 @ X1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(52,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u3r1 @ X1 ) )
| ( r1most @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[38]) ).
thf(53,plain,
( ( ! [X1: $i] :
( ( r @ X1 @ ( u3r2 @ X1 ) )
| ( r1most @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[37]) ).
thf(54,plain,
( ( ! [X1: $i] :
( ( d @ X1 )
| ~ ( e @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(55,plain,
( ( ! [X1: $i] :
( ( c @ X1 )
| ~ ( e @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(56,plain,
( ( ! [X1: $i] :
( ( e @ X1 )
| ~ ( c @ X1 )
| ~ ( d @ X1 ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(57,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[36]) ).
thf(58,plain,
! [SV1: $i] :
( ( ( r2least @ SV1 )
| ~ ( c @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(59,plain,
! [SV2: $i] :
( ( ( c @ SV2 )
| ~ ( r2least @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(60,plain,
! [SV3: $i] :
( ( ~ ( r2least @ SV3 )
| ~ ( equalish @ ( u1r2 @ SV3 ) @ ( u1r1 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(61,plain,
! [SV4: $i] :
( ( ( r @ SV4 @ ( u1r1 @ SV4 ) )
| ~ ( r2least @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(62,plain,
! [SV5: $i] :
( ( ( r @ SV5 @ ( u1r2 @ SV5 ) )
| ~ ( r2least @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(63,plain,
! [SV6: $i] :
( ( ( r2least @ SV6 )
| ! [SY19: $i,SY20: $i] :
( ( equalish @ SY19 @ SY20 )
| ~ ( r @ SV6 @ SY19 )
| ~ ( r @ SV6 @ SY20 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(64,plain,
! [SV7: $i] :
( ( ( r1most @ SV7 )
| ~ ( d @ SV7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[48]) ).
thf(65,plain,
! [SV8: $i] :
( ( ( d @ SV8 )
| ~ ( r1most @ SV8 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[49]) ).
thf(66,plain,
! [SV9: $i] :
( ( ! [SY21: $i] :
( ( equalish @ SV9 @ SY21 )
| ! [SY22: $i] :
( ~ ( r1most @ SY22 )
| ~ ( r @ SY22 @ SV9 )
| ~ ( r @ SY22 @ SY21 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[50]) ).
thf(67,plain,
! [SV10: $i] :
( ( ( r1most @ SV10 )
| ~ ( equalish @ ( u3r2 @ SV10 ) @ ( u3r1 @ SV10 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(68,plain,
! [SV11: $i] :
( ( ( r @ SV11 @ ( u3r1 @ SV11 ) )
| ( r1most @ SV11 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[52]) ).
thf(69,plain,
! [SV12: $i] :
( ( ( r @ SV12 @ ( u3r2 @ SV12 ) )
| ( r1most @ SV12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[53]) ).
thf(70,plain,
! [SV13: $i] :
( ( ( d @ SV13 )
| ~ ( e @ SV13 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[54]) ).
thf(71,plain,
! [SV14: $i] :
( ( ( c @ SV14 )
| ~ ( e @ SV14 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[55]) ).
thf(72,plain,
! [SV15: $i] :
( ( ( e @ SV15 )
| ~ ( c @ SV15 )
| ~ ( d @ SV15 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[56]) ).
thf(73,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[57]) ).
thf(74,plain,
! [SV1: $i] :
( ( ( r2least @ SV1 )
= $true )
| ( ( ~ ( c @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[58]) ).
thf(75,plain,
! [SV2: $i] :
( ( ( c @ SV2 )
= $true )
| ( ( ~ ( r2least @ SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[59]) ).
thf(76,plain,
! [SV3: $i] :
( ( ( ~ ( r2least @ SV3 ) )
= $true )
| ( ( ~ ( equalish @ ( u1r2 @ SV3 ) @ ( u1r1 @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[60]) ).
thf(77,plain,
! [SV4: $i] :
( ( ( r @ SV4 @ ( u1r1 @ SV4 ) )
= $true )
| ( ( ~ ( r2least @ SV4 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[61]) ).
thf(78,plain,
! [SV5: $i] :
( ( ( r @ SV5 @ ( u1r2 @ SV5 ) )
= $true )
| ( ( ~ ( r2least @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[62]) ).
thf(79,plain,
! [SV6: $i] :
( ( ( r2least @ SV6 )
= $true )
| ( ( ! [SY19: $i,SY20: $i] :
( ( equalish @ SY19 @ SY20 )
| ~ ( r @ SV6 @ SY19 )
| ~ ( r @ SV6 @ SY20 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[63]) ).
thf(80,plain,
! [SV7: $i] :
( ( ( r1most @ SV7 )
= $true )
| ( ( ~ ( d @ SV7 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[64]) ).
thf(81,plain,
! [SV8: $i] :
( ( ( d @ SV8 )
= $true )
| ( ( ~ ( r1most @ SV8 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[65]) ).
thf(82,plain,
! [SV16: $i,SV9: $i] :
( ( ( equalish @ SV9 @ SV16 )
| ! [SY23: $i] :
( ~ ( r1most @ SY23 )
| ~ ( r @ SY23 @ SV9 )
| ~ ( r @ SY23 @ SV16 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[66]) ).
thf(83,plain,
! [SV10: $i] :
( ( ( r1most @ SV10 )
= $true )
| ( ( ~ ( equalish @ ( u3r2 @ SV10 ) @ ( u3r1 @ SV10 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[67]) ).
thf(84,plain,
! [SV11: $i] :
( ( ( r @ SV11 @ ( u3r1 @ SV11 ) )
= $true )
| ( ( r1most @ SV11 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[68]) ).
thf(85,plain,
! [SV12: $i] :
( ( ( r @ SV12 @ ( u3r2 @ SV12 ) )
= $true )
| ( ( r1most @ SV12 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[69]) ).
thf(86,plain,
! [SV13: $i] :
( ( ( d @ SV13 )
= $true )
| ( ( ~ ( e @ SV13 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[70]) ).
thf(87,plain,
! [SV14: $i] :
( ( ( c @ SV14 )
= $true )
| ( ( ~ ( e @ SV14 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[71]) ).
thf(88,plain,
! [SV15: $i] :
( ( ( e @ SV15 )
= $true )
| ( ( ~ ( c @ SV15 )
| ~ ( d @ SV15 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[72]) ).
thf(89,plain,
! [SV1: $i] :
( ( ( c @ SV1 )
= $false )
| ( ( r2least @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[74]) ).
thf(90,plain,
! [SV2: $i] :
( ( ( r2least @ SV2 )
= $false )
| ( ( c @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[75]) ).
thf(91,plain,
! [SV3: $i] :
( ( ( r2least @ SV3 )
= $false )
| ( ( ~ ( equalish @ ( u1r2 @ SV3 ) @ ( u1r1 @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[76]) ).
thf(92,plain,
! [SV4: $i] :
( ( ( r2least @ SV4 )
= $false )
| ( ( r @ SV4 @ ( u1r1 @ SV4 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[77]) ).
thf(93,plain,
! [SV5: $i] :
( ( ( r2least @ SV5 )
= $false )
| ( ( r @ SV5 @ ( u1r2 @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[78]) ).
thf(94,plain,
! [SV6: $i,SV17: $i] :
( ( ( ! [SY24: $i] :
( ( equalish @ SV17 @ SY24 )
| ~ ( r @ SV6 @ SV17 )
| ~ ( r @ SV6 @ SY24 ) ) )
= $true )
| ( ( r2least @ SV6 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[79]) ).
thf(95,plain,
! [SV7: $i] :
( ( ( d @ SV7 )
= $false )
| ( ( r1most @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[80]) ).
thf(96,plain,
! [SV8: $i] :
( ( ( r1most @ SV8 )
= $false )
| ( ( d @ SV8 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[81]) ).
thf(97,plain,
! [SV16: $i,SV9: $i] :
( ( ( equalish @ SV9 @ SV16 )
= $true )
| ( ( ! [SY23: $i] :
( ~ ( r1most @ SY23 )
| ~ ( r @ SY23 @ SV9 )
| ~ ( r @ SY23 @ SV16 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[82]) ).
thf(98,plain,
! [SV10: $i] :
( ( ( equalish @ ( u3r2 @ SV10 ) @ ( u3r1 @ SV10 ) )
= $false )
| ( ( r1most @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[83]) ).
thf(99,plain,
! [SV13: $i] :
( ( ( e @ SV13 )
= $false )
| ( ( d @ SV13 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[86]) ).
thf(100,plain,
! [SV14: $i] :
( ( ( e @ SV14 )
= $false )
| ( ( c @ SV14 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[87]) ).
thf(101,plain,
! [SV15: $i] :
( ( ( ~ ( c @ SV15 ) )
= $true )
| ( ( ~ ( d @ SV15 ) )
= $true )
| ( ( e @ SV15 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[88]) ).
thf(102,plain,
! [SV3: $i] :
( ( ( equalish @ ( u1r2 @ SV3 ) @ ( u1r1 @ SV3 ) )
= $false )
| ( ( r2least @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[91]) ).
thf(103,plain,
! [SV6: $i,SV18: $i,SV17: $i] :
( ( ( ( equalish @ SV17 @ SV18 )
| ~ ( r @ SV6 @ SV17 )
| ~ ( r @ SV6 @ SV18 ) )
= $true )
| ( ( r2least @ SV6 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[94]) ).
thf(104,plain,
! [SV16: $i,SV9: $i,SV19: $i] :
( ( ( ~ ( r1most @ SV19 )
| ~ ( r @ SV19 @ SV9 )
| ~ ( r @ SV19 @ SV16 ) )
= $true )
| ( ( equalish @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[97]) ).
thf(105,plain,
! [SV15: $i] :
( ( ( c @ SV15 )
= $false )
| ( ( ~ ( d @ SV15 ) )
= $true )
| ( ( e @ SV15 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[101]) ).
thf(106,plain,
! [SV6: $i,SV18: $i,SV17: $i] :
( ( ( equalish @ SV17 @ SV18 )
= $true )
| ( ( ~ ( r @ SV6 @ SV17 )
| ~ ( r @ SV6 @ SV18 ) )
= $true )
| ( ( r2least @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[103]) ).
thf(107,plain,
! [SV16: $i,SV9: $i,SV19: $i] :
( ( ( ~ ( r1most @ SV19 ) )
= $true )
| ( ( ~ ( r @ SV19 @ SV9 )
| ~ ( r @ SV19 @ SV16 ) )
= $true )
| ( ( equalish @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[104]) ).
thf(108,plain,
! [SV15: $i] :
( ( ( d @ SV15 )
= $false )
| ( ( c @ SV15 )
= $false )
| ( ( e @ SV15 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[105]) ).
thf(109,plain,
! [SV18: $i,SV17: $i,SV6: $i] :
( ( ( ~ ( r @ SV6 @ SV17 ) )
= $true )
| ( ( ~ ( r @ SV6 @ SV18 ) )
= $true )
| ( ( equalish @ SV17 @ SV18 )
= $true )
| ( ( r2least @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[106]) ).
thf(110,plain,
! [SV16: $i,SV9: $i,SV19: $i] :
( ( ( r1most @ SV19 )
= $false )
| ( ( ~ ( r @ SV19 @ SV9 )
| ~ ( r @ SV19 @ SV16 ) )
= $true )
| ( ( equalish @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[107]) ).
thf(111,plain,
! [SV18: $i,SV17: $i,SV6: $i] :
( ( ( r @ SV6 @ SV17 )
= $false )
| ( ( ~ ( r @ SV6 @ SV18 ) )
= $true )
| ( ( equalish @ SV17 @ SV18 )
= $true )
| ( ( r2least @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[109]) ).
thf(112,plain,
! [SV16: $i,SV9: $i,SV19: $i] :
( ( ( ~ ( r @ SV19 @ SV9 ) )
= $true )
| ( ( ~ ( r @ SV19 @ SV16 ) )
= $true )
| ( ( r1most @ SV19 )
= $false )
| ( ( equalish @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[110]) ).
thf(113,plain,
! [SV17: $i,SV18: $i,SV6: $i] :
( ( ( r @ SV6 @ SV18 )
= $false )
| ( ( r @ SV6 @ SV17 )
= $false )
| ( ( equalish @ SV17 @ SV18 )
= $true )
| ( ( r2least @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[111]) ).
thf(114,plain,
! [SV16: $i,SV9: $i,SV19: $i] :
( ( ( r @ SV19 @ SV9 )
= $false )
| ( ( ~ ( r @ SV19 @ SV16 ) )
= $true )
| ( ( r1most @ SV19 )
= $false )
| ( ( equalish @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[112]) ).
thf(115,plain,
! [SV9: $i,SV16: $i,SV19: $i] :
( ( ( r @ SV19 @ SV16 )
= $false )
| ( ( r @ SV19 @ SV9 )
= $false )
| ( ( r1most @ SV19 )
= $false )
| ( ( equalish @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[114]) ).
thf(116,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[41,115,113,108,102,100,99,98,96,95,93,92,90,89,85,84,73]) ).
thf(117,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.11 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.32 % Computer : n023.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 7 16:11:08 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.33
% 0.12/0.33 No.of.Axioms: 16
% 0.12/0.33
% 0.12/0.33 Length.of.Defs: 0
% 0.12/0.33
% 0.12/0.33 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:16,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:18,loop_count:0,foatp_calls:0,translation:fof_full)....
% 0.12/0.38
% 0.12/0.38 ********************************
% 0.12/0.38 * All subproblems solved! *
% 0.12/0.38 ********************************
% 0.12/0.38 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:16,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:116,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.39
% 0.12/0.39 %**** Beginning of derivation protocol ****
% 0.12/0.39 % SZS output start CNFRefutation
% See solution above
% 0.12/0.39
% 0.12/0.39 %**** End of derivation protocol ****
% 0.12/0.39 %**** no. of clauses in derivation: 117 ****
% 0.12/0.39 %**** clause counter: 116 ****
% 0.12/0.39
% 0.12/0.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:16,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:116,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------