TSTP Solution File: SYN228-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN228-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n026.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:17 EDT 2022
% Result : Unsatisfiable 0.19s 0.49s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 41
% Syntax : Number of formulae : 76 ( 19 unt; 10 typ; 0 def)
% Number of atoms : 287 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 377 ( 175 ~; 170 |; 0 &)
% ( 32 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 19 ( 19 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 111 ( 99 !; 0 ?; 111 :)
% Comments :
%------------------------------------------------------------------------------
tff(p2_type,type,
p2: ( $i * $i * $i ) > $o ).
tff(b_type,type,
b: $i ).
tff(e_type,type,
e: $i ).
tff(l3_type,type,
l3: ( $i * $i ) > $o ).
tff(r0_type,type,
r0: $i > $o ).
tff(n1_type,type,
n1: ( $i * $i * $i ) > $o ).
tff(k1_type,type,
k1: $i > $o ).
tff(n0_type,type,
n0: ( $i * $i ) > $o ).
tff(d_type,type,
d: $i ).
tff(m0_type,type,
m0: ( $i * $i * $i ) > $o ).
tff(1,plain,
( ~ l3(b,e)
<=> ~ l3(b,e) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
~ l3(b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(3,plain,
~ l3(b,e),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [H: $i,G: $i] :
refl(
( ( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
<=> ( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
<=> ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
<=> ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ) ),
inference(rewrite,[status(thm)],]) ).
tff(7,plain,
^ [H: $i,G: $i] :
trans(
monotonicity(
rewrite(
( ( l3(G,H)
| ~ r0(G) )
<=> ( ~ r0(G)
| l3(G,H) ) )),
( ( l3(G,H)
| ~ r0(G)
| ~ p2(G,H,G) )
<=> ( ~ r0(G)
| l3(G,H)
| ~ p2(G,H,G) ) )),
rewrite(
( ( ~ r0(G)
| l3(G,H)
| ~ p2(G,H,G) )
<=> ( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ) )),
( ( l3(G,H)
| ~ r0(G)
| ~ p2(G,H,G) )
<=> ( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ) )),
inference(bind,[status(th)],]) ).
tff(8,plain,
( ! [H: $i,G: $i] :
( l3(G,H)
| ~ r0(G)
| ~ p2(G,H,G) )
<=> ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ) ),
inference(quant_intro,[status(thm)],[7]) ).
tff(9,axiom,
! [H: $i,G: $i] :
( l3(G,H)
| ~ r0(G)
| ~ p2(G,H,G) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_215) ).
tff(10,plain,
! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ),
inference(modus_ponens,[status(thm)],[10,6]) ).
tff(12,plain,
! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) ),
inference(modus_ponens,[status(thm)],[12,5]) ).
tff(14,plain,
( r0(b)
<=> r0(b) ),
inference(rewrite,[status(thm)],]) ).
tff(15,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
tff(16,plain,
r0(b),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
( ( ~ ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
| ~ r0(b)
| ~ p2(b,e,b)
| l3(b,e) )
<=> ( ~ ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
| ~ r0(b)
| ~ p2(b,e,b)
| l3(b,e) ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,plain,
( ~ ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
| ~ r0(b)
| ~ p2(b,e,b)
| l3(b,e) ),
inference(quant_inst,[status(thm)],]) ).
tff(19,plain,
( ~ ! [H: $i,G: $i] :
( ~ r0(G)
| ~ p2(G,H,G)
| l3(G,H) )
| ~ r0(b)
| ~ p2(b,e,b)
| l3(b,e) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
~ p2(b,e,b),
inference(unit_resolution,[status(thm)],[19,16,13,3]) ).
tff(21,plain,
^ [I: $i,J: $i] :
refl(
( ( k1(I)
| ~ n0(J,I) )
<=> ( k1(I)
| ~ n0(J,I) ) )),
inference(bind,[status(th)],]) ).
tff(22,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(quant_intro,[status(thm)],[21]) ).
tff(23,plain,
( ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
<=> ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,axiom,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
tff(25,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[24,23]) ).
tff(26,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(skolemize,[status(sab)],[25]) ).
tff(27,plain,
! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) ),
inference(modus_ponens,[status(thm)],[26,22]) ).
tff(28,plain,
( n0(d,b)
<=> n0(d,b) ),
inference(rewrite,[status(thm)],]) ).
tff(29,axiom,
n0(d,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
tff(30,plain,
n0(d,b),
inference(modus_ponens,[status(thm)],[29,28]) ).
tff(31,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(32,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(33,plain,
( ~ ! [I: $i,J: $i] :
( k1(I)
| ~ n0(J,I) )
| k1(b)
| ~ n0(d,b) ),
inference(modus_ponens,[status(thm)],[32,31]) ).
tff(34,plain,
k1(b),
inference(unit_resolution,[status(thm)],[33,30,27]) ).
tff(35,plain,
^ [D: $i,C: $i] :
refl(
( ( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
<=> ( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ) )),
inference(bind,[status(th)],]) ).
tff(36,plain,
( ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
<=> ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ) ),
inference(quant_intro,[status(thm)],[35]) ).
tff(37,plain,
( ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
<=> ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ) ),
inference(rewrite,[status(thm)],]) ).
tff(38,plain,
^ [D: $i,C: $i] :
trans(
monotonicity(
rewrite(
( ( n1(C,e,e)
| ~ m0(C,D,e) )
<=> ( ~ m0(C,D,e)
| n1(C,e,e) ) )),
( ( n1(C,e,e)
| ~ m0(C,D,e)
| ~ k1(C) )
<=> ( ~ m0(C,D,e)
| n1(C,e,e)
| ~ k1(C) ) )),
rewrite(
( ( ~ m0(C,D,e)
| n1(C,e,e)
| ~ k1(C) )
<=> ( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ) )),
( ( n1(C,e,e)
| ~ m0(C,D,e)
| ~ k1(C) )
<=> ( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ) )),
inference(bind,[status(th)],]) ).
tff(39,plain,
( ! [D: $i,C: $i] :
( n1(C,e,e)
| ~ m0(C,D,e)
| ~ k1(C) )
<=> ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ) ),
inference(quant_intro,[status(thm)],[38]) ).
tff(40,axiom,
! [D: $i,C: $i] :
( n1(C,e,e)
| ~ m0(C,D,e)
| ~ k1(C) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_040) ).
tff(41,plain,
! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ),
inference(modus_ponens,[status(thm)],[41,37]) ).
tff(43,plain,
! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ),
inference(skolemize,[status(sab)],[42]) ).
tff(44,plain,
! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) ),
inference(modus_ponens,[status(thm)],[43,36]) ).
tff(45,plain,
( m0(b,b,e)
<=> m0(b,b,e) ),
inference(rewrite,[status(thm)],]) ).
tff(46,axiom,
m0(b,b,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_31) ).
tff(47,plain,
m0(b,b,e),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
( ( ~ ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
| ~ k1(b)
| ~ m0(b,b,e)
| n1(b,e,e) )
<=> ( ~ ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
| ~ k1(b)
| ~ m0(b,b,e)
| n1(b,e,e) ) ),
inference(rewrite,[status(thm)],]) ).
tff(49,plain,
( ~ ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
| ~ k1(b)
| ~ m0(b,b,e)
| n1(b,e,e) ),
inference(quant_inst,[status(thm)],]) ).
tff(50,plain,
( ~ ! [D: $i,C: $i] :
( ~ k1(C)
| ~ m0(C,D,e)
| n1(C,e,e) )
| ~ k1(b)
| ~ m0(b,b,e)
| n1(b,e,e) ),
inference(modus_ponens,[status(thm)],[49,48]) ).
tff(51,plain,
( ~ k1(b)
| n1(b,e,e) ),
inference(unit_resolution,[status(thm)],[50,47,44]) ).
tff(52,plain,
n1(b,e,e),
inference(unit_resolution,[status(thm)],[51,34]) ).
tff(53,plain,
^ [C: $i] :
refl(
( ( ~ n1(C,e,e)
| p2(C,e,C) )
<=> ( ~ n1(C,e,e)
| p2(C,e,C) ) )),
inference(bind,[status(th)],]) ).
tff(54,plain,
( ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) )
<=> ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ) ),
inference(quant_intro,[status(thm)],[53]) ).
tff(55,plain,
( ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) )
<=> ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ) ),
inference(rewrite,[status(thm)],]) ).
tff(56,plain,
^ [C: $i] :
rewrite(
( ( p2(C,e,C)
| ~ n1(C,e,e) )
<=> ( ~ n1(C,e,e)
| p2(C,e,C) ) )),
inference(bind,[status(th)],]) ).
tff(57,plain,
( ! [C: $i] :
( p2(C,e,C)
| ~ n1(C,e,e) )
<=> ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ) ),
inference(quant_intro,[status(thm)],[56]) ).
tff(58,axiom,
! [C: $i] :
( p2(C,e,C)
| ~ n1(C,e,e) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_170) ).
tff(59,plain,
! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ),
inference(modus_ponens,[status(thm)],[58,57]) ).
tff(60,plain,
! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ),
inference(modus_ponens,[status(thm)],[59,55]) ).
tff(61,plain,
! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ),
inference(skolemize,[status(sab)],[60]) ).
tff(62,plain,
! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) ),
inference(modus_ponens,[status(thm)],[61,54]) ).
tff(63,plain,
( ( ~ ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) )
| ~ n1(b,e,e)
| p2(b,e,b) )
<=> ( ~ ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) )
| ~ n1(b,e,e)
| p2(b,e,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(64,plain,
( ~ ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) )
| ~ n1(b,e,e)
| p2(b,e,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(65,plain,
( ~ ! [C: $i] :
( ~ n1(C,e,e)
| p2(C,e,C) )
| ~ n1(b,e,e)
| p2(b,e,b) ),
inference(modus_ponens,[status(thm)],[64,63]) ).
tff(66,plain,
$false,
inference(unit_resolution,[status(thm)],[65,62,52,20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN228-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 : n026.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:26:25 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.49 % SZS status Unsatisfiable
% 0.19/0.49 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------