TSTP Solution File: SYN265-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN265-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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:26 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 44
% Syntax : Number of formulae : 94 ( 20 unt; 9 typ; 0 def)
% Number of atoms : 295 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 367 ( 168 ~; 152 |; 0 &)
% ( 47 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 11 ( 11 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 7 >; 5 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 92 ( 84 !; 0 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
tff(p3_type,type,
p3: ( $i * $i * $i ) > $o ).
tff(a_type,type,
a: $i ).
tff(k1_type,type,
k1: $i > $o ).
tff(n0_type,type,
n0: ( $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(l0_type,type,
l0: $i > $o ).
tff(r0_type,type,
r0: $i > $o ).
tff(1,plain,
^ [I: $i,J: $i] :
refl(
( ( k1(I)
| ~ n0(J,I) )
<=> ( k1(I)
| ~ n0(J,I) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
tff(5,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( n0(b,a)
<=> n0(b,a) ),
inference(rewrite,[status(thm)],]) ).
tff(9,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
tff(10,plain,
n0(b,a),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
( ( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(a)
| ~ n0(b,a) )
<=> ( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(a)
| ~ n0(b,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(12,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(a)
| ~ n0(b,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(13,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(a)
| ~ n0(b,a) ),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
k1(a),
inference(unit_resolution,[status(thm)],[13,10,7]) ).
tff(15,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(16,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)],[15]) ).
tff(17,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(18,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(19,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)],[18]) ).
tff(20,axiom,
! [H: $i] :
( p3(H,H,H)
| ~ k1(H)
| ~ n2(H) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_249) ).
tff(21,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(modus_ponens,[status(thm)],[20,19]) ).
tff(22,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(modus_ponens,[status(thm)],[21,17]) ).
tff(23,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(skolemize,[status(sab)],[22]) ).
tff(24,plain,
! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) ),
inference(modus_ponens,[status(thm)],[23,16]) ).
tff(25,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(26,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)],[25]) ).
tff(27,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(28,axiom,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
tff(29,plain,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
inference(modus_ponens,[status(thm)],[28,27]) ).
tff(30,plain,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
inference(skolemize,[status(sab)],[29]) ).
tff(31,plain,
! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) ),
inference(modus_ponens,[status(thm)],[30,26]) ).
tff(32,plain,
( p1(a,b,a)
<=> p1(a,b,a) ),
inference(rewrite,[status(thm)],]) ).
tff(33,plain,
( ( p1(a,b,a)
| $false )
<=> p1(a,b,a) ),
inference(rewrite,[status(thm)],]) ).
tff(34,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(35,plain,
( ( $false
| p1(a,a,a) )
<=> p1(a,a,a) ),
inference(rewrite,[status(thm)],]) ).
tff(36,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
tff(37,plain,
( l0(a)
<=> $true ),
inference(iff_true,[status(thm)],[36]) ).
tff(38,plain,
( ~ l0(a)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[37]) ).
tff(39,plain,
( ~ l0(a)
<=> $false ),
inference(transitivity,[status(thm)],[38,34]) ).
tff(40,plain,
( ( ~ l0(a)
| p1(a,a,a) )
<=> ( $false
| p1(a,a,a) ) ),
inference(monotonicity,[status(thm)],[39]) ).
tff(41,plain,
( ( ~ l0(a)
| p1(a,a,a) )
<=> p1(a,a,a) ),
inference(transitivity,[status(thm)],[40,35]) ).
tff(42,plain,
( ( p1(a,a,a)
| ~ l0(a) )
<=> ( ~ l0(a)
| p1(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(43,axiom,
( p1(a,a,a)
| ~ l0(a) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_088) ).
tff(44,plain,
( ~ l0(a)
| p1(a,a,a) ),
inference(modus_ponens,[status(thm)],[43,42]) ).
tff(45,plain,
p1(a,a,a),
inference(modus_ponens,[status(thm)],[44,41]) ).
tff(46,plain,
( p1(a,a,a)
<=> $true ),
inference(iff_true,[status(thm)],[45]) ).
tff(47,plain,
( ~ p1(a,a,a)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[46]) ).
tff(48,plain,
( ~ p1(a,a,a)
<=> $false ),
inference(transitivity,[status(thm)],[47,34]) ).
tff(49,plain,
( ( p1(a,b,a)
| ~ p1(a,a,a) )
<=> ( p1(a,b,a)
| $false ) ),
inference(monotonicity,[status(thm)],[48]) ).
tff(50,plain,
( ( p1(a,b,a)
| ~ p1(a,a,a) )
<=> p1(a,b,a) ),
inference(transitivity,[status(thm)],[49,33]) ).
tff(51,plain,
( ( $false
| p1(a,b,a)
| ~ p1(a,a,a) )
<=> ( p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(52,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
tff(53,plain,
( r0(b)
<=> $true ),
inference(iff_true,[status(thm)],[52]) ).
tff(54,plain,
( ~ r0(b)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[53]) ).
tff(55,plain,
( ~ r0(b)
<=> $false ),
inference(transitivity,[status(thm)],[54,34]) ).
tff(56,plain,
( ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) )
<=> ( $false
| p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(monotonicity,[status(thm)],[55]) ).
tff(57,plain,
( ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) )
<=> ( p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(transitivity,[status(thm)],[56,51]) ).
tff(58,plain,
( ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) )
<=> ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(59,plain,
( ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) )
<=> ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(60,plain,
( ( p1(a,b,a)
| ~ r0(b) )
<=> ( ~ r0(b)
| p1(a,b,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(61,plain,
( ( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) )
<=> ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(monotonicity,[status(thm)],[60]) ).
tff(62,plain,
( ( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) )
<=> ( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) ) ),
inference(transitivity,[status(thm)],[61,59]) ).
tff(63,axiom,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_087) ).
tff(64,plain,
( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) ),
inference(modus_ponens,[status(thm)],[63,62]) ).
tff(65,plain,
( ~ r0(b)
| p1(a,b,a)
| ~ p1(a,a,a) ),
inference(modus_ponens,[status(thm)],[64,58]) ).
tff(66,plain,
( p1(a,b,a)
| ~ p1(a,a,a) ),
inference(modus_ponens,[status(thm)],[65,57]) ).
tff(67,plain,
p1(a,b,a),
inference(modus_ponens,[status(thm)],[66,50]) ).
tff(68,plain,
p1(a,b,a),
inference(modus_ponens,[status(thm)],[67,32]) ).
tff(69,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(a)
| ~ p1(a,b,a) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(a)
| ~ p1(a,b,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(70,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(a)
| ~ p1(a,b,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(71,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( n2(A)
| ~ p1(B,C,A) )
| n2(a)
| ~ p1(a,b,a) ),
inference(modus_ponens,[status(thm)],[70,69]) ).
tff(72,plain,
n2(a),
inference(unit_resolution,[status(thm)],[71,68,31]) ).
tff(73,plain,
( ( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(a)
| ~ n2(a)
| p3(a,a,a) )
<=> ( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(a)
| ~ n2(a)
| p3(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(74,plain,
( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(a)
| ~ n2(a)
| p3(a,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(75,plain,
( ~ ! [H: $i] :
( ~ k1(H)
| ~ n2(H)
| p3(H,H,H) )
| ~ k1(a)
| ~ n2(a)
| p3(a,a,a) ),
inference(modus_ponens,[status(thm)],[74,73]) ).
tff(76,plain,
p3(a,a,a),
inference(unit_resolution,[status(thm)],[75,72,24,14]) ).
tff(77,plain,
^ [X: $i] :
refl(
( ~ p3(X,X,a)
<=> ~ p3(X,X,a) )),
inference(bind,[status(th)],]) ).
tff(78,plain,
( ! [X: $i] : ~ p3(X,X,a)
<=> ! [X: $i] : ~ p3(X,X,a) ),
inference(quant_intro,[status(thm)],[77]) ).
tff(79,plain,
( ! [X: $i] : ~ p3(X,X,a)
<=> ! [X: $i] : ~ p3(X,X,a) ),
inference(rewrite,[status(thm)],]) ).
tff(80,axiom,
! [X: $i] : ~ p3(X,X,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(81,plain,
! [X: $i] : ~ p3(X,X,a),
inference(modus_ponens,[status(thm)],[80,79]) ).
tff(82,plain,
! [X: $i] : ~ p3(X,X,a),
inference(skolemize,[status(sab)],[81]) ).
tff(83,plain,
! [X: $i] : ~ p3(X,X,a),
inference(modus_ponens,[status(thm)],[82,78]) ).
tff(84,plain,
( ~ ! [X: $i] : ~ p3(X,X,a)
| ~ p3(a,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(85,plain,
$false,
inference(unit_resolution,[status(thm)],[84,83,76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN265-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n014.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:19:29 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.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------