TSTP Solution File: COM001_10 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : COM001_10 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n022.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 : Mon May 22 15:23:57 EDT 2023
% Result : Satisfiable 0.20s 0.41s
% Output : Model 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM001_10 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n022.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 : Mon May 22 11:02:15 EDT 2023
% 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.41 % SZS status Satisfiable
% 0.20/0.41 % SZS output start Model
% 0.20/0.41 tff(register_val_0_type, type, (
% 0.20/0.41 register_val_0: register)).
% 0.20/0.41 tff(register_j_type, type, (
% 0.20/0.41 register_j: register)).
% 0.20/0.41 tff(label_val_0_type, type, (
% 0.20/0.41 label_val_0: label)).
% 0.20/0.41 tff(loop_type, type, (
% 0.20/0.41 loop: label)).
% 0.20/0.41 tff(label_val_1_type, type, (
% 0.20/0.41 label_val_1: label)).
% 0.20/0.41 tff(out_type, type, (
% 0.20/0.41 out: label)).
% 0.20/0.41 tff(number_val_0_type, type, (
% 0.20/0.41 number_val_0: number)).
% 0.20/0.41 tff(n_type, type, (
% 0.20/0.41 n: number)).
% 0.20/0.41 tff(state_val_1_type, type, (
% 0.20/0.41 state_val_1: state)).
% 0.20/0.41 tff(p4_type, type, (
% 0.20/0.41 p4: state)).
% 0.20/0.41 tff(state_val_0_type, type, (
% 0.20/0.41 state_val_0: state)).
% 0.20/0.41 tff(p3_type, type, (
% 0.20/0.41 p3: state)).
% 0.20/0.41 tff(state_val_3_type, type, (
% 0.20/0.41 state_val_3: state)).
% 0.20/0.41 tff(p8_type, type, (
% 0.20/0.41 p8: state)).
% 0.20/0.41 tff(state_val_2_type, type, (
% 0.20/0.41 state_val_2: state)).
% 0.20/0.41 tff(p5_type, type, (
% 0.20/0.41 p5: state)).
% 0.20/0.41 tff(statement_val_3_type, type, (
% 0.20/0.41 statement_val_3: statement)).
% 0.20/0.41 tff(statement_val_0_type, type, (
% 0.20/0.41 statement_val_0: statement)).
% 0.20/0.41 tff(ifthen_type, type, (
% 0.20/0.41 ifthen: ( boolean * state ) > statement)).
% 0.20/0.41 tff(succeeds_type, type, (
% 0.20/0.41 succeeds: ( state * state ) > $o)).
% 0.20/0.41 tff(statement_val_4_type, type, (
% 0.20/0.41 statement_val_4: statement)).
% 0.20/0.41 tff(statement_val_1_type, type, (
% 0.20/0.41 statement_val_1: statement)).
% 0.20/0.41 tff(statement_val_2_type, type, (
% 0.20/0.41 statement_val_2: statement)).
% 0.20/0.41 tff(goto_type, type, (
% 0.20/0.41 goto: label > statement)).
% 0.20/0.41 tff(follows_type, type, (
% 0.20/0.41 follows: ( state * state ) > $o)).
% 0.20/0.41 tff(boolean_val_0_type, type, (
% 0.20/0.41 boolean_val_0: boolean)).
% 0.20/0.41 tff(equal_function_type, type, (
% 0.20/0.41 equal_function: ( register * number ) > boolean)).
% 0.20/0.41 tff(labels_type, type, (
% 0.20/0.41 labels: ( label * state ) > $o)).
% 0.20/0.41 tff(has_type, type, (
% 0.20/0.41 has: ( state * statement ) > $o)).
% 0.20/0.41 tff(formula1, axiom,
% 0.20/0.41 register_j = register!val!0).
% 0.20/0.41 tff(formula2, axiom,
% 0.20/0.41 loop = label!val!0).
% 0.20/0.41 tff(formula3, axiom,
% 0.20/0.41 out = label!val!1).
% 0.20/0.41 tff(formula4, axiom,
% 0.20/0.41 n = number!val!0).
% 0.20/0.41 tff(formula5, axiom,
% 0.20/0.41 p4 = state!val!1).
% 0.20/0.41 tff(formula6, axiom,
% 0.20/0.41 p3 = state!val!0).
% 0.20/0.41 tff(formula7, axiom,
% 0.20/0.41 p8 = state!val!3).
% 0.20/0.41 tff(formula8, axiom,
% 0.20/0.41 p5 = state!val!2).
% 0.20/0.41 tff(formula9, axiom,
% 0.20/0.41 ![X0: boolean, X1: state] : (ifthen(X0, X1) = ite_t((ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!1), statement!val!0, statement!val!3))).
% 0.20/0.41 tff(formula10, axiom,
% 0.20/0.41 ![X0: state, X1: state] : (succeeds(X0, X1) <=> (((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!0) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!0)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!0) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!3)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!2) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!3)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!2) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!0)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!2) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!1)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!1) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!0)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!3) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!3)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!1) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!3)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!3) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!0))))).
% 0.20/0.41 tff(formula11, axiom,
% 0.20/0.41 ![X0: label] : (goto(X0) = ite_t((ite_t((X0 = label!val!1), label!val!1, label!val!0) = label!val!0), statement!val!2, ite_t((ite_t((X0 = label!val!1), label!val!1, label!val!0) = label!val!1), statement!val!1, statement!val!4)))).
% 0.20/0.41 tff(formula12, axiom,
% 0.20/0.41 ![X0: state, X1: state] : (follows(X0, X1) <=> (((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!2) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!1)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!3) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!0))))).
% 0.20/0.41 tff(formula13, axiom,
% 0.20/0.41 ![X0: register, X1: number] : (equal_function(X0, X1) = boolean!val!0)).
% 0.20/0.41 tff(formula14, axiom,
% 0.20/0.41 ![X0: label, X1: state] : (labels(X0, X1) <=> ((ite_t((X1 = label!val!1), label!val!1, label!val!0) = label!val!0) & (ite_t((X0 = state!val!1), state!val!1, ite_t((X0 = state!val!2), state!val!2, ite_t((X0 = state!val!3), state!val!3, state!val!0))) = state!val!0)))).
% 0.20/0.41 tff(formula15, axiom,
% 0.20/0.41 ![X0: state, X1: statement] : (has(X0, X1) <=> (((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!0) & (X0 = statement!val!0)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!1) & (X0 = statement!val!1)) | ((ite_t((X1 = state!val!1), state!val!1, ite_t((X1 = state!val!2), state!val!2, ite_t((X1 = state!val!3), state!val!3, state!val!0))) = state!val!3) & (X0 = statement!val!2))))).
% 0.20/0.41 % SZS output end Model
%------------------------------------------------------------------------------