TSTP Solution File: SYN168-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN168-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n005.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:02 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 38
% Syntax : Number of formulae : 73 ( 20 unt; 8 typ; 0 def)
% Number of atoms : 238 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 304 ( 144 ~; 132 |; 0 &)
% ( 28 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 136 ( 123 !; 0 ?; 136 :)
% Comments :
%------------------------------------------------------------------------------
tff(p3_type,type,
p3: ( $i * $i * $i ) > $o ).
tff(b_type,type,
b: $i ).
tff(n2_type,type,
n2: $i > $o ).
tff(p1_type,type,
p1: ( $i * $i * $i ) > $o ).
tff(d_type,type,
d: $i ).
tff(p0_type,type,
p0: ( $i * $i ) > $o ).
tff(k1_type,type,
k1: $i > $o ).
tff(n0_type,type,
n0: ( $i * $i ) > $o ).
tff(1,plain,
^ [B: $i,A: $i,C: $i] :
refl(
( ( n2(A)
| ~ p1(B,C,A) )
<=> ( n2(A)
| ~ p1(B,C,A) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
<=> ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
<=> ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
tff(5,plain,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
^ [B: $i,C: $i] :
refl(
( ( ~ p0(C,B)
| p1(B,B,C) )
<=> ( ~ p0(C,B)
| p1(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(9,plain,
( ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ) ),
inference(quant_intro,[status(thm)],[8]) ).
tff(10,plain,
( ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ) ),
inference(rewrite,[status(thm)],]) ).
tff(11,plain,
^ [B: $i,C: $i] :
rewrite(
( ( p1(B,B,C)
| ~ p0(C,B) )
<=> ( ~ p0(C,B)
| p1(B,B,C) ) )),
inference(bind,[status(th)],]) ).
tff(12,plain,
( ! [B: $i,C: $i] :
( p1(B,B,C)
| ~ p0(C,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ) ),
inference(quant_intro,[status(thm)],[11]) ).
tff(13,axiom,
! [B: $i,C: $i] :
( p1(B,B,C)
| ~ p0(C,B) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_069) ).
tff(14,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ),
inference(modus_ponens,[status(thm)],[14,10]) ).
tff(16,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ),
inference(skolemize,[status(sab)],[15]) ).
tff(17,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) ),
inference(modus_ponens,[status(thm)],[16,9]) ).
tff(18,plain,
( p0(b,d)
<=> p0(b,d) ),
inference(rewrite,[status(thm)],]) ).
tff(19,axiom,
p0(b,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_10) ).
tff(20,plain,
p0(b,d),
inference(modus_ponens,[status(thm)],[19,18]) ).
tff(21,plain,
( ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) )
| ~ p0(b,d)
| p1(d,d,b) )
<=> ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) )
| ~ p0(b,d)
| p1(d,d,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(22,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) )
| ~ p0(b,d)
| p1(d,d,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(23,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,C) )
| ~ p0(b,d)
| p1(d,d,b) ),
inference(modus_ponens,[status(thm)],[22,21]) ).
tff(24,plain,
p1(d,d,b),
inference(unit_resolution,[status(thm)],[23,20,17]) ).
tff(25,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(b)
| ~ p1(d,d,b) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(b)
| ~ p1(d,d,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(26,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(b)
| ~ p1(d,d,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(27,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(b)
| ~ p1(d,d,b) ),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
n2(b),
inference(unit_resolution,[status(thm)],[27,24,7]) ).
tff(29,plain,
^ [H: $i] :
refl(
( ( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
<=> ( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ) )),
inference(bind,[status(th)],]) ).
tff(30,plain,
( ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
<=> ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,plain,
( ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
<=> ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ) ),
inference(rewrite,[status(thm)],]) ).
tff(32,plain,
^ [H: $i] :
trans(
monotonicity(
rewrite(
( ( p3(H,H,H)
| ~ k1(H) )
<=> ( ~ k1(H)
| p3(H,H,H) ) )),
( ( p3(H,H,H)
| ~ k1(H)
| ~ n2(H) )
<=> ( ~ k1(H)
| p3(H,H,H)
| ~ n2(H) ) )),
rewrite(
( ( ~ k1(H)
| p3(H,H,H)
| ~ n2(H) )
<=> ( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ) )),
( ( p3(H,H,H)
| ~ k1(H)
| ~ n2(H) )
<=> ( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ) )),
inference(bind,[status(th)],]) ).
tff(33,plain,
( ! [H: $i] :
( p3(H,H,H)
| ~ k1(H)
| ~ n2(H) )
<=> ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,axiom,
! [H: $i] :
( p3(H,H,H)
| ~ k1(H)
| ~ n2(H) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_249) ).
tff(35,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(modus_ponens,[status(thm)],[35,31]) ).
tff(37,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(modus_ponens,[status(thm)],[37,30]) ).
tff(39,plain,
^ [I: $i,J: $i] :
refl(
( ( k1(I)
| ~ n0(J,I) )
<=> ( k1(I)
| ~ n0(J,I) ) )),
inference(bind,[status(th)],]) ).
tff(40,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(quant_intro,[status(thm)],[39]) ).
tff(41,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(rewrite,[status(thm)],]) ).
tff(42,axiom,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
tff(43,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[42,41]) ).
tff(44,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(skolemize,[status(sab)],[43]) ).
tff(45,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[44,40]) ).
tff(46,plain,
( n0(d,b)
<=> n0(d,b) ),
inference(rewrite,[status(thm)],]) ).
tff(47,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
tff(48,plain,
n0(d,b),
inference(modus_ponens,[status(thm)],[47,46]) ).
tff(49,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(50,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(51,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ),
inference(modus_ponens,[status(thm)],[50,49]) ).
tff(52,plain,
k1(b),
inference(unit_resolution,[status(thm)],[51,48,45]) ).
tff(53,plain,
( ( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(b)
| ~ n2(b)
| p3(b,b,b) )
<=> ( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(b)
| ~ n2(b)
| p3(b,b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(54,plain,
( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(b)
| ~ n2(b)
| p3(b,b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(55,plain,
( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(b)
| ~ n2(b)
| p3(b,b,b) ),
inference(modus_ponens,[status(thm)],[54,53]) ).
tff(56,plain,
p3(b,b,b),
inference(unit_resolution,[status(thm)],[55,52,38,28]) ).
tff(57,plain,
^ [Y: $i,X: $i] :
refl(
( ~ p3(X,Y,b)
<=> ~ p3(X,Y,b) )),
inference(bind,[status(th)],]) ).
tff(58,plain,
( ! [Y: $i,X: $i] : ~ p3(X,Y,b)
<=> ! [Y: $i,X: $i] : ~ p3(X,Y,b) ),
inference(quant_intro,[status(thm)],[57]) ).
tff(59,plain,
( ! [Y: $i,X: $i] : ~ p3(X,Y,b)
<=> ! [Y: $i,X: $i] : ~ p3(X,Y,b) ),
inference(rewrite,[status(thm)],]) ).
tff(60,axiom,
! [Y: $i,X: $i] : ~ p3(X,Y,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(61,plain,
! [Y: $i,X: $i] : ~ p3(X,Y,b),
inference(modus_ponens,[status(thm)],[60,59]) ).
tff(62,plain,
! [Y: $i,X: $i] : ~ p3(X,Y,b),
inference(skolemize,[status(sab)],[61]) ).
tff(63,plain,
! [Y: $i,X: $i] : ~ p3(X,Y,b),
inference(modus_ponens,[status(thm)],[62,58]) ).
tff(64,plain,
( ~ ! [Y: $i,X: $i] : ~ p3(X,Y,b)
| ~ p3(b,b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(65,plain,
$false,
inference(unit_resolution,[status(thm)],[64,63,56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN168-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n005.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 : Mon Sep 5 02:00:48 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.
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------