TSTP Solution File: SWC416-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC416-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n009.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:57:50 EDT 2022
% Result : Unsatisfiable 0.21s 0.55s
% Output : Proof 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 87
% Syntax : Number of formulae : 195 ( 44 unt; 13 typ; 0 def)
% Number of atoms : 1626 ( 563 equ)
% Maximal formula atoms : 30 ( 8 avg)
% Number of connectives : 2600 (1276 ~;1181 |; 0 &)
% ( 143 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of FOOLs : 120 ( 120 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 7 >; 3 *; 0 +; 0 <<)
% Number of predicates : 15 ( 12 usr; 2 prp; 0-5 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 315 ( 279 !; 0 ?; 315 :)
% Comments :
%------------------------------------------------------------------------------
tff(sk4_type,type,
sk4: $i ).
tff(nil_type,type,
nil: $i ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(sk2_type,type,
sk2: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(sk5_type,type,
sk5: $i ).
tff(hd_type,type,
hd: $i > $i ).
tff(cons_type,type,
cons: ( $i * $i ) > $i ).
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(sk3_type,type,
sk3: $i ).
tff(ssItem_type,type,
ssItem: $i > $o ).
tff(singletonP_type,type,
singletonP: $i > $o ).
tff(sk1_type,type,
sk1: $i ).
tff(1,plain,
( ( nil = sk4 )
<=> ( sk4 = nil ) ),
inference(commutativity,[status(thm)],]) ).
tff(2,plain,
( ( sk4 = nil )
<=> ( nil = sk4 ) ),
inference(symmetry,[status(thm)],[1]) ).
tff(3,plain,
( ( sk4 != nil )
<=> ( nil != sk4 ) ),
inference(monotonicity,[status(thm)],[2]) ).
tff(4,plain,
( neq(sk2,nil)
<=> neq(sk4,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(5,plain,
( neq(sk2,nil)
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(6,plain,
( ( neq(sk2,nil)
| neq(sk2,nil) )
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(7,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
tff(8,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[7,6]) ).
tff(9,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[8,5]) ).
tff(10,plain,
neq(sk4,nil),
inference(modus_ponens,[status(thm)],[9,4]) ).
tff(11,plain,
( ssList(sk2)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],]) ).
tff(12,plain,
( ssList(sk2)
<=> ssList(sk2) ),
inference(rewrite,[status(thm)],]) ).
tff(13,axiom,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
tff(14,plain,
ssList(sk2),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[14,11]) ).
tff(16,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
inference(bind,[status(th)],]) ).
tff(17,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) ),
inference(quant_intro,[status(thm)],[16]) ).
tff(18,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) ),
inference(rewrite,[status(thm)],]) ).
tff(19,plain,
^ [V: $i,U: $i] :
trans(
monotonicity(
rewrite(
( ( ( U != V )
| ~ neq(U,V)
| ~ ssList(V) )
<=> ( ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
( ( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ( ~ ssList(V)
| ( U != V )
| ~ neq(U,V)
| ~ ssList(U) ) )),
rewrite(
( ( ~ ssList(V)
| ( U != V )
| ~ neq(U,V)
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
( ( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
inference(bind,[status(th)],]) ).
tff(20,plain,
( ! [V: $i,U: $i] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) ),
inference(quant_intro,[status(thm)],[19]) ).
tff(21,axiom,
! [V: $i,U: $i] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
tff(22,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(modus_ponens,[status(thm)],[22,18]) ).
tff(24,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(skolemize,[status(sab)],[23]) ).
tff(25,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(modus_ponens,[status(thm)],[24,17]) ).
tff(26,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(27,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(28,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[27,26]) ).
tff(29,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ ssList(sk4) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ ssList(sk4) ) ),
inference(rewrite,[status(thm)],]) ).
tff(30,plain,
( ( ~ ssList(sk4)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ neq(sk4,nil) )
<=> ( ~ neq(sk4,nil)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ ssList(sk4) ) ),
inference(rewrite,[status(thm)],]) ).
tff(31,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ ssList(sk4)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ neq(sk4,nil) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ ssList(sk4) ) ),
inference(monotonicity,[status(thm)],[30]) ).
tff(32,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ ssList(sk4)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ neq(sk4,nil) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ ssList(sk4) ) ),
inference(transitivity,[status(thm)],[31,29]) ).
tff(33,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ ssList(sk4)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ neq(sk4,nil) ),
inference(quant_inst,[status(thm)],]) ).
tff(34,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ ssList(sk4) ),
inference(modus_ponens,[status(thm)],[33,32]) ).
tff(35,plain,
sk4 != nil,
inference(unit_resolution,[status(thm)],[34,28,25,15,10]) ).
tff(36,plain,
nil != sk4,
inference(modus_ponens,[status(thm)],[35,3]) ).
tff(37,plain,
( ( ssItem(sk5)
| $false )
<=> ssItem(sk5) ),
inference(rewrite,[status(thm)],]) ).
tff(38,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(39,plain,
( neq(sk4,nil)
<=> $true ),
inference(iff_true,[status(thm)],[10]) ).
tff(40,plain,
( ~ neq(sk4,nil)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[39]) ).
tff(41,plain,
( ~ neq(sk4,nil)
<=> $false ),
inference(transitivity,[status(thm)],[40,38]) ).
tff(42,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ( ssItem(sk5)
| $false ) ),
inference(monotonicity,[status(thm)],[41]) ).
tff(43,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ssItem(sk5) ),
inference(transitivity,[status(thm)],[42,37]) ).
tff(44,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ( ssItem(sk5)
| ~ neq(sk4,nil) ) ),
inference(rewrite,[status(thm)],]) ).
tff(45,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
tff(46,plain,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(modus_ponens,[status(thm)],[45,44]) ).
tff(47,plain,
ssItem(sk5),
inference(modus_ponens,[status(thm)],[46,43]) ).
tff(48,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(49,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ) ),
inference(quant_intro,[status(thm)],[48]) ).
tff(50,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(51,plain,
^ [V: $i,U: $i] :
rewrite(
( ( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(52,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ) ),
inference(quant_intro,[status(thm)],[51]) ).
tff(53,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
tff(54,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
inference(modus_ponens,[status(thm)],[53,52]) ).
tff(55,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
inference(modus_ponens,[status(thm)],[54,50]) ).
tff(56,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
inference(skolemize,[status(sab)],[55]) ).
tff(57,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
inference(modus_ponens,[status(thm)],[56,49]) ).
tff(58,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( hd(cons(sk5,nil)) = sk5 ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( hd(cons(sk5,nil)) = sk5 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(59,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( hd(cons(sk5,nil)) = sk5 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(60,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( hd(cons(sk5,nil)) = sk5 ) ),
inference(modus_ponens,[status(thm)],[59,58]) ).
tff(61,plain,
hd(cons(sk5,nil)) = sk5,
inference(unit_resolution,[status(thm)],[60,28,57,47]) ).
tff(62,plain,
( ( $false
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(rewrite,[status(thm)],]) ).
tff(63,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( $false
| ( app(cons(sk5,nil),sk3) = sk4 ) ) ),
inference(monotonicity,[status(thm)],[41]) ).
tff(64,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(transitivity,[status(thm)],[63,62]) ).
tff(65,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(66,plain,
( ( ( app(cons(sk5,nil),sk3) = sk4 )
| ~ neq(sk4,nil) )
<=> ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(67,axiom,
( ( app(cons(sk5,nil),sk3) = sk4 )
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
tff(68,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(modus_ponens,[status(thm)],[67,66]) ).
tff(69,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(modus_ponens,[status(thm)],[68,65]) ).
tff(70,plain,
app(cons(sk5,nil),sk3) = sk4,
inference(modus_ponens,[status(thm)],[69,64]) ).
tff(71,plain,
sk4 = app(cons(sk5,nil),sk3),
inference(symmetry,[status(thm)],[70]) ).
tff(72,plain,
hd(sk4) = hd(app(cons(sk5,nil),sk3)),
inference(monotonicity,[status(thm)],[71]) ).
tff(73,plain,
hd(app(cons(sk5,nil),sk3)) = hd(sk4),
inference(symmetry,[status(thm)],[72]) ).
tff(74,plain,
( ( hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)) )
<=> ( hd(sk4) = sk5 ) ),
inference(monotonicity,[status(thm)],[73,61]) ).
tff(75,plain,
( ( nil = cons(sk5,nil) )
<=> ( cons(sk5,nil) = nil ) ),
inference(commutativity,[status(thm)],]) ).
tff(76,plain,
( ( cons(sk5,nil) = nil )
<=> ( nil = cons(sk5,nil) ) ),
inference(symmetry,[status(thm)],[75]) ).
tff(77,plain,
( ( cons(sk5,nil) != nil )
<=> ( nil != cons(sk5,nil) ) ),
inference(monotonicity,[status(thm)],[76]) ).
tff(78,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ) )),
inference(bind,[status(th)],]) ).
tff(79,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ) ),
inference(quant_intro,[status(thm)],[78]) ).
tff(80,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(81,plain,
^ [V: $i,U: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( ( cons(U,nil) != V )
| ~ ssItem(U) )
<=> ( ~ ssItem(U)
| ( cons(U,nil) != V ) ) )),
( ( ( cons(U,nil) != V )
| ~ ssItem(U)
| ~ ssList(V) )
<=> ( ~ ssItem(U)
| ( cons(U,nil) != V )
| ~ ssList(V) ) )),
rewrite(
( ( ~ ssItem(U)
| ( cons(U,nil) != V )
| ~ ssList(V) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( cons(U,nil) != V ) ) )),
( ( ( cons(U,nil) != V )
| ~ ssItem(U)
| ~ ssList(V) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( cons(U,nil) != V ) ) )),
( ( ( cons(U,nil) != V )
| ~ ssItem(U)
| ~ ssList(V)
| singletonP(V) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( cons(U,nil) != V )
| singletonP(V) ) )),
rewrite(
( ( ~ ssItem(U)
| ~ ssList(V)
| ( cons(U,nil) != V )
| singletonP(V) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ) )),
( ( ( cons(U,nil) != V )
| ~ ssItem(U)
| ~ ssList(V)
| singletonP(V) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ) )),
inference(bind,[status(th)],]) ).
tff(82,plain,
( ! [V: $i,U: $i] :
( ( cons(U,nil) != V )
| ~ ssItem(U)
| ~ ssList(V)
| singletonP(V) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ) ),
inference(quant_intro,[status(thm)],[81]) ).
tff(83,axiom,
! [V: $i,U: $i] :
( ( cons(U,nil) != V )
| ~ ssItem(U)
| ~ ssList(V)
| singletonP(V) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
tff(84,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ),
inference(modus_ponens,[status(thm)],[83,82]) ).
tff(85,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ),
inference(modus_ponens,[status(thm)],[84,80]) ).
tff(86,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ),
inference(skolemize,[status(sab)],[85]) ).
tff(87,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) ),
inference(modus_ponens,[status(thm)],[86,79]) ).
tff(88,plain,
( ~ singletonP(nil)
<=> ~ singletonP(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(89,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause11) ).
tff(90,plain,
~ singletonP(nil),
inference(modus_ponens,[status(thm)],[89,88]) ).
tff(91,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ( cons(sk5,nil) != nil ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ( cons(sk5,nil) != nil ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(92,plain,
( ( ~ ssItem(sk5)
| ~ ssList(nil)
| singletonP(nil)
| ( cons(sk5,nil) != nil ) )
<=> ( singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ( cons(sk5,nil) != nil ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(93,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| singletonP(nil)
| ( cons(sk5,nil) != nil ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ( cons(sk5,nil) != nil ) ) ),
inference(monotonicity,[status(thm)],[92]) ).
tff(94,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| singletonP(nil)
| ( cons(sk5,nil) != nil ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ( cons(sk5,nil) != nil ) ) ),
inference(transitivity,[status(thm)],[93,91]) ).
tff(95,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| singletonP(nil)
| ( cons(sk5,nil) != nil ) ),
inference(quant_inst,[status(thm)],]) ).
tff(96,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| singletonP(V)
| ( cons(U,nil) != V ) )
| singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ( cons(sk5,nil) != nil ) ),
inference(modus_ponens,[status(thm)],[95,94]) ).
tff(97,plain,
cons(sk5,nil) != nil,
inference(unit_resolution,[status(thm)],[96,28,90,87,47]) ).
tff(98,plain,
nil != cons(sk5,nil),
inference(modus_ponens,[status(thm)],[97,77]) ).
tff(99,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) )),
inference(bind,[status(th)],]) ).
tff(100,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) ),
inference(quant_intro,[status(thm)],[99]) ).
tff(101,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(102,plain,
^ [V: $i,U: $i] :
rewrite(
( ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) )),
inference(bind,[status(th)],]) ).
tff(103,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) ),
inference(quant_intro,[status(thm)],[102]) ).
tff(104,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
tff(105,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[104,103]) ).
tff(106,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[105,101]) ).
tff(107,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(skolemize,[status(sab)],[106]) ).
tff(108,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[107,100]) ).
tff(109,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(110,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) ),
inference(quant_inst,[status(thm)],]) ).
tff(111,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) ),
inference(modus_ponens,[status(thm)],[110,109]) ).
tff(112,plain,
ssList(cons(sk5,nil)),
inference(unit_resolution,[status(thm)],[111,28,108,47]) ).
tff(113,plain,
( ssList(sk1)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(114,plain,
( ssList(sk1)
<=> ssList(sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(115,axiom,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
tff(116,plain,
ssList(sk1),
inference(modus_ponens,[status(thm)],[115,114]) ).
tff(117,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[116,113]) ).
tff(118,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) )),
inference(bind,[status(th)],]) ).
tff(119,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) ),
inference(quant_intro,[status(thm)],[118]) ).
tff(120,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(121,plain,
^ [V: $i,U: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V ) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) )),
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) )),
inference(bind,[status(th)],]) ).
tff(122,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ) ),
inference(quant_intro,[status(thm)],[121]) ).
tff(123,axiom,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
tff(124,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ),
inference(modus_ponens,[status(thm)],[123,122]) ).
tff(125,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ),
inference(modus_ponens,[status(thm)],[124,120]) ).
tff(126,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ),
inference(skolemize,[status(sab)],[125]) ).
tff(127,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) ),
inference(modus_ponens,[status(thm)],[126,119]) ).
tff(128,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
| ~ ssList(sk3)
| ~ ssList(cons(sk5,nil))
| ( nil = cons(sk5,nil) )
| ( hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)) ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
| ~ ssList(sk3)
| ~ ssList(cons(sk5,nil))
| ( nil = cons(sk5,nil) )
| ( hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(129,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
| ~ ssList(sk3)
| ~ ssList(cons(sk5,nil))
| ( nil = cons(sk5,nil) )
| ( hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(130,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( nil = V )
| ( hd(app(V,U)) = hd(V) ) )
| ~ ssList(sk3)
| ~ ssList(cons(sk5,nil))
| ( nil = cons(sk5,nil) )
| ( hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)) ) ),
inference(modus_ponens,[status(thm)],[129,128]) ).
tff(131,plain,
( ( nil = cons(sk5,nil) )
| ( hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)) ) ),
inference(unit_resolution,[status(thm)],[130,127,117,112]) ).
tff(132,plain,
hd(app(cons(sk5,nil),sk3)) = hd(cons(sk5,nil)),
inference(unit_resolution,[status(thm)],[131,98]) ).
tff(133,plain,
hd(sk4) = sk5,
inference(modus_ponens,[status(thm)],[132,74]) ).
tff(134,plain,
^ [B: $i,A: $i,C: $i] :
refl(
( ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
inference(bind,[status(th)],]) ).
tff(135,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) ),
inference(quant_intro,[status(thm)],[134]) ).
tff(136,plain,
^ [B: $i,A: $i,C: $i] :
trans(
monotonicity(
trans(
monotonicity(
iff_true(
mp(
mp(
mp(
asserted(
( neq(sk2,nil)
| neq(sk2,nil) )),
rewrite(
( ( neq(sk2,nil)
| neq(sk2,nil) )
<=> neq(sk2,nil) )),
neq(sk2,nil)),
rewrite(
( neq(sk2,nil)
<=> neq(sk2,nil) )),
neq(sk2,nil)),
rewrite(
( neq(sk2,nil)
<=> neq(sk4,nil) )),
neq(sk4,nil)),
( neq(sk4,nil)
<=> $true )),
( ~ neq(sk4,nil)
<=> ~ $true )),
rewrite(
( ~ $true
<=> $false )),
( ~ neq(sk4,nil)
<=> $false )),
( ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ( ~ ssItem(C)
| $false
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
rewrite(
( ( ~ ssItem(C)
| $false
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
( ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
inference(bind,[status(th)],]) ).
tff(137,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) ),
inference(quant_intro,[status(thm)],[136]) ).
tff(138,plain,
^ [B: $i,A: $i,C: $i] :
trans(
monotonicity(
rewrite(
( ~ neq(nil,sk2)
<=> ~ neq(nil,sk4) )),
rewrite(
( ( hd(sk2) != C )
<=> ( hd(sk4) != C ) )),
rewrite(
( ( app(B,sk1) != A )
<=> ( app(B,sk3) != A ) )),
rewrite(
( ( sk2 != A )
<=> ( sk4 != A ) )),
( ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) )
<=> ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( cons(C,nil) != B )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
rewrite(
( ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( cons(C,nil) != B )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
<=> ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
( ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) )
<=> ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) )),
inference(bind,[status(th)],]) ).
tff(139,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ) ),
inference(quant_intro,[status(thm)],[138]) ).
tff(140,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(141,plain,
^ [B: $i,A: $i,C: $i] :
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B) )
<=> ( ~ ssList(A)
| ~ ssList(B)
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A ) )
<=> ( ~ ssList(A)
| ~ ssList(B)
| ( sk2 != A )
| ( app(B,sk1) != A ) ) )),
rewrite(
( ( ~ ssList(A)
| ~ ssList(B)
| ( sk2 != A )
| ( app(B,sk1) != A ) )
<=> ( ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A ) )
<=> ( ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C) )
<=> ( ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A )
| ~ ssItem(C) ) )),
rewrite(
( ( ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A )
| ~ ssItem(C) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A )
| ( cons(C,nil) != B ) ) )),
rewrite(
( ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( app(B,sk1) != A )
| ( sk2 != A )
| ( cons(C,nil) != B ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A )
| ( hd(sk2) != C ) ) )),
rewrite(
( ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A )
| ( hd(sk2) != C ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C ) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C )
| ~ neq(nil,sk2) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A )
| ~ neq(nil,sk2) ) )),
rewrite(
( ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A )
| ~ neq(nil,sk2) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C )
| ~ neq(nil,sk2) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C )
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) )
<=> ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A )
| ~ neq(sk4,nil) ) )),
rewrite(
( ( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A )
| ~ neq(sk4,nil) )
<=> ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
( ( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C )
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) )
<=> ( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) )),
inference(bind,[status(th)],]) ).
tff(142,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C )
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ) ),
inference(quant_intro,[status(thm)],[141]) ).
tff(143,axiom,
! [B: $i,A: $i,C: $i] :
( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ( app(B,sk1) != A )
| ~ ssItem(C)
| ( cons(C,nil) != B )
| ( hd(sk2) != C )
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
tff(144,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ),
inference(modus_ponens,[status(thm)],[143,142]) ).
tff(145,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ~ neq(nil,sk2)
| ( hd(sk2) != C )
| ( cons(C,nil) != B )
| ( app(B,sk1) != A )
| ( sk2 != A ) ),
inference(modus_ponens,[status(thm)],[144,140]) ).
tff(146,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ neq(sk4,nil)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ),
inference(modus_ponens,[status(thm)],[145,139]) ).
tff(147,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ),
inference(modus_ponens,[status(thm)],[146,137]) ).
tff(148,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ),
inference(skolemize,[status(sab)],[147]) ).
tff(149,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) ),
inference(modus_ponens,[status(thm)],[148,135]) ).
tff(150,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(151,plain,
( ( ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| $false
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| $false )
<=> ( ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(152,plain,
( ( sk4 = sk4 )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(153,plain,
( ( sk4 != sk4 )
<=> ~ $true ),
inference(monotonicity,[status(thm)],[152]) ).
tff(154,plain,
( ( sk4 != sk4 )
<=> $false ),
inference(transitivity,[status(thm)],[153,38]) ).
tff(155,plain,
( ( cons(sk5,nil) = cons(sk5,nil) )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(156,plain,
( ( cons(sk5,nil) != cons(sk5,nil) )
<=> ~ $true ),
inference(monotonicity,[status(thm)],[155]) ).
tff(157,plain,
( ( cons(sk5,nil) != cons(sk5,nil) )
<=> $false ),
inference(transitivity,[status(thm)],[156,38]) ).
tff(158,plain,
( ( ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( cons(sk5,nil) != cons(sk5,nil) )
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| ( sk4 != sk4 ) )
<=> ( ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| $false
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| $false ) ),
inference(monotonicity,[status(thm)],[157,154]) ).
tff(159,plain,
( ( ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( cons(sk5,nil) != cons(sk5,nil) )
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| ( sk4 != sk4 ) )
<=> ( ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ) ),
inference(transitivity,[status(thm)],[158,151]) ).
tff(160,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( cons(sk5,nil) != cons(sk5,nil) )
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| ( sk4 != sk4 ) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ) ),
inference(monotonicity,[status(thm)],[159]) ).
tff(161,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( cons(sk5,nil) != cons(sk5,nil) )
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| ( sk4 != sk4 ) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ) ),
inference(transitivity,[status(thm)],[160,150]) ).
tff(162,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ ssItem(sk5)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( cons(sk5,nil) != cons(sk5,nil) )
| ~ neq(nil,sk4)
| ( hd(sk4) != sk5 )
| ( app(cons(sk5,nil),sk3) != sk4 )
| ( sk4 != sk4 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(163,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssItem(C)
| ~ ssList(A)
| ~ ssList(B)
| ( cons(C,nil) != B )
| ~ neq(nil,sk4)
| ( hd(sk4) != C )
| ( app(B,sk3) != A )
| ( sk4 != A ) )
| ~ neq(nil,sk4)
| ~ ssList(sk4)
| ~ ssItem(sk5)
| ( hd(sk4) != sk5 )
| ~ ssList(cons(sk5,nil))
| ( app(cons(sk5,nil),sk3) != sk4 ) ),
inference(modus_ponens,[status(thm)],[162,161]) ).
tff(164,plain,
( ~ neq(nil,sk4)
| ( hd(sk4) != sk5 ) ),
inference(unit_resolution,[status(thm)],[163,15,149,47,70,112]) ).
tff(165,plain,
~ neq(nil,sk4),
inference(unit_resolution,[status(thm)],[164,133]) ).
tff(166,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
inference(bind,[status(th)],]) ).
tff(167,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(quant_intro,[status(thm)],[166]) ).
tff(168,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(rewrite,[status(thm)],]) ).
tff(169,plain,
^ [V: $i,U: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ) )),
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
inference(bind,[status(th)],]) ).
tff(170,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(quant_intro,[status(thm)],[169]) ).
tff(171,axiom,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
tff(172,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[171,170]) ).
tff(173,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[172,168]) ).
tff(174,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(skolemize,[status(sab)],[173]) ).
tff(175,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[174,167]) ).
tff(176,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| neq(nil,sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ( nil = sk4 ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| neq(nil,sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ( nil = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(177,plain,
( ( ~ ssList(sk4)
| ~ ssList(nil)
| ( nil = sk4 )
| neq(nil,sk4) )
<=> ( neq(nil,sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ( nil = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(178,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(sk4)
| ~ ssList(nil)
| ( nil = sk4 )
| neq(nil,sk4) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| neq(nil,sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ( nil = sk4 ) ) ),
inference(monotonicity,[status(thm)],[177]) ).
tff(179,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(sk4)
| ~ ssList(nil)
| ( nil = sk4 )
| neq(nil,sk4) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| neq(nil,sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ( nil = sk4 ) ) ),
inference(transitivity,[status(thm)],[178,176]) ).
tff(180,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(sk4)
| ~ ssList(nil)
| ( nil = sk4 )
| neq(nil,sk4) ),
inference(quant_inst,[status(thm)],]) ).
tff(181,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| neq(nil,sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ( nil = sk4 ) ),
inference(modus_ponens,[status(thm)],[180,179]) ).
tff(182,plain,
$false,
inference(unit_resolution,[status(thm)],[181,28,175,15,165,36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SWC416-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Sep 4 00:47:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.55 % SZS status Unsatisfiable
% 0.21/0.55 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------