TSTP Solution File: SWV369+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n010.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:30 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Sep 4 02:35:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start Proof
% 0.20/0.43 tff(contains_pq_type, type, (
% 0.20/0.43 contains_pq: ( $i * $i ) > $o)).
% 0.20/0.43 tff(tptp_fun_W_3_type, type, (
% 0.20/0.43 tptp_fun_W_3: $i)).
% 0.20/0.43 tff(create_pq_type, type, (
% 0.20/0.43 create_pq: $i)).
% 0.20/0.43 tff(i_type, type, (
% 0.20/0.43 i: $i > $i)).
% 0.20/0.43 tff(triple_type, type, (
% 0.20/0.43 triple: ( $i * $i * $i ) > $i)).
% 0.20/0.43 tff(tptp_fun_V_4_type, type, (
% 0.20/0.43 tptp_fun_V_4: $i)).
% 0.20/0.43 tff(create_slb_type, type, (
% 0.20/0.43 create_slb: $i)).
% 0.20/0.43 tff(tptp_fun_U_5_type, type, (
% 0.20/0.43 tptp_fun_U_5: $i)).
% 0.20/0.43 tff(contains_cpq_type, type, (
% 0.20/0.43 contains_cpq: ( $i * $i ) > $o)).
% 0.20/0.43 tff(contains_slb_type, type, (
% 0.20/0.43 contains_slb: ( $i * $i ) > $o)).
% 0.20/0.43 tff(1,plain,
% 0.20/0.43 (^[U: $i, V: $i] : refl((i(triple(U, create_slb, V)) = create_pq) <=> (i(triple(U, create_slb, V)) = create_pq))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(2,plain,
% 0.20/0.43 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq) <=> ![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.20/0.43 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.43 tff(3,plain,
% 0.20/0.43 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq) <=> ![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(4,axiom,(![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax','ax54')).
% 0.20/0.43 tff(5,plain,
% 0.20/0.43 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.20/0.43 tff(6,plain,(
% 0.20/0.43 ![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.20/0.43 inference(skolemize,[status(sab)],[5])).
% 0.20/0.43 tff(7,plain,
% 0.20/0.43 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.20/0.43 tff(8,plain,
% 0.20/0.43 ((~![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)) | (i(triple(U!5, create_slb, V!4)) = create_pq)),
% 0.20/0.43 inference(quant_inst,[status(thm)],[])).
% 0.20/0.43 tff(9,plain,
% 0.20/0.43 (i(triple(U!5, create_slb, V!4)) = create_pq),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.20/0.43 tff(10,plain,
% 0.20/0.43 (create_pq = i(triple(U!5, create_slb, V!4))),
% 0.20/0.43 inference(symmetry,[status(thm)],[9])).
% 0.20/0.43 tff(11,plain,
% 0.20/0.43 (contains_pq(create_pq, W!3) <=> contains_pq(i(triple(U!5, create_slb, V!4)), W!3)),
% 0.20/0.43 inference(monotonicity,[status(thm)],[10])).
% 0.20/0.43 tff(12,plain,
% 0.20/0.43 (contains_pq(i(triple(U!5, create_slb, V!4)), W!3) <=> contains_pq(create_pq, W!3)),
% 0.20/0.43 inference(symmetry,[status(thm)],[11])).
% 0.20/0.43 tff(13,plain,
% 0.20/0.43 (^[U: $i, V: $i, W: $i, X: $i] : refl((contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)) <=> (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(14,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.20/0.43 inference(quant_intro,[status(thm)],[13])).
% 0.20/0.43 tff(15,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X)) <=> ![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(16,axiom,(![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax','ax39')).
% 0.20/0.43 tff(17,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[16, 15])).
% 0.20/0.43 tff(18,plain,(
% 0.20/0.43 ![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.20/0.43 inference(skolemize,[status(sab)],[17])).
% 0.20/0.43 tff(19,plain,
% 0.20/0.43 (![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[18, 14])).
% 0.20/0.43 tff(20,plain,
% 0.20/0.43 ((~![U: $i, V: $i, W: $i, X: $i] : (contains_cpq(triple(U, V, W), X) <=> contains_slb(V, X))) | (contains_cpq(triple(U!5, create_slb, V!4), W!3) <=> contains_slb(create_slb, W!3))),
% 0.20/0.43 inference(quant_inst,[status(thm)],[])).
% 0.20/0.43 tff(21,plain,
% 0.20/0.43 (contains_cpq(triple(U!5, create_slb, V!4), W!3) <=> contains_slb(create_slb, W!3)),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[20, 19])).
% 0.20/0.43 tff(22,plain,
% 0.20/0.43 (^[U: $i] : refl((~contains_slb(create_slb, U)) <=> (~contains_slb(create_slb, U)))),
% 0.20/0.43 inference(bind,[status(th)],[])).
% 0.20/0.43 tff(23,plain,
% 0.20/0.43 (![U: $i] : (~contains_slb(create_slb, U)) <=> ![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.43 inference(quant_intro,[status(thm)],[22])).
% 0.20/0.43 tff(24,plain,
% 0.20/0.43 (![U: $i] : (~contains_slb(create_slb, U)) <=> ![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(25,axiom,(![U: $i] : (~contains_slb(create_slb, U))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax','ax20')).
% 0.20/0.43 tff(26,plain,
% 0.20/0.43 (![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[25, 24])).
% 0.20/0.43 tff(27,plain,(
% 0.20/0.43 ![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.43 inference(skolemize,[status(sab)],[26])).
% 0.20/0.43 tff(28,plain,
% 0.20/0.43 (![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[27, 23])).
% 0.20/0.43 tff(29,plain,
% 0.20/0.43 ((~![U: $i] : (~contains_slb(create_slb, U))) | (~contains_slb(create_slb, W!3))),
% 0.20/0.43 inference(quant_inst,[status(thm)],[])).
% 0.20/0.43 tff(30,plain,
% 0.20/0.43 (~contains_slb(create_slb, W!3)),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[29, 28])).
% 0.20/0.43 tff(31,plain,
% 0.20/0.43 ((~(contains_cpq(triple(U!5, create_slb, V!4), W!3) <=> contains_slb(create_slb, W!3))) | (~contains_cpq(triple(U!5, create_slb, V!4), W!3)) | contains_slb(create_slb, W!3)),
% 0.20/0.43 inference(tautology,[status(thm)],[])).
% 0.20/0.43 tff(32,plain,
% 0.20/0.43 (~contains_cpq(triple(U!5, create_slb, V!4), W!3)),
% 0.20/0.43 inference(unit_resolution,[status(thm)],[31, 30, 21])).
% 0.20/0.43 tff(33,plain,
% 0.20/0.43 ((~(contains_cpq(triple(U!5, create_slb, V!4), W!3) <=> contains_pq(i(triple(U!5, create_slb, V!4)), W!3))) <=> ((~contains_cpq(triple(U!5, create_slb, V!4), W!3)) <=> contains_pq(i(triple(U!5, create_slb, V!4)), W!3))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(34,plain,
% 0.20/0.43 ((~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))) <=> (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W)))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(35,axiom,(~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l5_co')).
% 0.20/0.43 tff(36,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[35, 34])).
% 0.20/0.43 tff(37,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[36, 34])).
% 0.20/0.43 tff(38,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[37, 34])).
% 0.20/0.43 tff(39,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[38, 34])).
% 0.20/0.43 tff(40,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[39, 34])).
% 0.20/0.43 tff(41,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[40, 34])).
% 0.20/0.43 tff(42,plain,
% 0.20/0.43 (~![U: $i, V: $i, W: $i] : (contains_cpq(triple(U, create_slb, V), W) <=> contains_pq(i(triple(U, create_slb, V)), W))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[41, 34])).
% 0.20/0.43 tff(43,plain,(
% 0.20/0.43 ~(contains_cpq(triple(U!5, create_slb, V!4), W!3) <=> contains_pq(i(triple(U!5, create_slb, V!4)), W!3))),
% 0.20/0.43 inference(skolemize,[status(sab)],[42])).
% 0.20/0.43 tff(44,plain,
% 0.20/0.43 ((~contains_cpq(triple(U!5, create_slb, V!4), W!3)) <=> contains_pq(i(triple(U!5, create_slb, V!4)), W!3)),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[43, 33])).
% 0.20/0.44 tff(45,plain,
% 0.20/0.44 (contains_cpq(triple(U!5, create_slb, V!4), W!3) | contains_pq(i(triple(U!5, create_slb, V!4)), W!3) | (~((~contains_cpq(triple(U!5, create_slb, V!4), W!3)) <=> contains_pq(i(triple(U!5, create_slb, V!4)), W!3)))),
% 0.20/0.44 inference(tautology,[status(thm)],[])).
% 0.20/0.44 tff(46,plain,
% 0.20/0.44 (contains_cpq(triple(U!5, create_slb, V!4), W!3) | contains_pq(i(triple(U!5, create_slb, V!4)), W!3)),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[45, 44])).
% 0.20/0.44 tff(47,plain,
% 0.20/0.44 (contains_pq(i(triple(U!5, create_slb, V!4)), W!3)),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[46, 32])).
% 0.20/0.44 tff(48,plain,
% 0.20/0.44 (contains_pq(create_pq, W!3)),
% 0.20/0.44 inference(modus_ponens,[status(thm)],[47, 12])).
% 0.20/0.44 tff(49,plain,
% 0.20/0.44 (^[U: $i] : refl((~contains_pq(create_pq, U)) <=> (~contains_pq(create_pq, U)))),
% 0.20/0.44 inference(bind,[status(th)],[])).
% 0.20/0.44 tff(50,plain,
% 0.20/0.44 (![U: $i] : (~contains_pq(create_pq, U)) <=> ![U: $i] : (~contains_pq(create_pq, U))),
% 0.20/0.44 inference(quant_intro,[status(thm)],[49])).
% 0.20/0.44 tff(51,plain,
% 0.20/0.44 (![U: $i] : (~contains_pq(create_pq, U)) <=> ![U: $i] : (~contains_pq(create_pq, U))),
% 0.20/0.44 inference(rewrite,[status(thm)],[])).
% 0.20/0.44 tff(52,axiom,(![U: $i] : (~contains_pq(create_pq, U))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax','ax8')).
% 0.20/0.44 tff(53,plain,
% 0.20/0.44 (![U: $i] : (~contains_pq(create_pq, U))),
% 0.20/0.44 inference(modus_ponens,[status(thm)],[52, 51])).
% 0.20/0.44 tff(54,plain,(
% 0.20/0.44 ![U: $i] : (~contains_pq(create_pq, U))),
% 0.20/0.44 inference(skolemize,[status(sab)],[53])).
% 0.20/0.44 tff(55,plain,
% 0.20/0.44 (![U: $i] : (~contains_pq(create_pq, U))),
% 0.20/0.44 inference(modus_ponens,[status(thm)],[54, 50])).
% 0.20/0.44 tff(56,plain,
% 0.20/0.44 ((~![U: $i] : (~contains_pq(create_pq, U))) | (~contains_pq(create_pq, W!3))),
% 0.20/0.44 inference(quant_inst,[status(thm)],[])).
% 0.20/0.44 tff(57,plain,
% 0.20/0.44 (~contains_pq(create_pq, W!3)),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[56, 55])).
% 0.20/0.44 tff(58,plain,
% 0.20/0.44 ($false),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[57, 48])).
% 0.20/0.44 % SZS output end Proof
%------------------------------------------------------------------------------