TSTP Solution File: SWV397+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n005.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:37 EDT 2022
% Result : Theorem 0.22s 0.43s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun Sep 4 02:51:03 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.14/0.37 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.37 Usage: tptp [options] [-file:]file
% 0.14/0.37 -h, -? prints this message.
% 0.14/0.37 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.37 -m, -model generate model.
% 0.14/0.37 -p, -proof generate proof.
% 0.14/0.37 -c, -core generate unsat core of named formulas.
% 0.14/0.37 -st, -statistics display statistics.
% 0.14/0.37 -t:timeout set timeout (in second).
% 0.14/0.37 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.37 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.37 -<param>:<value> configuration parameter and value.
% 0.14/0.37 -o:<output-file> file to place output in.
% 0.22/0.43 % SZS status Theorem
% 0.22/0.43 % SZS output start Proof
% 0.22/0.43 tff(ok_type, type, (
% 0.22/0.43 ok: $i > $o)).
% 0.22/0.43 tff(triple_type, type, (
% 0.22/0.43 triple: ( $i * $i * $i ) > $i)).
% 0.22/0.43 tff(bad_type, type, (
% 0.22/0.43 bad: $i)).
% 0.22/0.43 tff(tptp_fun_V_2_type, type, (
% 0.22/0.43 tptp_fun_V_2: $i)).
% 0.22/0.43 tff(tptp_fun_U_3_type, type, (
% 0.22/0.43 tptp_fun_U_3: $i)).
% 0.22/0.43 tff(remove_cpq_type, type, (
% 0.22/0.43 remove_cpq: ( $i * $i ) > $i)).
% 0.22/0.43 tff(tptp_fun_X_0_type, type, (
% 0.22/0.43 tptp_fun_X_0: $i)).
% 0.22/0.43 tff(tptp_fun_W_1_type, type, (
% 0.22/0.43 tptp_fun_W_1: $i)).
% 0.22/0.43 tff(contains_slb_type, type, (
% 0.22/0.43 contains_slb: ( $i * $i ) > $o)).
% 0.22/0.43 tff(1,plain,
% 0.22/0.43 ((~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))) <=> (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X)))),
% 0.22/0.43 inference(rewrite,[status(thm)],[])).
% 0.22/0.43 tff(2,plain,
% 0.22/0.43 ((~![U: $i, V: $i, W: $i, X: $i] : (ok(remove_cpq(triple(U, V, W), X)) => contains_slb(V, X))) <=> (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X)))),
% 0.22/0.43 inference(rewrite,[status(thm)],[])).
% 0.22/0.43 tff(3,axiom,(~![U: $i, V: $i, W: $i, X: $i] : (ok(remove_cpq(triple(U, V, W), X)) => contains_slb(V, X))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l33_co')).
% 0.22/0.43 tff(4,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.22/0.43 tff(5,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.22/0.43 tff(6,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.22/0.43 tff(7,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.22/0.43 tff(8,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[7, 1])).
% 0.22/0.43 tff(9,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.22/0.43 tff(10,plain,
% 0.22/0.43 (~![U: $i, V: $i, W: $i, X: $i] : ((~ok(remove_cpq(triple(U, V, W), X))) | contains_slb(V, X))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[9, 1])).
% 0.22/0.43 tff(11,plain,(
% 0.22/0.43 ~((~ok(remove_cpq(triple(U!3, V!2, W!1), X!0))) | contains_slb(V!2, X!0))),
% 0.22/0.43 inference(skolemize,[status(sab)],[10])).
% 0.22/0.43 tff(12,plain,
% 0.22/0.43 (~contains_slb(V!2, X!0)),
% 0.22/0.43 inference(or_elim,[status(thm)],[11])).
% 0.22/0.43 tff(13,plain,
% 0.22/0.43 (^[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.22/0.43 inference(bind,[status(th)],[])).
% 0.22/0.43 tff(14,plain,
% 0.22/0.43 (![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.22/0.43 inference(quant_intro,[status(thm)],[13])).
% 0.22/0.43 tff(15,plain,
% 0.22/0.43 (![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.22/0.43 inference(rewrite,[status(thm)],[])).
% 0.22/0.43 tff(16,plain,
% 0.22/0.43 (^[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.22/0.43 inference(bind,[status(th)],[])).
% 0.22/0.43 tff(17,plain,
% 0.22/0.43 (![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.22/0.43 inference(quant_intro,[status(thm)],[16])).
% 0.22/0.43 tff(18,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.22/0.43 tff(19,plain,
% 0.22/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[18, 17])).
% 0.22/0.43 tff(20,plain,
% 0.22/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[19, 15])).
% 0.22/0.43 tff(21,plain,(
% 0.22/0.43 ![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.22/0.43 inference(skolemize,[status(sab)],[20])).
% 0.22/0.43 tff(22,plain,
% 0.22/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_slb(V, X) | (remove_cpq(triple(U, V, W), X) = triple(U, V, bad)))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[21, 14])).
% 0.22/0.43 tff(23,plain,
% 0.22/0.43 (((~![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.22/0.43 inference(rewrite,[status(thm)],[])).
% 0.22/0.43 tff(24,plain,
% 0.22/0.43 ((~![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.22/0.43 inference(quant_inst,[status(thm)],[])).
% 0.22/0.43 tff(25,plain,
% 0.22/0.43 ((~![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.22/0.43 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.22/0.43 tff(26,plain,
% 0.22/0.43 (remove_cpq(triple(U!3, V!2, W!1), X!0) = triple(U!3, V!2, bad)),
% 0.22/0.43 inference(unit_resolution,[status(thm)],[25, 22, 12])).
% 0.22/0.43 tff(27,plain,
% 0.22/0.43 (triple(U!3, V!2, bad) = remove_cpq(triple(U!3, V!2, W!1), X!0)),
% 0.22/0.43 inference(symmetry,[status(thm)],[26])).
% 0.22/0.43 tff(28,plain,
% 0.22/0.43 (ok(triple(U!3, V!2, bad)) <=> ok(remove_cpq(triple(U!3, V!2, W!1), X!0))),
% 0.22/0.43 inference(monotonicity,[status(thm)],[27])).
% 0.22/0.43 tff(29,plain,
% 0.22/0.43 (ok(remove_cpq(triple(U!3, V!2, W!1), X!0)) <=> ok(triple(U!3, V!2, bad))),
% 0.22/0.43 inference(symmetry,[status(thm)],[28])).
% 0.22/0.43 tff(30,plain,
% 0.22/0.43 (ok(remove_cpq(triple(U!3, V!2, W!1), X!0))),
% 0.22/0.43 inference(or_elim,[status(thm)],[11])).
% 0.22/0.43 tff(31,plain,
% 0.22/0.43 (ok(triple(U!3, V!2, bad))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.22/0.43 tff(32,plain,
% 0.22/0.43 (^[U: $i, V: $i] : refl((~ok(triple(U, V, bad))) <=> (~ok(triple(U, V, bad))))),
% 0.22/0.43 inference(bind,[status(th)],[])).
% 0.22/0.43 tff(33,plain,
% 0.22/0.43 (![U: $i, V: $i] : (~ok(triple(U, V, bad))) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(quant_intro,[status(thm)],[32])).
% 0.22/0.43 tff(34,plain,
% 0.22/0.43 (![U: $i, V: $i] : (~ok(triple(U, V, bad))) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(rewrite,[status(thm)],[])).
% 0.22/0.43 tff(35,plain,
% 0.22/0.43 (^[U: $i, V: $i] : rewrite((ok(triple(U, V, bad)) <=> $false) <=> (~ok(triple(U, V, bad))))),
% 0.22/0.43 inference(bind,[status(th)],[])).
% 0.22/0.43 tff(36,plain,
% 0.22/0.43 (![U: $i, V: $i] : (ok(triple(U, V, bad)) <=> $false) <=> ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(quant_intro,[status(thm)],[35])).
% 0.22/0.43 tff(37,axiom,(![U: $i, V: $i] : (ok(triple(U, V, bad)) <=> $false)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax40')).
% 0.22/0.43 tff(38,plain,
% 0.22/0.43 (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.22/0.43 tff(39,plain,
% 0.22/0.43 (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[38, 34])).
% 0.22/0.43 tff(40,plain,(
% 0.22/0.43 ![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(skolemize,[status(sab)],[39])).
% 0.22/0.43 tff(41,plain,
% 0.22/0.43 (![U: $i, V: $i] : (~ok(triple(U, V, bad)))),
% 0.22/0.43 inference(modus_ponens,[status(thm)],[40, 33])).
% 0.22/0.43 tff(42,plain,
% 0.22/0.43 ((~![U: $i, V: $i] : (~ok(triple(U, V, bad)))) | (~ok(triple(U!3, V!2, bad)))),
% 0.22/0.43 inference(quant_inst,[status(thm)],[])).
% 0.22/0.44 tff(43,plain,
% 0.22/0.44 (~ok(triple(U!3, V!2, bad))),
% 0.22/0.44 inference(unit_resolution,[status(thm)],[42, 41])).
% 0.22/0.44 tff(44,plain,
% 0.22/0.44 ($false),
% 0.22/0.44 inference(unit_resolution,[status(thm)],[43, 31])).
% 0.22/0.44 % SZS output end Proof
%------------------------------------------------------------------------------