TSTP Solution File: SWC309-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC309-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n001.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:01 EDT 2022
% Result : Unsatisfiable 0.21s 0.50s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 67
% Syntax : Number of formulae : 142 ( 32 unt; 12 typ; 0 def)
% Number of atoms : 823 ( 322 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 1225 ( 573 ~; 579 |; 0 &)
% ( 73 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of FOOLs : 41 ( 41 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 7 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 211 ( 187 !; 0 ?; 211 :)
% Comments :
%------------------------------------------------------------------------------
tff(sk4_type,type,
sk4: $i ).
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(tl_type,type,
tl: $i > $i ).
tff(cons_type,type,
cons: ( $i * $i ) > $i ).
tff(nil_type,type,
nil: $i ).
tff(hd_type,type,
hd: $i > $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(sk3_type,type,
sk3: $i ).
tff(sk1_type,type,
sk1: $i ).
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/sandbox/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/sandbox/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/sandbox/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/sandbox/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,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
<=> ( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(35,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ) ),
inference(quant_intro,[status(thm)],[34]) ).
tff(36,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(37,plain,
^ [U: $i] :
rewrite(
( ( ~ ssList(U)
| ( cons(hd(U),tl(U)) = U )
| ( nil = U ) )
<=> ( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(38,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( cons(hd(U),tl(U)) = U )
| ( nil = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ) ),
inference(quant_intro,[status(thm)],[37]) ).
tff(39,axiom,
! [U: $i] :
( ~ ssList(U)
| ( cons(hd(U),tl(U)) = U )
| ( nil = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
tff(40,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ),
inference(modus_ponens,[status(thm)],[40,36]) ).
tff(42,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ),
inference(skolemize,[status(sab)],[41]) ).
tff(43,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) ),
inference(modus_ponens,[status(thm)],[42,35]) ).
tff(44,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ( cons(hd(sk4),tl(sk4)) = sk4 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ( cons(hd(sk4),tl(sk4)) = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(45,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ( cons(hd(sk4),tl(sk4)) = sk4 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(46,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ( cons(hd(U),tl(U)) = U ) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ( cons(hd(sk4),tl(sk4)) = sk4 ) ),
inference(modus_ponens,[status(thm)],[45,44]) ).
tff(47,plain,
( ( nil = sk4 )
| ( cons(hd(sk4),tl(sk4)) = sk4 ) ),
inference(unit_resolution,[status(thm)],[46,43,12]) ).
tff(48,plain,
cons(hd(sk4),tl(sk4)) = sk4,
inference(unit_resolution,[status(thm)],[47,33]) ).
tff(49,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
<=> ( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ) )),
inference(bind,[status(th)],]) ).
tff(50,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ) ),
inference(quant_intro,[status(thm)],[49]) ).
tff(51,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(52,plain,
^ [U: $i] :
rewrite(
( ( ~ ssList(U)
| ssList(tl(U))
| ( nil = U ) )
<=> ( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ) )),
inference(bind,[status(th)],]) ).
tff(53,plain,
( ! [U: $i] :
( ~ ssList(U)
| ssList(tl(U))
| ( nil = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ) ),
inference(quant_intro,[status(thm)],[52]) ).
tff(54,axiom,
! [U: $i] :
( ~ ssList(U)
| ssList(tl(U))
| ( nil = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
tff(55,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ),
inference(modus_ponens,[status(thm)],[54,53]) ).
tff(56,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ),
inference(modus_ponens,[status(thm)],[55,51]) ).
tff(57,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ),
inference(skolemize,[status(sab)],[56]) ).
tff(58,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) ),
inference(modus_ponens,[status(thm)],[57,50]) ).
tff(59,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssList(tl(sk4)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssList(tl(sk4)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(60,plain,
( ( ~ ssList(sk4)
| ( nil = sk4 )
| ssList(tl(sk4)) )
<=> ( ( nil = sk4 )
| ~ ssList(sk4)
| ssList(tl(sk4)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(61,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ssList(tl(sk4)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssList(tl(sk4)) ) ),
inference(monotonicity,[status(thm)],[60]) ).
tff(62,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ssList(tl(sk4)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssList(tl(sk4)) ) ),
inference(transitivity,[status(thm)],[61,59]) ).
tff(63,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ssList(tl(sk4)) ),
inference(quant_inst,[status(thm)],]) ).
tff(64,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssList(tl(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssList(tl(sk4)) ),
inference(modus_ponens,[status(thm)],[63,62]) ).
tff(65,plain,
ssList(tl(sk4)),
inference(unit_resolution,[status(thm)],[64,58,12,33]) ).
tff(66,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
<=> ( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ) )),
inference(bind,[status(th)],]) ).
tff(67,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ) ),
inference(quant_intro,[status(thm)],[66]) ).
tff(68,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(69,plain,
^ [U: $i] :
rewrite(
( ( ~ ssList(U)
| ssItem(hd(U))
| ( nil = U ) )
<=> ( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ) )),
inference(bind,[status(th)],]) ).
tff(70,plain,
( ! [U: $i] :
( ~ ssList(U)
| ssItem(hd(U))
| ( nil = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ) ),
inference(quant_intro,[status(thm)],[69]) ).
tff(71,axiom,
! [U: $i] :
( ~ ssList(U)
| ssItem(hd(U))
| ( nil = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
tff(72,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ),
inference(modus_ponens,[status(thm)],[71,70]) ).
tff(73,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ),
inference(modus_ponens,[status(thm)],[72,68]) ).
tff(74,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ),
inference(skolemize,[status(sab)],[73]) ).
tff(75,plain,
! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) ),
inference(modus_ponens,[status(thm)],[74,67]) ).
tff(76,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssItem(hd(sk4)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssItem(hd(sk4)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(77,plain,
( ( ~ ssList(sk4)
| ( nil = sk4 )
| ssItem(hd(sk4)) )
<=> ( ( nil = sk4 )
| ~ ssList(sk4)
| ssItem(hd(sk4)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(78,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ssItem(hd(sk4)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssItem(hd(sk4)) ) ),
inference(monotonicity,[status(thm)],[77]) ).
tff(79,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ssItem(hd(sk4)) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssItem(hd(sk4)) ) ),
inference(transitivity,[status(thm)],[78,76]) ).
tff(80,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ~ ssList(sk4)
| ( nil = sk4 )
| ssItem(hd(sk4)) ),
inference(quant_inst,[status(thm)],]) ).
tff(81,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( nil = U )
| ssItem(hd(U)) )
| ( nil = sk4 )
| ~ ssList(sk4)
| ssItem(hd(sk4)) ),
inference(modus_ponens,[status(thm)],[80,79]) ).
tff(82,plain,
( ( nil = sk4 )
| ssItem(hd(sk4)) ),
inference(unit_resolution,[status(thm)],[81,75,12]) ).
tff(83,plain,
ssItem(hd(sk4)),
inference(unit_resolution,[status(thm)],[82,33]) ).
tff(84,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(85,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)],[84]) ).
tff(86,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(87,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(88,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)],[87]) ).
tff(89,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
tff(90,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(modus_ponens,[status(thm)],[89,88]) ).
tff(91,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(modus_ponens,[status(thm)],[90,86]) ).
tff(92,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(skolemize,[status(sab)],[91]) ).
tff(93,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
inference(modus_ponens,[status(thm)],[92,85]) ).
tff(94,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) = cons(hd(sk4),tl(sk4)) ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) = cons(hd(sk4),tl(sk4)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(95,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) = cons(hd(sk4),tl(sk4)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(96,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) = cons(hd(sk4),tl(sk4)) ) ),
inference(modus_ponens,[status(thm)],[95,94]) ).
tff(97,plain,
( ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) = cons(hd(sk4),tl(sk4)) ) ),
inference(unit_resolution,[status(thm)],[96,93,83]) ).
tff(98,plain,
app(cons(hd(sk4),nil),tl(sk4)) = cons(hd(sk4),tl(sk4)),
inference(unit_resolution,[status(thm)],[97,65]) ).
tff(99,plain,
app(cons(hd(sk4),nil),tl(sk4)) = sk4,
inference(transitivity,[status(thm)],[98,48]) ).
tff(100,plain,
^ [B: $i,A: $i] :
refl(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) )),
inference(bind,[status(th)],]) ).
tff(101,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) ),
inference(quant_intro,[status(thm)],[100]) ).
tff(102,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(103,plain,
^ [B: $i,A: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) )),
rewrite(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) )),
inference(bind,[status(th)],]) ).
tff(104,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) ),
inference(quant_intro,[status(thm)],[103]) ).
tff(105,axiom,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
tff(106,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ),
inference(modus_ponens,[status(thm)],[105,104]) ).
tff(107,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ),
inference(modus_ponens,[status(thm)],[106,102]) ).
tff(108,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ),
inference(skolemize,[status(sab)],[107]) ).
tff(109,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) ),
inference(modus_ponens,[status(thm)],[108,101]) ).
tff(110,plain,
( ( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(tl(sk4),cons(hd(sk4),nil)) = sk3 )
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 ) )
<=> ( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(tl(sk4),cons(hd(sk4),nil)) = sk3 )
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(111,plain,
( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(tl(sk4),cons(hd(sk4),nil)) = sk3 )
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(112,plain,
( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) = sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(tl(sk4),cons(hd(sk4),nil)) = sk3 )
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 ) ),
inference(modus_ponens,[status(thm)],[111,110]) ).
tff(113,plain,
app(tl(sk4),cons(hd(sk4),nil)) = sk3,
inference(unit_resolution,[status(thm)],[112,109,83,65,99]) ).
tff(114,plain,
^ [B: $i,A: $i] :
refl(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ) )),
inference(bind,[status(th)],]) ).
tff(115,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ) ),
inference(quant_intro,[status(thm)],[114]) ).
tff(116,plain,
^ [B: $i,A: $i] :
trans(
monotonicity(
rewrite(
( ( app(B,cons(A,nil)) != sk1 )
<=> ( app(B,cons(A,nil)) != sk3 ) )),
rewrite(
( ( app(cons(A,nil),B) != sk2 )
<=> ( app(cons(A,nil),B) != sk4 ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk3 )
| ( app(cons(A,nil),B) != sk4 ) ) )),
rewrite(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk3 )
| ( app(cons(A,nil),B) != sk4 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ) )),
inference(bind,[status(th)],]) ).
tff(117,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ) ),
inference(quant_intro,[status(thm)],[116]) ).
tff(118,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(119,plain,
^ [B: $i,A: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 )
| ( app(B,cons(A,nil)) != sk1 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 )
| ( app(B,cons(A,nil)) != sk1 ) ) )),
rewrite(
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 )
| ( app(B,cons(A,nil)) != sk1 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 )
| ( app(B,cons(A,nil)) != sk1 ) )
<=> ( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) ) )),
inference(bind,[status(th)],]) ).
tff(120,plain,
( ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 )
| ( app(B,cons(A,nil)) != sk1 ) )
<=> ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) ) ),
inference(quant_intro,[status(thm)],[119]) ).
tff(121,axiom,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk2 )
| ( app(B,cons(A,nil)) != sk1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
tff(122,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) ),
inference(modus_ponens,[status(thm)],[121,120]) ).
tff(123,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(B,cons(A,nil)) != sk1 )
| ( app(cons(A,nil),B) != sk2 ) ),
inference(modus_ponens,[status(thm)],[122,118]) ).
tff(124,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ),
inference(modus_ponens,[status(thm)],[123,117]) ).
tff(125,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ),
inference(skolemize,[status(sab)],[124]) ).
tff(126,plain,
! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) ),
inference(modus_ponens,[status(thm)],[125,115]) ).
tff(127,plain,
( ( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 )
| ( app(tl(sk4),cons(hd(sk4),nil)) != sk3 ) )
<=> ( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 )
| ( app(tl(sk4),cons(hd(sk4),nil)) != sk3 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(128,plain,
( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 )
| ( app(tl(sk4),cons(hd(sk4),nil)) != sk3 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(129,plain,
( ~ ! [B: $i,A: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ( app(cons(A,nil),B) != sk4 )
| ( app(B,cons(A,nil)) != sk3 ) )
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ( app(cons(hd(sk4),nil),tl(sk4)) != sk4 )
| ( app(tl(sk4),cons(hd(sk4),nil)) != sk3 ) ),
inference(modus_ponens,[status(thm)],[128,127]) ).
tff(130,plain,
$false,
inference(unit_resolution,[status(thm)],[129,126,83,65,113,99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC309-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Sep 4 00:10:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.50 % SZS status Unsatisfiable
% 0.21/0.50 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------