TSTP Solution File: DAT016_1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : DAT016_1 : TPTP v8.1.0. Bugfixed v5.1.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 : Fri Sep 16 14:36:23 EDT 2022

% Result   : Theorem 0.20s 0.40s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : DAT016_1 : TPTP v8.1.0. Bugfixed v5.1.0.
% 0.07/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n015.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Aug 31 01:53:51 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.40  % SZS status Theorem
% 0.20/0.40  % SZS output start Proof
% 0.20/0.40  tff(read_type, type, (
% 0.20/0.40     read: ( array * $int ) > $int)).
% 0.20/0.40  tff(tptp_fun_U_0_type, type, (
% 0.20/0.40     tptp_fun_U_0: array)).
% 0.20/0.40  tff(1,plain,
% 0.20/0.40      (^[W: $int] : refl((~(read(U!0, W) = 53)) <=> (~(read(U!0, W) = 53)))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(2,plain,
% 0.20/0.40      (![W: $int] : (~(read(U!0, W) = 53)) <=> ![W: $int] : (~(read(U!0, W) = 53))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[1])).
% 0.20/0.40  tff(3,plain,
% 0.20/0.40      ((![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) & ![W: $int] : (~(read(U!0, W) = 53))) <=> (![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) & ![W: $int] : (~(read(U!0, W) = 53)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(4,plain,
% 0.20/0.40      ((~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U, V))) = -3))) | ?[W: $int] : (read(U, W) = 53))) <=> (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U, V))) = -3))) | ?[W: $int] : (read(U, W) = 53)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(5,plain,
% 0.20/0.40      ((~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum(read(U, V), $product(-2, V)) = 3))) | ?[W: $int] : (read(U, W) = 53))) <=> (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U, V))) = -3))) | ?[W: $int] : (read(U, W) = 53)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(6,plain,
% 0.20/0.40      ((~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53))) <=> (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum(read(U, V), $product(-2, V)) = 3))) | ?[W: $int] : (read(U, W) = 53)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(7,plain,
% 0.20/0.40      ((~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53))) <=> (~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(8,plain,
% 0.20/0.40      ((~![U: array] : (![V: $int] : (($lesseq(20, V) & $lesseq(V, 30)) => (read(U, V) = $sum($product(2, V), 3))) => ?[W: $int] : (read(U, W) = 53))) <=> (~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(9,axiom,(~![U: array] : (![V: $int] : (($lesseq(20, V) & $lesseq(V, 30)) => (read(U, V) = $sum($product(2, V), 3))) => ?[W: $int] : (read(U, W) = 53))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','co1')).
% 0.20/0.40  tff(10,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[9, 8])).
% 0.20/0.40  tff(11,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[10, 7])).
% 0.20/0.40  tff(12,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[11, 7])).
% 0.20/0.40  tff(13,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($lesseq(20, V) & $lesseq(V, 30))) | (read(U, V) = $sum(3, $product(2, V))))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[12, 7])).
% 0.20/0.40  tff(14,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum(read(U, V), $product(-2, V)) = 3))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[13, 6])).
% 0.20/0.40  tff(15,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U, V))) = -3))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[14, 5])).
% 0.20/0.40  tff(16,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U, V))) = -3))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[15, 4])).
% 0.20/0.40  tff(17,plain,
% 0.20/0.40      (~![U: array] : ((~![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U, V))) = -3))) | ?[W: $int] : (read(U, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[16, 4])).
% 0.20/0.40  tff(18,plain,
% 0.20/0.40      (![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) & ![W: $int] : (~(read(U!0, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[17, 3])).
% 0.20/0.40  tff(19,plain,
% 0.20/0.40      (![W: $int] : (~(read(U!0, W) = 53))),
% 0.20/0.40      inference(and_elim,[status(thm)],[18])).
% 0.20/0.40  tff(20,plain,
% 0.20/0.40      (![W: $int] : (~(read(U!0, W) = 53))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[19, 2])).
% 0.20/0.40  tff(21,plain,
% 0.20/0.40      ((~![W: $int] : (~(read(U!0, W) = 53))) | (~(read(U!0, 25) = 53))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(22,plain,
% 0.20/0.40      (~(read(U!0, 25) = 53)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[21, 20])).
% 0.20/0.40  tff(23,plain,
% 0.20/0.40      (^[V: $int] : refl((($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30))) <=> (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30))))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(24,plain,
% 0.20/0.40      (![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30))) <=> ![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[23])).
% 0.20/0.40  tff(25,plain,
% 0.20/0.40      (^[V: $int] : trans(monotonicity(trans(monotonicity(rewrite(($greatereq(V, 20) & $lesseq(V, 30)) <=> (~((~$greatereq(V, 20)) | (~$lesseq(V, 30))))), ((~($greatereq(V, 20) & $lesseq(V, 30))) <=> (~(~((~$greatereq(V, 20)) | (~$lesseq(V, 30))))))), rewrite((~(~((~$greatereq(V, 20)) | (~$lesseq(V, 30))))) <=> ((~$greatereq(V, 20)) | (~$lesseq(V, 30)))), ((~($greatereq(V, 20) & $lesseq(V, 30))) <=> ((~$greatereq(V, 20)) | (~$lesseq(V, 30))))), (((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) <=> (((~$greatereq(V, 20)) | (~$lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)))), rewrite((((~$greatereq(V, 20)) | (~$lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) <=> (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))), (((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) <=> (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))))),
% 0.20/0.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(26,plain,
% 0.20/0.40      (![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3)) <=> ![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))),
% 0.20/0.40      inference(quant_intro,[status(thm)],[25])).
% 0.20/0.40  tff(27,plain,
% 0.20/0.40      (![V: $int] : ((~($greatereq(V, 20) & $lesseq(V, 30))) | ($sum($product(2, V), $product(-1, read(U!0, V))) = -3))),
% 0.20/0.40      inference(and_elim,[status(thm)],[18])).
% 0.20/0.40  tff(28,plain,
% 0.20/0.40      (![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[27, 26])).
% 0.20/0.40  tff(29,plain,
% 0.20/0.40      (![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[28, 24])).
% 0.20/0.40  tff(30,plain,
% 0.20/0.40      (((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (read(U!0, 25) = 53)) <=> ((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (read(U!0, 25) = 53))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(31,plain,
% 0.20/0.40      (((read(U!0, 25) = 53) | $false | $false) <=> (read(U!0, 25) = 53)),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(32,plain,
% 0.20/0.40      ((~$true) <=> $false),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(33,plain,
% 0.20/0.40      ($lesseq(25, 30) <=> $true),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(34,plain,
% 0.20/0.40      ((~$lesseq(25, 30)) <=> (~$true)),
% 0.20/0.40      inference(monotonicity,[status(thm)],[33])).
% 0.20/0.40  tff(35,plain,
% 0.20/0.40      ((~$lesseq(25, 30)) <=> $false),
% 0.20/0.40      inference(transitivity,[status(thm)],[34, 32])).
% 0.20/0.40  tff(36,plain,
% 0.20/0.40      ($greatereq(25, 20) <=> $true),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(37,plain,
% 0.20/0.40      ((~$greatereq(25, 20)) <=> (~$true)),
% 0.20/0.40      inference(monotonicity,[status(thm)],[36])).
% 0.20/0.40  tff(38,plain,
% 0.20/0.40      ((~$greatereq(25, 20)) <=> $false),
% 0.20/0.40      inference(transitivity,[status(thm)],[37, 32])).
% 0.20/0.40  tff(39,plain,
% 0.20/0.40      (($sum(50, $product(-1, read(U!0, 25))) = -3) <=> (read(U!0, 25) = 53)),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(40,plain,
% 0.20/0.40      ($sum($product(2, 25), $product(-1, read(U!0, 25))) = $sum(50, $product(-1, read(U!0, 25)))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(41,plain,
% 0.20/0.40      (($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) <=> ($sum(50, $product(-1, read(U!0, 25))) = -3)),
% 0.20/0.40      inference(monotonicity,[status(thm)],[40])).
% 0.20/0.40  tff(42,plain,
% 0.20/0.40      (($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) <=> (read(U!0, 25) = 53)),
% 0.20/0.40      inference(transitivity,[status(thm)],[41, 39])).
% 0.20/0.40  tff(43,plain,
% 0.20/0.40      ((($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) | (~$greatereq(25, 20)) | (~$lesseq(25, 30))) <=> ((read(U!0, 25) = 53) | $false | $false)),
% 0.20/0.40      inference(monotonicity,[status(thm)],[42, 38, 35])).
% 0.20/0.40  tff(44,plain,
% 0.20/0.40      ((($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) | (~$greatereq(25, 20)) | (~$lesseq(25, 30))) <=> (read(U!0, 25) = 53)),
% 0.20/0.40      inference(transitivity,[status(thm)],[43, 31])).
% 0.20/0.40  tff(45,plain,
% 0.20/0.40      (((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) | (~$greatereq(25, 20)) | (~$lesseq(25, 30)))) <=> ((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (read(U!0, 25) = 53))),
% 0.20/0.40      inference(monotonicity,[status(thm)],[44])).
% 0.20/0.40  tff(46,plain,
% 0.20/0.40      (((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) | (~$greatereq(25, 20)) | (~$lesseq(25, 30)))) <=> ((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (read(U!0, 25) = 53))),
% 0.20/0.40      inference(transitivity,[status(thm)],[45, 30])).
% 0.20/0.40  tff(47,plain,
% 0.20/0.40      ((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (($sum($product(2, 25), $product(-1, read(U!0, 25))) = -3) | (~$greatereq(25, 20)) | (~$lesseq(25, 30)))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(48,plain,
% 0.20/0.40      ((~![V: $int] : (($sum($product(2, V), $product(-1, read(U!0, V))) = -3) | (~$greatereq(V, 20)) | (~$lesseq(V, 30)))) | (read(U!0, 25) = 53)),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[47, 46])).
% 0.20/0.40  tff(49,plain,
% 0.20/0.40      ($false),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[48, 29, 22])).
% 0.20/0.40  % SZS output end Proof
%------------------------------------------------------------------------------