TSTP Solution File: SYN231-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN231-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n022.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:18 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 38
% Syntax : Number of formulae : 77 ( 19 unt; 8 typ; 0 def)
% Number of atoms : 259 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 335 ( 157 ~; 143 |; 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 : 15 ( 6 >; 9 *; 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(d_type,type,
d: $i ).
tff(p1_type,type,
p1: ( $i * $i * $i ) > $o ).
tff(p0_type,type,
p0: ( $i * $i ) > $o ).
tff(b_type,type,
b: $i ).
tff(p2_type,type,
p2: ( $i * $i * $i ) > $o ).
tff(n1_type,type,
n1: ( $i * $i * $i ) > $o ).
tff(q0_type,type,
q0: ( $i * $i ) > $o ).
tff(1,plain,
^ [X: $i] :
refl(
( ~ l3(d,X)
<=> ~ l3(d,X) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X: $i] : ~ l3(d,X)
<=> ! [X: $i] : ~ l3(d,X) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] : ~ l3(d,X)
<=> ! [X: $i] : ~ l3(d,X) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [X: $i] : ~ l3(d,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(5,plain,
! [X: $i] : ~ l3(d,X),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [X: $i] : ~ l3(d,X),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [X: $i] : ~ l3(d,X),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,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(9,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)],[8]) ).
tff(10,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(11,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(12,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)],[11]) ).
tff(13,axiom,
! [B: $i,C: $i] :
( p1(B,B,B)
| ~ p0(C,B) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
tff(14,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[14,10]) ).
tff(16,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(skolemize,[status(sab)],[15]) ).
tff(17,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
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/sandbox2/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,B) )
| ~ p0(b,d)
| p1(d,d,d) )
<=> ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(b,d)
| p1(d,d,d) ) ),
inference(rewrite,[status(thm)],]) ).
tff(22,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(b,d)
| p1(d,d,d) ),
inference(quant_inst,[status(thm)],]) ).
tff(23,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(b,d)
| p1(d,d,d) ),
inference(modus_ponens,[status(thm)],[22,21]) ).
tff(24,plain,
p1(d,d,d),
inference(unit_resolution,[status(thm)],[23,20,17]) ).
tff(25,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(26,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)],[25]) ).
tff(27,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(28,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(29,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)],[28]) ).
tff(30,axiom,
! [D: $i,E: $i,F: $i] :
( l3(D,D)
| ~ p1(D,D,E)
| ~ p2(E,F,D) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_216) ).
tff(31,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(modus_ponens,[status(thm)],[30,29]) ).
tff(32,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(modus_ponens,[status(thm)],[31,27]) ).
tff(33,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(skolemize,[status(sab)],[32]) ).
tff(34,plain,
! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) ),
inference(modus_ponens,[status(thm)],[33,26]) ).
tff(35,plain,
^ [B: $i] :
refl(
( ( p2(B,B,B)
| ~ n1(d,d,B) )
<=> ( p2(B,B,B)
| ~ n1(d,d,B) ) )),
inference(bind,[status(th)],]) ).
tff(36,plain,
( ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) )
<=> ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) ) ),
inference(quant_intro,[status(thm)],[35]) ).
tff(37,plain,
( ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) )
<=> ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) ) ),
inference(rewrite,[status(thm)],]) ).
tff(38,axiom,
! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_153) ).
tff(39,plain,
! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) ),
inference(modus_ponens,[status(thm)],[38,37]) ).
tff(40,plain,
! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) ),
inference(skolemize,[status(sab)],[39]) ).
tff(41,plain,
! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) ),
inference(modus_ponens,[status(thm)],[40,36]) ).
tff(42,plain,
( n1(d,d,d)
<=> n1(d,d,d) ),
inference(rewrite,[status(thm)],]) ).
tff(43,plain,
( ( n1(d,d,d)
| $false )
<=> n1(d,d,d) ),
inference(rewrite,[status(thm)],]) ).
tff(44,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(45,axiom,
q0(d,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_25) ).
tff(46,plain,
( q0(d,d)
<=> $true ),
inference(iff_true,[status(thm)],[45]) ).
tff(47,plain,
( ~ q0(d,d)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[46]) ).
tff(48,plain,
( ~ q0(d,d)
<=> $false ),
inference(transitivity,[status(thm)],[47,44]) ).
tff(49,plain,
( ( n1(d,d,d)
| ~ q0(d,d) )
<=> ( n1(d,d,d)
| $false ) ),
inference(monotonicity,[status(thm)],[48]) ).
tff(50,plain,
( ( n1(d,d,d)
| ~ q0(d,d) )
<=> n1(d,d,d) ),
inference(transitivity,[status(thm)],[49,43]) ).
tff(51,plain,
( ( n1(d,d,d)
| ~ q0(d,d) )
<=> ( n1(d,d,d)
| ~ q0(d,d) ) ),
inference(rewrite,[status(thm)],]) ).
tff(52,axiom,
( n1(d,d,d)
| ~ q0(d,d) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_045) ).
tff(53,plain,
( n1(d,d,d)
| ~ q0(d,d) ),
inference(modus_ponens,[status(thm)],[52,51]) ).
tff(54,plain,
( n1(d,d,d)
| ~ q0(d,d) ),
inference(modus_ponens,[status(thm)],[53,51]) ).
tff(55,plain,
n1(d,d,d),
inference(modus_ponens,[status(thm)],[54,50]) ).
tff(56,plain,
n1(d,d,d),
inference(modus_ponens,[status(thm)],[55,42]) ).
tff(57,plain,
( ( ~ ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) )
| p2(d,d,d)
| ~ n1(d,d,d) )
<=> ( ~ ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) )
| p2(d,d,d)
| ~ n1(d,d,d) ) ),
inference(rewrite,[status(thm)],]) ).
tff(58,plain,
( ~ ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) )
| p2(d,d,d)
| ~ n1(d,d,d) ),
inference(quant_inst,[status(thm)],]) ).
tff(59,plain,
( ~ ! [B: $i] :
( p2(B,B,B)
| ~ n1(d,d,B) )
| p2(d,d,d)
| ~ n1(d,d,d) ),
inference(modus_ponens,[status(thm)],[58,57]) ).
tff(60,plain,
p2(d,d,d),
inference(unit_resolution,[status(thm)],[59,56,41]) ).
tff(61,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| l3(d,d)
| ~ p1(d,d,d)
| ~ p2(d,d,d) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| l3(d,d)
| ~ p1(d,d,d)
| ~ p2(d,d,d) ) ),
inference(rewrite,[status(thm)],]) ).
tff(62,plain,
( ( ~ p2(d,d,d)
| ~ p1(d,d,d)
| l3(d,d) )
<=> ( l3(d,d)
| ~ p1(d,d,d)
| ~ p2(d,d,d) ) ),
inference(rewrite,[status(thm)],]) ).
tff(63,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p2(d,d,d)
| ~ p1(d,d,d)
| l3(d,d) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| l3(d,d)
| ~ p1(d,d,d)
| ~ p2(d,d,d) ) ),
inference(monotonicity,[status(thm)],[62]) ).
tff(64,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p2(d,d,d)
| ~ p1(d,d,d)
| l3(d,d) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| l3(d,d)
| ~ p1(d,d,d)
| ~ p2(d,d,d) ) ),
inference(transitivity,[status(thm)],[63,61]) ).
tff(65,plain,
( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| ~ p2(d,d,d)
| ~ p1(d,d,d)
| l3(d,d) ),
inference(quant_inst,[status(thm)],]) ).
tff(66,plain,
( ~ ! [D: $i,E: $i,F: $i] :
( ~ p2(E,F,D)
| ~ p1(D,D,E)
| l3(D,D) )
| l3(d,d)
| ~ p1(d,d,d)
| ~ p2(d,d,d) ),
inference(modus_ponens,[status(thm)],[65,64]) ).
tff(67,plain,
l3(d,d),
inference(unit_resolution,[status(thm)],[66,60,34,24]) ).
tff(68,plain,
( ~ ! [X: $i] : ~ l3(d,X)
| ~ l3(d,d) ),
inference(quant_inst,[status(thm)],]) ).
tff(69,plain,
$false,
inference(unit_resolution,[status(thm)],[68,67,7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN231-1 : TPTP v8.1.0. Released v1.1.0.
% 0.13/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n022.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:14:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------