TSTP Solution File: SYN135-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN135-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:53:53 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of formulae : 64 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 181 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 227 ( 106 ~; 91 |; 0 &)
% ( 30 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 5 >; 6 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 63 ( 58 !; 0 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
tff(m3_type,type,
m3: ( $i * $i * $i ) > $o ).
tff(a_type,type,
a: $i ).
tff(p2_type,type,
p2: ( $i * $i * $i ) > $o ).
tff(m1_type,type,
m1: ( $i * $i * $i ) > $o ).
tff(l0_type,type,
l0: $i > $o ).
tff(s0_type,type,
s0: $i > $o ).
tff(d_type,type,
d: $i ).
tff(1,plain,
^ [I: $i] :
refl(
( ( m3(I,I,I)
| ~ p2(I,I,I) )
<=> ( m3(I,I,I)
| ~ p2(I,I,I) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
<=> ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
<=> ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_238) ).
tff(5,plain,
! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
^ [D: $i,E: $i] :
refl(
( ( p2(D,E,D)
| ~ m1(E,D,E) )
<=> ( p2(D,E,D)
| ~ m1(E,D,E) ) )),
inference(bind,[status(th)],]) ).
tff(9,plain,
( ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) )
<=> ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ) ),
inference(quant_intro,[status(thm)],[8]) ).
tff(10,plain,
( ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) )
<=> ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
tff(12,plain,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
inference(skolemize,[status(sab)],[12]) ).
tff(14,plain,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
inference(modus_ponens,[status(thm)],[13,9]) ).
tff(15,plain,
( m1(a,a,a)
<=> m1(a,a,a) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
( ( m1(a,a,a)
| $false
| $false )
<=> m1(a,a,a) ),
inference(rewrite,[status(thm)],]) ).
tff(17,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(18,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
tff(19,plain,
( l0(a)
<=> $true ),
inference(iff_true,[status(thm)],[18]) ).
tff(20,plain,
( ~ l0(a)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[19]) ).
tff(21,plain,
( ~ l0(a)
<=> $false ),
inference(transitivity,[status(thm)],[20,17]) ).
tff(22,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
tff(23,plain,
( s0(d)
<=> $true ),
inference(iff_true,[status(thm)],[22]) ).
tff(24,plain,
( ~ s0(d)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[23]) ).
tff(25,plain,
( ~ s0(d)
<=> $false ),
inference(transitivity,[status(thm)],[24,17]) ).
tff(26,plain,
( ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) )
<=> ( m1(a,a,a)
| $false
| $false ) ),
inference(monotonicity,[status(thm)],[25,21]) ).
tff(27,plain,
( ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) )
<=> m1(a,a,a) ),
inference(transitivity,[status(thm)],[26,16]) ).
tff(28,plain,
( ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) )
<=> ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(29,plain,
( ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) )
<=> ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(30,plain,
( ( m1(a,a,a)
| ~ l0(a) )
<=> ( m1(a,a,a)
| ~ l0(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(31,plain,
( ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) )
<=> ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) ) ),
inference(monotonicity,[status(thm)],[30]) ).
tff(32,plain,
( ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) )
<=> ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ) ),
inference(transitivity,[status(thm)],[31,29]) ).
tff(33,axiom,
( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_023) ).
tff(34,plain,
( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ),
inference(modus_ponens,[status(thm)],[33,32]) ).
tff(35,plain,
( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ),
inference(modus_ponens,[status(thm)],[34,28]) ).
tff(36,plain,
m1(a,a,a),
inference(modus_ponens,[status(thm)],[35,27]) ).
tff(37,plain,
m1(a,a,a),
inference(modus_ponens,[status(thm)],[36,15]) ).
tff(38,plain,
( ( ~ ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) )
| p2(a,a,a)
| ~ m1(a,a,a) )
<=> ( ~ ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) )
| p2(a,a,a)
| ~ m1(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(39,plain,
( ~ ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) )
| p2(a,a,a)
| ~ m1(a,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(40,plain,
( ~ ! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) )
| p2(a,a,a)
| ~ m1(a,a,a) ),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
p2(a,a,a),
inference(unit_resolution,[status(thm)],[40,37,14]) ).
tff(42,plain,
( ( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| ~ p2(a,a,a)
| m3(a,a,a) )
<=> ( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| ~ p2(a,a,a)
| m3(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(43,plain,
( ( m3(a,a,a)
| ~ p2(a,a,a) )
<=> ( ~ p2(a,a,a)
| m3(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(44,plain,
( ( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| m3(a,a,a)
| ~ p2(a,a,a) )
<=> ( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| ~ p2(a,a,a)
| m3(a,a,a) ) ),
inference(monotonicity,[status(thm)],[43]) ).
tff(45,plain,
( ( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| m3(a,a,a)
| ~ p2(a,a,a) )
<=> ( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| ~ p2(a,a,a)
| m3(a,a,a) ) ),
inference(transitivity,[status(thm)],[44,42]) ).
tff(46,plain,
( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| m3(a,a,a)
| ~ p2(a,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(47,plain,
( ~ ! [I: $i] :
( m3(I,I,I)
| ~ p2(I,I,I) )
| ~ p2(a,a,a)
| m3(a,a,a) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
m3(a,a,a),
inference(unit_resolution,[status(thm)],[47,41,7]) ).
tff(49,plain,
^ [Y: $i,X: $i] :
refl(
( ~ m3(X,Y,a)
<=> ~ m3(X,Y,a) )),
inference(bind,[status(th)],]) ).
tff(50,plain,
( ! [Y: $i,X: $i] : ~ m3(X,Y,a)
<=> ! [Y: $i,X: $i] : ~ m3(X,Y,a) ),
inference(quant_intro,[status(thm)],[49]) ).
tff(51,plain,
( ! [Y: $i,X: $i] : ~ m3(X,Y,a)
<=> ! [Y: $i,X: $i] : ~ m3(X,Y,a) ),
inference(rewrite,[status(thm)],]) ).
tff(52,axiom,
! [Y: $i,X: $i] : ~ m3(X,Y,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(53,plain,
! [Y: $i,X: $i] : ~ m3(X,Y,a),
inference(modus_ponens,[status(thm)],[52,51]) ).
tff(54,plain,
! [Y: $i,X: $i] : ~ m3(X,Y,a),
inference(skolemize,[status(sab)],[53]) ).
tff(55,plain,
! [Y: $i,X: $i] : ~ m3(X,Y,a),
inference(modus_ponens,[status(thm)],[54,50]) ).
tff(56,plain,
( ~ ! [Y: $i,X: $i] : ~ m3(X,Y,a)
| ~ m3(a,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(57,plain,
$false,
inference(unit_resolution,[status(thm)],[56,55,48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN135-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 : 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 01:55: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.19/0.48 % SZS status Unsatisfiable
% 0.19/0.48 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------