TSTP Solution File: SWV386+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SWV386+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n029.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 15:11:34 EDT 2022

% Result   : Theorem 0.21s 0.41s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV386+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n029.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 : Sun Sep  4 02:59:00 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35  Usage: tptp [options] [-file:]file
% 0.13/0.35    -h, -?       prints this message.
% 0.13/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.35    -m, -model   generate model.
% 0.13/0.35    -p, -proof   generate proof.
% 0.13/0.35    -c, -core    generate unsat core of named formulas.
% 0.13/0.35    -st, -statistics display statistics.
% 0.13/0.35    -t:timeout   set timeout (in second).
% 0.13/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35    -<param>:<value> configuration parameter and value.
% 0.13/0.35    -o:<output-file> file to place output in.
% 0.21/0.41  % SZS status Theorem
% 0.21/0.41  % SZS output start Proof
% 0.21/0.41  tff(check_cpq_type, type, (
% 0.21/0.41     check_cpq: $i > $o)).
% 0.21/0.41  tff(insert_cpq_type, type, (
% 0.21/0.41     insert_cpq: ( $i * $i ) > $i)).
% 0.21/0.41  tff(triple_type, type, (
% 0.21/0.41     triple: ( $i * $i * $i ) > $i)).
% 0.21/0.41  tff(tptp_fun_W_0_type, type, (
% 0.21/0.41     tptp_fun_W_0: $i)).
% 0.21/0.41  tff(tptp_fun_V_1_type, type, (
% 0.21/0.41     tptp_fun_V_1: $i)).
% 0.21/0.41  tff(tptp_fun_U_2_type, type, (
% 0.21/0.41     tptp_fun_U_2: $i)).
% 0.21/0.41  tff(ok_type, type, (
% 0.21/0.41     ok: $i > $o)).
% 0.21/0.41  tff(tptp_fun_X_3_type, type, (
% 0.21/0.41     tptp_fun_X_3: $i)).
% 0.21/0.41  tff(1,plain,
% 0.21/0.41      ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))) <=> (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X))))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(2,plain,
% 0.21/0.41      ((~![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))) <=> (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X))))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(3,axiom,(~![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l22_co')).
% 0.21/0.41  tff(4,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[3, 2])).
% 0.21/0.41  tff(5,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[4, 1])).
% 0.21/0.41  tff(6,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[5, 1])).
% 0.21/0.41  tff(7,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[6, 1])).
% 0.21/0.41  tff(8,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[7, 1])).
% 0.21/0.41  tff(9,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[8, 1])).
% 0.21/0.41  tff(10,plain,
% 0.21/0.41      (~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : ((~check_cpq(insert_cpq(triple(U, V, W), X))) | (~ok(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[9, 1])).
% 0.21/0.41  tff(11,plain,
% 0.21/0.41      (~check_cpq(triple(U!2, V!1, W!0))),
% 0.21/0.41      inference(and_elim,[status(thm)],[10])).
% 0.21/0.41  tff(12,plain,
% 0.21/0.41      (^[U: $i, V: $i, W: $i] : refl((check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(13,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[12])).
% 0.21/0.41  tff(14,plain,
% 0.21/0.41      (^[U: $i, V: $i, W: $i] : rewrite((check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(15,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[14])).
% 0.21/0.41  tff(16,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(transitivity,[status(thm)],[15, 13])).
% 0.21/0.41  tff(17,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(18,plain,
% 0.21/0.41      (^[U: $i, V: $i, W: $i] : rewrite(((~check_cpq(triple(U, V, W))) => ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(19,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X)))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[18])).
% 0.21/0.41  tff(20,axiom,(![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l22_l26')).
% 0.21/0.41  tff(21,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[20, 19])).
% 0.21/0.41  tff(22,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[21, 17])).
% 0.21/0.41  tff(23,plain,(
% 0.21/0.41      ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(skolemize,[status(sab)],[22])).
% 0.21/0.41  tff(24,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[23, 16])).
% 0.21/0.41  tff(25,plain,
% 0.21/0.41      (((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))) | (check_cpq(triple(U!2, V!1, W!0)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X))))) <=> ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))) | check_cpq(triple(U!2, V!1, W!0)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(26,plain,
% 0.21/0.41      ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))) | (check_cpq(triple(U!2, V!1, W!0)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X))))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(27,plain,
% 0.21/0.41      ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U, V, W), X))))) | check_cpq(triple(U!2, V!1, W!0)) | ![X: $i] : (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[26, 25])).
% 0.21/0.41  tff(28,plain,
% 0.21/0.41      (![X: $i] : (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X)))),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[27, 24, 11])).
% 0.21/0.41  tff(29,plain,
% 0.21/0.41      (~((~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X!3))) | (~ok(insert_cpq(triple(U!2, V!1, W!0), X!3))))),
% 0.21/0.41      inference(and_elim,[status(thm)],[10])).
% 0.21/0.41  tff(30,plain,
% 0.21/0.41      (check_cpq(insert_cpq(triple(U!2, V!1, W!0), X!3))),
% 0.21/0.41      inference(or_elim,[status(thm)],[29])).
% 0.21/0.41  tff(31,plain,
% 0.21/0.41      ((~![X: $i] : (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X)))) | (~check_cpq(insert_cpq(triple(U!2, V!1, W!0), X!3)))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(32,plain,
% 0.21/0.41      ($false),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[31, 30, 28])).
% 0.21/0.41  % SZS output end Proof
%------------------------------------------------------------------------------