TSTP Solution File: COM003_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : COM003_1 : TPTP v8.1.0. Released v5.0.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 : Tue Sep 6 18:05:41 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : COM003_1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 13:29:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output start Proof
% 0.12/0.40 tff(halts2_type, type, (
% 0.12/0.40 halts2: ( program * input ) > $o)).
% 0.12/0.40 tff(as_input_type, type, (
% 0.12/0.40 as_input: program > input)).
% 0.12/0.40 tff(tptp_fun_Y_5_type, type, (
% 0.12/0.40 tptp_fun_Y_5: program > program)).
% 0.12/0.40 tff(tptp_fun_V_4_type, type, (
% 0.12/0.40 tptp_fun_V_4: program)).
% 0.12/0.40 tff(outputs_type, type, (
% 0.12/0.40 outputs: ( program * output ) > $o)).
% 0.12/0.40 tff(bad_type, type, (
% 0.12/0.40 bad: output)).
% 0.12/0.40 tff(good_type, type, (
% 0.12/0.40 good: output)).
% 0.12/0.40 tff(halts3_type, type, (
% 0.12/0.40 halts3: ( program * program * input ) > $o)).
% 0.12/0.40 tff(tptp_fun_Y_3_type, type, (
% 0.12/0.40 tptp_fun_Y_3: program > program)).
% 0.12/0.40 tff(tptp_fun_W_2_type, type, (
% 0.12/0.40 tptp_fun_W_2: program)).
% 0.12/0.40 tff(decides_type, type, (
% 0.12/0.40 decides: ( algorithm * program * input ) > $o)).
% 0.12/0.40 tff(elem_9_type, type, (
% 0.12/0.40 elem_9: input)).
% 0.12/0.40 tff(elem_10_type, type, (
% 0.12/0.40 elem_10: program)).
% 0.12/0.40 tff(algorithm_of_type, type, (
% 0.12/0.40 algorithm_of: program > algorithm)).
% 0.12/0.40 tff(tptp_fun_Z_0_type, type, (
% 0.12/0.40 tptp_fun_Z_0: algorithm > input)).
% 0.12/0.40 tff(tptp_fun_Y_1_type, type, (
% 0.12/0.40 tptp_fun_Y_1: algorithm > program)).
% 0.12/0.40 tff(tptp_fun_X1_7_type, type, (
% 0.12/0.40 tptp_fun_X1_7: algorithm)).
% 0.12/0.40 tff(tptp_fun_U_6_type, type, (
% 0.12/0.40 tptp_fun_U_6: program)).
% 0.12/0.40 tff(1,assumption,((~((~halts2(tptp_fun_Y_5(V!4), as_input(tptp_fun_Y_5(V!4)))) | (~((~outputs(V!4, good)) | (~halts2(V!4, as_input(tptp_fun_Y_5(V!4)))))))) | (~(halts2(tptp_fun_Y_5(V!4), as_input(tptp_fun_Y_5(V!4))) | (~((~outputs(V!4, bad)) | (~halts2(V!4, as_input(tptp_fun_Y_5(V!4))))))))), introduced(assumption)).
% 0.12/0.40 tff(2,assumption,((~((~halts2(tptp_fun_Y_3(W!2), as_input(tptp_fun_Y_3(W!2)))) | (~((~outputs(W!2, good)) | (~halts3(W!2, tptp_fun_Y_3(W!2), as_input(tptp_fun_Y_3(W!2)))))))) | (~(halts2(tptp_fun_Y_3(W!2), as_input(tptp_fun_Y_3(W!2))) | (~((~outputs(W!2, bad)) | (~halts3(W!2, tptp_fun_Y_3(W!2), as_input(tptp_fun_Y_3(W!2))))))))), introduced(assumption)).
% 0.12/0.40 tff(3,assumption,(~decides(X1!7, tptp_fun_Y_1(X1!7), tptp_fun_Z_0(X1!7))), introduced(assumption)).
% 0.12/0.40 tff(4,plain,
% 0.12/0.40 (^[Y1: program, Z1: input] : refl(decides(X1!7, Y1, Z1) <=> decides(X1!7, Y1, Z1))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(5,plain,
% 0.12/0.40 (![Y1: program, Z1: input] : decides(X1!7, Y1, Z1) <=> ![Y1: program, Z1: input] : decides(X1!7, Y1, Z1)),
% 0.12/0.40 inference(quant_intro,[status(thm)],[4])).
% 0.12/0.40 tff(6,plain,
% 0.12/0.40 (?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1) <=> ?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(7,plain,
% 0.12/0.40 ((~(~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1))) <=> ?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(8,plain,
% 0.12/0.40 ((~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)) <=> (~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(9,plain,
% 0.12/0.40 ((~(~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1))) <=> (~(~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)))),
% 0.12/0.40 inference(monotonicity,[status(thm)],[8])).
% 0.12/0.40 tff(10,plain,
% 0.12/0.40 ((~(~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1))) <=> ?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)),
% 0.12/0.40 inference(transitivity,[status(thm)],[9, 7])).
% 0.12/0.40 tff(11,axiom,(~(~?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_this')).
% 0.12/0.40 tff(12,plain,
% 0.12/0.40 (?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[11, 10])).
% 0.12/0.40 tff(13,plain,
% 0.12/0.40 (?[X1: algorithm] : ![Y1: program, Z1: input] : decides(X1, Y1, Z1)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[12, 6])).
% 0.12/0.40 tff(14,plain,(
% 0.12/0.40 $oeq(![Y1: program, Z1: input] : decides(X1!7, Y1, Z1), ![Y1: program, Z1: input] : decides(X1!7, Y1, Z1))),
% 0.12/0.40 inference(transitivity,[status(sab)],[13])).
% 0.12/0.40 tff(15,plain,
% 0.12/0.40 (![Y1: program, Z1: input] : decides(X1!7, Y1, Z1)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[14, 5])).
% 0.12/0.40 tff(16,plain,
% 0.12/0.40 ((~![Y1: program, Z1: input] : decides(X1!7, Y1, Z1)) | decides(X1!7, tptp_fun_Y_1(X1!7), tptp_fun_Z_0(X1!7))),
% 0.12/0.41 inference(quant_inst,[status(thm)],[])).
% 0.12/0.41 tff(17,plain,
% 0.12/0.41 ($false),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[16, 15, 3])).
% 0.12/0.41 tff(18,plain,(decides(X1!7, tptp_fun_Y_1(X1!7), tptp_fun_Z_0(X1!7))), inference(lemma,lemma(discharge,[]))).
% 0.12/0.41 tff(19,plain,
% 0.12/0.41 ((~![X: algorithm] : (~decides(X, tptp_fun_Y_1(X), tptp_fun_Z_0(X)))) | (~decides(X1!7, tptp_fun_Y_1(X1!7), tptp_fun_Z_0(X1!7)))),
% 0.12/0.41 inference(quant_inst,[status(thm)],[])).
% 0.12/0.41 tff(20,plain,
% 0.12/0.41 (~![X: algorithm] : (~decides(X, tptp_fun_Y_1(X), tptp_fun_Z_0(X)))),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[19, 18])).
% 0.12/0.41 tff(21,plain,
% 0.12/0.41 ((![X: algorithm] : (~decides(X, tptp_fun_Y_1(X), tptp_fun_Z_0(X))) | ![Y: program, Z: input] : decides(algorithm_of(W!2), Y, Z)) <=> (![X: algorithm] : (~decides(X, tptp_fun_Y_1(X), tptp_fun_Z_0(X))) | ![Y: program, Z: input] : decides(algorithm_of(W!2), Y, Z))),
% 0.12/0.41 inference(rewrite,[status(thm)],[])).
% 0.12/0.41 tff(22,plain,
% 0.12/0.41 ((![X: algorithm] : (~decides(X, tptp_fun_Y_1(X), tptp_fun_Z_0(X))) | ![Y: program, Z: input] : decides(algorithm_of(W!2), Y, Z)) <=> (![X: algorithm] : (~decides(X, tptp_fun_Y_1(X), tptp_fun_Z_0(X))) | ![Y: program, Z: input] : decides(algorithm_of(W!2), Y, Z))),
% 0.12/0.41 inference(rewrite,[status(thm)],[])).
% 0.12/0.41 tff(23,plain,
% 0.12/0.41 (((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)) <=> ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z))),
% 0.12/0.41 inference(rewrite,[status(thm)],[])).
% 0.12/0.41 tff(24,plain,
% 0.12/0.41 ((?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z) => ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)) <=> ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z))),
% 0.12/0.41 inference(rewrite,[status(thm)],[])).
% 0.12/0.41 tff(25,axiom,(?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z) => ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','p1')).
% 0.12/0.41 tff(26,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[25, 24])).
% 0.12/0.41 tff(27,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[26, 23])).
% 0.12/0.41 tff(28,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[27, 23])).
% 0.12/0.41 tff(29,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[28, 23])).
% 0.12/0.41 tff(30,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[29, 23])).
% 0.12/0.41 tff(31,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[30, 23])).
% 0.12/0.41 tff(32,plain,
% 0.12/0.41 ((~?[X: algorithm] : ![Y: program, Z: input] : decides(X, Y, Z)) | ?[W: program] : ![Y: program, Z: input] : decides(algorithm_of(W), Y, Z)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[31, 23])).
% 0.12/0.41 Proof display could not be completed: monotonicity rule is not handled
%------------------------------------------------------------------------------