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

View Problem - Process Solution

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

% Computer : n004.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:35 EDT 2022

% Result   : Theorem 0.19s 0.40s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV388+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Sun Sep  4 02:46:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34  Usage: tptp [options] [-file:]file
% 0.12/0.34    -h, -?       prints this message.
% 0.12/0.34    -smt2        print SMT-LIB2 benchmark.
% 0.12/0.34    -m, -model   generate model.
% 0.12/0.34    -p, -proof   generate proof.
% 0.12/0.34    -c, -core    generate unsat core of named formulas.
% 0.12/0.34    -st, -statistics display statistics.
% 0.12/0.34    -t:timeout   set timeout (in second).
% 0.12/0.34    -smt2status  display status in smt2 format instead of SZS.
% 0.12/0.34    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34    -<param>:<value> configuration parameter and value.
% 0.12/0.34    -o:<output-file> file to place output in.
% 0.19/0.40  % SZS status Theorem
% 0.19/0.40  % SZS output start Proof
% 0.19/0.40  tff(check_cpq_type, type, (
% 0.19/0.40     check_cpq: $i > $o)).
% 0.19/0.40  tff(triple_type, type, (
% 0.19/0.40     triple: ( $i * $i * $i ) > $i)).
% 0.19/0.40  tff(tptp_fun_W_0_type, type, (
% 0.19/0.40     tptp_fun_W_0: $i)).
% 0.19/0.40  tff(tptp_fun_V_1_type, type, (
% 0.19/0.40     tptp_fun_V_1: $i)).
% 0.19/0.40  tff(tptp_fun_U_2_type, type, (
% 0.19/0.40     tptp_fun_U_2: $i)).
% 0.19/0.40  tff(ok_type, type, (
% 0.19/0.40     ok: $i > $o)).
% 0.19/0.40  tff(findmin_cpq_eff_type, type, (
% 0.19/0.40     findmin_cpq_eff: $i > $i)).
% 0.19/0.40  tff(1,plain,
% 0.19/0.40      ((~((~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | check_cpq(triple(U!2, V!1, W!0)) | (~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))))) <=> (~((~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | check_cpq(triple(U!2, V!1, W!0)) | (~ok(findmin_cpq_eff(triple(U!2, V!1, W!0))))))),
% 0.19/0.40      inference(rewrite,[status(thm)],[])).
% 0.19/0.40  tff(2,plain,
% 0.19/0.40      ((~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))) <=> (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W))))))),
% 0.19/0.40      inference(rewrite,[status(thm)],[])).
% 0.19/0.40  tff(3,plain,
% 0.19/0.40      ((~![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | (~ok(findmin_cpq_eff(triple(U, V, W))))))) <=> (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W))))))),
% 0.19/0.40      inference(rewrite,[status(thm)],[])).
% 0.19/0.40  tff(4,axiom,(~![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | (~ok(findmin_cpq_eff(triple(U, V, W))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','l24_co')).
% 0.19/0.40  tff(5,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[4, 3])).
% 0.19/0.40  tff(6,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[5, 2])).
% 0.19/0.40  tff(7,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[6, 2])).
% 0.19/0.40  tff(8,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[7, 2])).
% 0.19/0.40  tff(9,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[8, 2])).
% 0.19/0.40  tff(10,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[9, 2])).
% 0.19/0.40  tff(11,plain,
% 0.19/0.40      (~![U: $i, V: $i, W: $i] : ((~check_cpq(findmin_cpq_eff(triple(U, V, W)))) | check_cpq(triple(U, V, W)) | (~ok(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[10, 2])).
% 0.19/0.40  tff(12,plain,(
% 0.19/0.40      ~((~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | check_cpq(triple(U!2, V!1, W!0)) | (~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))))),
% 0.19/0.40      inference(skolemize,[status(sab)],[11])).
% 0.19/0.40  tff(13,plain,
% 0.19/0.40      (~((~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | check_cpq(triple(U!2, V!1, W!0)) | (~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[12, 1])).
% 0.19/0.40  tff(14,plain,
% 0.19/0.40      (~check_cpq(triple(U!2, V!1, W!0))),
% 0.19/0.40      inference(or_elim,[status(thm)],[13])).
% 0.19/0.40  tff(15,plain,
% 0.19/0.40      (check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))),
% 0.19/0.40      inference(or_elim,[status(thm)],[13])).
% 0.19/0.40  tff(16,plain,
% 0.19/0.40      (^[U: $i, V: $i, W: $i] : refl((check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W))))) <=> (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W))))))),
% 0.19/0.40      inference(bind,[status(th)],[])).
% 0.19/0.40  tff(17,plain,
% 0.19/0.40      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W))))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(quant_intro,[status(thm)],[16])).
% 0.19/0.40  tff(18,plain,
% 0.19/0.40      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W))))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(rewrite,[status(thm)],[])).
% 0.19/0.40  tff(19,plain,
% 0.19/0.40      (^[U: $i, V: $i, W: $i] : rewrite(((~check_cpq(triple(U, V, W))) => (~check_cpq(findmin_cpq_eff(triple(U, V, W))))) <=> (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W))))))),
% 0.19/0.40      inference(bind,[status(th)],[])).
% 0.19/0.40  tff(20,plain,
% 0.19/0.40      (![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => (~check_cpq(findmin_cpq_eff(triple(U, V, W))))) <=> ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(quant_intro,[status(thm)],[19])).
% 0.19/0.40  tff(21,axiom,(![U: $i, V: $i, W: $i] : ((~check_cpq(triple(U, V, W))) => (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','l24_l34')).
% 0.19/0.40  tff(22,plain,
% 0.19/0.40      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[21, 20])).
% 0.19/0.40  tff(23,plain,
% 0.19/0.40      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[22, 18])).
% 0.19/0.40  tff(24,plain,(
% 0.19/0.40      ![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(skolemize,[status(sab)],[23])).
% 0.19/0.40  tff(25,plain,
% 0.19/0.40      (![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[24, 17])).
% 0.19/0.40  tff(26,plain,
% 0.19/0.40      (((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))) | (check_cpq(triple(U!2, V!1, W!0)) | (~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))))) <=> ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))) | check_cpq(triple(U!2, V!1, W!0)) | (~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))))),
% 0.19/0.40      inference(rewrite,[status(thm)],[])).
% 0.19/0.40  tff(27,plain,
% 0.19/0.40      ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))) | (check_cpq(triple(U!2, V!1, W!0)) | (~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0)))))),
% 0.19/0.40      inference(quant_inst,[status(thm)],[])).
% 0.19/0.40  tff(28,plain,
% 0.19/0.40      ((~![U: $i, V: $i, W: $i] : (check_cpq(triple(U, V, W)) | (~check_cpq(findmin_cpq_eff(triple(U, V, W)))))) | check_cpq(triple(U!2, V!1, W!0)) | (~check_cpq(findmin_cpq_eff(triple(U!2, V!1, W!0))))),
% 0.19/0.40      inference(modus_ponens,[status(thm)],[27, 26])).
% 0.19/0.40  tff(29,plain,
% 0.19/0.40      ($false),
% 0.19/0.40      inference(unit_resolution,[status(thm)],[28, 25, 15, 14])).
% 0.19/0.40  % SZS output end Proof
%------------------------------------------------------------------------------