TSTP Solution File: SYN408+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN408+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n016.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:12 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN408+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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:33:09 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.13/0.38 % SZS status Theorem
% 0.13/0.38 % SZS output start Proof
% 0.13/0.38 tff(f_type, type, (
% 0.13/0.38 f: $i > $o)).
% 0.13/0.38 tff(tptp_fun_Y_0_type, type, (
% 0.13/0.38 tptp_fun_Y_0: $i)).
% 0.13/0.38 tff(g_type, type, (
% 0.13/0.38 g: $i > $o)).
% 0.13/0.38 tff(1,plain,
% 0.13/0.38 ((~![Y: $i] : (g(Y) | (~f(Y)))) <=> (~![Y: $i] : (g(Y) | (~f(Y))))),
% 0.13/0.38 inference(rewrite,[status(thm)],[])).
% 0.13/0.38 tff(2,plain,
% 0.13/0.38 ((~((~?[X: $i] : f(X)) => ![Y: $i] : (f(Y) => g(Y)))) <=> (~(?[X: $i] : f(X) | ![Y: $i] : (g(Y) | (~f(Y)))))),
% 0.13/0.38 inference(rewrite,[status(thm)],[])).
% 0.13/0.38 tff(3,axiom,(~((~?[X: $i] : f(X)) => ![Y: $i] : (f(Y) => g(Y)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','kalish244')).
% 0.13/0.38 tff(4,plain,
% 0.13/0.38 (~(?[X: $i] : f(X) | ![Y: $i] : (g(Y) | (~f(Y))))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.13/0.38 tff(5,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(or_elim,[status(thm)],[4])).
% 0.13/0.38 tff(6,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.13/0.38 tff(7,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.13/0.38 tff(8,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[7, 1])).
% 0.13/0.38 tff(9,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.13/0.38 tff(10,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[9, 1])).
% 0.13/0.38 tff(11,plain,
% 0.13/0.38 (~![Y: $i] : (g(Y) | (~f(Y)))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[10, 1])).
% 0.13/0.38 tff(12,plain,(
% 0.13/0.38 ~(g(Y!0) | (~f(Y!0)))),
% 0.13/0.38 inference(skolemize,[status(sab)],[11])).
% 0.13/0.38 tff(13,plain,
% 0.13/0.38 (f(Y!0)),
% 0.13/0.38 inference(or_elim,[status(thm)],[12])).
% 0.13/0.38 tff(14,plain,
% 0.13/0.38 (^[X: $i] : refl((~f(X)) <=> (~f(X)))),
% 0.13/0.38 inference(bind,[status(th)],[])).
% 0.13/0.38 tff(15,plain,
% 0.13/0.38 (![X: $i] : (~f(X)) <=> ![X: $i] : (~f(X))),
% 0.13/0.38 inference(quant_intro,[status(thm)],[14])).
% 0.13/0.38 tff(16,plain,
% 0.13/0.38 ((~?[X: $i] : f(X)) <=> (~?[X: $i] : f(X))),
% 0.13/0.38 inference(rewrite,[status(thm)],[])).
% 0.13/0.38 tff(17,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(or_elim,[status(thm)],[4])).
% 0.13/0.38 tff(18,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[17, 16])).
% 0.13/0.38 tff(19,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[18, 16])).
% 0.13/0.38 tff(20,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[19, 16])).
% 0.13/0.38 tff(21,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[20, 16])).
% 0.13/0.38 tff(22,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[21, 16])).
% 0.13/0.38 tff(23,plain,
% 0.13/0.38 (~?[X: $i] : f(X)),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[22, 16])).
% 0.13/0.38 tff(24,plain,
% 0.13/0.38 (^[X: $i] : refl($oeq((~f(X)), (~f(X))))),
% 0.13/0.38 inference(bind,[status(th)],[])).
% 0.13/0.38 tff(25,plain,(
% 0.13/0.38 ![X: $i] : (~f(X))),
% 0.13/0.38 inference(nnf-neg,[status(sab)],[23, 24])).
% 0.13/0.38 tff(26,plain,
% 0.13/0.38 (![X: $i] : (~f(X))),
% 0.13/0.38 inference(modus_ponens,[status(thm)],[25, 15])).
% 0.13/0.38 tff(27,plain,
% 0.13/0.38 ((~![X: $i] : (~f(X))) | (~f(Y!0))),
% 0.13/0.38 inference(quant_inst,[status(thm)],[])).
% 0.13/0.38 tff(28,plain,
% 0.13/0.38 ($false),
% 0.13/0.38 inference(unit_resolution,[status(thm)],[27, 26, 13])).
% 0.13/0.38 % SZS output end Proof
%------------------------------------------------------------------------------