TSTP Solution File: SWV378+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV378+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n009.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:32 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV378+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Sep 4 02:42:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.20/0.35 Usage: tptp [options] [-file:]file
% 0.20/0.35 -h, -? prints this message.
% 0.20/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.20/0.35 -m, -model generate model.
% 0.20/0.35 -p, -proof generate proof.
% 0.20/0.35 -c, -core generate unsat core of named formulas.
% 0.20/0.35 -st, -statistics display statistics.
% 0.20/0.35 -t:timeout set timeout (in second).
% 0.20/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.20/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.20/0.35 -<param>:<value> configuration parameter and value.
% 0.20/0.35 -o:<output-file> file to place output in.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output start Proof
% 0.20/0.41 tff(less_than_type, type, (
% 0.20/0.41 less_than: ( $i * $i ) > $o)).
% 0.20/0.41 tff(lookup_slb_type, type, (
% 0.20/0.41 lookup_slb: ( $i * $i ) > $i)).
% 0.20/0.41 tff(tptp_fun_X_0_type, type, (
% 0.20/0.41 tptp_fun_X_0: $i)).
% 0.20/0.41 tff(tptp_fun_V_2_type, type, (
% 0.20/0.41 tptp_fun_V_2: $i)).
% 0.20/0.41 tff(strictly_less_than_type, type, (
% 0.20/0.41 strictly_less_than: ( $i * $i ) > $o)).
% 0.20/0.41 tff(contains_slb_type, type, (
% 0.20/0.41 contains_slb: ( $i * $i ) > $o)).
% 0.20/0.41 tff(triple_type, type, (
% 0.20/0.41 triple: ( $i * $i * $i ) > $i)).
% 0.20/0.41 tff(bad_type, type, (
% 0.20/0.41 bad: $i)).
% 0.20/0.41 tff(tptp_fun_U_3_type, type, (
% 0.20/0.41 tptp_fun_U_3: $i)).
% 0.20/0.41 tff(remove_cpq_type, type, (
% 0.20/0.41 remove_cpq: ( $i * $i ) > $i)).
% 0.20/0.41 tff(tptp_fun_W_1_type, type, (
% 0.20/0.41 tptp_fun_W_1: $i)).
% 0.20/0.41 tff(ok_type, type, (
% 0.20/0.41 ok: $i > $o)).
% 0.20/0.41 tff(remove_slb_type, type, (
% 0.20/0.41 remove_slb: ( $i * $i ) > $i)).
% 0.20/0.41 tff(remove_pqp_type, type, (
% 0.20/0.41 remove_pqp: ( $i * $i ) > $i)).
% 0.20/0.41 tff(1,plain,
% 0.20/0.41 (^[U: $i, V: $i] : refl((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)))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(2,plain,
% 0.20/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.20/0.41 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.41 tff(3,plain,
% 0.20/0.41 (^[U: $i, V: $i] : rewrite((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)))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(4,plain,
% 0.20/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.20/0.41 inference(quant_intro,[status(thm)],[3])).
% 0.20/0.41 tff(5,plain,
% 0.20/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.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(6,axiom,(![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax','stricly_smaller_definition')).
% 0.20/0.41 tff(7,plain,
% 0.20/0.41 (![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.20/0.41 tff(8,plain,(
% 0.20/0.41 ![U: $i, V: $i] : (strictly_less_than(U, V) <=> (less_than(U, V) & (~less_than(V, U))))),
% 0.20/0.41 inference(skolemize,[status(sab)],[7])).
% 0.20/0.41 tff(9,plain,
% 0.20/0.41 (![U: $i, V: $i] : (strictly_less_than(U, V) <=> (~((~less_than(U, V)) | less_than(V, U))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[8, 4])).
% 0.20/0.41 tff(10,plain,
% 0.20/0.41 (![U: $i, V: $i] : (strictly_less_than(U, V) <=> (~((~less_than(U, V)) | less_than(V, U))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.20/0.41 tff(11,plain,
% 0.20/0.41 ((~![U: $i, V: $i] : (strictly_less_than(U, V) <=> (~((~less_than(U, V)) | less_than(V, U))))) | (strictly_less_than(X!0, lookup_slb(V!2, X!0)) <=> (~((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0))))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(12,plain,
% 0.20/0.41 (strictly_less_than(X!0, lookup_slb(V!2, X!0)) <=> (~((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0)))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[11, 10])).
% 0.20/0.41 tff(13,plain,
% 0.20/0.41 ((~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))) <=> (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(14,plain,
% 0.20/0.41 ((~![U: $i, V: $i, W: $i, X: $i] : ((~ok(triple(U, V, W))) => (~ok(remove_cpq(triple(U, V, W), X))))) <=> (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(15,axiom,(~![U: $i, V: $i, W: $i, X: $i] : ((~ok(triple(U, V, W))) => (~ok(remove_cpq(triple(U, V, W), X))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l14_co')).
% 0.20/0.41 tff(16,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.20/0.41 tff(17,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[16, 13])).
% 0.20/0.41 tff(18,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[17, 13])).
% 0.20/0.41 tff(19,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[18, 13])).
% 0.20/0.41 tff(20,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[19, 13])).
% 0.20/0.41 tff(21,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[20, 13])).
% 0.20/0.41 tff(22,plain,
% 0.20/0.41 (~![U: $i, V: $i, W: $i, X: $i] : (ok(triple(U, V, W)) | (~ok(remove_cpq(triple(U, V, W), X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[21, 13])).
% 0.20/0.41 tff(23,plain,(
% 0.20/0.41 ~(ok(triple(U!3, V!2, W!1)) | (~ok(remove_cpq(triple(U!3, V!2, W!1), X!0))))),
% 0.20/0.41 inference(skolemize,[status(sab)],[22])).
% 0.20/0.41 tff(24,plain,
% 0.20/0.41 (~ok(triple(U!3, V!2, W!1))),
% 0.20/0.41 inference(or_elim,[status(thm)],[23])).
% 0.20/0.41 tff(25,plain,
% 0.20/0.41 (^[U: $i, V: $i, W: $i] : refl((ok(triple(U, V, W)) | (W = bad)) <=> (ok(triple(U, V, W)) | (W = bad)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(26,plain,
% 0.20/0.41 (![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad)) <=> ![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[25])).
% 0.20/0.41 tff(27,plain,
% 0.20/0.41 (![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad)) <=> ![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(28,plain,
% 0.20/0.41 (^[U: $i, V: $i, W: $i] : rewrite(((~ok(triple(U, V, W))) => (W = bad)) <=> (ok(triple(U, V, W)) | (W = bad)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(29,plain,
% 0.20/0.41 (![U: $i, V: $i, W: $i] : ((~ok(triple(U, V, W))) => (W = bad)) <=> ![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[28])).
% 0.20/0.41 tff(30,axiom,(![U: $i, V: $i, W: $i] : ((~ok(triple(U, V, W))) => (W = bad))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax41')).
% 0.20/0.41 tff(31,plain,
% 0.20/0.41 (![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.20/0.41 tff(32,plain,
% 0.20/0.41 (![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[31, 27])).
% 0.20/0.41 tff(33,plain,(
% 0.20/0.41 ![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(skolemize,[status(sab)],[32])).
% 0.20/0.41 tff(34,plain,
% 0.20/0.41 (![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[33, 26])).
% 0.20/0.41 tff(35,plain,
% 0.20/0.41 (((~![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))) | (ok(triple(U!3, V!2, W!1)) | (W!1 = bad))) <=> ((~![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))) | ok(triple(U!3, V!2, W!1)) | (W!1 = bad))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(36,plain,
% 0.20/0.41 ((~![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))) | (ok(triple(U!3, V!2, W!1)) | (W!1 = bad))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(37,plain,
% 0.20/0.41 ((~![U: $i, V: $i, W: $i] : (ok(triple(U, V, W)) | (W = bad))) | ok(triple(U!3, V!2, W!1)) | (W!1 = bad)),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[36, 35])).
% 0.20/0.41 tff(38,plain,
% 0.20/0.41 (W!1 = bad),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[37, 34, 24])).
% 0.20/0.41 tff(39,plain,
% 0.20/0.41 (triple(U!3, V!2, W!1) = triple(U!3, V!2, bad)),
% 0.20/0.41 inference(monotonicity,[status(thm)],[38])).
% 0.20/0.41 tff(40,plain,
% 0.20/0.41 (triple(U!3, V!2, bad) = triple(U!3, V!2, W!1)),
% 0.20/0.41 inference(symmetry,[status(thm)],[39])).
% 0.20/0.41 tff(41,assumption,(remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad)), introduced(assumption)).
% 0.20/0.41 tff(42,plain,
% 0.20/0.42 (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, W!1)),
% 0.20/0.42 inference(transitivity,[status(thm)],[41, 40])).
% 0.20/0.42 tff(43,plain,
% 0.20/0.42 (ok(remove_cpq(triple(U!3, V!2, W!1), X!0)) <=> ok(triple(U!3, V!2, W!1))),
% 0.20/0.42 inference(monotonicity,[status(thm)],[42])).
% 0.20/0.42 tff(44,plain,
% 0.20/0.42 (ok(triple(U!3, V!2, W!1)) <=> ok(remove_cpq(triple(U!3, V!2, W!1), X!0))),
% 0.20/0.42 inference(symmetry,[status(thm)],[43])).
% 0.20/0.42 tff(45,plain,
% 0.20/0.42 ((~ok(triple(U!3, V!2, W!1))) <=> (~ok(remove_cpq(triple(U!3, V!2, W!1), X!0)))),
% 0.20/0.42 inference(monotonicity,[status(thm)],[44])).
% 0.20/0.42 tff(46,plain,
% 0.20/0.42 (~ok(remove_cpq(triple(U!3, V!2, W!1), X!0))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[24, 45])).
% 0.20/0.42 tff(47,plain,
% 0.20/0.42 (ok(remove_cpq(triple(U!3, V!2, W!1), X!0))),
% 0.20/0.42 inference(or_elim,[status(thm)],[23])).
% 0.20/0.42 tff(48,plain,
% 0.20/0.42 ($false),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[47, 46])).
% 0.20/0.42 tff(49,plain,(~(remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.42 tff(50,plain,
% 0.20/0.42 (^[U: $i, V: $i, W: $i, X: $i] : refl((contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))) <=> (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(51,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[50])).
% 0.20/0.42 tff(52,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(53,plain,
% 0.20/0.42 (^[U: $i, V: $i, W: $i, X: $i] : rewrite(((~contains_slb(V, X)) => (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))) <=> (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(54,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) => (remove_cpq(triple(U, V, W), X) = triple(U, V, bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[53])).
% 0.20/0.42 tff(55,axiom,(![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) => (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax43')).
% 0.20/0.42 tff(56,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[55, 54])).
% 0.20/0.42 tff(57,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[56, 52])).
% 0.20/0.42 tff(58,plain,(
% 0.20/0.42 ![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(skolemize,[status(sab)],[57])).
% 0.20/0.42 tff(59,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[58, 51])).
% 0.20/0.42 tff(60,plain,
% 0.20/0.42 (((~![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))) | (contains_slb(V!2, X!0) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad)))) <=> ((~![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))) | contains_slb(V!2, X!0) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad)))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(61,plain,
% 0.20/0.42 ((~![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))) | (contains_slb(V!2, X!0) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad)))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(62,plain,
% 0.20/0.42 ((~![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))) | contains_slb(V!2, X!0) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[61, 60])).
% 0.20/0.42 tff(63,plain,
% 0.20/0.42 (contains_slb(V!2, X!0) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[62, 59])).
% 0.20/0.42 tff(64,plain,
% 0.20/0.42 (contains_slb(V!2, X!0)),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[63, 49])).
% 0.20/0.42 tff(65,assumption,(remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)), introduced(assumption)).
% 0.20/0.42 tff(66,plain,
% 0.20/0.42 (triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad) = remove_cpq(triple(U!3, V!2, W!1), X!0)),
% 0.20/0.42 inference(symmetry,[status(thm)],[65])).
% 0.20/0.42 tff(67,plain,
% 0.20/0.42 (ok(triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) <=> ok(remove_cpq(triple(U!3, V!2, W!1), X!0))),
% 0.20/0.42 inference(monotonicity,[status(thm)],[66])).
% 0.20/0.42 tff(68,plain,
% 0.20/0.42 (ok(remove_cpq(triple(U!3, V!2, W!1), X!0)) <=> ok(triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.42 inference(symmetry,[status(thm)],[67])).
% 0.20/0.42 tff(69,plain,
% 0.20/0.42 (ok(triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[47, 68])).
% 0.20/0.42 tff(70,plain,
% 0.20/0.42 (^[U: $i, V: $i] : refl((~ok(triple(U, V, bad))) <=> (~ok(triple(U, V, bad))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(71,plain,
% 0.20/0.42 (![U: $i, V: $i] : (~ok(triple(U, V, bad))) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[70])).
% 0.20/0.42 tff(72,plain,
% 0.20/0.42 (![U: $i, V: $i] : (~ok(triple(U, V, bad))) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(73,plain,
% 0.20/0.42 (^[U: $i, V: $i] : rewrite((ok(triple(U, V, bad)) <=> $false) <=> (~ok(triple(U, V, bad))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(74,plain,
% 0.20/0.42 (![U: $i, V: $i] : (ok(triple(U, V, bad)) <=> $false) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[73])).
% 0.20/0.42 tff(75,axiom,(![U: $i, V: $i] : (ok(triple(U, V, bad)) <=> $false)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax40')).
% 0.20/0.42 tff(76,plain,
% 0.20/0.42 (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[75, 74])).
% 0.20/0.42 tff(77,plain,
% 0.20/0.42 (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[76, 72])).
% 0.20/0.42 tff(78,plain,(
% 0.20/0.42 ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(skolemize,[status(sab)],[77])).
% 0.20/0.42 tff(79,plain,
% 0.20/0.42 (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[78, 71])).
% 0.20/0.42 tff(80,plain,
% 0.20/0.42 ((~![U: $i, V: $i] : (~ok(triple(U, V, bad)))) | (~ok(triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(81,plain,
% 0.20/0.42 (~ok(triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[80, 79])).
% 0.20/0.42 tff(82,plain,
% 0.20/0.42 ($false),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[81, 69])).
% 0.20/0.42 tff(83,plain,(~(remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.42 tff(84,plain,
% 0.20/0.42 (^[U: $i, V: $i, W: $i, X: $i] : refl(((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X)))) <=> ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X)))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(85,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X)))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[84])).
% 0.20/0.42 tff(86,plain,
% 0.20/0.42 (^[U: $i, V: $i, W: $i, X: $i] : trans(monotonicity(trans(monotonicity(rewrite((contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X))) <=> (~((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X)))))), ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) <=> (~(~((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X)))))))), rewrite((~(~((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X)))))) <=> ((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X))))), ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) <=> ((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X)))))), (((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> (((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))))), rewrite((((~contains_slb(V, X)) | (~strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))), (((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(87,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[86])).
% 0.20/0.42 tff(88,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(89,plain,
% 0.20/0.42 (^[U: $i, V: $i, W: $i, X: $i] : rewrite(((contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X))) => (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(90,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X))) => (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[89])).
% 0.20/0.42 tff(91,axiom,(![U: $i, V: $i, W: $i, X: $i] : ((contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X))) => (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax45')).
% 0.20/0.42 tff(92,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[91, 90])).
% 0.20/0.42 tff(93,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[92, 88])).
% 0.20/0.42 tff(94,plain,(
% 0.20/0.42 ![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & strictly_less_than(X, lookup_slb(V, X)))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)))),
% 0.20/0.42 inference(skolemize,[status(sab)],[93])).
% 0.20/0.42 tff(95,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[94, 87])).
% 0.20/0.42 tff(96,plain,
% 0.20/0.42 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[95, 85])).
% 0.20/0.42 tff(97,plain,
% 0.20/0.42 (((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))) | ((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~strictly_less_than(X!0, lookup_slb(V!2, X!0))))) <=> ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))) | (~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~strictly_less_than(X!0, lookup_slb(V!2, X!0))))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(98,plain,
% 0.20/0.42 ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))) | ((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~strictly_less_than(X!0, lookup_slb(V!2, X!0))))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(99,plain,
% 0.20/0.42 ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), bad)) | (~strictly_less_than(X, lookup_slb(V, X))))) | (~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~strictly_less_than(X!0, lookup_slb(V!2, X!0)))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[98, 97])).
% 0.20/0.42 tff(100,plain,
% 0.20/0.42 ((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~strictly_less_than(X!0, lookup_slb(V!2, X!0)))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[99, 96])).
% 0.20/0.42 tff(101,plain,
% 0.20/0.42 (~strictly_less_than(X!0, lookup_slb(V!2, X!0))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[100, 83, 64])).
% 0.20/0.42 tff(102,plain,
% 0.20/0.42 ((~(strictly_less_than(X!0, lookup_slb(V!2, X!0)) <=> (~((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0))))) | strictly_less_than(X!0, lookup_slb(V!2, X!0)) | ((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0))),
% 0.20/0.42 inference(tautology,[status(thm)],[])).
% 0.20/0.42 tff(103,plain,
% 0.20/0.42 ((~(strictly_less_than(X!0, lookup_slb(V!2, X!0)) <=> (~((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0))))) | ((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[102, 101])).
% 0.20/0.42 tff(104,plain,
% 0.20/0.42 ((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0)),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[103, 12])).
% 0.20/0.42 tff(105,plain,
% 0.20/0.42 (remove_cpq(triple(U!3, V!2, bad), X!0) = remove_cpq(triple(U!3, V!2, W!1), X!0)),
% 0.20/0.42 inference(monotonicity,[status(thm)],[40])).
% 0.20/0.42 tff(106,plain,
% 0.20/0.42 ((remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) <=> (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.42 inference(monotonicity,[status(thm)],[105])).
% 0.20/0.43 tff(107,plain,
% 0.20/0.43 ((remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) <=> (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.43 inference(symmetry,[status(thm)],[106])).
% 0.20/0.43 tff(108,plain,
% 0.20/0.43 ((~(remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))) <=> (~(remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)))),
% 0.20/0.43 inference(monotonicity,[status(thm)],[107])).
% 0.20/0.43 tff(109,plain,
% 0.20/0.43 (~(remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[83, 108])).
% 0.20/0.43 tff(110,plain,
% 0.20/0.43 (^[U: $i, V: $i, W: $i, X: $i] : refl(((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X))) <=> ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X))))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(111,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))),
% 0.20/0.43 inference(quant_intro,[status(thm)],[110])).
% 0.20/0.43 tff(112,plain,
% 0.20/0.43 (^[U: $i, V: $i, W: $i, X: $i] : trans(monotonicity(trans(monotonicity(rewrite((contains_slb(V, X) & less_than(lookup_slb(V, X), X)) <=> (~((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X))))), ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) <=> (~(~((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X))))))), rewrite((~(~((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X))))) <=> ((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X)))), ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) <=> ((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X))))), (((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> (((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))))), rewrite((((~contains_slb(V, X)) | (~less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))), (((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(113,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))),
% 0.20/0.43 inference(quant_intro,[status(thm)],[112])).
% 0.20/0.43 tff(114,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(115,plain,
% 0.20/0.43 (^[U: $i, V: $i, W: $i, X: $i] : rewrite(((contains_slb(V, X) & less_than(lookup_slb(V, X), X)) => (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(116,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((contains_slb(V, X) & less_than(lookup_slb(V, X), X)) => (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W))) <=> ![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)))),
% 0.20/0.43 inference(quant_intro,[status(thm)],[115])).
% 0.20/0.43 tff(117,axiom,(![U: $i, V: $i, W: $i, X: $i] : ((contains_slb(V, X) & less_than(lookup_slb(V, X), X)) => (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax44')).
% 0.20/0.43 tff(118,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[117, 116])).
% 0.20/0.43 tff(119,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[118, 114])).
% 0.20/0.43 tff(120,plain,(
% 0.20/0.43 ![U: $i, V: $i, W: $i, X: $i] : ((~(contains_slb(V, X) & less_than(lookup_slb(V, X), X))) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)))),
% 0.20/0.43 inference(skolemize,[status(sab)],[119])).
% 0.20/0.43 tff(121,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[120, 113])).
% 0.20/0.43 tff(122,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[121, 111])).
% 0.20/0.43 tff(123,plain,
% 0.20/0.43 (((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | ((~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)))) <=> ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | (~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(124,plain,
% 0.20/0.43 (((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~less_than(lookup_slb(V!2, X!0), X!0))) <=> ((~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(125,plain,
% 0.20/0.43 (((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | ((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~less_than(lookup_slb(V!2, X!0), X!0)))) <=> ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | ((~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))))),
% 0.20/0.43 inference(monotonicity,[status(thm)],[124])).
% 0.20/0.43 tff(126,plain,
% 0.20/0.43 (((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | ((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~less_than(lookup_slb(V!2, X!0), X!0)))) <=> ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | (~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)))),
% 0.20/0.43 inference(transitivity,[status(thm)],[125, 123])).
% 0.20/0.43 tff(127,plain,
% 0.20/0.43 ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | ((~contains_slb(V!2, X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad)) | (~less_than(lookup_slb(V!2, X!0), X!0)))),
% 0.20/0.43 inference(quant_inst,[status(thm)],[])).
% 0.20/0.43 tff(128,plain,
% 0.20/0.43 ((~![U: $i, V: $i, W: $i, X: $i] : ((~contains_slb(V, X)) | (remove_cpq(triple(U, V, W), X) = triple(remove_pqp(U, X), remove_slb(V, X), W)) | (~less_than(lookup_slb(V, X), X)))) | (~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[127, 126])).
% 0.20/0.43 tff(129,plain,
% 0.20/0.43 ((~contains_slb(V!2, X!0)) | (~less_than(lookup_slb(V!2, X!0), X!0)) | (remove_cpq(triple(U!3, V!2, bad), X!0) = triple(remove_pqp(U!3, X!0), remove_slb(V!2, X!0), bad))),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[128, 122])).
% 0.20/0.43 tff(130,plain,
% 0.20/0.43 (~less_than(lookup_slb(V!2, X!0), X!0)),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[129, 109, 64])).
% 0.20/0.43 tff(131,plain,
% 0.20/0.43 ((~((~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0))) | (~less_than(X!0, lookup_slb(V!2, X!0))) | less_than(lookup_slb(V!2, X!0), X!0)),
% 0.20/0.43 inference(tautology,[status(thm)],[])).
% 0.20/0.43 tff(132,plain,
% 0.20/0.43 (~less_than(X!0, lookup_slb(V!2, X!0))),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[131, 130, 104])).
% 0.20/0.43 tff(133,plain,
% 0.20/0.43 (^[U: $i, V: $i] : refl((less_than(V, U) | less_than(U, V)) <=> (less_than(V, U) | less_than(U, V)))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(134,plain,
% 0.20/0.43 (![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.20/0.43 inference(quant_intro,[status(thm)],[133])).
% 0.20/0.43 tff(135,plain,
% 0.20/0.43 (![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.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(136,plain,
% 0.20/0.43 (^[U: $i, V: $i] : rewrite((less_than(U, V) | less_than(V, U)) <=> (less_than(V, U) | less_than(U, V)))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(137,plain,
% 0.20/0.43 (![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.20/0.43 inference(quant_intro,[status(thm)],[136])).
% 0.20/0.43 tff(138,axiom,(![U: $i, V: $i] : (less_than(U, V) | less_than(V, U))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax','totality')).
% 0.20/0.43 tff(139,plain,
% 0.20/0.43 (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[138, 137])).
% 0.20/0.43 tff(140,plain,
% 0.20/0.43 (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[139, 135])).
% 0.20/0.43 tff(141,plain,(
% 0.20/0.43 ![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.20/0.43 inference(skolemize,[status(sab)],[140])).
% 0.20/0.43 tff(142,plain,
% 0.20/0.43 (![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[141, 134])).
% 0.20/0.43 tff(143,plain,
% 0.20/0.43 (((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | (less_than(X!0, lookup_slb(V!2, X!0)) | less_than(lookup_slb(V!2, X!0), X!0))) <=> ((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | less_than(X!0, lookup_slb(V!2, X!0)) | less_than(lookup_slb(V!2, X!0), X!0))),
% 0.20/0.44 inference(rewrite,[status(thm)],[])).
% 0.20/0.44 tff(144,plain,
% 0.20/0.44 ((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | (less_than(X!0, lookup_slb(V!2, X!0)) | less_than(lookup_slb(V!2, X!0), X!0))),
% 0.20/0.44 inference(quant_inst,[status(thm)],[])).
% 0.20/0.44 tff(145,plain,
% 0.20/0.44 ((~![U: $i, V: $i] : (less_than(V, U) | less_than(U, V))) | less_than(X!0, lookup_slb(V!2, X!0)) | less_than(lookup_slb(V!2, X!0), X!0)),
% 0.20/0.44 inference(modus_ponens,[status(thm)],[144, 143])).
% 0.20/0.44 tff(146,plain,
% 0.20/0.44 ($false),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[145, 142, 130, 132])).
% 0.20/0.44 % SZS output end Proof
%------------------------------------------------------------------------------