↑ Up

Z3---4.15.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SWV374+1 : TPTP v9.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% 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 : Sat Jun 21 05:32:19 AM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SWV374+1 : TPTP v9.0.0. Released v3.3.0.
% 0.08/0.12  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n002.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   : Fri Jun 20 09:46:01 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 0.13/0.39  % SZS status Theorem
% 0.13/0.39  % SZS output start Proof
% 0.13/0.39  tff(less_than_type, type, (
% 0.13/0.39     less_than: ( $i * $i ) > $o)).
% 0.13/0.39  tff(findmin_cpq_res_type, type, (
% 0.13/0.39     findmin_cpq_res: $i > $i)).
% 0.13/0.39  tff(triple_type, type, (
% 0.13/0.39     triple: ( $i * $i * $i ) > $i)).
% 0.13/0.39  tff(tptp_fun_W_0_type, type, (
% 0.13/0.39     tptp_fun_W_0: $i)).
% 0.13/0.39  tff(tptp_fun_V_1_type, type, (
% 0.13/0.39     tptp_fun_V_1: $i)).
% 0.13/0.39  tff(tptp_fun_U_2_type, type, (
% 0.13/0.39     tptp_fun_U_2: $i)).
% 0.13/0.39  tff(lookup_slb_type, type, (
% 0.13/0.39     lookup_slb: ( $i * $i ) > $i)).
% 0.13/0.39  tff(findmin_pqp_res_type, type, (
% 0.13/0.39     findmin_pqp_res: $i > $i)).
% 0.13/0.39  tff(create_slb_type, type, (
% 0.13/0.39     create_slb: $i)).
% 0.13/0.39  tff(bad_type, type, (
% 0.13/0.39     bad: $i)).
% 0.13/0.39  tff(update_slb_type, type, (
% 0.13/0.39     update_slb: ( $i * $i ) > $i)).
% 0.13/0.39  tff(findmin_cpq_eff_type, type, (
% 0.13/0.39     findmin_cpq_eff: $i > $i)).
% 0.13/0.39  tff(ok_type, type, (
% 0.13/0.39     ok: $i > $o)).
% 0.13/0.39  tff(contains_slb_type, type, (
% 0.13/0.39     contains_slb: ( $i * $i ) > $o)).
% 0.13/0.39  tff(strictly_less_than_type, type, (
% 0.13/0.39     strictly_less_than: ( $i * $i ) > $o)).
% 0.13/0.39  tff(1,assumption,(V!1 = create_slb), introduced(assumption)).
% 0.13/0.39  tff(2,plain,
% 0.13/0.39      (create_slb = V!1),
% 0.13/0.39      inference(symmetry,[status(thm)],[1])).
% 0.13/0.39  tff(3,plain,
% 0.13/0.39      (^[U: $i] : refl((update_slb(create_slb, U) = create_slb) <=> (update_slb(create_slb, U) = create_slb))),
% 0.13/0.39      inference(bind,[status(th)],[])).
% 0.13/0.39  tff(4,plain,
% 0.13/0.39      (![U: $i] : (update_slb(create_slb, U) = create_slb) <=> ![U: $i] : (update_slb(create_slb, U) = create_slb)),
% 0.13/0.39      inference(quant_intro,[status(thm)],[3])).
% 0.13/0.39  tff(5,plain,
% 0.13/0.39      (![U: $i] : (update_slb(create_slb, U) = create_slb) <=> ![U: $i] : (update_slb(create_slb, U) = create_slb)),
% 0.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(6,axiom,(![U: $i] : (update_slb(create_slb, U) = create_slb)), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax','ax28')).
% 0.13/0.39  tff(7,plain,
% 0.13/0.39      (![U: $i] : (update_slb(create_slb, U) = create_slb)),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[6, 5])).
% 0.13/0.39  tff(8,plain,(
% 0.13/0.39      ![U: $i] : (update_slb(create_slb, U) = create_slb)),
% 0.13/0.39      inference(skolemize,[status(sab)],[7])).
% 0.13/0.39  tff(9,plain,
% 0.13/0.39      (![U: $i] : (update_slb(create_slb, U) = create_slb)),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[8, 4])).
% 0.13/0.39  tff(10,plain,
% 0.13/0.39      ((~![U: $i] : (update_slb(create_slb, U) = create_slb)) | (update_slb(create_slb, findmin_pqp_res(U!2)) = create_slb)),
% 0.13/0.39      inference(quant_inst,[status(thm)],[])).
% 0.13/0.39  tff(11,plain,
% 0.13/0.39      (update_slb(create_slb, findmin_pqp_res(U!2)) = create_slb),
% 0.13/0.39      inference(unit_resolution,[status(thm)],[10, 9])).
% 0.13/0.39  tff(12,plain,
% 0.13/0.39      (update_slb(V!1, findmin_pqp_res(U!2)) = update_slb(create_slb, findmin_pqp_res(U!2))),
% 0.13/0.39      inference(monotonicity,[status(thm)],[1])).
% 0.13/0.39  tff(13,plain,
% 0.13/0.39      (update_slb(V!1, findmin_pqp_res(U!2)) = V!1),
% 0.13/0.39      inference(transitivity,[status(thm)],[12, 11, 2])).
% 0.13/0.39  tff(14,plain,
% 0.13/0.39      (triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad) = triple(U!2, V!1, bad)),
% 0.13/0.39      inference(monotonicity,[status(thm)],[13])).
% 0.13/0.39  tff(15,plain,
% 0.13/0.39      (triple(U!2, V!1, bad) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)),
% 0.13/0.39      inference(symmetry,[status(thm)],[14])).
% 0.13/0.39  tff(16,plain,
% 0.13/0.39      (triple(U!2, V!1, bad) = triple(U!2, create_slb, bad)),
% 0.13/0.39      inference(monotonicity,[status(thm)],[1])).
% 0.13/0.39  tff(17,plain,
% 0.13/0.39      (triple(U!2, create_slb, bad) = triple(U!2, V!1, bad)),
% 0.13/0.39      inference(symmetry,[status(thm)],[16])).
% 0.13/0.39  tff(18,plain,
% 0.13/0.39      (^[U: $i, V: $i] : refl((findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad)) <=> (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad)))),
% 0.13/0.39      inference(bind,[status(th)],[])).
% 0.13/0.39  tff(19,plain,
% 0.13/0.39      (![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad)) <=> ![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))),
% 0.13/0.39      inference(quant_intro,[status(thm)],[18])).
% 0.13/0.39  tff(20,plain,
% 0.13/0.39      (![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad)) <=> ![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))),
% 0.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(21,axiom,(![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax','ax46')).
% 0.13/0.39  tff(22,plain,
% 0.13/0.39      (![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[21, 20])).
% 0.13/0.39  tff(23,plain,(
% 0.13/0.39      ![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))),
% 0.13/0.39      inference(skolemize,[status(sab)],[22])).
% 0.13/0.39  tff(24,plain,
% 0.13/0.39      (![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[23, 19])).
% 0.13/0.39  tff(25,plain,
% 0.13/0.39      ((~![U: $i, V: $i] : (findmin_cpq_eff(triple(U, create_slb, V)) = triple(U, create_slb, bad))) | (findmin_cpq_eff(triple(U!2, create_slb, W!0)) = triple(U!2, create_slb, bad))),
% 0.13/0.39      inference(quant_inst,[status(thm)],[])).
% 0.13/0.39  tff(26,plain,
% 0.13/0.39      (findmin_cpq_eff(triple(U!2, create_slb, W!0)) = triple(U!2, create_slb, bad)),
% 0.13/0.39      inference(unit_resolution,[status(thm)],[25, 24])).
% 0.13/0.39  tff(27,plain,
% 0.13/0.39      (triple(U!2, create_slb, W!0) = triple(U!2, V!1, W!0)),
% 0.13/0.39      inference(monotonicity,[status(thm)],[2])).
% 0.13/0.39  tff(28,plain,
% 0.13/0.39      (triple(U!2, V!1, W!0) = triple(U!2, create_slb, W!0)),
% 0.13/0.39      inference(symmetry,[status(thm)],[27])).
% 0.13/0.39  tff(29,plain,
% 0.13/0.39      (findmin_cpq_eff(triple(U!2, V!1, W!0)) = findmin_cpq_eff(triple(U!2, create_slb, W!0))),
% 0.13/0.39      inference(monotonicity,[status(thm)],[28])).
% 0.13/0.39  tff(30,plain,
% 0.13/0.39      (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)),
% 0.13/0.39      inference(transitivity,[status(thm)],[29, 26, 17, 15])).
% 0.13/0.39  tff(31,assumption,(findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)), introduced(assumption)).
% 0.13/0.39  tff(32,plain,
% 0.13/0.39      (triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad) = findmin_cpq_eff(triple(U!2, V!1, W!0))),
% 0.13/0.39      inference(symmetry,[status(thm)],[31])).
% 0.13/0.39  tff(33,plain,
% 0.13/0.39      (ok(triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)) <=> ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))),
% 0.13/0.39      inference(monotonicity,[status(thm)],[32])).
% 0.13/0.39  tff(34,plain,
% 0.13/0.39      (ok(findmin_cpq_eff(triple(U!2, V!1, W!0))) <=> ok(triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))),
% 0.13/0.39      inference(symmetry,[status(thm)],[33])).
% 0.13/0.39  tff(35,plain,
% 0.13/0.39      ((~![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.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(36,plain,
% 0.13/0.39      ((~![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.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(37,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/sandbox/benchmark/theBenchmark.p','l10_co')).
% 0.13/0.39  tff(38,plain,
% 0.13/0.39      (~![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.13/0.39      inference(modus_ponens,[status(thm)],[37, 36])).
% 0.13/0.39  tff(39,plain,
% 0.13/0.39      (~![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.13/0.39      inference(modus_ponens,[status(thm)],[38, 35])).
% 0.13/0.39  tff(40,plain,
% 0.13/0.39      (~![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.13/0.39      inference(modus_ponens,[status(thm)],[39, 35])).
% 0.13/0.39  tff(41,plain,
% 0.13/0.39      (~![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.13/0.39      inference(modus_ponens,[status(thm)],[40, 35])).
% 0.13/0.39  tff(42,plain,(
% 0.13/0.39      ~((~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.13/0.39      inference(skolemize,[status(sab)],[41])).
% 0.13/0.39  tff(43,plain,
% 0.13/0.39      (ok(findmin_cpq_eff(triple(U!2, V!1, W!0)))),
% 0.13/0.39      inference(or_elim,[status(thm)],[42])).
% 0.13/0.39  tff(44,plain,
% 0.13/0.39      (ok(triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[43, 34])).
% 0.13/0.39  tff(45,plain,
% 0.13/0.39      (^[U: $i, V: $i] : refl((~ok(triple(U, V, bad))) <=> (~ok(triple(U, V, bad))))),
% 0.13/0.39      inference(bind,[status(th)],[])).
% 0.13/0.39  tff(46,plain,
% 0.13/0.39      (![U: $i, V: $i] : (~ok(triple(U, V, bad))) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(quant_intro,[status(thm)],[45])).
% 0.13/0.39  tff(47,plain,
% 0.13/0.39      (![U: $i, V: $i] : (~ok(triple(U, V, bad))) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(48,plain,
% 0.13/0.39      (^[U: $i, V: $i] : rewrite((ok(triple(U, V, bad)) <=> $false) <=> (~ok(triple(U, V, bad))))),
% 0.13/0.39      inference(bind,[status(th)],[])).
% 0.13/0.39  tff(49,plain,
% 0.13/0.39      (![U: $i, V: $i] : (ok(triple(U, V, bad)) <=> $false) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(quant_intro,[status(thm)],[48])).
% 0.13/0.39  tff(50,axiom,(![U: $i, V: $i] : (ok(triple(U, V, bad)) <=> $false)), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax','ax40')).
% 0.13/0.39  tff(51,plain,
% 0.13/0.39      (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[50, 49])).
% 0.13/0.39  tff(52,plain,
% 0.13/0.39      (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[51, 47])).
% 0.13/0.39  tff(53,plain,(
% 0.13/0.39      ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(skolemize,[status(sab)],[52])).
% 0.13/0.39  tff(54,plain,
% 0.13/0.39      (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.13/0.39      inference(modus_ponens,[status(thm)],[53, 46])).
% 0.13/0.39  tff(55,plain,
% 0.13/0.39      ((~![U: $i, V: $i] : (~ok(triple(U, V, bad)))) | (~ok(triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))),
% 0.13/0.39      inference(quant_inst,[status(thm)],[])).
% 0.13/0.39  tff(56,plain,
% 0.13/0.39      (~ok(triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))),
% 0.13/0.39      inference(unit_resolution,[status(thm)],[55, 54])).
% 0.13/0.39  tff(57,plain,
% 0.13/0.39      ($false),
% 0.13/0.39      inference(unit_resolution,[status(thm)],[56, 44])).
% 0.13/0.39  tff(58,plain,(~(findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))), inference(lemma,lemma(discharge,[]))).
% 0.13/0.39  tff(59,plain,
% 0.13/0.39      ($false),
% 0.13/0.39      inference(unit_resolution,[status(thm)],[58, 30])).
% 0.13/0.39  tff(60,plain,(~(V!1 = create_slb)), inference(lemma,lemma(discharge,[]))).
% 0.13/0.39  tff(61,plain,
% 0.13/0.39      (^[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.13/0.39      inference(bind,[status(th)],[])).
% 0.13/0.39  tff(62,plain,
% 0.13/0.39      (![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.13/0.39      inference(quant_intro,[status(thm)],[61])).
% 0.13/0.39  tff(63,plain,
% 0.13/0.39      (![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.13/0.39      inference(rewrite,[status(thm)],[])).
% 0.13/0.39  tff(64,plain,
% 0.13/0.39      (![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.13/0.39      inference(elim_unused_vars,[status(thm)],[])).
% 0.13/0.39  tff(65,plain,
% 0.13/0.39      (^[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.39      inference(bind,[status(th)],[])).
% 0.21/0.39  tff(66,plain,
% 0.21/0.39      (![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.39      inference(quant_intro,[status(thm)],[65])).
% 0.21/0.39  tff(67,plain,
% 0.21/0.39      (![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.39      inference(transitivity,[status(thm)],[66, 64])).
% 0.21/0.39  tff(68,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/sandbox/benchmark/Axioms/SWV007+3.ax','ax51')).
% 0.21/0.39  tff(69,plain,
% 0.21/0.39      (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.39      inference(modus_ponens,[status(thm)],[68, 67])).
% 0.21/0.39  tff(70,plain,
% 0.21/0.39      (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.39      inference(modus_ponens,[status(thm)],[69, 63])).
% 0.21/0.39  tff(71,plain,(
% 0.21/0.39      ![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.39      inference(skolemize,[status(sab)],[70])).
% 0.21/0.39  tff(72,plain,
% 0.21/0.39      (![U: $i, V: $i, W: $i] : ((V = create_slb) | (findmin_cpq_res(triple(U, V, W)) = findmin_pqp_res(U)))),
% 0.21/0.39      inference(modus_ponens,[status(thm)],[71, 62])).
% 0.21/0.39  tff(73,plain,
% 0.21/0.39      (((~![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.39      inference(rewrite,[status(thm)],[])).
% 0.21/0.39  tff(74,plain,
% 0.21/0.39      ((~![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.39      inference(quant_inst,[status(thm)],[])).
% 0.21/0.39  tff(75,plain,
% 0.21/0.39      ((~![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.39      inference(modus_ponens,[status(thm)],[74, 73])).
% 0.21/0.39  tff(76,plain,
% 0.21/0.39      ((V!1 = create_slb) | (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2))),
% 0.21/0.39      inference(unit_resolution,[status(thm)],[75, 72])).
% 0.21/0.39  tff(77,plain,
% 0.21/0.39      (findmin_cpq_res(triple(U!2, V!1, W!0)) = findmin_pqp_res(U!2)),
% 0.21/0.39      inference(unit_resolution,[status(thm)],[76, 60])).
% 0.21/0.39  tff(78,plain,
% 0.21/0.39      (less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0))) <=> less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))),
% 0.21/0.39      inference(monotonicity,[status(thm)],[77])).
% 0.21/0.39  tff(79,plain,
% 0.21/0.39      (less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2)) <=> less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.39      inference(symmetry,[status(thm)],[78])).
% 0.21/0.39  tff(80,plain,
% 0.21/0.39      ((~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))) <=> (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.39      inference(monotonicity,[status(thm)],[79])).
% 0.21/0.39  tff(81,plain,
% 0.21/0.39      (^[U: $i, V: $i, W: $i] : refl((contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))))),
% 0.21/0.39      inference(bind,[status(th)],[])).
% 0.21/0.39  tff(82,plain,
% 0.21/0.39      (![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(quant_intro,[status(thm)],[81])).
% 0.21/0.40  tff(83,plain,
% 0.21/0.40      (^[U: $i, V: $i, W: $i] : trans(monotonicity(trans(monotonicity(rewrite(((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U)))) <=> (~((V = create_slb) | contains_slb(V, findmin_pqp_res(U))))), ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) <=> (~(~((V = create_slb) | contains_slb(V, findmin_pqp_res(U))))))), rewrite((~(~((V = create_slb) | contains_slb(V, findmin_pqp_res(U))))) <=> ((V = create_slb) | contains_slb(V, findmin_pqp_res(U)))), ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) <=> ((V = create_slb) | contains_slb(V, findmin_pqp_res(U))))), (((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> (((V = create_slb) | contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))))), rewrite((((V = create_slb) | contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))), (((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))))),
% 0.21/0.40      inference(bind,[status(th)],[])).
% 0.21/0.40  tff(84,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(quant_intro,[status(thm)],[83])).
% 0.21/0.40  tff(85,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(rewrite,[status(thm)],[])).
% 0.21/0.40  tff(86,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i, X: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(elim_unused_vars,[status(thm)],[])).
% 0.21/0.40  tff(87,plain,
% 0.21/0.40      (^[U: $i, V: $i, W: $i, X: $i] : rewrite((((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))))),
% 0.21/0.40      inference(bind,[status(th)],[])).
% 0.21/0.40  tff(88,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i, X: $i] : (((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(quant_intro,[status(thm)],[87])).
% 0.21/0.40  tff(89,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i, X: $i] : (((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(transitivity,[status(thm)],[88, 86])).
% 0.21/0.40  tff(90,axiom,(![U: $i, V: $i, W: $i, X: $i] : (((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax','ax47')).
% 0.21/0.40  tff(91,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(modus_ponens,[status(thm)],[90, 89])).
% 0.21/0.40  tff(92,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(modus_ponens,[status(thm)],[91, 85])).
% 0.21/0.40  tff(93,plain,(
% 0.21/0.40      ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & (~contains_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(skolemize,[status(sab)],[92])).
% 0.21/0.40  tff(94,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(modus_ponens,[status(thm)],[93, 84])).
% 0.21/0.40  tff(95,plain,
% 0.21/0.40      (![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.40      inference(modus_ponens,[status(thm)],[94, 82])).
% 0.21/0.40  tff(96,plain,
% 0.21/0.40      (((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | ((V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))) <=> ((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | (V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))),
% 0.21/0.40      inference(rewrite,[status(thm)],[])).
% 0.21/0.40  tff(97,plain,
% 0.21/0.40      ((contains_slb(V!1, findmin_pqp_res(U!2)) | (V!1 = create_slb) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))) <=> ((V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))),
% 0.21/0.40      inference(rewrite,[status(thm)],[])).
% 0.21/0.40  tff(98,plain,
% 0.21/0.40      (((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | (contains_slb(V!1, findmin_pqp_res(U!2)) | (V!1 = create_slb) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))) <=> ((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | ((V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))))),
% 0.21/0.40      inference(monotonicity,[status(thm)],[97])).
% 0.21/0.40  tff(99,plain,
% 0.21/0.40      (((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | (contains_slb(V!1, findmin_pqp_res(U!2)) | (V!1 = create_slb) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))) <=> ((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | (V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))),
% 0.21/0.40      inference(transitivity,[status(thm)],[98, 96])).
% 0.21/0.40  tff(100,plain,
% 0.21/0.40      ((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | (contains_slb(V!1, findmin_pqp_res(U!2)) | (V!1 = create_slb) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)))),
% 0.21/0.40      inference(quant_inst,[status(thm)],[])).
% 0.21/0.40  tff(101,plain,
% 0.21/0.40      ((~![U: $i, V: $i, W: $i] : (contains_slb(V, findmin_pqp_res(U)) | (V = create_slb) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))) | (V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))),
% 0.21/0.40      inference(modus_ponens,[status(thm)],[100, 99])).
% 0.21/0.40  tff(102,plain,
% 0.21/0.40      ((V!1 = create_slb) | contains_slb(V!1, findmin_pqp_res(U!2)) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad))),
% 0.21/0.40      inference(unit_resolution,[status(thm)],[101, 95])).
% 0.21/0.40  tff(103,plain,
% 0.21/0.40      (contains_slb(V!1, findmin_pqp_res(U!2))),
% 0.21/0.40      inference(unit_resolution,[status(thm)],[102, 60, 58])).
% 0.21/0.40  tff(104,plain,
% 0.21/0.40      ((~(~((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) | (~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.40      inference(rewrite,[status(thm)],[])).
% 0.21/0.40  tff(105,plain,
% 0.21/0.40      (((~(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) | (~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.40      inference(rewrite,[status(thm)],[])).
% 0.21/0.40  tff(106,plain,
% 0.21/0.40      ((~((~(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) | (~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.40      inference(monotonicity,[status(thm)],[105])).
% 0.21/0.40  tff(107,plain,
% 0.21/0.40      ((~((~(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) | (~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.40      inference(transitivity,[status(thm)],[106, 104])).
% 0.21/0.40  tff(108,plain,
% 0.21/0.40      (~((~(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.40      inference(or_elim,[status(thm)],[42])).
% 0.21/0.40  tff(109,plain,
% 0.21/0.40      ((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.40      inference(modus_ponens,[status(thm)],[108, 107])).
% 0.21/0.40  tff(110,plain,
% 0.21/0.40      (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_pqp_res(U!2))),
% 0.21/0.40      inference(unit_resolution,[status(thm)],[109, 103, 60])).
% 0.21/0.40  tff(111,plain,
% 0.21/0.40      (~less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.40      inference(modus_ponens,[status(thm)],[110, 80])).
% 0.21/0.40  tff(112,plain,
% 0.21/0.40      (^[U: $i, V: $i] : refl((less_than(V, U) | less_than(U, V)) <=> (less_than(V, U) | less_than(U, V)))),
% 0.21/0.40      inference(bind,[status(th)],[])).
% 0.21/0.40  tff(113,plain,
% 0.21/0.41      (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V)) <=> ![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[112])).
% 0.21/0.41  tff(114,plain,
% 0.21/0.41      (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V)) <=> ![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(115,plain,
% 0.21/0.41      (^[U: $i, V: $i] : rewrite((less_than(U, V) | less_than(V, U)) <=> (less_than(V, U) | less_than(U, V)))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(116,plain,
% 0.21/0.41      (![U: $i, V: $i] : (less_than(U, V) | less_than(V, U)) <=> ![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[115])).
% 0.21/0.41  tff(117,axiom,(![U: $i, V: $i] : (less_than(U, V) | less_than(V, U))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax','totality')).
% 0.21/0.41  tff(118,plain,
% 0.21/0.41      (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[117, 116])).
% 0.21/0.41  tff(119,plain,
% 0.21/0.41      (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[118, 114])).
% 0.21/0.41  tff(120,plain,(
% 0.21/0.41      ![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(skolemize,[status(sab)],[119])).
% 0.21/0.41  tff(121,plain,
% 0.21/0.41      (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[120, 113])).
% 0.21/0.41  tff(122,plain,
% 0.21/0.41      (((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | (less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0))))) <=> ((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(123,plain,
% 0.21/0.41      ((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | (less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0))))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(124,plain,
% 0.21/0.41      ((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[123, 122])).
% 0.21/0.41  tff(125,plain,
% 0.21/0.41      (less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[124, 121])).
% 0.21/0.41  tff(126,plain,
% 0.21/0.41      (less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[125, 111])).
% 0.21/0.41  tff(127,plain,
% 0.21/0.41      (^[U: $i, V: $i] : refl((~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V))) <=> (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(128,plain,
% 0.21/0.41      (![U: $i, V: $i] : (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V))) <=> ![U: $i, V: $i] : (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[127])).
% 0.21/0.41  tff(129,plain,
% 0.21/0.41      (^[U: $i, V: $i] : trans(trans(monotonicity(rewrite((less_than(U, V) & (~less_than(V, U))) <=> (~((~less_than(U, V)) | less_than(V, U)))), ((strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U)))) <=> (strictly_less_than(U, V) <=> (~((~less_than(U, V)) | less_than(V, U)))))), rewrite((strictly_less_than(U, V) <=> (~((~less_than(U, V)) | less_than(V, U)))) <=> (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))), ((strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U)))) <=> (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V))))), rewrite((~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V))) <=> (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))), ((strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U)))) <=> (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(130,plain,
% 0.21/0.41      (![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U)))) <=> ![U: $i, V: $i] : (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[129])).
% 0.21/0.41  tff(131,plain,
% 0.21/0.41      (![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U)))) <=> ![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(132,axiom,(![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax','stricly_smaller_definition')).
% 0.21/0.41  tff(133,plain,
% 0.21/0.41      (![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[132, 131])).
% 0.21/0.41  tff(134,plain,(
% 0.21/0.41      ![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))),
% 0.21/0.41      inference(skolemize,[status(sab)],[133])).
% 0.21/0.41  tff(135,plain,
% 0.21/0.41      (![U: $i, V: $i] : (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[134, 130])).
% 0.21/0.41  tff(136,plain,
% 0.21/0.41      (![U: $i, V: $i] : (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[135, 128])).
% 0.21/0.41  tff(137,plain,
% 0.21/0.41      ((~![U: $i, V: $i] : (~(((~less_than(U, V)) | less_than(V, U)) <=> strictly_less_than(U, V)))) | (~(((~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))) <=> strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(138,plain,
% 0.21/0.41      (~(((~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))) <=> strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))))),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[137, 136])).
% 0.21/0.41  tff(139,plain,
% 0.21/0.41      (strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))) <=> strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.41      inference(monotonicity,[status(thm)],[77])).
% 0.21/0.41  tff(140,plain,
% 0.21/0.41      (strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2))) <=> strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.41      inference(symmetry,[status(thm)],[139])).
% 0.21/0.41  tff(141,plain,
% 0.21/0.41      ((~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2)))) <=> (~strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2))))),
% 0.21/0.41      inference(monotonicity,[status(thm)],[140])).
% 0.21/0.41  tff(142,plain,
% 0.21/0.41      (^[U: $i, V: $i, W: $i] : refl(((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) <=> ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(143,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) <=> ![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[142])).
% 0.21/0.41  tff(144,plain,
% 0.21/0.41      (^[U: $i, V: $i, W: $i] : trans(monotonicity(trans(monotonicity(rewrite(((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) <=> (~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))))), ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) <=> (~(~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))))))), rewrite((~(~((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))))) <=> ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))), ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) <=> ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))))), (((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> (((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))))), rewrite((((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))), (((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(145,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[144])).
% 0.21/0.41  tff(146,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(147,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i, X: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(elim_unused_vars,[status(thm)],[])).
% 0.21/0.41  tff(148,plain,
% 0.21/0.41      (^[U: $i, V: $i, W: $i, X: $i] : trans(monotonicity(rewrite((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) <=> ((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))), (((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> (((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))))), rewrite((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))), (((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))))),
% 0.21/0.41      inference(bind,[status(th)],[])).
% 0.21/0.41  tff(149,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i, X: $i] : ((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(quant_intro,[status(thm)],[148])).
% 0.21/0.41  tff(150,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i, X: $i] : ((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad))) <=> ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(transitivity,[status(thm)],[149, 147])).
% 0.21/0.41  tff(151,axiom,(![U: $i, V: $i, W: $i, X: $i] : ((((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U))) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))) => (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax','ax48')).
% 0.21/0.41  tff(152,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[151, 150])).
% 0.21/0.41  tff(153,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[152, 146])).
% 0.21/0.41  tff(154,plain,(
% 0.21/0.41      ![U: $i, V: $i, W: $i] : ((~((~(V = create_slb)) & contains_slb(V, findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U))))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)))),
% 0.21/0.41      inference(skolemize,[status(sab)],[153])).
% 0.21/0.41  tff(155,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[154, 145])).
% 0.21/0.41  tff(156,plain,
% 0.21/0.41      (![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[155, 143])).
% 0.21/0.41  tff(157,plain,
% 0.21/0.41      (((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))) | ((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)) | (~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2)))))) <=> ((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))) | (V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)) | (~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2)))))),
% 0.21/0.41      inference(rewrite,[status(thm)],[])).
% 0.21/0.41  tff(158,plain,
% 0.21/0.41      ((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))) | ((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)) | (~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2)))))),
% 0.21/0.41      inference(quant_inst,[status(thm)],[])).
% 0.21/0.41  tff(159,plain,
% 0.21/0.41      ((~![U: $i, V: $i, W: $i] : ((V = create_slb) | (~contains_slb(V, findmin_pqp_res(U))) | (findmin_cpq_eff(triple(U, V, W)) = triple(U, update_slb(V, findmin_pqp_res(U)), bad)) | (~strictly_less_than(findmin_pqp_res(U), lookup_slb(V, findmin_pqp_res(U)))))) | (V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)) | (~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2))))),
% 0.21/0.41      inference(modus_ponens,[status(thm)],[158, 157])).
% 0.21/0.41  tff(160,plain,
% 0.21/0.41      ((V!1 = create_slb) | (~contains_slb(V!1, findmin_pqp_res(U!2))) | (findmin_cpq_eff(triple(U!2, V!1, W!0)) = triple(U!2, update_slb(V!1, findmin_pqp_res(U!2)), bad)) | (~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2))))),
% 0.21/0.41      inference(unit_resolution,[status(thm)],[159, 156])).
% 0.21/0.42  tff(161,plain,
% 0.21/0.42      (~strictly_less_than(findmin_pqp_res(U!2), lookup_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.42      inference(unit_resolution,[status(thm)],[160, 103, 58, 60])).
% 0.21/0.42  tff(162,plain,
% 0.21/0.42      (~strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.42      inference(modus_ponens,[status(thm)],[161, 141])).
% 0.21/0.42  tff(163,plain,
% 0.21/0.42      ((((~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))) <=> strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | ((~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))) | strictly_less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))),
% 0.21/0.42      inference(tautology,[status(thm)],[])).
% 0.21/0.42  tff(164,plain,
% 0.21/0.42      ((~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.42      inference(unit_resolution,[status(thm)],[163, 162, 138])).
% 0.21/0.42  tff(165,plain,
% 0.21/0.42      ((~((~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0))))) | (~less_than(findmin_cpq_res(triple(U!2, V!1, W!0)), lookup_slb(V!1, findmin_pqp_res(U!2)))) | less_than(lookup_slb(V!1, findmin_pqp_res(U!2)), findmin_cpq_res(triple(U!2, V!1, W!0)))),
% 0.21/0.42      inference(tautology,[status(thm)],[])).
% 0.21/0.42  tff(166,plain,
% 0.21/0.42      ($false),
% 0.21/0.42      inference(unit_resolution,[status(thm)],[165, 164, 126, 111])).
% 0.21/0.42  % SZS output end Proof
% 0.21/0.42  % E exiting
%------------------------------------------------------------------------------