TSTP Solution File: SWC166-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC166-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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:55:46 EDT 2022
% Result : Unsatisfiable 0.18s 0.53s
% Output : Proof 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 96
% Syntax : Number of formulae : 199 ( 60 unt; 16 typ; 0 def)
% Number of atoms : 1389 ( 197 equ)
% Maximal formula atoms : 38 ( 7 avg)
% Number of connectives : 2213 (1078 ~;1033 |; 0 &)
% ( 102 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of FOOLs : 71 ( 71 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 9 >; 4 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 390 ( 351 !; 0 ?; 390 :)
% Comments :
%------------------------------------------------------------------------------
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(sk8_type,type,
sk8: $i ).
tff(cons_type,type,
cons: ( $i * $i ) > $i ).
tff(nil_type,type,
nil: $i ).
tff(sk6_type,type,
sk6: $i ).
tff(sk5_type,type,
sk5: $i ).
tff(sk7_type,type,
sk7: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(ssItem_type,type,
ssItem: $i > $o ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(cyclefreeP_type,type,
cyclefreeP: $i > $o ).
tff(skaf44_type,type,
skaf44: $i > $i ).
tff(singletonP_type,type,
singletonP: $i > $o ).
tff(sk3_type,type,
sk3: $i ).
tff(sk1_type,type,
sk1: $i ).
tff(leq_type,type,
leq: ( $i * $i ) > $o ).
tff(1,plain,
( ssItem(sk5)
<=> ssItem(sk5) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
tff(3,plain,
ssItem(sk5),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,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(5,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)],[4]) ).
tff(6,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(7,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(8,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)],[7]) ).
tff(9,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
tff(10,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[10,6]) ).
tff(12,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[12,5]) ).
tff(14,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(15,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(16,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,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(18,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(19,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)],[18,17]) ).
tff(20,plain,
ssList(cons(sk5,nil)),
inference(unit_resolution,[status(thm)],[19,16,13,3]) ).
tff(21,plain,
( ssList(sk7)
<=> ssList(sk7) ),
inference(rewrite,[status(thm)],]) ).
tff(22,axiom,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
tff(23,plain,
ssList(sk7),
inference(modus_ponens,[status(thm)],[22,21]) ).
tff(24,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
<=> ( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ) )),
inference(bind,[status(th)],]) ).
tff(25,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ) ),
inference(quant_intro,[status(thm)],[24]) ).
tff(26,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ) ),
inference(rewrite,[status(thm)],]) ).
tff(27,plain,
^ [V: $i,U: $i] :
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) )
<=> ( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ) )),
inference(bind,[status(th)],]) ).
tff(28,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ) ),
inference(quant_intro,[status(thm)],[27]) ).
tff(29,axiom,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
tff(30,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ),
inference(modus_ponens,[status(thm)],[29,28]) ).
tff(31,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ),
inference(modus_ponens,[status(thm)],[30,26]) ).
tff(32,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ),
inference(skolemize,[status(sab)],[31]) ).
tff(33,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) ),
inference(modus_ponens,[status(thm)],[32,25]) ).
tff(34,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil))) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(35,plain,
( ( ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(sk7) )
<=> ( ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(36,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(sk7) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil))) ) ),
inference(monotonicity,[status(thm)],[35]) ).
tff(37,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(sk7) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil))) ) ),
inference(transitivity,[status(thm)],[36,34]) ).
tff(38,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(sk7) ),
inference(quant_inst,[status(thm)],]) ).
tff(39,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ssList(app(V,U))
| ~ ssList(V) )
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ssList(app(sk7,cons(sk5,nil))) ),
inference(modus_ponens,[status(thm)],[38,37]) ).
tff(40,plain,
ssList(app(sk7,cons(sk5,nil))),
inference(unit_resolution,[status(thm)],[39,33,23,20]) ).
tff(41,plain,
( ssItem(sk6)
<=> ssItem(sk6) ),
inference(rewrite,[status(thm)],]) ).
tff(42,axiom,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
tff(43,plain,
ssItem(sk6),
inference(modus_ponens,[status(thm)],[42,41]) ).
tff(44,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk6)
| ~ ssList(nil)
| ssList(cons(sk6,nil)) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk6)
| ~ ssList(nil)
| ssList(cons(sk6,nil)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(45,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk6)
| ~ ssList(nil)
| ssList(cons(sk6,nil)) ),
inference(quant_inst,[status(thm)],]) ).
tff(46,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk6)
| ~ ssList(nil)
| ssList(cons(sk6,nil)) ),
inference(modus_ponens,[status(thm)],[45,44]) ).
tff(47,plain,
ssList(cons(sk6,nil)),
inference(unit_resolution,[status(thm)],[46,16,13,43]) ).
tff(48,plain,
( ssList(sk8)
<=> ssList(sk8) ),
inference(rewrite,[status(thm)],]) ).
tff(49,axiom,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
tff(50,plain,
ssList(sk8),
inference(modus_ponens,[status(thm)],[49,48]) ).
tff(51,plain,
^ [W: $i,V: $i,U: $i] :
refl(
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
inference(bind,[status(th)],]) ).
tff(52,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) ),
inference(quant_intro,[status(thm)],[51]) ).
tff(53,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(54,plain,
^ [W: $i,V: $i,U: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
rewrite(
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
inference(bind,[status(th)],]) ).
tff(55,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) ),
inference(quant_intro,[status(thm)],[54]) ).
tff(56,axiom,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
tff(57,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(modus_ponens,[status(thm)],[56,55]) ).
tff(58,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(modus_ponens,[status(thm)],[57,53]) ).
tff(59,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(skolemize,[status(sab)],[58]) ).
tff(60,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(modus_ponens,[status(thm)],[59,52]) ).
tff(61,plain,
( ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk8)
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| ( app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) ) )
<=> ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk8)
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| ( app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(62,plain,
( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk8)
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| ( app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(63,plain,
( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk8)
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| ( app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) ) ),
inference(modus_ponens,[status(thm)],[62,61]) ).
tff(64,plain,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)),
inference(unit_resolution,[status(thm)],[63,60,50,47,40]) ).
tff(65,plain,
app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
inference(symmetry,[status(thm)],[64]) ).
tff(66,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ) )),
inference(bind,[status(th)],]) ).
tff(67,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ) ),
inference(quant_intro,[status(thm)],[66]) ).
tff(68,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(69,plain,
^ [V: $i,U: $i] :
rewrite(
( ( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ) )),
inference(bind,[status(th)],]) ).
tff(70,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ) ),
inference(quant_intro,[status(thm)],[69]) ).
tff(71,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
tff(72,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(modus_ponens,[status(thm)],[71,70]) ).
tff(73,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(modus_ponens,[status(thm)],[72,68]) ).
tff(74,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(skolemize,[status(sab)],[73]) ).
tff(75,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(modus_ponens,[status(thm)],[74,67]) ).
tff(76,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ( app(cons(sk6,nil),sk8) = cons(sk6,sk8) ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ( app(cons(sk6,nil),sk8) = cons(sk6,sk8) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(77,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ( app(cons(sk6,nil),sk8) = cons(sk6,sk8) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(78,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ( app(cons(sk6,nil),sk8) = cons(sk6,sk8) ) ),
inference(modus_ponens,[status(thm)],[77,76]) ).
tff(79,plain,
app(cons(sk6,nil),sk8) = cons(sk6,sk8),
inference(unit_resolution,[status(thm)],[78,75,43,50]) ).
tff(80,plain,
cons(sk6,sk8) = app(cons(sk6,nil),sk8),
inference(symmetry,[status(thm)],[79]) ).
tff(81,plain,
( ~ neq(sk5,sk6)
<=> ~ neq(sk5,sk6) ),
inference(rewrite,[status(thm)],]) ).
tff(82,axiom,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
tff(83,plain,
~ neq(sk5,sk6),
inference(modus_ponens,[status(thm)],[82,81]) ).
tff(84,plain,
^ [V: $i,U: $i] :
refl(
( ( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
<=> ( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ) )),
inference(bind,[status(th)],]) ).
tff(85,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ) ),
inference(quant_intro,[status(thm)],[84]) ).
tff(86,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ) ),
inference(rewrite,[status(thm)],]) ).
tff(87,plain,
^ [V: $i,U: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssItem(U)
| ~ ssItem(V)
| neq(V,U) )
<=> ( ~ ssItem(U)
| neq(V,U)
| ~ ssItem(V) ) )),
( ( ~ ssItem(U)
| ~ ssItem(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssItem(U)
| neq(V,U)
| ~ ssItem(V)
| ( V = U ) ) )),
rewrite(
( ( ~ ssItem(U)
| neq(V,U)
| ~ ssItem(V)
| ( V = U ) )
<=> ( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ) )),
( ( ~ ssItem(U)
| ~ ssItem(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ) )),
inference(bind,[status(th)],]) ).
tff(88,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssItem(V)
| neq(V,U)
| ( V = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ) ),
inference(quant_intro,[status(thm)],[87]) ).
tff(89,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssItem(V)
| neq(V,U)
| ( V = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
tff(90,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ),
inference(modus_ponens,[status(thm)],[89,88]) ).
tff(91,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ),
inference(modus_ponens,[status(thm)],[90,86]) ).
tff(92,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ),
inference(skolemize,[status(sab)],[91]) ).
tff(93,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) ),
inference(modus_ponens,[status(thm)],[92,85]) ).
tff(94,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| neq(sk5,sk6)
| ~ ssItem(sk5)
| ~ ssItem(sk6)
| ( sk5 = sk6 ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| neq(sk5,sk6)
| ~ ssItem(sk5)
| ~ ssItem(sk6)
| ( sk5 = sk6 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(95,plain,
( ( ~ ssItem(sk6)
| ( sk5 = sk6 )
| neq(sk5,sk6)
| ~ ssItem(sk5) )
<=> ( neq(sk5,sk6)
| ~ ssItem(sk5)
| ~ ssItem(sk6)
| ( sk5 = sk6 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(96,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| ~ ssItem(sk6)
| ( sk5 = sk6 )
| neq(sk5,sk6)
| ~ ssItem(sk5) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| neq(sk5,sk6)
| ~ ssItem(sk5)
| ~ ssItem(sk6)
| ( sk5 = sk6 ) ) ),
inference(monotonicity,[status(thm)],[95]) ).
tff(97,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| ~ ssItem(sk6)
| ( sk5 = sk6 )
| neq(sk5,sk6)
| ~ ssItem(sk5) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| neq(sk5,sk6)
| ~ ssItem(sk5)
| ~ ssItem(sk6)
| ( sk5 = sk6 ) ) ),
inference(transitivity,[status(thm)],[96,94]) ).
tff(98,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| ~ ssItem(sk6)
| ( sk5 = sk6 )
| neq(sk5,sk6)
| ~ ssItem(sk5) ),
inference(quant_inst,[status(thm)],]) ).
tff(99,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ( V = U )
| neq(V,U)
| ~ ssItem(V) )
| neq(sk5,sk6)
| ~ ssItem(sk5)
| ~ ssItem(sk6)
| ( sk5 = sk6 ) ),
inference(modus_ponens,[status(thm)],[98,97]) ).
tff(100,plain,
sk5 = sk6,
inference(unit_resolution,[status(thm)],[99,93,3,43,83]) ).
tff(101,plain,
cons(sk5,nil) = cons(sk6,nil),
inference(monotonicity,[status(thm)],[100]) ).
tff(102,plain,
cons(sk6,nil) = cons(sk5,nil),
inference(symmetry,[status(thm)],[101]) ).
tff(103,plain,
app(sk7,cons(sk6,nil)) = app(sk7,cons(sk5,nil)),
inference(monotonicity,[status(thm)],[102]) ).
tff(104,plain,
app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) = app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)),
inference(monotonicity,[status(thm)],[103,80]) ).
tff(105,plain,
app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
inference(transitivity,[status(thm)],[104,65]) ).
tff(106,plain,
( singletonP(sk3)
<=> singletonP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) ),
inference(rewrite,[status(thm)],]) ).
tff(107,plain,
( singletonP(sk3)
<=> singletonP(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(108,axiom,
singletonP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
tff(109,plain,
singletonP(sk3),
inference(modus_ponens,[status(thm)],[108,107]) ).
tff(110,plain,
singletonP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),
inference(modus_ponens,[status(thm)],[109,106]) ).
tff(111,plain,
( ssList(sk3)
<=> ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) ),
inference(rewrite,[status(thm)],]) ).
tff(112,plain,
( ssList(sk1)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(113,plain,
( ssList(sk1)
<=> ssList(sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(114,axiom,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
tff(115,plain,
ssList(sk1),
inference(modus_ponens,[status(thm)],[114,113]) ).
tff(116,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[115,112]) ).
tff(117,plain,
ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),
inference(modus_ponens,[status(thm)],[116,111]) ).
tff(118,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
<=> ( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ) )),
inference(bind,[status(th)],]) ).
tff(119,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ) ),
inference(quant_intro,[status(thm)],[118]) ).
tff(120,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ) ),
inference(rewrite,[status(thm)],]) ).
tff(121,plain,
^ [U: $i] :
rewrite(
( ( ~ singletonP(U)
| ~ ssList(U)
| ( cons(skaf44(U),nil) = U ) )
<=> ( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ) )),
inference(bind,[status(th)],]) ).
tff(122,plain,
( ! [U: $i] :
( ~ singletonP(U)
| ~ ssList(U)
| ( cons(skaf44(U),nil) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ) ),
inference(quant_intro,[status(thm)],[121]) ).
tff(123,axiom,
! [U: $i] :
( ~ singletonP(U)
| ~ ssList(U)
| ( cons(skaf44(U),nil) = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
tff(124,plain,
! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ),
inference(modus_ponens,[status(thm)],[123,122]) ).
tff(125,plain,
! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ),
inference(modus_ponens,[status(thm)],[124,120]) ).
tff(126,plain,
! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ),
inference(skolemize,[status(sab)],[125]) ).
tff(127,plain,
! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) ),
inference(modus_ponens,[status(thm)],[126,119]) ).
tff(128,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ singletonP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ singletonP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(129,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ singletonP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) ),
inference(quant_inst,[status(thm)],]) ).
tff(130,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( cons(skaf44(U),nil) = U )
| ~ singletonP(U) )
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ singletonP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) ),
inference(modus_ponens,[status(thm)],[129,128]) ).
tff(131,plain,
cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil) = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
inference(unit_resolution,[status(thm)],[130,127,117,110]) ).
tff(132,plain,
( cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil))
<=> cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)) ),
inference(monotonicity,[status(thm)],[131]) ).
tff(133,plain,
^ [U: $i] :
refl(
( ssItem(skaf44(U))
<=> ssItem(skaf44(U)) )),
inference(bind,[status(th)],]) ).
tff(134,plain,
( ! [U: $i] : ssItem(skaf44(U))
<=> ! [U: $i] : ssItem(skaf44(U)) ),
inference(quant_intro,[status(thm)],[133]) ).
tff(135,plain,
( ! [U: $i] : ssItem(skaf44(U))
<=> ! [U: $i] : ssItem(skaf44(U)) ),
inference(rewrite,[status(thm)],]) ).
tff(136,axiom,
! [U: $i] : ssItem(skaf44(U)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
tff(137,plain,
! [U: $i] : ssItem(skaf44(U)),
inference(modus_ponens,[status(thm)],[136,135]) ).
tff(138,plain,
! [U: $i] : ssItem(skaf44(U)),
inference(skolemize,[status(sab)],[137]) ).
tff(139,plain,
! [U: $i] : ssItem(skaf44(U)),
inference(modus_ponens,[status(thm)],[138,134]) ).
tff(140,plain,
( ~ ! [U: $i] : ssItem(skaf44(U))
| ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))) ),
inference(quant_inst,[status(thm)],]) ).
tff(141,plain,
ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))),
inference(unit_resolution,[status(thm)],[140,139]) ).
tff(142,plain,
^ [U: $i] :
refl(
( ( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
<=> ( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ) )),
inference(bind,[status(th)],]) ).
tff(143,plain,
( ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
<=> ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ) ),
inference(quant_intro,[status(thm)],[142]) ).
tff(144,plain,
( ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
<=> ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(145,axiom,
! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause70) ).
tff(146,plain,
! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ),
inference(modus_ponens,[status(thm)],[145,144]) ).
tff(147,plain,
! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ),
inference(skolemize,[status(sab)],[146]) ).
tff(148,plain,
! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) ),
inference(modus_ponens,[status(thm)],[147,143]) ).
tff(149,plain,
( ( ~ ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
| ~ ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)))
| cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil)) )
<=> ( ~ ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
| ~ ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)))
| cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(150,plain,
( ~ ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
| ~ ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)))
| cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil)) ),
inference(quant_inst,[status(thm)],]) ).
tff(151,plain,
( ~ ! [U: $i] :
( ~ ssItem(U)
| cyclefreeP(cons(U,nil)) )
| ~ ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)))
| cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil)) ),
inference(modus_ponens,[status(thm)],[150,149]) ).
tff(152,plain,
( ~ ssItem(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)))
| cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil)) ),
inference(unit_resolution,[status(thm)],[151,148]) ).
tff(153,plain,
cyclefreeP(cons(skaf44(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),nil)),
inference(unit_resolution,[status(thm)],[152,141]) ).
tff(154,plain,
cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8)),
inference(modus_ponens,[status(thm)],[153,132]) ).
tff(155,plain,
^ [U: $i] :
refl(
( ( ~ ssItem(U)
| leq(U,U) )
<=> ( ~ ssItem(U)
| leq(U,U) ) )),
inference(bind,[status(th)],]) ).
tff(156,plain,
( ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) )
<=> ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) ) ),
inference(quant_intro,[status(thm)],[155]) ).
tff(157,plain,
( ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) )
<=> ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) ) ),
inference(rewrite,[status(thm)],]) ).
tff(158,axiom,
! [U: $i] :
( ~ ssItem(U)
| leq(U,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause62) ).
tff(159,plain,
! [U: $i] :
( ~ ssItem(U)
| leq(U,U) ),
inference(modus_ponens,[status(thm)],[158,157]) ).
tff(160,plain,
! [U: $i] :
( ~ ssItem(U)
| leq(U,U) ),
inference(skolemize,[status(sab)],[159]) ).
tff(161,plain,
! [U: $i] :
( ~ ssItem(U)
| leq(U,U) ),
inference(modus_ponens,[status(thm)],[160,156]) ).
tff(162,plain,
( ( ~ ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) )
| ~ ssItem(sk6)
| leq(sk6,sk6) )
<=> ( ~ ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) )
| ~ ssItem(sk6)
| leq(sk6,sk6) ) ),
inference(rewrite,[status(thm)],]) ).
tff(163,plain,
( ~ ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) )
| ~ ssItem(sk6)
| leq(sk6,sk6) ),
inference(quant_inst,[status(thm)],]) ).
tff(164,plain,
( ~ ! [U: $i] :
( ~ ssItem(U)
| leq(U,U) )
| ~ ssItem(sk6)
| leq(sk6,sk6) ),
inference(modus_ponens,[status(thm)],[163,162]) ).
tff(165,plain,
leq(sk6,sk6),
inference(unit_resolution,[status(thm)],[164,161,43]) ).
tff(166,plain,
^ [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
refl(
( ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
inference(bind,[status(th)],]) ).
tff(167,plain,
( ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
<=> ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) ),
inference(quant_intro,[status(thm)],[166]) ).
tff(168,plain,
( ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
<=> ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) ),
inference(rewrite,[status(thm)],]) ).
tff(169,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(
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z ) )
<=> ( ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y) )
<=> ( ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(Y) ) )),
rewrite(
( ( ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(Y) )
<=> ( ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y) )
<=> ( ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X) )
<=> ( ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(X) ) )),
rewrite(
( ( ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(X) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(W) ) )),
rewrite(
( ( ~ ssList(X)
| ~ ssList(Y)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(W) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssItem(V) ) )),
rewrite(
( ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssItem(V) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U) )
<=> ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssItem(U) ) )),
rewrite(
( ( ~ ssList(X)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssItem(U) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| ~ cyclefreeP(Z) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ cyclefreeP(Z) ) )),
rewrite(
( ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ cyclefreeP(Z) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| ~ cyclefreeP(Z) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| ~ cyclefreeP(Z)
| ~ ssList(Z) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(Z) ) )),
rewrite(
( ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V)
| ~ ssList(Z) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
( ( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| ~ cyclefreeP(Z)
| ~ ssList(Z) )
<=> ( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) )),
inference(bind,[status(th)],]) ).
tff(170,plain,
( ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| ~ cyclefreeP(Z)
| ~ ssList(Z) )
<=> ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ) ),
inference(quant_intro,[status(thm)],[169]) ).
tff(171,axiom,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ leq(U,V)
| ~ leq(V,U)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| ~ cyclefreeP(Z)
| ~ ssList(Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause185) ).
tff(172,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ),
inference(modus_ponens,[status(thm)],[171,170]) ).
tff(173,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ),
inference(modus_ponens,[status(thm)],[172,168]) ).
tff(174,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ),
inference(skolemize,[status(sab)],[173]) ).
tff(175,plain,
! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) ),
inference(modus_ponens,[status(thm)],[174,167]) ).
tff(176,plain,
( ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ leq(sk6,sk6)
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) ) )
<=> ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ leq(sk6,sk6)
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(177,plain,
( ( ~ ssList(nil)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ leq(sk6,sk6)
| ~ leq(sk6,sk6) )
<=> ( ~ ssList(nil)
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ leq(sk6,sk6)
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(178,plain,
( ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ leq(sk6,sk6)
| ~ leq(sk6,sk6) )
<=> ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ leq(sk6,sk6)
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) ) ) ),
inference(monotonicity,[status(thm)],[177]) ).
tff(179,plain,
( ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ leq(sk6,sk6)
| ~ leq(sk6,sk6) )
<=> ( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ leq(sk6,sk6)
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) ) ) ),
inference(transitivity,[status(thm)],[178,176]) ).
tff(180,plain,
( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) )
| ~ leq(sk6,sk6)
| ~ leq(sk6,sk6) ),
inference(quant_inst,[status(thm)],]) ).
tff(181,plain,
( ~ ! [W: $i,V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssItem(U)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssItem(V)
| ~ ssList(W)
| ~ cyclefreeP(Z)
| ( app(app(W,cons(U,X)),cons(V,Y)) != Z )
| ~ leq(V,U)
| ~ leq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ cyclefreeP(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8))
| ~ leq(sk6,sk6)
| ( app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) ) ),
inference(modus_ponens,[status(thm)],[180,179]) ).
tff(182,plain,
app(app(sk7,cons(sk6,nil)),cons(sk6,sk8)) != app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
inference(unit_resolution,[status(thm)],[181,16,175,117,43,23,50,165,154]) ).
tff(183,plain,
$false,
inference(unit_resolution,[status(thm)],[182,105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC166-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Sep 3 22:08:30 EDT 2022
% 0.12/0.33 % 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.18/0.53 % SZS status Unsatisfiable
% 0.18/0.53 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------