TSTP Solution File: SWC276-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC276-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n015.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 : Tue Sep 20 11:56:45 EDT 2022
% Result : Unsatisfiable 0.48s 0.61s
% Output : Proof 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 81
% Syntax : Number of formulae : 171 ( 57 unt; 15 typ; 0 def)
% Number of atoms : 1136 ( 186 equ)
% Maximal formula atoms : 36 ( 7 avg)
% Number of connectives : 1714 ( 813 ~; 795 |; 0 &)
% ( 106 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 79 ( 79 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 11 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 260 ( 235 !; 0 ?; 260 :)
% Comments :
%------------------------------------------------------------------------------
tff(totalorderedP_type,type,
totalorderedP: $i > $o ).
tff(cons_type,type,
cons: ( $i * $i ) > $i ).
tff(nil_type,type,
nil: $i ).
tff(sk5_type,type,
sk5: $i ).
tff(sk3_type,type,
sk3: $i ).
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(skaf68_type,type,
skaf68: $i > $i ).
tff(skaf65_type,type,
skaf65: $i > $i ).
tff(skaf67_type,type,
skaf67: $i > $i ).
tff(skaf64_type,type,
skaf64: $i > $i ).
tff(skaf66_type,type,
skaf66: $i > $i ).
tff(sk1_type,type,
sk1: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(ssItem_type,type,
ssItem: $i > $o ).
tff(leq_type,type,
leq: ( $i * $i ) > $o ).
tff(1,plain,
( ( sk3 = nil )
<=> ( nil = sk3 ) ),
inference(commutativity,[status(thm)],]) ).
tff(2,plain,
( ~ totalorderedP(sk1)
<=> ~ totalorderedP(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(3,plain,
( ~ totalorderedP(sk1)
<=> ~ totalorderedP(sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
tff(5,plain,
~ totalorderedP(sk1),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
~ totalorderedP(sk3),
inference(modus_ponens,[status(thm)],[5,2]) ).
tff(7,plain,
( ssList(sk1)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(8,plain,
( ssList(sk1)
<=> ssList(sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(9,axiom,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
tff(10,plain,
ssList(sk1),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[10,7]) ).
tff(12,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(13,plain,
( ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) ),
inference(quant_intro,[status(thm)],[12]) ).
tff(14,plain,
( ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(15,plain,
^ [U: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssList(U)
| totalorderedP(U) )
<=> ( ~ ssList(U)
| totalorderedP(U) ) )),
( ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) )),
rewrite(
( ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) )),
( ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(16,plain,
( ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ) ),
inference(quant_intro,[status(thm)],[15]) ).
tff(17,axiom,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause164) ).
tff(18,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ),
inference(modus_ponens,[status(thm)],[17,16]) ).
tff(19,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ),
inference(modus_ponens,[status(thm)],[18,14]) ).
tff(20,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ),
inference(skolemize,[status(sab)],[19]) ).
tff(21,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) ),
inference(modus_ponens,[status(thm)],[20,13]) ).
tff(22,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(23,plain,
( ( ~ ssList(sk3)
| totalorderedP(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) )
<=> ( totalorderedP(sk3)
| ~ ssList(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| ~ ssList(sk3)
| totalorderedP(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ) ),
inference(monotonicity,[status(thm)],[23]) ).
tff(25,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| ~ ssList(sk3)
| totalorderedP(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ) ),
inference(transitivity,[status(thm)],[24,22]) ).
tff(26,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| ~ ssList(sk3)
| totalorderedP(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(27,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ( app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3,
inference(unit_resolution,[status(thm)],[27,21,11,6]) ).
tff(29,plain,
( ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = nil )
<=> ( sk3 = nil ) ),
inference(monotonicity,[status(thm)],[28]) ).
tff(30,plain,
( ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = nil )
<=> ( nil = sk3 ) ),
inference(transitivity,[status(thm)],[29,1]) ).
tff(31,plain,
( ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
<=> ( nil != sk3 ) ),
inference(monotonicity,[status(thm)],[30]) ).
tff(32,plain,
^ [U: $i] :
refl(
( ssList(skaf67(U))
<=> ssList(skaf67(U)) )),
inference(bind,[status(th)],]) ).
tff(33,plain,
( ! [U: $i] : ssList(skaf67(U))
<=> ! [U: $i] : ssList(skaf67(U)) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,plain,
( ! [U: $i] : ssList(skaf67(U))
<=> ! [U: $i] : ssList(skaf67(U)) ),
inference(rewrite,[status(thm)],]) ).
tff(35,axiom,
! [U: $i] : ssList(skaf67(U)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause28) ).
tff(36,plain,
! [U: $i] : ssList(skaf67(U)),
inference(modus_ponens,[status(thm)],[35,34]) ).
tff(37,plain,
! [U: $i] : ssList(skaf67(U)),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [U: $i] : ssList(skaf67(U)),
inference(modus_ponens,[status(thm)],[37,33]) ).
tff(39,plain,
( ~ ! [U: $i] : ssList(skaf67(U))
| ssList(skaf67(sk3)) ),
inference(quant_inst,[status(thm)],]) ).
tff(40,plain,
ssList(skaf67(sk3)),
inference(unit_resolution,[status(thm)],[39,38]) ).
tff(41,plain,
^ [U: $i] :
refl(
( ssList(skaf66(U))
<=> ssList(skaf66(U)) )),
inference(bind,[status(th)],]) ).
tff(42,plain,
( ! [U: $i] : ssList(skaf66(U))
<=> ! [U: $i] : ssList(skaf66(U)) ),
inference(quant_intro,[status(thm)],[41]) ).
tff(43,plain,
( ! [U: $i] : ssList(skaf66(U))
<=> ! [U: $i] : ssList(skaf66(U)) ),
inference(rewrite,[status(thm)],]) ).
tff(44,axiom,
! [U: $i] : ssList(skaf66(U)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause29) ).
tff(45,plain,
! [U: $i] : ssList(skaf66(U)),
inference(modus_ponens,[status(thm)],[44,43]) ).
tff(46,plain,
! [U: $i] : ssList(skaf66(U)),
inference(skolemize,[status(sab)],[45]) ).
tff(47,plain,
! [U: $i] : ssList(skaf66(U)),
inference(modus_ponens,[status(thm)],[46,42]) ).
tff(48,plain,
( ~ ! [U: $i] : ssList(skaf66(U))
| ssList(skaf66(sk3)) ),
inference(quant_inst,[status(thm)],]) ).
tff(49,plain,
ssList(skaf66(sk3)),
inference(unit_resolution,[status(thm)],[48,47]) ).
tff(50,plain,
^ [U: $i] :
refl(
( ssList(skaf68(U))
<=> ssList(skaf68(U)) )),
inference(bind,[status(th)],]) ).
tff(51,plain,
( ! [U: $i] : ssList(skaf68(U))
<=> ! [U: $i] : ssList(skaf68(U)) ),
inference(quant_intro,[status(thm)],[50]) ).
tff(52,plain,
( ! [U: $i] : ssList(skaf68(U))
<=> ! [U: $i] : ssList(skaf68(U)) ),
inference(rewrite,[status(thm)],]) ).
tff(53,axiom,
! [U: $i] : ssList(skaf68(U)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause27) ).
tff(54,plain,
! [U: $i] : ssList(skaf68(U)),
inference(modus_ponens,[status(thm)],[53,52]) ).
tff(55,plain,
! [U: $i] : ssList(skaf68(U)),
inference(skolemize,[status(sab)],[54]) ).
tff(56,plain,
! [U: $i] : ssList(skaf68(U)),
inference(modus_ponens,[status(thm)],[55,51]) ).
tff(57,plain,
( ~ ! [U: $i] : ssList(skaf68(U))
| ssList(skaf68(sk3)) ),
inference(quant_inst,[status(thm)],]) ).
tff(58,plain,
ssList(skaf68(sk3)),
inference(unit_resolution,[status(thm)],[57,56]) ).
tff(59,plain,
^ [U: $i] :
refl(
( ssItem(skaf65(U))
<=> ssItem(skaf65(U)) )),
inference(bind,[status(th)],]) ).
tff(60,plain,
( ! [U: $i] : ssItem(skaf65(U))
<=> ! [U: $i] : ssItem(skaf65(U)) ),
inference(quant_intro,[status(thm)],[59]) ).
tff(61,plain,
( ! [U: $i] : ssItem(skaf65(U))
<=> ! [U: $i] : ssItem(skaf65(U)) ),
inference(rewrite,[status(thm)],]) ).
tff(62,axiom,
! [U: $i] : ssItem(skaf65(U)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause30) ).
tff(63,plain,
! [U: $i] : ssItem(skaf65(U)),
inference(modus_ponens,[status(thm)],[62,61]) ).
tff(64,plain,
! [U: $i] : ssItem(skaf65(U)),
inference(skolemize,[status(sab)],[63]) ).
tff(65,plain,
! [U: $i] : ssItem(skaf65(U)),
inference(modus_ponens,[status(thm)],[64,60]) ).
tff(66,plain,
( ~ ! [U: $i] : ssItem(skaf65(U))
| ssItem(skaf65(sk3)) ),
inference(quant_inst,[status(thm)],]) ).
tff(67,plain,
ssItem(skaf65(sk3)),
inference(unit_resolution,[status(thm)],[66,65]) ).
tff(68,plain,
^ [U: $i] :
refl(
( ssItem(skaf64(U))
<=> ssItem(skaf64(U)) )),
inference(bind,[status(th)],]) ).
tff(69,plain,
( ! [U: $i] : ssItem(skaf64(U))
<=> ! [U: $i] : ssItem(skaf64(U)) ),
inference(quant_intro,[status(thm)],[68]) ).
tff(70,plain,
( ! [U: $i] : ssItem(skaf64(U))
<=> ! [U: $i] : ssItem(skaf64(U)) ),
inference(rewrite,[status(thm)],]) ).
tff(71,axiom,
! [U: $i] : ssItem(skaf64(U)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause31) ).
tff(72,plain,
! [U: $i] : ssItem(skaf64(U)),
inference(modus_ponens,[status(thm)],[71,70]) ).
tff(73,plain,
! [U: $i] : ssItem(skaf64(U)),
inference(skolemize,[status(sab)],[72]) ).
tff(74,plain,
! [U: $i] : ssItem(skaf64(U)),
inference(modus_ponens,[status(thm)],[73,69]) ).
tff(75,plain,
( ~ ! [U: $i] : ssItem(skaf64(U))
| ssItem(skaf64(sk3)) ),
inference(quant_inst,[status(thm)],]) ).
tff(76,plain,
ssItem(skaf64(sk3)),
inference(unit_resolution,[status(thm)],[75,74]) ).
tff(77,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ) )),
inference(bind,[status(th)],]) ).
tff(78,plain,
( ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
<=> ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ) ),
inference(quant_intro,[status(thm)],[77]) ).
tff(79,plain,
( ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
<=> ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(80,plain,
^ [U: $i] :
trans(
monotonicity(
rewrite(
( ( ~ leq(skaf64(U),skaf65(U))
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ leq(skaf64(U),skaf65(U)) ) )),
( ( ~ leq(skaf64(U),skaf65(U))
| ~ ssList(U)
| totalorderedP(U) )
<=> ( ~ ssList(U)
| ~ leq(skaf64(U),skaf65(U))
| totalorderedP(U) ) )),
rewrite(
( ( ~ ssList(U)
| ~ leq(skaf64(U),skaf65(U))
| totalorderedP(U) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ) )),
( ( ~ leq(skaf64(U),skaf65(U))
| ~ ssList(U)
| totalorderedP(U) )
<=> ( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ) )),
inference(bind,[status(th)],]) ).
tff(81,plain,
( ! [U: $i] :
( ~ leq(skaf64(U),skaf65(U))
| ~ ssList(U)
| totalorderedP(U) )
<=> ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ) ),
inference(quant_intro,[status(thm)],[80]) ).
tff(82,axiom,
! [U: $i] :
( ~ leq(skaf64(U),skaf65(U))
| ~ ssList(U)
| totalorderedP(U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause91) ).
tff(83,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ),
inference(modus_ponens,[status(thm)],[82,81]) ).
tff(84,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ),
inference(modus_ponens,[status(thm)],[83,79]) ).
tff(85,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ),
inference(skolemize,[status(sab)],[84]) ).
tff(86,plain,
! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) ),
inference(modus_ponens,[status(thm)],[85,78]) ).
tff(87,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(88,plain,
( ( ~ ssList(sk3)
| totalorderedP(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) )
<=> ( totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(89,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| ~ ssList(sk3)
| totalorderedP(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ) ),
inference(monotonicity,[status(thm)],[88]) ).
tff(90,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| ~ ssList(sk3)
| totalorderedP(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ) ),
inference(transitivity,[status(thm)],[89,87]) ).
tff(91,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| ~ ssList(sk3)
| totalorderedP(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ),
inference(quant_inst,[status(thm)],]) ).
tff(92,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| totalorderedP(U)
| ~ leq(skaf64(U),skaf65(U)) )
| totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ),
inference(modus_ponens,[status(thm)],[91,90]) ).
tff(93,plain,
~ leq(skaf64(sk3),skaf65(sk3)),
inference(unit_resolution,[status(thm)],[92,86,11,6]) ).
tff(94,plain,
^ [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
refl(
( ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ) )),
inference(bind,[status(th)],]) ).
tff(95,plain,
( ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
<=> ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ) ),
inference(quant_intro,[status(thm)],[94]) ).
tff(96,plain,
( ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
<=> ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ) ),
inference(rewrite,[status(thm)],]) ).
tff(97,plain,
^ [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y) )
<=> ( ~ ssList(Y)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W) )
<=> ( ~ ssList(Y)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(W) ) )),
rewrite(
( ( ~ ssList(Y)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(W) )
<=> ( ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W) )
<=> ( ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U) )
<=> ( ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(U) ) )),
rewrite(
( ( ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X) )
<=> ( ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssItem(X) ) )),
rewrite(
( ( ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssItem(X) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssItem(V) ) )),
rewrite(
( ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssItem(V) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z ) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z) ) )),
rewrite(
( ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z)
| ~ ssList(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z)
| ~ ssList(Z) ) )),
rewrite(
( ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z)
| ~ ssList(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z)
| ~ ssList(Z) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z)
| ~ ssList(Z)
| leq(V,X) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z)
| leq(V,X) ) )),
rewrite(
( ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ totalorderedP(Z)
| leq(V,X) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ) )),
( ( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z)
| ~ ssList(Z)
| leq(V,X) )
<=> ( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ) )),
inference(bind,[status(th)],]) ).
tff(98,plain,
( ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z)
| ~ ssList(Z)
| leq(V,X) )
<=> ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ) ),
inference(quant_intro,[status(thm)],[97]) ).
tff(99,axiom,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(X)
| ~ ssItem(V)
| ~ totalorderedP(Z)
| ~ ssList(Z)
| leq(V,X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause182) ).
tff(100,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ),
inference(modus_ponens,[status(thm)],[99,98]) ).
tff(101,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ),
inference(modus_ponens,[status(thm)],[100,96]) ).
tff(102,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ),
inference(skolemize,[status(sab)],[101]) ).
tff(103,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) ),
inference(modus_ponens,[status(thm)],[102,95]) ).
tff(104,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(105,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(106,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[105,104]) ).
tff(107,plain,
( totalorderedP(nil)
<=> totalorderedP(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(108,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause4) ).
tff(109,plain,
totalorderedP(nil),
inference(modus_ponens,[status(thm)],[108,107]) ).
tff(110,plain,
( ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssList(nil)
| leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| ~ totalorderedP(nil) )
<=> ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssList(nil)
| leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| ~ totalorderedP(nil) ) ),
inference(rewrite,[status(thm)],]) ).
tff(111,plain,
( ( ~ ssItem(skaf65(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(nil)
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| leq(skaf64(sk3),skaf65(sk3))
| ~ totalorderedP(nil) )
<=> ( ~ ssList(nil)
| leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| ~ totalorderedP(nil) ) ),
inference(rewrite,[status(thm)],]) ).
tff(112,plain,
( ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(nil)
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| leq(skaf64(sk3),skaf65(sk3))
| ~ totalorderedP(nil) )
<=> ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssList(nil)
| leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| ~ totalorderedP(nil) ) ),
inference(monotonicity,[status(thm)],[111]) ).
tff(113,plain,
( ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(nil)
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| leq(skaf64(sk3),skaf65(sk3))
| ~ totalorderedP(nil) )
<=> ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssList(nil)
| leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| ~ totalorderedP(nil) ) ),
inference(transitivity,[status(thm)],[112,110]) ).
tff(114,plain,
( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(nil)
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| leq(skaf64(sk3),skaf65(sk3))
| ~ totalorderedP(nil) ),
inference(quant_inst,[status(thm)],]) ).
tff(115,plain,
( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssItem(X)
| ~ ssList(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(U,cons(V,W)),cons(X,Y)) != Z )
| leq(V,X)
| ~ totalorderedP(Z) )
| ~ ssList(nil)
| leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil )
| ~ totalorderedP(nil) ),
inference(modus_ponens,[status(thm)],[114,113]) ).
tff(116,plain,
( ~ ssItem(skaf64(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf68(sk3))
| ~ ssList(skaf66(sk3))
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil ) ),
inference(unit_resolution,[status(thm)],[115,109,106,103,93]) ).
tff(117,plain,
app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) != nil,
inference(unit_resolution,[status(thm)],[116,76,67,58,49,40]) ).
tff(118,plain,
nil != sk3,
inference(modus_ponens,[status(thm)],[117,31]) ).
tff(119,plain,
( ( ( nil = sk3 )
| ( cons(sk5,nil) = sk3 ) )
<=> ( ( nil = sk3 )
| ( cons(sk5,nil) = sk3 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(120,plain,
( ( ( cons(sk5,nil) = sk3 )
| ( nil = sk3 ) )
<=> ( ( nil = sk3 )
| ( cons(sk5,nil) = sk3 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(121,axiom,
( ( cons(sk5,nil) = sk3 )
| ( nil = sk3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
tff(122,plain,
( ( nil = sk3 )
| ( cons(sk5,nil) = sk3 ) ),
inference(modus_ponens,[status(thm)],[121,120]) ).
tff(123,plain,
( ( nil = sk3 )
| ( cons(sk5,nil) = sk3 ) ),
inference(modus_ponens,[status(thm)],[122,119]) ).
tff(124,plain,
cons(sk5,nil) = sk3,
inference(unit_resolution,[status(thm)],[123,118]) ).
tff(125,plain,
( totalorderedP(cons(sk5,nil))
<=> totalorderedP(sk3) ),
inference(monotonicity,[status(thm)],[124]) ).
tff(126,plain,
( totalorderedP(sk3)
<=> totalorderedP(cons(sk5,nil)) ),
inference(symmetry,[status(thm)],[125]) ).
tff(127,plain,
( ~ totalorderedP(sk3)
<=> ~ totalorderedP(cons(sk5,nil)) ),
inference(monotonicity,[status(thm)],[126]) ).
tff(128,plain,
~ totalorderedP(cons(sk5,nil)),
inference(modus_ponens,[status(thm)],[6,127]) ).
tff(129,plain,
( ( ssItem(sk5)
| ( nil = sk3 ) )
<=> ( ssItem(sk5)
| ( nil = sk3 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(130,axiom,
( ssItem(sk5)
| ( nil = sk3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
tff(131,plain,
( ssItem(sk5)
| ( nil = sk3 ) ),
inference(modus_ponens,[status(thm)],[130,129]) ).
tff(132,plain,
ssItem(sk5),
inference(unit_resolution,[status(thm)],[131,118]) ).
tff(133,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) )),
inference(bind,[status(th)],]) ).
tff(134,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) ),
inference(quant_intro,[status(thm)],[133]) ).
tff(135,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(136,plain,
^ [V: $i,U: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( ( nil != U )
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ( nil != U ) ) )),
( ( ( nil != U )
| ~ ssList(U)
| ~ ssItem(V) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V) ) )),
rewrite(
( ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V) ) )),
( ( ( nil != U )
| ~ ssList(U)
| ~ ssItem(V) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V) ) )),
( ( ( nil != U )
| ~ ssList(U)
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) )),
rewrite(
( ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) )),
( ( ( nil != U )
| ~ ssList(U)
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) )),
inference(bind,[status(th)],]) ).
tff(137,plain,
( ! [V: $i,U: $i] :
( ( nil != U )
| ~ ssList(U)
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ) ),
inference(quant_intro,[status(thm)],[136]) ).
tff(138,axiom,
! [V: $i,U: $i] :
( ( nil != U )
| ~ ssList(U)
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause113) ).
tff(139,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ),
inference(modus_ponens,[status(thm)],[138,137]) ).
tff(140,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ),
inference(modus_ponens,[status(thm)],[139,135]) ).
tff(141,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ),
inference(skolemize,[status(sab)],[140]) ).
tff(142,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) ),
inference(modus_ponens,[status(thm)],[141,134]) ).
tff(143,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(144,plain,
( ( ~ ssList(nil)
| $false
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) )
<=> ( ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(145,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(146,plain,
( ( nil = nil )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(147,plain,
( ( nil != nil )
<=> ~ $true ),
inference(monotonicity,[status(thm)],[146]) ).
tff(148,plain,
( ( nil != nil )
<=> $false ),
inference(transitivity,[status(thm)],[147,145]) ).
tff(149,plain,
( ( ~ ssList(nil)
| ( nil != nil )
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) )
<=> ( ~ ssList(nil)
| $false
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ) ),
inference(monotonicity,[status(thm)],[148]) ).
tff(150,plain,
( ( ~ ssList(nil)
| ( nil != nil )
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) )
<=> ( ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ) ),
inference(transitivity,[status(thm)],[149,144]) ).
tff(151,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ( nil != nil )
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ) ),
inference(monotonicity,[status(thm)],[150]) ).
tff(152,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ( nil != nil )
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ) ),
inference(transitivity,[status(thm)],[151,143]) ).
tff(153,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ( nil != nil )
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ),
inference(quant_inst,[status(thm)],]) ).
tff(154,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ( nil != U )
| ~ ssItem(V)
| totalorderedP(cons(V,U)) )
| ~ ssList(nil)
| ~ ssItem(sk5)
| totalorderedP(cons(sk5,nil)) ),
inference(modus_ponens,[status(thm)],[153,152]) ).
tff(155,plain,
totalorderedP(cons(sk5,nil)),
inference(unit_resolution,[status(thm)],[154,106,142,132]) ).
tff(156,plain,
$false,
inference(unit_resolution,[status(thm)],[155,128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC276-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Sep 3 23:37:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.48/0.61 % SZS status Unsatisfiable
% 0.48/0.61 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------