TSTP Solution File: SYN366+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN366+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n018.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:00 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN366+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Sep 5 03:00:01 EDT 2022
% 0.12/0.34 % 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.39 % SZS status Theorem
% 0.12/0.39 % SZS output start Proof
% 0.12/0.39 tff(big_r_type, type, (
% 0.12/0.39 big_r: ( $i * $i ) > $o)).
% 0.12/0.39 tff(tptp_fun_Y_0_type, type, (
% 0.12/0.39 tptp_fun_Y_0: $i)).
% 0.12/0.39 tff(tptp_fun_X_1_type, type, (
% 0.12/0.39 tptp_fun_X_1: $i)).
% 0.12/0.39 tff(1,plain,
% 0.12/0.39 (^[U: $i, V: $i] : refl((big_r(U, U) <=> big_r(U, V)) <=> (big_r(U, U) <=> big_r(U, V)))),
% 0.12/0.39 inference(bind,[status(th)],[])).
% 0.12/0.39 tff(2,plain,
% 0.12/0.39 (![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) <=> ![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))),
% 0.12/0.39 inference(quant_intro,[status(thm)],[1])).
% 0.12/0.39 tff(3,plain,
% 0.12/0.39 (![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) <=> ![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(4,plain,
% 0.12/0.39 ((~((![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) & ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))) => (?[X: $i] : big_r(X, X) => ![Y: $i] : big_r(Y, Y)))) <=> (~(![Y: $i] : big_r(Y, Y) | (~?[X: $i] : big_r(X, X)) | (~(![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) & ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))))))),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(5,axiom,(~((![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) & ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))) => (?[X: $i] : big_r(X, X) => ![Y: $i] : big_r(Y, Y)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','x2117')).
% 0.12/0.39 tff(6,plain,
% 0.12/0.39 (~(![Y: $i] : big_r(Y, Y) | (~?[X: $i] : big_r(X, X)) | (~(![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) & ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W)))))),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.12/0.39 tff(7,plain,
% 0.12/0.39 (![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V)) & ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(or_elim,[status(thm)],[6])).
% 0.12/0.39 tff(8,plain,
% 0.12/0.39 (![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))),
% 0.12/0.39 inference(and_elim,[status(thm)],[7])).
% 0.12/0.39 tff(9,plain,
% 0.12/0.39 (![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[8, 3])).
% 0.12/0.39 tff(10,plain,(
% 0.12/0.39 ![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))),
% 0.12/0.39 inference(skolemize,[status(sab)],[9])).
% 0.12/0.39 tff(11,plain,
% 0.12/0.39 (![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[10, 2])).
% 0.12/0.39 tff(12,plain,
% 0.12/0.39 ((~![U: $i, V: $i] : (big_r(U, U) <=> big_r(U, V))) | (big_r(X!1, X!1) <=> big_r(X!1, Y!0))),
% 0.12/0.39 inference(quant_inst,[status(thm)],[])).
% 0.12/0.39 tff(13,plain,
% 0.12/0.39 (big_r(X!1, X!1) <=> big_r(X!1, Y!0)),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[12, 11])).
% 0.12/0.39 tff(14,plain,
% 0.12/0.39 (?[X: $i] : big_r(X, X) <=> ?[X: $i] : big_r(X, X)),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(15,plain,
% 0.12/0.39 (?[X: $i] : big_r(X, X)),
% 0.12/0.39 inference(or_elim,[status(thm)],[6])).
% 0.12/0.39 tff(16,plain,
% 0.12/0.39 (?[X: $i] : big_r(X, X)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.12/0.39 tff(17,plain,(
% 0.12/0.39 big_r(X!1, X!1)),
% 0.12/0.39 inference(skolemize,[status(sab)],[16])).
% 0.12/0.39 tff(18,plain,
% 0.12/0.39 ((~(big_r(X!1, X!1) <=> big_r(X!1, Y!0))) | (~big_r(X!1, X!1)) | big_r(X!1, Y!0)),
% 0.12/0.39 inference(tautology,[status(thm)],[])).
% 0.12/0.39 tff(19,plain,
% 0.12/0.39 ((~(big_r(X!1, X!1) <=> big_r(X!1, Y!0))) | big_r(X!1, Y!0)),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[18, 17])).
% 0.12/0.39 tff(20,plain,
% 0.12/0.39 (big_r(X!1, Y!0)),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[19, 13])).
% 0.12/0.39 tff(21,plain,
% 0.12/0.39 ((~![Y: $i] : big_r(Y, Y)) <=> (~![Y: $i] : big_r(Y, Y))),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(22,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(or_elim,[status(thm)],[6])).
% 0.12/0.39 tff(23,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.12/0.39 tff(24,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[23, 21])).
% 0.12/0.39 tff(25,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[24, 21])).
% 0.12/0.39 tff(26,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[25, 21])).
% 0.12/0.39 tff(27,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[26, 21])).
% 0.12/0.39 tff(28,plain,
% 0.12/0.39 (~![Y: $i] : big_r(Y, Y)),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[27, 21])).
% 0.12/0.39 tff(29,plain,(
% 0.12/0.39 ~big_r(Y!0, Y!0)),
% 0.12/0.39 inference(skolemize,[status(sab)],[28])).
% 0.12/0.39 tff(30,plain,
% 0.12/0.39 ((~(big_r(Y!0, Y!0) <=> big_r(X!1, Y!0))) | big_r(Y!0, Y!0) | (~big_r(X!1, Y!0))),
% 0.12/0.39 inference(tautology,[status(thm)],[])).
% 0.12/0.39 tff(31,plain,
% 0.12/0.39 (~(big_r(Y!0, Y!0) <=> big_r(X!1, Y!0))),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[30, 29, 20])).
% 0.12/0.39 tff(32,plain,
% 0.12/0.39 (^[W: $i, Z: $i] : refl((big_r(W, W) <=> big_r(Z, W)) <=> (big_r(W, W) <=> big_r(Z, W)))),
% 0.12/0.39 inference(bind,[status(th)],[])).
% 0.12/0.39 tff(33,plain,
% 0.12/0.39 (![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W)) <=> ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(quant_intro,[status(thm)],[32])).
% 0.12/0.39 tff(34,plain,
% 0.12/0.39 (![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W)) <=> ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(35,plain,
% 0.12/0.39 (![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(and_elim,[status(thm)],[7])).
% 0.12/0.39 tff(36,plain,
% 0.12/0.39 (![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[35, 34])).
% 0.12/0.39 tff(37,plain,(
% 0.12/0.39 ![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(skolemize,[status(sab)],[36])).
% 0.12/0.39 tff(38,plain,
% 0.12/0.39 (![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[37, 33])).
% 0.12/0.39 tff(39,plain,
% 0.12/0.39 ((~![W: $i, Z: $i] : (big_r(W, W) <=> big_r(Z, W))) | (big_r(Y!0, Y!0) <=> big_r(X!1, Y!0))),
% 0.12/0.39 inference(quant_inst,[status(thm)],[])).
% 0.12/0.39 tff(40,plain,
% 0.12/0.39 ($false),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[39, 38, 31])).
% 0.12/0.39 % SZS output end Proof
%------------------------------------------------------------------------------