TSTP Solution File: SYN153-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN153-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n012.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:58 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 28
% Syntax : Number of formulae : 55 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 151 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 184 ( 83 ~; 76 |; 0 &)
% ( 25 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 2 ( 2 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 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 : 65 ( 60 !; 0 ?; 65 :)
% Comments :
%------------------------------------------------------------------------------
tff(n3_type,type,
n3: $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,
( ~ n3(a)
<=> ~ n3(a) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
~ n3(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(3,plain,
~ n3(a),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [D: $i,E: $i,F: $i] :
refl(
( ( n3(D)
| ~ p2(E,F,D) )
<=> ( n3(D)
| ~ p2(E,F,D) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) )
<=> ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) )
<=> ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) ) ),
inference(rewrite,[status(thm)],]) ).
tff(7,axiom,
! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_240) ).
tff(8,plain,
! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) ),
inference(modus_ponens,[status(thm)],[7,6]) ).
tff(9,plain,
! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) ),
inference(modus_ponens,[status(thm)],[9,5]) ).
tff(11,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(12,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)],[11]) ).
tff(13,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(14,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(15,plain,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
inference(modus_ponens,[status(thm)],[14,13]) ).
tff(16,plain,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
inference(skolemize,[status(sab)],[15]) ).
tff(17,plain,
! [D: $i,E: $i] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
inference(modus_ponens,[status(thm)],[16,12]) ).
tff(18,plain,
( m1(a,a,a)
<=> m1(a,a,a) ),
inference(rewrite,[status(thm)],]) ).
tff(19,plain,
( ( m1(a,a,a)
| $false
| $false )
<=> m1(a,a,a) ),
inference(rewrite,[status(thm)],]) ).
tff(20,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(21,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
tff(22,plain,
( l0(a)
<=> $true ),
inference(iff_true,[status(thm)],[21]) ).
tff(23,plain,
( ~ l0(a)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[22]) ).
tff(24,plain,
( ~ l0(a)
<=> $false ),
inference(transitivity,[status(thm)],[23,20]) ).
tff(25,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
tff(26,plain,
( s0(d)
<=> $true ),
inference(iff_true,[status(thm)],[25]) ).
tff(27,plain,
( ~ s0(d)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[26]) ).
tff(28,plain,
( ~ s0(d)
<=> $false ),
inference(transitivity,[status(thm)],[27,20]) ).
tff(29,plain,
( ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) )
<=> ( m1(a,a,a)
| $false
| $false ) ),
inference(monotonicity,[status(thm)],[28,24]) ).
tff(30,plain,
( ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) )
<=> m1(a,a,a) ),
inference(transitivity,[status(thm)],[29,19]) ).
tff(31,plain,
( ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) )
<=> ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(32,plain,
( ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) )
<=> ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(33,plain,
( ( m1(a,a,a)
| ~ l0(a) )
<=> ( m1(a,a,a)
| ~ l0(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(34,plain,
( ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) )
<=> ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) ) ),
inference(monotonicity,[status(thm)],[33]) ).
tff(35,plain,
( ( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) )
<=> ( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ) ),
inference(transitivity,[status(thm)],[34,32]) ).
tff(36,axiom,
( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_023) ).
tff(37,plain,
( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ),
inference(modus_ponens,[status(thm)],[36,35]) ).
tff(38,plain,
( m1(a,a,a)
| ~ s0(d)
| ~ l0(a) ),
inference(modus_ponens,[status(thm)],[37,31]) ).
tff(39,plain,
m1(a,a,a),
inference(modus_ponens,[status(thm)],[38,30]) ).
tff(40,plain,
m1(a,a,a),
inference(modus_ponens,[status(thm)],[39,18]) ).
tff(41,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(42,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(43,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)],[42,41]) ).
tff(44,plain,
p2(a,a,a),
inference(unit_resolution,[status(thm)],[43,40,17]) ).
tff(45,plain,
( ( ~ ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) )
| n3(a)
| ~ p2(a,a,a) )
<=> ( ~ ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) )
| n3(a)
| ~ p2(a,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(46,plain,
( ~ ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) )
| n3(a)
| ~ p2(a,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(47,plain,
( ~ ! [D: $i,E: $i,F: $i] :
( n3(D)
| ~ p2(E,F,D) )
| n3(a)
| ~ p2(a,a,a) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
$false,
inference(unit_resolution,[status(thm)],[47,44,10,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN153-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35 % Computer : n012.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 01:57:33 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.20/0.51 % SZS status Unsatisfiable
% 0.20/0.51 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------