TSTP Solution File: SYN220-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN220-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n023.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:15 EDT 2022
% Result : Unsatisfiable 0.21s 0.50s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 38
% Syntax : Number of formulae : 76 ( 19 unt; 8 typ; 0 def)
% Number of atoms : 257 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 333 ( 156 ~; 142 |; 0 &)
% ( 35 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 12 ( 12 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 120 ( 108 !; 0 ?; 120 :)
% Comments :
%------------------------------------------------------------------------------
tff(l3_type,type,
l3: ( $i * $i ) > $o ).
tff(b_type,type,
b: $i ).
tff(p2_type,type,
p2: ( $i * $i * $i ) > $o ).
tff(q1_type,type,
q1: ( $i * $i * $i ) > $o ).
tff(r0_type,type,
r0: $i > $o ).
tff(p1_type,type,
p1: ( $i * $i * $i ) > $o ).
tff(p0_type,type,
p0: ( $i * $i ) > $o ).
tff(c_type,type,
c: $i ).
tff(1,plain,
^ [A: $i] :
refl(
( ( p2(A,A,A)
| ~ q1(A,A,A) )
<=> ( p2(A,A,A)
| ~ q1(A,A,A) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) )
<=> ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) )
<=> ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_154) ).
tff(5,plain,
! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( q1(b,b,b)
<=> q1(b,b,b) ),
inference(rewrite,[status(thm)],]) ).
tff(9,plain,
( ( $false
| q1(b,b,b) )
<=> q1(b,b,b) ),
inference(rewrite,[status(thm)],]) ).
tff(10,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
tff(12,plain,
( r0(b)
<=> $true ),
inference(iff_true,[status(thm)],[11]) ).
tff(13,plain,
( ~ r0(b)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[12]) ).
tff(14,plain,
( ~ r0(b)
<=> $false ),
inference(transitivity,[status(thm)],[13,10]) ).
tff(15,plain,
( ( ~ r0(b)
| q1(b,b,b) )
<=> ( $false
| q1(b,b,b) ) ),
inference(monotonicity,[status(thm)],[14]) ).
tff(16,plain,
( ( ~ r0(b)
| q1(b,b,b) )
<=> q1(b,b,b) ),
inference(transitivity,[status(thm)],[15,9]) ).
tff(17,plain,
( ( q1(b,b,b)
| ~ r0(b) )
<=> ( ~ r0(b)
| q1(b,b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,axiom,
( q1(b,b,b)
| ~ r0(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_120) ).
tff(19,plain,
( ~ r0(b)
| q1(b,b,b) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
q1(b,b,b),
inference(modus_ponens,[status(thm)],[19,16]) ).
tff(21,plain,
q1(b,b,b),
inference(modus_ponens,[status(thm)],[20,8]) ).
tff(22,plain,
( ( ~ ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) )
| p2(b,b,b)
| ~ q1(b,b,b) )
<=> ( ~ ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) )
| p2(b,b,b)
| ~ q1(b,b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(23,plain,
( ~ ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) )
| p2(b,b,b)
| ~ q1(b,b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(24,plain,
( ~ ! [A: $i] :
( p2(A,A,A)
| ~ q1(A,A,A) )
| p2(b,b,b)
| ~ q1(b,b,b) ),
inference(modus_ponens,[status(thm)],[23,22]) ).
tff(25,plain,
p2(b,b,b),
inference(unit_resolution,[status(thm)],[24,21,7]) ).
tff(26,plain,
^ [B: $i,C: $i] :
refl(
( ( ~ p0(C,B)
| p1(B,B,B) )
<=> ( ~ p0(C,B)
| p1(B,B,B) ) )),
inference(bind,[status(th)],]) ).
tff(27,plain,
( ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ) ),
inference(quant_intro,[status(thm)],[26]) ).
tff(28,plain,
( ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ) ),
inference(rewrite,[status(thm)],]) ).
tff(29,plain,
^ [B: $i,C: $i] :
rewrite(
( ( p1(B,B,B)
| ~ p0(C,B) )
<=> ( ~ p0(C,B)
| p1(B,B,B) ) )),
inference(bind,[status(th)],]) ).
tff(30,plain,
( ! [B: $i,C: $i] :
( p1(B,B,B)
| ~ p0(C,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,axiom,
! [B: $i,C: $i] :
( p1(B,B,B)
| ~ p0(C,B) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
tff(32,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[31,30]) ).
tff(33,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[32,28]) ).
tff(34,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(skolemize,[status(sab)],[33]) ).
tff(35,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[34,27]) ).
tff(36,plain,
( p0(c,b)
<=> p0(c,b) ),
inference(rewrite,[status(thm)],]) ).
tff(37,axiom,
p0(c,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
tff(38,plain,
p0(c,b),
inference(modus_ponens,[status(thm)],[37,36]) ).
tff(39,plain,
( ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) )
<=> ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(40,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(41,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) ),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
p1(b,b,b),
inference(unit_resolution,[status(thm)],[41,38,35]) ).
tff(43,plain,
^ [D: $i,E: $i,F: $i] :
refl(
( ( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
<=> ( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ) )),
inference(bind,[status(th)],]) ).
tff(44,plain,
( ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
<=> ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ) ),
inference(quant_intro,[status(thm)],[43]) ).
tff(45,plain,
( ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
<=> ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ) ),
inference(rewrite,[status(thm)],]) ).
tff(46,plain,
^ [D: $i,E: $i,F: $i] :
trans(
monotonicity(
rewrite(
( ( l3(D,D)
| ~ p1(D,D,E) )
<=> ( ~ p1(D,D,E)
| l3(D,D) ) )),
( ( l3(D,D)
| ~ p1(D,D,E)
| ~ p2(E,F,D) )
<=> ( ~ p1(D,D,E)
| l3(D,D)
| ~ p2(E,F,D) ) )),
rewrite(
( ( ~ p1(D,D,E)
| l3(D,D)
| ~ p2(E,F,D) )
<=> ( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ) )),
( ( l3(D,D)
| ~ p1(D,D,E)
| ~ p2(E,F,D) )
<=> ( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ) )),
inference(bind,[status(th)],]) ).
tff(47,plain,
( ! [D: $i,E: $i,F: $i] :
( l3(D,D)
| ~ p1(D,D,E)
| ~ p2(E,F,D) )
<=> ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ) ),
inference(quant_intro,[status(thm)],[46]) ).
tff(48,axiom,
! [D: $i,E: $i,F: $i] :
( l3(D,D)
| ~ p1(D,D,E)
| ~ p2(E,F,D) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_216) ).
tff(49,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(modus_ponens,[status(thm)],[48,47]) ).
tff(50,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(modus_ponens,[status(thm)],[49,45]) ).
tff(51,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(skolemize,[status(sab)],[50]) ).
tff(52,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(modus_ponens,[status(thm)],[51,44]) ).
tff(53,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p1(b,b,b)
| ~ p2(b,b,b)
| l3(b,b) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p1(b,b,b)
| ~ p2(b,b,b)
| l3(b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(54,plain,
( ( ~ p2(b,b,b)
| ~ p1(b,b,b)
| l3(b,b) )
<=> ( ~ p1(b,b,b)
| ~ p2(b,b,b)
| l3(b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(55,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p2(b,b,b)
| ~ p1(b,b,b)
| l3(b,b) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p1(b,b,b)
| ~ p2(b,b,b)
| l3(b,b) ) ),
inference(monotonicity,[status(thm)],[54]) ).
tff(56,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p2(b,b,b)
| ~ p1(b,b,b)
| l3(b,b) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p1(b,b,b)
| ~ p2(b,b,b)
| l3(b,b) ) ),
inference(transitivity,[status(thm)],[55,53]) ).
tff(57,plain,
( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p2(b,b,b)
| ~ p1(b,b,b)
| l3(b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(58,plain,
( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p1(b,b,b)
| ~ p2(b,b,b)
| l3(b,b) ),
inference(modus_ponens,[status(thm)],[57,56]) ).
tff(59,plain,
l3(b,b),
inference(unit_resolution,[status(thm)],[58,52,42,25]) ).
tff(60,plain,
^ [X: $i] :
refl(
( ~ l3(X,b)
<=> ~ l3(X,b) )),
inference(bind,[status(th)],]) ).
tff(61,plain,
( ! [X: $i] : ~ l3(X,b)
<=> ! [X: $i] : ~ l3(X,b) ),
inference(quant_intro,[status(thm)],[60]) ).
tff(62,plain,
( ! [X: $i] : ~ l3(X,b)
<=> ! [X: $i] : ~ l3(X,b) ),
inference(rewrite,[status(thm)],]) ).
tff(63,axiom,
! [X: $i] : ~ l3(X,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(64,plain,
! [X: $i] : ~ l3(X,b),
inference(modus_ponens,[status(thm)],[63,62]) ).
tff(65,plain,
! [X: $i] : ~ l3(X,b),
inference(skolemize,[status(sab)],[64]) ).
tff(66,plain,
! [X: $i] : ~ l3(X,b),
inference(modus_ponens,[status(thm)],[65,61]) ).
tff(67,plain,
( ~ ! [X: $i] : ~ l3(X,b)
| ~ l3(b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(68,plain,
$false,
inference(unit_resolution,[status(thm)],[67,66,59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN220-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Sep 5 02:32:32 EDT 2022
% 0.14/0.35 % 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
%------------------------------------------------------------------------------