TSTP Solution File: KRS002-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n028.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 : 300s
% DateTime : Sat Sep 17 17:44:19 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 65
% Syntax : Number of formulae : 132 ( 26 unt; 12 typ; 0 def)
% Number of atoms : 548 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 766 ( 365 ~; 346 |; 0 &)
% ( 55 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 27 ( 27 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 11 >; 3 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 209 ( 186 !; 0 ?; 209 :)
% Comments :
%------------------------------------------------------------------------------
tff(equalish_type,type,
equalish: ( $i * $i ) > $o ).
tff(u1r1_type,type,
u1r1: $i > $i ).
tff(u4r2_type,type,
u4r2: $i > $i ).
tff(exist_type,type,
exist: $i ).
tff(u1r2_type,type,
u1r2: $i > $i ).
tff(s2least_type,type,
s2least: $i > $o ).
tff(c_type,type,
c: $i > $o ).
tff(r_type,type,
r: ( $i * $i ) > $o ).
tff(e_type,type,
e: $i > $o ).
tff(s_type,type,
s: ( $i * $i ) > $o ).
tff(s1most_type,type,
s1most: $i > $o ).
tff(d_type,type,
d: $i > $o ).
tff(1,plain,
^ [X1: $i] :
refl(
( ( ~ e(X1)
| r(X1,u4r2(X1)) )
<=> ( ~ e(X1)
| r(X1,u4r2(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) )
<=> ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) )
<=> ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,plain,
^ [X1: $i] :
rewrite(
( ( r(X1,u4r2(X1))
| ~ e(X1) )
<=> ( ~ e(X1)
| r(X1,u4r2(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [X1: $i] :
( r(X1,u4r2(X1))
| ~ e(X1) )
<=> ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,axiom,
! [X1: $i] :
( r(X1,u4r2(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
tff(7,plain,
! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ),
inference(modus_ponens,[status(thm)],[7,3]) ).
tff(9,plain,
! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) ),
inference(modus_ponens,[status(thm)],[9,2]) ).
tff(11,plain,
( e(exist)
<=> e(exist) ),
inference(rewrite,[status(thm)],]) ).
tff(12,axiom,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
tff(13,plain,
e(exist),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
( ( ~ ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) )
| ~ e(exist)
| r(exist,u4r2(exist)) )
<=> ( ~ ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) )
| ~ e(exist)
| r(exist,u4r2(exist)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(15,plain,
( ~ ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) )
| ~ e(exist)
| r(exist,u4r2(exist)) ),
inference(quant_inst,[status(thm)],]) ).
tff(16,plain,
( ~ ! [X1: $i] :
( ~ e(X1)
| r(X1,u4r2(X1)) )
| ~ e(exist)
| r(exist,u4r2(exist)) ),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
r(exist,u4r2(exist)),
inference(unit_resolution,[status(thm)],[16,13,10]) ).
tff(18,plain,
^ [X2: $i,X1: $i] :
refl(
( ( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
<=> ( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ) )),
inference(bind,[status(th)],]) ).
tff(19,plain,
( ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
<=> ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ) ),
inference(quant_intro,[status(thm)],[18]) ).
tff(20,plain,
( ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
<=> ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ) ),
inference(rewrite,[status(thm)],]) ).
tff(21,plain,
^ [X2: $i,X1: $i] :
rewrite(
( ( c(X2)
| ~ e(X1)
| ~ r(X1,X2) )
<=> ( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ) )),
inference(bind,[status(th)],]) ).
tff(22,plain,
( ! [X2: $i,X1: $i] :
( c(X2)
| ~ e(X1)
| ~ r(X1,X2) )
<=> ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ) ),
inference(quant_intro,[status(thm)],[21]) ).
tff(23,axiom,
! [X2: $i,X1: $i] :
( c(X2)
| ~ e(X1)
| ~ r(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
tff(24,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ),
inference(modus_ponens,[status(thm)],[23,22]) ).
tff(25,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ),
inference(modus_ponens,[status(thm)],[24,20]) ).
tff(26,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ),
inference(skolemize,[status(sab)],[25]) ).
tff(27,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) ),
inference(modus_ponens,[status(thm)],[26,19]) ).
tff(28,plain,
( ( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| c(u4r2(exist)) )
<=> ( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| c(u4r2(exist)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(29,plain,
( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| c(u4r2(exist)) ),
inference(quant_inst,[status(thm)],]) ).
tff(30,plain,
( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| c(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| c(u4r2(exist)) ),
inference(modus_ponens,[status(thm)],[29,28]) ).
tff(31,plain,
c(u4r2(exist)),
inference(unit_resolution,[status(thm)],[30,13,27,17]) ).
tff(32,plain,
^ [X1: $i] :
refl(
( ( s2least(X1)
| ~ c(X1) )
<=> ( s2least(X1)
| ~ c(X1) ) )),
inference(bind,[status(th)],]) ).
tff(33,plain,
( ! [X1: $i] :
( s2least(X1)
| ~ c(X1) )
<=> ! [X1: $i] :
( s2least(X1)
| ~ c(X1) ) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,plain,
( ! [X1: $i] :
( s2least(X1)
| ~ c(X1) )
<=> ! [X1: $i] :
( s2least(X1)
| ~ c(X1) ) ),
inference(rewrite,[status(thm)],]) ).
tff(35,axiom,
! [X1: $i] :
( s2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
tff(36,plain,
! [X1: $i] :
( s2least(X1)
| ~ c(X1) ),
inference(modus_ponens,[status(thm)],[35,34]) ).
tff(37,plain,
! [X1: $i] :
( s2least(X1)
| ~ c(X1) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [X1: $i] :
( s2least(X1)
| ~ c(X1) ),
inference(modus_ponens,[status(thm)],[37,33]) ).
tff(39,plain,
( ( ~ ! [X1: $i] :
( s2least(X1)
| ~ c(X1) )
| s2least(u4r2(exist))
| ~ c(u4r2(exist)) )
<=> ( ~ ! [X1: $i] :
( s2least(X1)
| ~ c(X1) )
| s2least(u4r2(exist))
| ~ c(u4r2(exist)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(40,plain,
( ~ ! [X1: $i] :
( s2least(X1)
| ~ c(X1) )
| s2least(u4r2(exist))
| ~ c(u4r2(exist)) ),
inference(quant_inst,[status(thm)],]) ).
tff(41,plain,
( ~ ! [X1: $i] :
( s2least(X1)
| ~ c(X1) )
| s2least(u4r2(exist))
| ~ c(u4r2(exist)) ),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
s2least(u4r2(exist)),
inference(unit_resolution,[status(thm)],[41,38,31]) ).
tff(43,plain,
^ [X1: $i] :
refl(
( ( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
<=> ( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(44,plain,
( ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ) ),
inference(quant_intro,[status(thm)],[43]) ).
tff(45,plain,
( ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(46,axiom,
! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
tff(47,plain,
! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(skolemize,[status(sab)],[47]) ).
tff(49,plain,
! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(modus_ponens,[status(thm)],[48,44]) ).
tff(50,plain,
( ( ~ ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
| ~ s2least(u4r2(exist))
| ~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) )
<=> ( ~ ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
| ~ s2least(u4r2(exist))
| ~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(51,plain,
( ~ ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
| ~ s2least(u4r2(exist))
| ~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
inference(quant_inst,[status(thm)],]) ).
tff(52,plain,
( ~ ! [X1: $i] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) )
| ~ s2least(u4r2(exist))
| ~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
inference(modus_ponens,[status(thm)],[51,50]) ).
tff(53,plain,
~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))),
inference(unit_resolution,[status(thm)],[52,49,42]) ).
tff(54,plain,
^ [X1: $i] :
refl(
( ( ~ s2least(X1)
| s(X1,u1r1(X1)) )
<=> ( ~ s2least(X1)
| s(X1,u1r1(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(55,plain,
( ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ) ),
inference(quant_intro,[status(thm)],[54]) ).
tff(56,plain,
( ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(57,plain,
^ [X1: $i] :
rewrite(
( ( s(X1,u1r1(X1))
| ~ s2least(X1) )
<=> ( ~ s2least(X1)
| s(X1,u1r1(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(58,plain,
( ! [X1: $i] :
( s(X1,u1r1(X1))
| ~ s2least(X1) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ) ),
inference(quant_intro,[status(thm)],[57]) ).
tff(59,axiom,
! [X1: $i] :
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
tff(60,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(modus_ponens,[status(thm)],[59,58]) ).
tff(61,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(modus_ponens,[status(thm)],[60,56]) ).
tff(62,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(skolemize,[status(sab)],[61]) ).
tff(63,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(modus_ponens,[status(thm)],[62,55]) ).
tff(64,plain,
( ( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r1(u4r2(exist))) )
<=> ( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r1(u4r2(exist))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(65,plain,
( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r1(u4r2(exist))) ),
inference(quant_inst,[status(thm)],]) ).
tff(66,plain,
( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r1(u4r2(exist))) ),
inference(modus_ponens,[status(thm)],[65,64]) ).
tff(67,plain,
s(u4r2(exist),u1r1(u4r2(exist))),
inference(unit_resolution,[status(thm)],[66,63,42]) ).
tff(68,plain,
^ [X1: $i] :
refl(
( ( ~ s2least(X1)
| s(X1,u1r2(X1)) )
<=> ( ~ s2least(X1)
| s(X1,u1r2(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(69,plain,
( ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ) ),
inference(quant_intro,[status(thm)],[68]) ).
tff(70,plain,
( ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(71,plain,
^ [X1: $i] :
rewrite(
( ( s(X1,u1r2(X1))
| ~ s2least(X1) )
<=> ( ~ s2least(X1)
| s(X1,u1r2(X1)) ) )),
inference(bind,[status(th)],]) ).
tff(72,plain,
( ! [X1: $i] :
( s(X1,u1r2(X1))
| ~ s2least(X1) )
<=> ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ) ),
inference(quant_intro,[status(thm)],[71]) ).
tff(73,axiom,
! [X1: $i] :
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
tff(74,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(modus_ponens,[status(thm)],[73,72]) ).
tff(75,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(modus_ponens,[status(thm)],[74,70]) ).
tff(76,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(skolemize,[status(sab)],[75]) ).
tff(77,plain,
! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(modus_ponens,[status(thm)],[76,69]) ).
tff(78,plain,
( ( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r2(u4r2(exist))) )
<=> ( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r2(u4r2(exist))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(79,plain,
( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r2(u4r2(exist))) ),
inference(quant_inst,[status(thm)],]) ).
tff(80,plain,
( ~ ! [X1: $i] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) )
| ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r2(u4r2(exist))) ),
inference(modus_ponens,[status(thm)],[79,78]) ).
tff(81,plain,
s(u4r2(exist),u1r2(u4r2(exist))),
inference(unit_resolution,[status(thm)],[80,77,42]) ).
tff(82,plain,
^ [X2: $i,X1: $i] :
refl(
( ( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
<=> ( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ) )),
inference(bind,[status(th)],]) ).
tff(83,plain,
( ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
<=> ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ) ),
inference(quant_intro,[status(thm)],[82]) ).
tff(84,plain,
( ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
<=> ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ) ),
inference(rewrite,[status(thm)],]) ).
tff(85,plain,
^ [X2: $i,X1: $i] :
rewrite(
( ( d(X2)
| ~ e(X1)
| ~ r(X1,X2) )
<=> ( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ) )),
inference(bind,[status(th)],]) ).
tff(86,plain,
( ! [X2: $i,X1: $i] :
( d(X2)
| ~ e(X1)
| ~ r(X1,X2) )
<=> ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ) ),
inference(quant_intro,[status(thm)],[85]) ).
tff(87,axiom,
! [X2: $i,X1: $i] :
( d(X2)
| ~ e(X1)
| ~ r(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
tff(88,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ),
inference(modus_ponens,[status(thm)],[87,86]) ).
tff(89,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ),
inference(modus_ponens,[status(thm)],[88,84]) ).
tff(90,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ),
inference(skolemize,[status(sab)],[89]) ).
tff(91,plain,
! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) ),
inference(modus_ponens,[status(thm)],[90,83]) ).
tff(92,plain,
( ( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| d(u4r2(exist)) )
<=> ( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| d(u4r2(exist)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(93,plain,
( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| d(u4r2(exist)) ),
inference(quant_inst,[status(thm)],]) ).
tff(94,plain,
( ~ ! [X2: $i,X1: $i] :
( ~ e(X1)
| ~ r(X1,X2)
| d(X2) )
| ~ e(exist)
| ~ r(exist,u4r2(exist))
| d(u4r2(exist)) ),
inference(modus_ponens,[status(thm)],[93,92]) ).
tff(95,plain,
d(u4r2(exist)),
inference(unit_resolution,[status(thm)],[94,13,91,17]) ).
tff(96,plain,
^ [X1: $i] :
refl(
( ( s1most(X1)
| ~ d(X1) )
<=> ( s1most(X1)
| ~ d(X1) ) )),
inference(bind,[status(th)],]) ).
tff(97,plain,
( ! [X1: $i] :
( s1most(X1)
| ~ d(X1) )
<=> ! [X1: $i] :
( s1most(X1)
| ~ d(X1) ) ),
inference(quant_intro,[status(thm)],[96]) ).
tff(98,plain,
( ! [X1: $i] :
( s1most(X1)
| ~ d(X1) )
<=> ! [X1: $i] :
( s1most(X1)
| ~ d(X1) ) ),
inference(rewrite,[status(thm)],]) ).
tff(99,axiom,
! [X1: $i] :
( s1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
tff(100,plain,
! [X1: $i] :
( s1most(X1)
| ~ d(X1) ),
inference(modus_ponens,[status(thm)],[99,98]) ).
tff(101,plain,
! [X1: $i] :
( s1most(X1)
| ~ d(X1) ),
inference(skolemize,[status(sab)],[100]) ).
tff(102,plain,
! [X1: $i] :
( s1most(X1)
| ~ d(X1) ),
inference(modus_ponens,[status(thm)],[101,97]) ).
tff(103,plain,
( ( ~ ! [X1: $i] :
( s1most(X1)
| ~ d(X1) )
| s1most(u4r2(exist))
| ~ d(u4r2(exist)) )
<=> ( ~ ! [X1: $i] :
( s1most(X1)
| ~ d(X1) )
| s1most(u4r2(exist))
| ~ d(u4r2(exist)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(104,plain,
( ~ ! [X1: $i] :
( s1most(X1)
| ~ d(X1) )
| s1most(u4r2(exist))
| ~ d(u4r2(exist)) ),
inference(quant_inst,[status(thm)],]) ).
tff(105,plain,
( ~ ! [X1: $i] :
( s1most(X1)
| ~ d(X1) )
| s1most(u4r2(exist))
| ~ d(u4r2(exist)) ),
inference(modus_ponens,[status(thm)],[104,103]) ).
tff(106,plain,
s1most(u4r2(exist)),
inference(unit_resolution,[status(thm)],[105,102,95]) ).
tff(107,plain,
^ [X3: $i,X2: $i,X1: $i] :
refl(
( ( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
<=> ( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ) )),
inference(bind,[status(th)],]) ).
tff(108,plain,
( ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
<=> ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ) ),
inference(quant_intro,[status(thm)],[107]) ).
tff(109,plain,
( ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
<=> ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ) ),
inference(rewrite,[status(thm)],]) ).
tff(110,plain,
^ [X3: $i,X2: $i,X1: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( equalish(X3,X2)
| ~ s1most(X1) )
<=> ( ~ s1most(X1)
| equalish(X3,X2) ) )),
( ( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3) )
<=> ( ~ s1most(X1)
| equalish(X3,X2)
| ~ s(X1,X3) ) )),
rewrite(
( ( ~ s1most(X1)
| equalish(X3,X2)
| ~ s(X1,X3) )
<=> ( ~ s1most(X1)
| ~ s(X1,X3)
| equalish(X3,X2) ) )),
( ( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3) )
<=> ( ~ s1most(X1)
| ~ s(X1,X3)
| equalish(X3,X2) ) )),
( ( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3)
| ~ s(X1,X2) )
<=> ( ~ s1most(X1)
| ~ s(X1,X3)
| equalish(X3,X2)
| ~ s(X1,X2) ) )),
rewrite(
( ( ~ s1most(X1)
| ~ s(X1,X3)
| equalish(X3,X2)
| ~ s(X1,X2) )
<=> ( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ) )),
( ( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3)
| ~ s(X1,X2) )
<=> ( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ) )),
inference(bind,[status(th)],]) ).
tff(111,plain,
( ! [X3: $i,X2: $i,X1: $i] :
( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3)
| ~ s(X1,X2) )
<=> ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ) ),
inference(quant_intro,[status(thm)],[110]) ).
tff(112,axiom,
! [X3: $i,X2: $i,X1: $i] :
( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3)
| ~ s(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
tff(113,plain,
! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ),
inference(modus_ponens,[status(thm)],[112,111]) ).
tff(114,plain,
! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ),
inference(modus_ponens,[status(thm)],[113,109]) ).
tff(115,plain,
! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ),
inference(skolemize,[status(sab)],[114]) ).
tff(116,plain,
! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) ),
inference(modus_ponens,[status(thm)],[115,108]) ).
tff(117,plain,
( ( ~ ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
| ~ s1most(u4r2(exist))
| ~ s(u4r2(exist),u1r1(u4r2(exist)))
| ~ s(u4r2(exist),u1r2(u4r2(exist)))
| equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) )
<=> ( ~ ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
| ~ s1most(u4r2(exist))
| ~ s(u4r2(exist),u1r1(u4r2(exist)))
| ~ s(u4r2(exist),u1r2(u4r2(exist)))
| equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(118,plain,
( ~ ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
| ~ s1most(u4r2(exist))
| ~ s(u4r2(exist),u1r1(u4r2(exist)))
| ~ s(u4r2(exist),u1r2(u4r2(exist)))
| equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
inference(quant_inst,[status(thm)],]) ).
tff(119,plain,
( ~ ! [X3: $i,X2: $i,X1: $i] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3)
| equalish(X3,X2) )
| ~ s1most(u4r2(exist))
| ~ s(u4r2(exist),u1r1(u4r2(exist)))
| ~ s(u4r2(exist),u1r2(u4r2(exist)))
| equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
inference(modus_ponens,[status(thm)],[118,117]) ).
tff(120,plain,
$false,
inference(unit_resolution,[status(thm)],[119,116,106,81,67,53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Sep 1 09:23:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------