TSTP Solution File: SYN292-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN292-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n003.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:33 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 7 unt; 4 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 66 ( 31 ~; 27 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 34 ( 30 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
tff(q1_type,type,
q1: ( $i * $i * $i ) > $o ).
tff(b_type,type,
b: $i ).
tff(d_type,type,
d: $i ).
tff(p0_type,type,
p0: ( $i * $i ) > $o ).
tff(1,plain,
( ~ q1(d,b,b)
<=> ~ q1(d,b,b) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
~ q1(d,b,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(3,plain,
~ q1(d,b,b),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [F: $i,G: $i] :
refl(
( ( ~ p0(G,F)
| q1(F,G,G) )
<=> ( ~ p0(G,F)
| q1(F,G,G) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) )
<=> ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) )
<=> ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ) ),
inference(rewrite,[status(thm)],]) ).
tff(7,plain,
^ [F: $i,G: $i] :
rewrite(
( ( q1(F,G,G)
| ~ p0(G,F) )
<=> ( ~ p0(G,F)
| q1(F,G,G) ) )),
inference(bind,[status(th)],]) ).
tff(8,plain,
( ! [F: $i,G: $i] :
( q1(F,G,G)
| ~ p0(G,F) )
<=> ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ) ),
inference(quant_intro,[status(thm)],[7]) ).
tff(9,axiom,
! [F: $i,G: $i] :
( q1(F,G,G)
| ~ p0(G,F) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_095) ).
tff(10,plain,
! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ),
inference(modus_ponens,[status(thm)],[10,6]) ).
tff(12,plain,
! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) ),
inference(modus_ponens,[status(thm)],[12,5]) ).
tff(14,plain,
( p0(b,d)
<=> p0(b,d) ),
inference(rewrite,[status(thm)],]) ).
tff(15,axiom,
p0(b,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_10) ).
tff(16,plain,
p0(b,d),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
( ( ~ ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) )
| ~ p0(b,d)
| q1(d,b,b) )
<=> ( ~ ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) )
| ~ p0(b,d)
| q1(d,b,b) ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,plain,
( ~ ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) )
| ~ p0(b,d)
| q1(d,b,b) ),
inference(quant_inst,[status(thm)],]) ).
tff(19,plain,
( ~ ! [F: $i,G: $i] :
( ~ p0(G,F)
| q1(F,G,G) )
| ~ p0(b,d)
| q1(d,b,b) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
$false,
inference(unit_resolution,[status(thm)],[19,16,13,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN292-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Sep 5 02:23:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.35 Usage: tptp [options] [-file:]file
% 0.12/0.35 -h, -? prints this message.
% 0.12/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.35 -m, -model generate model.
% 0.12/0.35 -p, -proof generate proof.
% 0.12/0.35 -c, -core generate unsat core of named formulas.
% 0.12/0.35 -st, -statistics display statistics.
% 0.12/0.35 -t:timeout set timeout (in second).
% 0.12/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.35 -<param>:<value> configuration parameter and value.
% 0.12/0.35 -o:<output-file> file to place output in.
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------