TSTP Solution File: SYN267-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN267-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n002.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 : Thu Sep 29 23:54:27 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 47
% Syntax : Number of formulae : 89 ( 23 unt; 11 typ; 0 def)
% Number of atoms : 395 ( 0 equ)
% Maximal formula atoms : 15 ( 5 avg)
% Number of connectives : 554 ( 262 ~; 250 |; 0 &)
% ( 42 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 25 ( 25 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 8 >; 8 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 198 ( 180 !; 0 ?; 198 :)
% Comments :
%------------------------------------------------------------------------------
tff(p4_type,type,
p4: ( $i * $i * $i ) > $o ).
tff(c_type,type,
c: $i ).
tff(b_type,type,
b: $i ).
tff(k3_type,type,
k3: ( $i * $i * $i ) > $o ).
tff(p1_type,type,
p1: ( $i * $i * $i ) > $o ).
tff(p0_type,type,
p0: ( $i * $i ) > $o ).
tff(r0_type,type,
r0: $i > $o ).
tff(m2_type,type,
m2: $i > $o ).
tff(k1_type,type,
k1: $i > $o ).
tff(n0_type,type,
n0: ( $i * $i ) > $o ).
tff(d_type,type,
d: $i ).
tff(1,plain,
^ [B: $i,C: $i] :
refl(
( ( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
<=> ( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
<=> ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
<=> ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,plain,
^ [B: $i,C: $i] :
trans(
monotonicity(
rewrite(
( ( p1(B,B,C)
| ~ p0(C,B) )
<=> ( ~ p0(C,B)
| p1(B,B,C) ) )),
( ( p1(B,B,C)
| ~ p0(C,B)
| ~ r0(B) )
<=> ( ~ p0(C,B)
| p1(B,B,C)
| ~ r0(B) ) )),
rewrite(
( ( ~ p0(C,B)
| p1(B,B,C)
| ~ r0(B) )
<=> ( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ) )),
( ( p1(B,B,C)
| ~ p0(C,B)
| ~ r0(B) )
<=> ( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [B: $i,C: $i] :
( p1(B,B,C)
| ~ p0(C,B)
| ~ r0(B) )
<=> ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,axiom,
! [B: $i,C: $i] :
( p1(B,B,C)
| ~ p0(C,B)
| ~ r0(B) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_074) ).
tff(7,plain,
! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ),
inference(modus_ponens,[status(thm)],[7,3]) ).
tff(9,plain,
! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) ),
inference(modus_ponens,[status(thm)],[9,2]) ).
tff(11,plain,
( p0(c,b)
<=> p0(c,b) ),
inference(rewrite,[status(thm)],]) ).
tff(12,axiom,
p0(c,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
tff(13,plain,
p0(c,b),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
( r0(b)
<=> r0(b) ),
inference(rewrite,[status(thm)],]) ).
tff(15,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
tff(16,plain,
r0(b),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
( ( ~ ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
| ~ r0(b)
| ~ p0(c,b)
| p1(b,b,c) )
<=> ( ~ ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
| ~ r0(b)
| ~ p0(c,b)
| p1(b,b,c) ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,plain,
( ~ ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
| ~ r0(b)
| ~ p0(c,b)
| p1(b,b,c) ),
inference(quant_inst,[status(thm)],]) ).
tff(19,plain,
( ~ ! [B: $i,C: $i] :
( ~ r0(B)
| ~ p0(C,B)
| p1(B,B,C) )
| ~ r0(b)
| ~ p0(c,b)
| p1(b,b,c) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
p1(b,b,c),
inference(unit_resolution,[status(thm)],[19,16,13,10]) ).
tff(21,plain,
^ [B: $i,D: $i,E: $i,C: $i] :
refl(
( ( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
<=> ( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(22,plain,
( ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
<=> ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) ),
inference(quant_intro,[status(thm)],[21]) ).
tff(23,plain,
( ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
<=> ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,plain,
^ [B: $i,D: $i,E: $i,C: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( k3(B,B,C)
| ~ p1(C,D,B) )
<=> ( ~ p1(C,D,B)
| k3(B,B,C) ) )),
( ( k3(B,B,C)
| ~ p1(C,D,B)
| ~ m2(E) )
<=> ( ~ p1(C,D,B)
| k3(B,B,C)
| ~ m2(E) ) )),
rewrite(
( ( ~ p1(C,D,B)
| k3(B,B,C)
| ~ m2(E) )
<=> ( ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) )),
( ( k3(B,B,C)
| ~ p1(C,D,B)
| ~ m2(E) )
<=> ( ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) )),
( ( k3(B,B,C)
| ~ p1(C,D,B)
| ~ m2(E)
| ~ m2(D) )
<=> ( ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C)
| ~ m2(D) ) )),
rewrite(
( ( ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C)
| ~ m2(D) )
<=> ( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) )),
( ( k3(B,B,C)
| ~ p1(C,D,B)
| ~ m2(E)
| ~ m2(D) )
<=> ( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(25,plain,
( ! [B: $i,D: $i,E: $i,C: $i] :
( k3(B,B,C)
| ~ p1(C,D,B)
| ~ m2(E)
| ~ m2(D) )
<=> ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ) ),
inference(quant_intro,[status(thm)],[24]) ).
tff(26,axiom,
! [B: $i,D: $i,E: $i,C: $i] :
( k3(B,B,C)
| ~ p1(C,D,B)
| ~ m2(E)
| ~ m2(D) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_201) ).
tff(27,plain,
! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ),
inference(modus_ponens,[status(thm)],[27,23]) ).
tff(29,plain,
! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ),
inference(skolemize,[status(sab)],[28]) ).
tff(30,plain,
! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) ),
inference(modus_ponens,[status(thm)],[29,22]) ).
tff(31,plain,
^ [I: $i,J: $i] :
refl(
( ( k1(I)
| ~ n0(J,I) )
<=> ( k1(I)
| ~ n0(J,I) ) )),
inference(bind,[status(th)],]) ).
tff(32,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(quant_intro,[status(thm)],[31]) ).
tff(33,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(rewrite,[status(thm)],]) ).
tff(34,axiom,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
tff(35,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(skolemize,[status(sab)],[35]) ).
tff(37,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[36,32]) ).
tff(38,plain,
( n0(d,b)
<=> n0(d,b) ),
inference(rewrite,[status(thm)],]) ).
tff(39,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
tff(40,plain,
n0(d,b),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
( ( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) )
<=> ( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(42,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(43,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ),
inference(modus_ponens,[status(thm)],[42,41]) ).
tff(44,plain,
k1(b),
inference(unit_resolution,[status(thm)],[43,40,37]) ).
tff(45,plain,
( ( m2(b)
| ~ k1(b) )
<=> ( m2(b)
| ~ k1(b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(46,axiom,
( m2(b)
| ~ k1(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_136) ).
tff(47,plain,
( m2(b)
| ~ k1(b) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
m2(b),
inference(unit_resolution,[status(thm)],[47,44]) ).
tff(49,plain,
( ( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) )
<=> ( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(50,plain,
( ( ~ m2(b)
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) )
<=> ( ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(51,plain,
( ( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) )
<=> ( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) ) ),
inference(monotonicity,[status(thm)],[50]) ).
tff(52,plain,
( ( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) )
<=> ( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) ) ),
inference(transitivity,[status(thm)],[51,49]) ).
tff(53,plain,
( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(54,plain,
( ~ ! [B: $i,D: $i,E: $i,C: $i] :
( ~ m2(D)
| ~ m2(E)
| ~ p1(C,D,B)
| k3(B,B,C) )
| ~ m2(b)
| ~ p1(b,b,c)
| k3(c,c,b) ),
inference(modus_ponens,[status(thm)],[53,52]) ).
tff(55,plain,
k3(c,c,b),
inference(unit_resolution,[status(thm)],[54,48,30,20]) ).
tff(56,plain,
^ [B: $i,C: $i] :
refl(
( ( p4(B,C,B)
| ~ k3(B,B,C) )
<=> ( p4(B,C,B)
| ~ k3(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(57,plain,
( ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
<=> ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) ) ),
inference(quant_intro,[status(thm)],[56]) ).
tff(58,plain,
( ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
<=> ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) ) ),
inference(rewrite,[status(thm)],]) ).
tff(59,axiom,
! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_287) ).
tff(60,plain,
! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) ),
inference(modus_ponens,[status(thm)],[59,58]) ).
tff(61,plain,
! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) ),
inference(skolemize,[status(sab)],[60]) ).
tff(62,plain,
! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) ),
inference(modus_ponens,[status(thm)],[61,57]) ).
tff(63,plain,
( ( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| ~ k3(c,c,b)
| p4(c,b,c) )
<=> ( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| ~ k3(c,c,b)
| p4(c,b,c) ) ),
inference(rewrite,[status(thm)],]) ).
tff(64,plain,
( ( p4(c,b,c)
| ~ k3(c,c,b) )
<=> ( ~ k3(c,c,b)
| p4(c,b,c) ) ),
inference(rewrite,[status(thm)],]) ).
tff(65,plain,
( ( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| p4(c,b,c)
| ~ k3(c,c,b) )
<=> ( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| ~ k3(c,c,b)
| p4(c,b,c) ) ),
inference(monotonicity,[status(thm)],[64]) ).
tff(66,plain,
( ( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| p4(c,b,c)
| ~ k3(c,c,b) )
<=> ( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| ~ k3(c,c,b)
| p4(c,b,c) ) ),
inference(transitivity,[status(thm)],[65,63]) ).
tff(67,plain,
( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| p4(c,b,c)
| ~ k3(c,c,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(68,plain,
( ~ ! [B: $i,C: $i] :
( p4(B,C,B)
| ~ k3(B,B,C) )
| ~ k3(c,c,b)
| p4(c,b,c) ),
inference(modus_ponens,[status(thm)],[67,66]) ).
tff(69,plain,
p4(c,b,c),
inference(unit_resolution,[status(thm)],[68,62,55]) ).
tff(70,plain,
^ [Y: $i,X: $i] :
refl(
( ~ p4(X,Y,c)
<=> ~ p4(X,Y,c) )),
inference(bind,[status(th)],]) ).
tff(71,plain,
( ! [Y: $i,X: $i] : ~ p4(X,Y,c)
<=> ! [Y: $i,X: $i] : ~ p4(X,Y,c) ),
inference(quant_intro,[status(thm)],[70]) ).
tff(72,plain,
( ! [Y: $i,X: $i] : ~ p4(X,Y,c)
<=> ! [Y: $i,X: $i] : ~ p4(X,Y,c) ),
inference(rewrite,[status(thm)],]) ).
tff(73,axiom,
! [Y: $i,X: $i] : ~ p4(X,Y,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(74,plain,
! [Y: $i,X: $i] : ~ p4(X,Y,c),
inference(modus_ponens,[status(thm)],[73,72]) ).
tff(75,plain,
! [Y: $i,X: $i] : ~ p4(X,Y,c),
inference(skolemize,[status(sab)],[74]) ).
tff(76,plain,
! [Y: $i,X: $i] : ~ p4(X,Y,c),
inference(modus_ponens,[status(thm)],[75,71]) ).
tff(77,plain,
( ~ ! [Y: $i,X: $i] : ~ p4(X,Y,c)
| ~ p4(c,b,c) ),
inference(quant_inst,[status(thm)],]) ).
tff(78,plain,
$false,
inference(unit_resolution,[status(thm)],[77,76,69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN267-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.11 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Sep 5 02:31:48 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.33 Usage: tptp [options] [-file:]file
% 0.11/0.33 -h, -? prints this message.
% 0.11/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.11/0.33 -m, -model generate model.
% 0.11/0.33 -p, -proof generate proof.
% 0.11/0.33 -c, -core generate unsat core of named formulas.
% 0.11/0.33 -st, -statistics display statistics.
% 0.11/0.33 -t:timeout set timeout (in second).
% 0.11/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.11/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.33 -<param>:<value> configuration parameter and value.
% 0.11/0.33 -o:<output-file> file to place output in.
% 0.19/0.42 % SZS status Unsatisfiable
% 0.19/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------