TSTP Solution File: SWC086-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC086-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 20 11:55:09 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 43
% Syntax : Number of formulae : 83 ( 23 unt; 8 typ; 0 def)
% Number of atoms : 414 ( 53 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 662 ( 349 ~; 271 |; 0 &)
% ( 42 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 26 ( 26 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 76 ( 68 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
tff(segmentP_type,type,
segmentP: ( $i * $i ) > $o ).
tff(sk3_type,type,
sk3: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(sk1_type,type,
sk1: $i ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(nil_type,type,
nil: $i ).
tff(sk4_type,type,
sk4: $i ).
tff(sk2_type,type,
sk2: $i ).
tff(1,plain,
( ssList(sk1)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ssList(sk1)
<=> ssList(sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(3,axiom,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
tff(4,plain,
ssList(sk1),
inference(modus_ponens,[status(thm)],[3,2]) ).
tff(5,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[4,1]) ).
tff(6,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| segmentP(U,U) )
<=> ( ~ ssList(U)
| segmentP(U,U) ) )),
inference(bind,[status(th)],]) ).
tff(7,plain,
( ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) )
<=> ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) ) ),
inference(quant_intro,[status(thm)],[6]) ).
tff(8,plain,
( ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) )
<=> ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) ) ),
inference(rewrite,[status(thm)],]) ).
tff(9,axiom,
! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
tff(10,plain,
! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) ),
inference(skolemize,[status(sab)],[10]) ).
tff(12,plain,
! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) ),
inference(modus_ponens,[status(thm)],[11,7]) ).
tff(13,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) )
| ~ ssList(sk3)
| segmentP(sk3,sk3) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) )
| ~ ssList(sk3)
| segmentP(sk3,sk3) ) ),
inference(rewrite,[status(thm)],]) ).
tff(14,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) )
| ~ ssList(sk3)
| segmentP(sk3,sk3) ),
inference(quant_inst,[status(thm)],]) ).
tff(15,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| segmentP(U,U) )
| ~ ssList(sk3)
| segmentP(sk3,sk3) ),
inference(modus_ponens,[status(thm)],[14,13]) ).
tff(16,plain,
segmentP(sk3,sk3),
inference(unit_resolution,[status(thm)],[15,12,5]) ).
tff(17,plain,
( ( sk4 = nil )
<=> ( nil = sk4 ) ),
inference(commutativity,[status(thm)],]) ).
tff(18,plain,
( ( sk4 != nil )
<=> ( nil != sk4 ) ),
inference(monotonicity,[status(thm)],[17]) ).
tff(19,plain,
( neq(sk2,nil)
<=> neq(sk4,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(20,plain,
( neq(sk2,nil)
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(21,axiom,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
tff(22,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
neq(sk4,nil),
inference(modus_ponens,[status(thm)],[22,19]) ).
tff(24,plain,
( ssList(sk2)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],]) ).
tff(25,plain,
( ssList(sk2)
<=> ssList(sk2) ),
inference(rewrite,[status(thm)],]) ).
tff(26,axiom,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
tff(27,plain,
ssList(sk2),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[27,24]) ).
tff(29,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(30,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)],[29]) ).
tff(31,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(32,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(33,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)],[32]) ).
tff(34,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(35,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(modus_ponens,[status(thm)],[35,31]) ).
tff(37,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ),
inference(modus_ponens,[status(thm)],[37,30]) ).
tff(39,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(40,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(41,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ neq(sk4,nil)
| ( sk4 != nil ) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ neq(sk4,nil)
| ( sk4 != nil ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(43,plain,
( ( ~ ssList(sk4)
| ~ ssList(nil)
| ( sk4 != nil )
| ~ neq(sk4,nil) )
<=> ( ~ ssList(nil)
| ~ ssList(sk4)
| ~ neq(sk4,nil)
| ( sk4 != nil ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(44,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)
| ~ neq(sk4,nil)
| ( sk4 != nil ) ) ),
inference(monotonicity,[status(thm)],[43]) ).
tff(45,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)
| ~ neq(sk4,nil)
| ( sk4 != nil ) ) ),
inference(transitivity,[status(thm)],[44,42]) ).
tff(46,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(47,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ neq(sk4,nil)
| ( sk4 != nil ) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
sk4 != nil,
inference(unit_resolution,[status(thm)],[47,41,38,28,23]) ).
tff(49,plain,
nil != sk4,
inference(modus_ponens,[status(thm)],[48,18]) ).
tff(50,plain,
( ( ( nil = sk4 )
| neq(sk3,nil) )
<=> ( ( nil = sk4 )
| neq(sk3,nil) ) ),
inference(rewrite,[status(thm)],]) ).
tff(51,axiom,
( ( nil = sk4 )
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
tff(52,plain,
( ( nil = sk4 )
| neq(sk3,nil) ),
inference(modus_ponens,[status(thm)],[51,50]) ).
tff(53,plain,
neq(sk3,nil),
inference(unit_resolution,[status(thm)],[52,49]) ).
tff(54,plain,
( ( ( nil = sk4 )
| segmentP(sk4,sk3) )
<=> ( ( nil = sk4 )
| segmentP(sk4,sk3) ) ),
inference(rewrite,[status(thm)],]) ).
tff(55,axiom,
( ( nil = sk4 )
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
tff(56,plain,
( ( nil = sk4 )
| segmentP(sk4,sk3) ),
inference(modus_ponens,[status(thm)],[55,54]) ).
tff(57,plain,
segmentP(sk4,sk3),
inference(unit_resolution,[status(thm)],[56,49]) ).
tff(58,plain,
^ [A: $i] :
refl(
( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) )
<=> ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ) )),
inference(bind,[status(th)],]) ).
tff(59,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ) ),
inference(quant_intro,[status(thm)],[58]) ).
tff(60,plain,
^ [A: $i] :
trans(
monotonicity(
rewrite(
( ~ segmentP(sk2,A)
<=> ~ segmentP(sk4,A) )),
rewrite(
( ~ segmentP(sk1,A)
<=> ~ segmentP(sk3,A) )),
( ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) )
<=> ( ~ ssList(A)
| ~ segmentP(sk4,A)
| ~ neq(A,nil)
| ~ segmentP(sk3,A) ) )),
rewrite(
( ( ~ ssList(A)
| ~ segmentP(sk4,A)
| ~ neq(A,nil)
| ~ segmentP(sk3,A) )
<=> ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ) )),
( ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) )
<=> ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ) )),
inference(bind,[status(th)],]) ).
tff(61,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ) ),
inference(quant_intro,[status(thm)],[60]) ).
tff(62,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ) ),
inference(rewrite,[status(thm)],]) ).
tff(63,plain,
^ [A: $i] :
trans(
monotonicity(
rewrite(
( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A) )
<=> ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil) ) )),
( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A)
| ~ segmentP(sk1,A) )
<=> ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ) )),
rewrite(
( ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) )
<=> ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ) )),
( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A)
| ~ segmentP(sk1,A) )
<=> ( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ) )),
inference(bind,[status(th)],]) ).
tff(64,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A)
| ~ segmentP(sk1,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ) ),
inference(quant_intro,[status(thm)],[63]) ).
tff(65,axiom,
! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A)
| ~ segmentP(sk1,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
tff(66,plain,
! [A: $i] :
( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ),
inference(modus_ponens,[status(thm)],[65,64]) ).
tff(67,plain,
! [A: $i] :
( ~ ssList(A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ segmentP(sk1,A) ),
inference(modus_ponens,[status(thm)],[66,62]) ).
tff(68,plain,
! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ),
inference(modus_ponens,[status(thm)],[67,61]) ).
tff(69,plain,
! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ),
inference(skolemize,[status(sab)],[68]) ).
tff(70,plain,
! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) ),
inference(modus_ponens,[status(thm)],[69,59]) ).
tff(71,plain,
( ( ~ ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) )
| ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) )
<=> ( ~ ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) )
| ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ) ),
inference(rewrite,[status(thm)],]) ).
tff(72,plain,
( ~ ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) )
| ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(quant_inst,[status(thm)],]) ).
tff(73,plain,
( ~ ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk4,A)
| ~ segmentP(sk3,A) )
| ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(modus_ponens,[status(thm)],[72,71]) ).
tff(74,plain,
( ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(unit_resolution,[status(thm)],[73,5,70]) ).
tff(75,plain,
$false,
inference(unit_resolution,[status(thm)],[74,57,53,16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC086-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Sep 3 21:34:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.19/0.44 % SZS status Unsatisfiable
% 0.19/0.44 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------