TSTP Solution File: SWB003+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWB003+3 : TPTP v8.1.0. Released v5.2.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 : Tue Sep 20 08:31:33 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 24 ( 15 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 21 ~; 1 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 4 ( 4 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 17 ( 5 !; 10 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(iext_type,type,
iext: ( $i * $i * $i ) > $o ).
tff(literal_plain_type,type,
literal_plain: $i > $i ).
tff(dat_str_foo_type,type,
dat_str_foo: $i ).
tff(uri_ex_s_type,type,
uri_ex_s: $i ).
tff(uri_ex_p_type,type,
uri_ex_p: $i ).
tff(1,plain,
( iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo))
<=> iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
tff(3,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [BNODE_x: $i] :
refl(
( ~ iext(uri_ex_p,uri_ex_s,BNODE_x)
<=> ~ iext(uri_ex_p,uri_ex_s,BNODE_x) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [BNODE_x: $i] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x)
<=> ! [BNODE_x: $i] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x)
<=> ~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x) ),
inference(rewrite,[status(thm)],]) ).
tff(7,axiom,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
tff(8,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[7,6]) ).
tff(9,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[8,6]) ).
tff(10,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[9,6]) ).
tff(11,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[10,6]) ).
tff(12,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[11,6]) ).
tff(13,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[12,6]) ).
tff(14,plain,
~ ? [BNODE_x: $i] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[13,6]) ).
tff(15,plain,
^ [BNODE_x: $i] : refl($oeq(~ iext(uri_ex_p,uri_ex_s,BNODE_x),~ iext(uri_ex_p,uri_ex_s,BNODE_x))),
inference(bind,[status(th)],]) ).
tff(16,plain,
! [BNODE_x: $i] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(nnf-neg,[status(sab)],[14,15]) ).
tff(17,plain,
! [BNODE_x: $i] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(modus_ponens,[status(thm)],[16,5]) ).
tff(18,plain,
( ~ ! [BNODE_x: $i] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x)
| ~ iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)) ),
inference(quant_inst,[status(thm)],]) ).
tff(19,plain,
$false,
inference(unit_resolution,[status(thm)],[18,17,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWB003+3 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 : Sat Sep 3 19:11:03 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.45 % SZS status Theorem
% 0.20/0.45 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------