TSTP Solution File: DAT057_1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : DAT057_1 : TPTP v8.1.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n027.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 : Fri Sep 16 14:36:33 EDT 2022

% Result   : Theorem 0.14s 0.39s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : DAT057_1 : TPTP v8.1.0. Released v5.5.0.
% 0.07/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Aug 31 02:01:16 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35  Usage: tptp [options] [-file:]file
% 0.14/0.35    -h, -?       prints this message.
% 0.14/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.14/0.35    -m, -model   generate model.
% 0.14/0.35    -p, -proof   generate proof.
% 0.14/0.35    -c, -core    generate unsat core of named formulas.
% 0.14/0.35    -st, -statistics display statistics.
% 0.14/0.35    -t:timeout   set timeout (in second).
% 0.14/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.14/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35    -<param>:<value> configuration parameter and value.
% 0.14/0.35    -o:<output-file> file to place output in.
% 0.14/0.39  % SZS status Theorem
% 0.14/0.39  % SZS output start Proof
% 0.14/0.39  tff(get_type, type, (
% 0.14/0.39     get: ( array * $int ) > data)).
% 0.14/0.39  tff(tptp_fun_N_1_type, type, (
% 0.14/0.39     tptp_fun_N_1: $int)).
% 0.14/0.39  tff(tptp_fun_Ar_3_type, type, (
% 0.14/0.39     tptp_fun_Ar_3: array)).
% 0.14/0.39  tff(put_type, type, (
% 0.14/0.39     put: ( array * $int * data ) > array)).
% 0.14/0.39  tff(tptp_fun_D_4_type, type, (
% 0.14/0.39     tptp_fun_D_4: data)).
% 0.14/0.39  tff(tptp_fun_M_2_type, type, (
% 0.14/0.39     tptp_fun_M_2: $int)).
% 0.14/0.39  tff(1,plain,
% 0.14/0.39      ((~![D: data, Ar: array, M: $int, N: $int] : (($sum(N, $product(-1, M)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N)))) <=> (~![D: data, Ar: array, M: $int, N: $int] : (($sum(N, $product(-1, M)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N))))),
% 0.14/0.39      inference(rewrite,[status(thm)],[])).
% 0.14/0.39  tff(2,plain,
% 0.14/0.39      ((~![D: data, Ar: array, M: $int, N: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N)))) <=> (~![D: data, Ar: array, M: $int, N: $int] : (($sum(N, $product(-1, M)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N))))),
% 0.14/0.39      inference(rewrite,[status(thm)],[])).
% 0.14/0.39  tff(3,plain,
% 0.14/0.39      ((~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N)))) <=> (~![D: data, Ar: array, M: $int, N: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N))))),
% 0.14/0.39      inference(rewrite,[status(thm)],[])).
% 0.14/0.39  tff(4,plain,
% 0.14/0.39      ((~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N)))) <=> (~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N))))),
% 0.14/0.39      inference(rewrite,[status(thm)],[])).
% 0.14/0.39  tff(5,plain,
% 0.14/0.39      ((~![D: data, Ar: array, M: $int, N: $int] : ((get(put(Ar, M, D), N) = get(Ar, N)) | (M = N))) <=> (~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N))))),
% 0.14/0.39      inference(rewrite,[status(thm)],[])).
% 0.14/0.39  tff(6,axiom,(~![D: data, Ar: array, M: $int, N: $int] : ((get(put(Ar, M, D), N) = get(Ar, N)) | (M = N))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','th_lem_1')).
% 0.14/0.39  tff(7,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[6, 5])).
% 0.14/0.39  tff(8,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[7, 4])).
% 0.14/0.39  tff(9,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[8, 4])).
% 0.14/0.39  tff(10,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : ((M = N) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[9, 4])).
% 0.14/0.39  tff(11,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[10, 3])).
% 0.14/0.39  tff(12,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : (($sum(N, $product(-1, M)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[11, 2])).
% 0.14/0.39  tff(13,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : (($sum(N, $product(-1, M)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[12, 1])).
% 0.14/0.39  tff(14,plain,
% 0.14/0.39      (~![D: data, Ar: array, M: $int, N: $int] : (($sum(N, $product(-1, M)) = 0) | (get(put(Ar, M, D), N) = get(Ar, N)))),
% 0.14/0.39      inference(modus_ponens,[status(thm)],[13, 1])).
% 0.14/0.39  tff(15,plain,(
% 0.14/0.39      ~(($sum(N!1, $product(-1, M!2)) = 0) | (get(put(Ar!3, M!2, D!4), N!1) = get(Ar!3, N!1)))),
% 0.14/0.39      inference(skolemize,[status(sab)],[14])).
% 0.14/0.39  tff(16,plain,
% 0.14/0.39      (~(get(put(Ar!3, M!2, D!4), N!1) = get(Ar!3, N!1))),
% 0.14/0.39      inference(or_elim,[status(thm)],[15])).
% 0.14/0.39  tff(17,plain,
% 0.14/0.39      (~($sum(N!1, $product(-1, M!2)) = 0)),
% 0.14/0.39      inference(or_elim,[status(thm)],[15])).
% 0.14/0.39  tff(18,plain,
% 0.14/0.39      (^[N: $int, D: data, Ar: array, M: $int] : refl((($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M))) <=> (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M))))),
% 0.14/0.39      inference(bind,[status(th)],[])).
% 0.14/0.39  tff(19,plain,
% 0.14/0.39      (![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M))) <=> ![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(quant_intro,[status(thm)],[18])).
% 0.14/0.40  tff(20,plain,
% 0.14/0.40      (^[N: $int, D: data, Ar: array, M: $int] : rewrite(((M = N) | (get(put(Ar, N, D), M) = get(Ar, M))) <=> (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M))))),
% 0.14/0.40      inference(bind,[status(th)],[])).
% 0.14/0.40  tff(21,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M))) <=> ![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(quant_intro,[status(thm)],[20])).
% 0.14/0.40  tff(22,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M))) <=> ![N: $int, D: data, Ar: array, M: $int] : ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(23,plain,
% 0.14/0.40      (^[N: $int, D: data, Ar: array, M: $int] : rewrite(((~(M = N)) => (get(put(Ar, N, D), M) = get(Ar, M))) <=> ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M))))),
% 0.14/0.40      inference(bind,[status(th)],[])).
% 0.14/0.40  tff(24,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : ((~(M = N)) => (get(put(Ar, N, D), M) = get(Ar, M))) <=> ![N: $int, D: data, Ar: array, M: $int] : ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(quant_intro,[status(thm)],[23])).
% 0.14/0.40  tff(25,axiom,(![N: $int, D: data, Ar: array, M: $int] : ((~(M = N)) => (get(put(Ar, N, D), M) = get(Ar, M)))), file('/export/starexec/sandbox/benchmark/Axioms/DAT004=0.ax','ax_19')).
% 0.14/0.40  tff(26,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[25, 24])).
% 0.14/0.40  tff(27,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : ((M = N) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[26, 22])).
% 0.14/0.40  tff(28,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[27, 21])).
% 0.14/0.40  tff(29,plain,(
% 0.14/0.40      ![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(skolemize,[status(sab)],[28])).
% 0.14/0.40  tff(30,plain,
% 0.14/0.40      (![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[29, 19])).
% 0.14/0.40  tff(31,plain,
% 0.14/0.40      (((~![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))) | (($sum(N!1, $product(-1, M!2)) = 0) | (get(put(Ar!3, M!2, D!4), N!1) = get(Ar!3, N!1)))) <=> ((~![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))) | ($sum(N!1, $product(-1, M!2)) = 0) | (get(put(Ar!3, M!2, D!4), N!1) = get(Ar!3, N!1)))),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(32,plain,
% 0.14/0.40      ((~![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))) | (($sum(N!1, $product(-1, M!2)) = 0) | (get(put(Ar!3, M!2, D!4), N!1) = get(Ar!3, N!1)))),
% 0.14/0.40      inference(quant_inst,[status(thm)],[])).
% 0.14/0.40  tff(33,plain,
% 0.14/0.40      ((~![N: $int, D: data, Ar: array, M: $int] : (($sum(M, $product(-1, N)) = 0) | (get(put(Ar, N, D), M) = get(Ar, M)))) | ($sum(N!1, $product(-1, M!2)) = 0) | (get(put(Ar!3, M!2, D!4), N!1) = get(Ar!3, N!1))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[32, 31])).
% 0.14/0.40  tff(34,plain,
% 0.14/0.40      ($false),
% 0.14/0.40      inference(unit_resolution,[status(thm)],[33, 30, 17, 16])).
% 0.14/0.40  % SZS output end Proof
%------------------------------------------------------------------------------