TSTP Solution File: SYN396+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN396+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n003.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 23:55:09 EDT 2022
% Result : Theorem 0.21s 0.39s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN396+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n003.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 : Mon Sep 5 03:07:41 EDT 2022
% 0.13/0.34 % 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.21/0.39 % SZS status Theorem
% 0.21/0.39 % SZS output start Proof
% 0.21/0.39 tff(f_type, type, (
% 0.21/0.39 f: $i > $o)).
% 0.21/0.39 tff(tptp_fun_X_0_type, type, (
% 0.21/0.39 tptp_fun_X_0: $i)).
% 0.21/0.39 tff(tptp_fun_Y_1_type, type, (
% 0.21/0.39 tptp_fun_Y_1: $i)).
% 0.21/0.39 tff(1,assumption,(![X: $i] : f(X)), introduced(assumption)).
% 0.21/0.39 tff(2,assumption,(~f(Y!1)), introduced(assumption)).
% 0.21/0.39 tff(3,plain,
% 0.21/0.39 ((~![X: $i] : f(X)) | f(Y!1)),
% 0.21/0.39 inference(quant_inst,[status(thm)],[])).
% 0.21/0.39 tff(4,plain,
% 0.21/0.39 ($false),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[3, 2, 1])).
% 0.21/0.39 tff(5,plain,(f(Y!1) | (~![X: $i] : f(X))), inference(lemma,lemma(discharge,[]))).
% 0.21/0.39 tff(6,plain,
% 0.21/0.39 (f(Y!1)),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[5, 1])).
% 0.21/0.39 tff(7,plain,
% 0.21/0.39 ((((~f(X!0)) | (~f(Y!1))) & (![X: $i] : f(X) | ![Y: $i] : (~(~f(Y))))) <=> (((~f(X!0)) | (~f(Y!1))) & (![X: $i] : f(X) | ![Y: $i] : f(Y)))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(8,plain,
% 0.21/0.39 ((![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))) <=> (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y)))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(9,plain,
% 0.21/0.39 ((~((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y)))) <=> (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y)))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(10,plain,
% 0.21/0.39 (((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y))) <=> ((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y)))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(11,plain,
% 0.21/0.39 ((~((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y)))) <=> (~((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y))))),
% 0.21/0.39 inference(monotonicity,[status(thm)],[10])).
% 0.21/0.39 tff(12,plain,
% 0.21/0.39 ((~((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y)))) <=> (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y)))),
% 0.21/0.39 inference(transitivity,[status(thm)],[11, 9])).
% 0.21/0.39 tff(13,axiom,(~((~![X: $i] : f(X)) <=> ?[Y: $i] : (~f(Y)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','kalish203')).
% 0.21/0.39 tff(14,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.21/0.39 tff(15,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[14, 8])).
% 0.21/0.39 tff(16,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[15, 8])).
% 0.21/0.39 tff(17,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[16, 8])).
% 0.21/0.39 tff(18,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[17, 8])).
% 0.21/0.39 tff(19,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[18, 8])).
% 0.21/0.39 tff(20,plain,
% 0.21/0.39 (![X: $i] : f(X) <=> ?[Y: $i] : (~f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[19, 8])).
% 0.21/0.39 tff(21,plain,(
% 0.21/0.39 ((~f(X!0)) | (~f(Y!1))) & (![X: $i] : f(X) | ![Y: $i] : (~(~f(Y))))),
% 0.21/0.39 inference(skolemize,[status(sab)],[20])).
% 0.21/0.39 tff(22,plain,
% 0.21/0.39 (((~f(X!0)) | (~f(Y!1))) & (![X: $i] : f(X) | ![Y: $i] : f(Y))),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[21, 7])).
% 0.21/0.39 tff(23,plain,
% 0.21/0.39 ((~f(X!0)) | (~f(Y!1))),
% 0.21/0.39 inference(and_elim,[status(thm)],[22])).
% 0.21/0.39 tff(24,plain,
% 0.21/0.39 (~f(X!0)),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[23, 6])).
% 0.21/0.39 tff(25,plain,
% 0.21/0.39 ((~![X: $i] : f(X)) | f(X!0)),
% 0.21/0.39 inference(quant_inst,[status(thm)],[])).
% 0.21/0.39 tff(26,plain,
% 0.21/0.39 ($false),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[25, 24, 1])).
% 0.21/0.39 tff(27,plain,(~![X: $i] : f(X)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.39 tff(28,plain,
% 0.21/0.39 ((![X: $i] : f(X) | ![Y: $i] : f(Y)) <=> (![X: $i] : f(X) | ![Y: $i] : f(Y))),
% 0.21/0.39 inference(rewrite,[status(thm)],[])).
% 0.21/0.39 tff(29,plain,
% 0.21/0.39 (![X: $i] : f(X) | ![Y: $i] : f(Y)),
% 0.21/0.39 inference(and_elim,[status(thm)],[22])).
% 0.21/0.39 tff(30,plain,
% 0.21/0.39 (![X: $i] : f(X) | ![Y: $i] : f(Y)),
% 0.21/0.39 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.21/0.39 tff(31,plain,
% 0.21/0.39 (![Y: $i] : f(Y)),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[30, 27])).
% 0.21/0.39 tff(32,plain,
% 0.21/0.39 ((~![Y: $i] : f(Y)) | f(Y!1)),
% 0.21/0.39 inference(quant_inst,[status(thm)],[])).
% 0.21/0.39 tff(33,plain,
% 0.21/0.39 ($false),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[32, 2, 31])).
% 0.21/0.39 tff(34,plain,(f(Y!1)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.39 tff(35,plain,
% 0.21/0.39 (~f(X!0)),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[23, 34])).
% 0.21/0.39 tff(36,plain,
% 0.21/0.39 ((~![Y: $i] : f(Y)) | f(X!0)),
% 0.21/0.39 inference(quant_inst,[status(thm)],[])).
% 0.21/0.39 tff(37,plain,
% 0.21/0.39 ($false),
% 0.21/0.39 inference(unit_resolution,[status(thm)],[36, 35, 31])).
% 0.21/0.39 % SZS output end Proof
%------------------------------------------------------------------------------