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