TSTP Solution File: SWV392+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV392+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n015.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:36 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV392+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Sep 4 03:01:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.20/0.38 % SZS status Theorem
% 0.20/0.38 % SZS output start Proof
% 0.20/0.38 tff(contains_slb_type, type, (
% 0.20/0.38 contains_slb: ( $i * $i ) > $o)).
% 0.20/0.38 tff(tptp_fun_W_2_type, type, (
% 0.20/0.38 tptp_fun_W_2: $i)).
% 0.20/0.38 tff(create_slb_type, type, (
% 0.20/0.38 create_slb: $i)).
% 0.20/0.38 tff(pair_in_list_type, type, (
% 0.20/0.38 pair_in_list: ( $i * $i * $i ) > $o)).
% 0.20/0.38 tff(tptp_fun_V_0_type, type, (
% 0.20/0.38 tptp_fun_V_0: $i)).
% 0.20/0.38 tff(tptp_fun_U_1_type, type, (
% 0.20/0.38 tptp_fun_U_1: $i)).
% 0.20/0.38 tff(remove_slb_type, type, (
% 0.20/0.38 remove_slb: ( $i * $i ) > $i)).
% 0.20/0.38 tff(1,plain,
% 0.20/0.38 (((~(~pair_in_list(create_slb, U!1, V!0))) & (~((~contains_slb(create_slb, W!2)) | (U!1 = W!2) | pair_in_list(remove_slb(create_slb, W!2), U!1, V!0)))) <=> (pair_in_list(create_slb, U!1, V!0) & (~((~contains_slb(create_slb, W!2)) | (U!1 = W!2) | pair_in_list(remove_slb(create_slb, W!2), U!1, V!0))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(2,plain,
% 0.20/0.38 ((~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))) <=> (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(3,plain,
% 0.20/0.38 ((~![U: $i, V: $i] : (pair_in_list(create_slb, U, V) => ![W: $i] : (contains_slb(create_slb, W) => (pair_in_list(remove_slb(create_slb, W), U, V) | (U = W))))) <=> (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V))))),
% 0.20/0.38 inference(rewrite,[status(thm)],[])).
% 0.20/0.38 tff(4,axiom,(~![U: $i, V: $i] : (pair_in_list(create_slb, U, V) => ![W: $i] : (contains_slb(create_slb, W) => (pair_in_list(remove_slb(create_slb, W), U, V) | (U = W))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l28_co')).
% 0.20/0.38 tff(5,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.20/0.38 tff(6,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[5, 2])).
% 0.20/0.38 tff(7,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.20/0.38 tff(8,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[7, 2])).
% 0.20/0.38 tff(9,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[8, 2])).
% 0.20/0.38 tff(10,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.20/0.38 tff(11,plain,
% 0.20/0.38 (~![U: $i, V: $i] : ((~pair_in_list(create_slb, U, V)) | ![W: $i] : ((~contains_slb(create_slb, W)) | (U = W) | pair_in_list(remove_slb(create_slb, W), U, V)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[10, 2])).
% 0.20/0.38 tff(12,plain,
% 0.20/0.38 (pair_in_list(create_slb, U!1, V!0) & (~((~contains_slb(create_slb, W!2)) | (U!1 = W!2) | pair_in_list(remove_slb(create_slb, W!2), U!1, V!0)))),
% 0.20/0.38 inference(modus_ponens,[status(thm)],[11, 1])).
% 0.20/0.38 tff(13,plain,
% 0.20/0.38 (~((~contains_slb(create_slb, W!2)) | (U!1 = W!2) | pair_in_list(remove_slb(create_slb, W!2), U!1, V!0))),
% 0.20/0.38 inference(and_elim,[status(thm)],[12])).
% 0.20/0.38 tff(14,plain,
% 0.20/0.38 (contains_slb(create_slb, W!2)),
% 0.20/0.38 inference(or_elim,[status(thm)],[13])).
% 0.20/0.38 tff(15,plain,
% 0.20/0.38 (^[U: $i] : refl((~contains_slb(create_slb, U)) <=> (~contains_slb(create_slb, U)))),
% 0.20/0.38 inference(bind,[status(th)],[])).
% 0.20/0.38 tff(16,plain,
% 0.20/0.38 (![U: $i] : (~contains_slb(create_slb, U)) <=> ![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[15])).
% 0.20/0.39 tff(17,plain,
% 0.20/0.39 (![U: $i] : (~contains_slb(create_slb, U)) <=> ![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(18,axiom,(![U: $i] : (~contains_slb(create_slb, U))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax','ax20')).
% 0.20/0.39 tff(19,plain,
% 0.20/0.39 (![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[18, 17])).
% 0.20/0.39 tff(20,plain,(
% 0.20/0.39 ![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.39 inference(skolemize,[status(sab)],[19])).
% 0.20/0.39 tff(21,plain,
% 0.20/0.39 (![U: $i] : (~contains_slb(create_slb, U))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[20, 16])).
% 0.20/0.39 tff(22,plain,
% 0.20/0.39 ((~![U: $i] : (~contains_slb(create_slb, U))) | (~contains_slb(create_slb, W!2))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(23,plain,
% 0.20/0.39 ($false),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[22, 21, 14])).
% 0.20/0.39 % SZS output end Proof
%------------------------------------------------------------------------------