TSTP Solution File: SWV373+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n002.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:31 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35 % Computer : n002.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 : Sun Sep 4 02:56:02 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.36 Usage: tptp [options] [-file:]file
% 0.14/0.36 -h, -? prints this message.
% 0.14/0.36 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.36 -m, -model generate model.
% 0.14/0.36 -p, -proof generate proof.
% 0.14/0.36 -c, -core generate unsat core of named formulas.
% 0.14/0.36 -st, -statistics display statistics.
% 0.14/0.36 -t:timeout set timeout (in second).
% 0.14/0.36 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.36 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.36 -<param>:<value> configuration parameter and value.
% 0.14/0.36 -o:<output-file> file to place output in.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 % SZS output start Proof
% 0.21/0.45 tff(contains_slb_type, type, (
% 0.21/0.45 contains_slb: ( $i * $i ) > $o)).
% 0.21/0.45 tff(findmin_pqp_res_type, type, (
% 0.21/0.45 findmin_pqp_res: $i > $i)).
% 0.21/0.45 tff(tptp_fun_U_2_type, type, (
% 0.21/0.45 tptp_fun_U_2: $i)).
% 0.21/0.45 tff(tptp_fun_V_1_type, type, (
% 0.21/0.45 tptp_fun_V_1: $i)).
% 0.21/0.45 tff(findmin_cpq_res_type, type, (
% 0.21/0.45 findmin_cpq_res: $i > $i)).
% 0.21/0.45 tff(triple_type, type, (
% 0.21/0.45 triple: ( $i * $i * $i ) > $i)).
% 0.21/0.45 tff(tptp_fun_W_0_type, type, (
% 0.21/0.45 tptp_fun_W_0: $i)).
% 0.21/0.45 tff(create_slb_type, type, (
% 0.21/0.45 create_slb: $i)).
% 0.21/0.45 tff(less_than_type, type, (
% 0.21/0.45 less_than: ( $i * $i ) > $o)).
% 0.21/0.45 tff(lookup_slb_type, type, (
% 0.21/0.45 lookup_slb: ( $i * $i ) > $i)).
% 0.21/0.45 tff(ok_type, type, (
% 0.21/0.45 ok: $i > $o)).
% 0.21/0.45 tff(findmin_cpq_eff_type, type, (
% 0.21/0.45 findmin_cpq_eff: $i > $i)).
% 0.21/0.45 tff(contains_cpq_type, type, (
% 0.21/0.45 contains_cpq: ( $i * $i ) > $o)).
% 0.21/0.45 tff(1,plain,
% 0.21/0.45 ((~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))) <=> (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W)))))),
% 0.21/0.45 inference(rewrite,[status(thm)],[])).
% 0.21/0.45 tff(2,plain,
% 0.21/0.45 ((~![U: $i, V: $i, W: $i] : ((~contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W)))) => (~ok(findmin_cpq_eff(triple(U, V, W)))))) <=> (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W)))))),
% 0.21/0.45 inference(rewrite,[status(thm)],[])).
% 0.21/0.45 tff(3,axiom,(~![U: $i, V: $i, W: $i] : ((~contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W)))) => (~ok(findmin_cpq_eff(triple(U, V, W)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l9_co')).
% 0.21/0.45 tff(4,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.21/0.45 tff(5,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.21/0.45 tff(6,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.21/0.45 tff(7,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.21/0.45 tff(8,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[7, 1])).
% 0.21/0.45 tff(9,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.21/0.45 tff(10,plain,
% 0.21/0.45 (~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | contains_cpq(triple(U, V, W), findmin_cpq_res(triple(U, V, W))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[9, 1])).
% 0.21/0.45 tff(11,plain,(
% 0.21/0.45 ~((~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.45 inference(skolemize,[status(sab)],[10])).
% 0.21/0.45 tff(12,plain,
% 0.21/0.45 (ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))),
% 0.21/0.45 inference(or_elim,[status(thm)],[11])).
% 0.21/0.45 tff(13,plain,
% 0.21/0.45 (^[U: $i, V: $i, W: $i] : refl(((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))))) <=> ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))))))),
% 0.21/0.45 inference(bind,[status(th)],[])).
% 0.21/0.45 tff(14,plain,
% 0.21/0.45 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))))) <=> ![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))),
% 0.21/0.45 inference(quant_intro,[status(thm)],[13])).
% 0.21/0.45 tff(15,plain,
% 0.21/0.45 (^[U: $i, V: $i, W: $i] : rewrite(((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))))))),
% 0.21/0.45 inference(bind,[status(th)],[])).
% 0.21/0.45 tff(16,plain,
% 0.21/0.45 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> ![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))),
% 0.21/0.45 inference(quant_intro,[status(thm)],[15])).
% 0.21/0.45 tff(17,plain,
% 0.21/0.45 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> ![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))),
% 0.21/0.45 inference(rewrite,[status(thm)],[])).
% 0.21/0.45 tff(18,plain,
% 0.21/0.45 (^[U: $i, V: $i, W: $i] : trans(monotonicity(rewrite((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))) <=> ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))), ((ok(findmin_cpq_eff(triple(U, V, W))) => (((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> (ok(findmin_cpq_eff(triple(U, V, W))) => ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))))), rewrite((ok(findmin_cpq_eff(triple(U, V, W))) => ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))), ((ok(findmin_cpq_eff(triple(U, V, W))) => (((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))),
% 0.21/0.45 inference(bind,[status(th)],[])).
% 0.21/0.45 tff(19,plain,
% 0.21/0.45 (![U: $i, V: $i, W: $i] : (ok(findmin_cpq_eff(triple(U, V, W))) => (((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U)))) <=> ![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))),
% 0.21/0.45 inference(quant_intro,[status(thm)],[18])).
% 0.21/0.45 tff(20,axiom,(![U: $i, V: $i, W: $i] : (ok(findmin_cpq_eff(triple(U, V, W))) => (((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l9_l10')).
% 0.21/0.45 tff(21,plain,
% 0.21/0.45 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))),
% 0.21/0.45 inference(modus_ponens,[status(thm)],[20, 19])).
% 0.21/0.46 tff(22,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[21, 17])).
% 0.21/0.46 tff(23,plain,(
% 0.21/0.46 ![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))),
% 0.21/0.46 inference(skolemize,[status(sab)],[22])).
% 0.21/0.46 tff(24,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[23, 16])).
% 0.21/0.46 tff(25,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[24, 14])).
% 0.21/0.46 tff(26,plain,
% 0.21/0.46 (((~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))) | ((~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | (~((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))))))) <=> ((~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))) | (~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | (~((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))))))),
% 0.21/0.46 inference(rewrite,[status(thm)],[])).
% 0.21/0.46 tff(27,plain,
% 0.21/0.46 ((~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))) | ((~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | (~((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))))))),
% 0.21/0.46 inference(quant_inst,[status(thm)],[])).
% 0.21/0.46 tff(28,plain,
% 0.21/0.46 ((~![U: $i, V: $i, W: $i] : ((~ok(findmin_cpq_eff(triple(U, V, W)))) | (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~less_than(lookup_slb(V, findmin_pqp_res(U)), findmin_pqp_res(U))))))) | (~ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))) | (~((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2)))))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[27, 26])).
% 0.21/0.46 tff(29,plain,
% 0.21/0.46 (~((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))))),
% 0.21/0.46 inference(unit_resolution,[status(thm)],[28, 25, 12])).
% 0.21/0.46 tff(30,plain,
% 0.21/0.46 (((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2)))) | (~(V!1 = create_slb))),
% 0.21/0.46 inference(tautology,[status(thm)],[])).
% 0.21/0.46 tff(31,plain,
% 0.21/0.46 (~(V!1 = create_slb)),
% 0.21/0.46 inference(unit_resolution,[status(thm)],[30, 29])).
% 0.21/0.46 tff(32,plain,
% 0.21/0.46 (^[U: $i, V: $i, W: $i] : refl(((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))))),
% 0.21/0.46 inference(bind,[status(th)],[])).
% 0.21/0.46 tff(33,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(quant_intro,[status(thm)],[32])).
% 0.21/0.46 tff(34,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(rewrite,[status(thm)],[])).
% 0.21/0.46 tff(35,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i, X: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(elim_unused_vars,[status(thm)],[])).
% 0.21/0.46 tff(36,plain,
% 0.21/0.46 (^[U: $i, V: $i, W: $i, X: $i] : rewrite(((~(V = create_slb)) => (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))))),
% 0.21/0.46 inference(bind,[status(th)],[])).
% 0.21/0.46 tff(37,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i, X: $i] : ((~(V = create_slb)) => (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(quant_intro,[status(thm)],[36])).
% 0.21/0.46 tff(38,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i, X: $i] : ((~(V = create_slb)) => (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U))) <=> ![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(transitivity,[status(thm)],[37, 35])).
% 0.21/0.46 tff(39,axiom,(![U: $i, V: $i, W: $i, X: $i] : ((~(V = create_slb)) => (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax51')).
% 0.21/0.46 tff(40,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[39, 38])).
% 0.21/0.46 tff(41,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[40, 34])).
% 0.21/0.46 tff(42,plain,(
% 0.21/0.46 ![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(skolemize,[status(sab)],[41])).
% 0.21/0.46 tff(43,plain,
% 0.21/0.46 (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[42, 33])).
% 0.21/0.46 tff(44,plain,
% 0.21/0.46 (((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))) | ((V!1 = create_slb) | (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2)))) <=> ((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))) | (V!1 = create_slb) | (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2)))),
% 0.21/0.46 inference(rewrite,[status(thm)],[])).
% 0.21/0.46 tff(45,plain,
% 0.21/0.46 ((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))) | ((V!1 = create_slb) | (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2)))),
% 0.21/0.46 inference(quant_inst,[status(thm)],[])).
% 0.21/0.46 tff(46,plain,
% 0.21/0.46 ((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))) | (V!1 = create_slb) | (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2))),
% 0.21/0.46 inference(modus_ponens,[status(thm)],[45, 44])).
% 0.21/0.46 tff(47,plain,
% 0.21/0.46 ((V!1 = create_slb) | (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2))),
% 0.21/0.46 inference(unit_resolution,[status(thm)],[46, 43])).
% 0.21/0.46 tff(48,plain,
% 0.21/0.46 (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2)),
% 0.21/0.46 inference(unit_resolution,[status(thm)],[47, 31])).
% 0.21/0.46 tff(49,plain,
% 0.21/0.46 (findmin_pqp_res(U!2) = findmin_cpq_res(triple(U!2, V!1, W!0))),
% 0.21/0.46 inference(symmetry,[status(thm)],[48])).
% 0.21/0.46 tff(50,plain,
% 0.21/0.46 (contains_slb(V!1, findmin_pqp_res(U!2)) <=> contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.46 inference(monotonicity,[status(thm)],[49])).
% 0.21/0.46 tff(51,plain,
% 0.21/0.46 (contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0))) <=> contains_slb(V!1, findmin_pqp_res(U!2))),
% 0.21/0.46 inference(symmetry,[status(thm)],[50])).
% 0.21/0.46 tff(52,plain,
% 0.21/0.46 ((~contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0)))) <=> (~contains_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.46 inference(monotonicity,[status(thm)],[51])).
% 0.21/0.47 tff(53,plain,
% 0.21/0.47 (^[U: $i, V: $i, W: $i, X: $i] : refl((contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)) <=> (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)))),
% 0.21/0.47 inference(bind,[status(th)],[])).
% 0.21/0.47 tff(54,plain,
% 0.21/0.47 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.21/0.47 inference(quant_intro,[status(thm)],[53])).
% 0.21/0.47 tff(55,plain,
% 0.21/0.47 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.21/0.47 inference(rewrite,[status(thm)],[])).
% 0.21/0.47 tff(56,axiom,(![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax39')).
% 0.21/0.47 tff(57,plain,
% 0.21/0.47 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.21/0.47 inference(modus_ponens,[status(thm)],[56, 55])).
% 0.21/0.47 tff(58,plain,(
% 0.21/0.47 ![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.21/0.47 inference(skolemize,[status(sab)],[57])).
% 0.21/0.47 tff(59,plain,
% 0.21/0.47 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.21/0.47 inference(modus_ponens,[status(thm)],[58, 54])).
% 0.21/0.47 tff(60,plain,
% 0.21/0.47 ((~![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))) | (contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0))) <=> contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.47 inference(quant_inst,[status(thm)],[])).
% 0.21/0.47 tff(61,plain,
% 0.21/0.47 (contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0))) <=> contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.47 inference(unit_resolution,[status(thm)],[60, 59])).
% 0.21/0.47 tff(62,plain,
% 0.21/0.47 (~contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.47 inference(or_elim,[status(thm)],[11])).
% 0.21/0.47 tff(63,plain,
% 0.21/0.47 ((~(contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0))) <=> contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0))))) | contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0))) | (~contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.47 inference(tautology,[status(thm)],[])).
% 0.21/0.47 tff(64,plain,
% 0.21/0.47 ((~(contains_cpq(triple(U!2, V!1, W!0), findmin_cpq_res(triple(U!2, V!1, W!0))) <=> contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0))))) | (~contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.47 inference(unit_resolution,[status(thm)],[63, 62])).
% 0.21/0.47 tff(65,plain,
% 0.21/0.47 (~contains_slb(V!1, findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.47 inference(unit_resolution,[status(thm)],[64, 61])).
% 0.21/0.47 tff(66,plain,
% 0.21/0.47 (~contains_slb(V!1, findmin_pqp_res(U!2))),
% 0.21/0.47 inference(modus_ponens,[status(thm)],[65, 52])).
% 0.21/0.47 tff(67,plain,
% 0.21/0.47 (((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2)))) | contains_slb(V!1, findmin_pqp_res(U!2))),
% 0.21/0.47 inference(tautology,[status(thm)],[])).
% 0.21/0.47 tff(68,plain,
% 0.21/0.47 (contains_slb(V!1, findmin_pqp_res(U!2))),
% 0.21/0.47 inference(unit_resolution,[status(thm)],[67, 29])).
% 0.21/0.47 tff(69,plain,
% 0.21/0.47 ($false),
% 0.21/0.47 inference(unit_resolution,[status(thm)],[68, 66])).
% 0.21/0.47 % SZS output end Proof
%------------------------------------------------------------------------------