TSTP Solution File: SYN395+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SYN395+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n001.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.14s 0.40s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN395+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35  % Computer : n001.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Sep  5 03:28:29 EDT 2022
% 0.14/0.35  % 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.40  % SZS status Theorem
% 0.14/0.40  % SZS output start Proof
% 0.14/0.40  tff(g_type, type, (
% 0.14/0.40     g: $i > $o)).
% 0.14/0.40  tff(tptp_fun_Y_0_type, type, (
% 0.14/0.40     tptp_fun_Y_0: $i)).
% 0.14/0.40  tff(f_type, type, (
% 0.14/0.40     f: $i > $o)).
% 0.14/0.40  tff(1,plain,
% 0.14/0.40      (^[X: $i] : refl((g(X) | (~f(X))) <=> (g(X) | (~f(X))))),
% 0.14/0.40      inference(bind,[status(th)],[])).
% 0.14/0.40  tff(2,plain,
% 0.14/0.40      (![X: $i] : (g(X) | (~f(X))) <=> ![X: $i] : (g(X) | (~f(X)))),
% 0.14/0.40      inference(quant_intro,[status(thm)],[1])).
% 0.14/0.40  tff(3,plain,
% 0.14/0.40      (![X: $i] : (g(X) | (~f(X))) <=> ![X: $i] : (g(X) | (~f(X)))),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(4,plain,
% 0.14/0.40      ((~(![X: $i] : (f(X) => g(X)) => (?[Y: $i] : f(Y) => ?[Z: $i] : g(Z)))) <=> (~(?[Z: $i] : g(Z) | (~?[Y: $i] : f(Y)) | (~![X: $i] : (g(X) | (~f(X))))))),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(5,axiom,(~(![X: $i] : (f(X) => g(X)) => (?[Y: $i] : f(Y) => ?[Z: $i] : g(Z)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','kalish202')).
% 0.14/0.40  tff(6,plain,
% 0.14/0.40      (~(?[Z: $i] : g(Z) | (~?[Y: $i] : f(Y)) | (~![X: $i] : (g(X) | (~f(X)))))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[5, 4])).
% 0.14/0.40  tff(7,plain,
% 0.14/0.40      (![X: $i] : (g(X) | (~f(X)))),
% 0.14/0.40      inference(or_elim,[status(thm)],[6])).
% 0.14/0.40  tff(8,plain,
% 0.14/0.40      (![X: $i] : (g(X) | (~f(X)))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[7, 3])).
% 0.14/0.40  tff(9,plain,(
% 0.14/0.40      ![X: $i] : (g(X) | (~f(X)))),
% 0.14/0.40      inference(skolemize,[status(sab)],[8])).
% 0.14/0.40  tff(10,plain,
% 0.14/0.40      (![X: $i] : (g(X) | (~f(X)))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[9, 2])).
% 0.14/0.40  tff(11,plain,
% 0.14/0.40      (?[Y: $i] : f(Y) <=> ?[Y: $i] : f(Y)),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(12,plain,
% 0.14/0.40      (?[Y: $i] : f(Y)),
% 0.14/0.40      inference(or_elim,[status(thm)],[6])).
% 0.14/0.40  tff(13,plain,
% 0.14/0.40      (?[Y: $i] : f(Y)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[12, 11])).
% 0.14/0.40  tff(14,plain,(
% 0.14/0.40      f(Y!0)),
% 0.14/0.40      inference(skolemize,[status(sab)],[13])).
% 0.14/0.40  tff(15,plain,
% 0.14/0.40      (((~![X: $i] : (g(X) | (~f(X)))) | (g(Y!0) | (~f(Y!0)))) <=> ((~![X: $i] : (g(X) | (~f(X)))) | g(Y!0) | (~f(Y!0)))),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(16,plain,
% 0.14/0.40      ((~![X: $i] : (g(X) | (~f(X)))) | (g(Y!0) | (~f(Y!0)))),
% 0.14/0.40      inference(quant_inst,[status(thm)],[])).
% 0.14/0.40  tff(17,plain,
% 0.14/0.40      ((~![X: $i] : (g(X) | (~f(X)))) | g(Y!0) | (~f(Y!0))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[16, 15])).
% 0.14/0.40  tff(18,plain,
% 0.14/0.40      (g(Y!0)),
% 0.14/0.40      inference(unit_resolution,[status(thm)],[17, 14, 10])).
% 0.14/0.40  tff(19,plain,
% 0.14/0.40      (^[Z: $i] : refl((~g(Z)) <=> (~g(Z)))),
% 0.14/0.40      inference(bind,[status(th)],[])).
% 0.14/0.40  tff(20,plain,
% 0.14/0.40      (![Z: $i] : (~g(Z)) <=> ![Z: $i] : (~g(Z))),
% 0.14/0.40      inference(quant_intro,[status(thm)],[19])).
% 0.14/0.40  tff(21,plain,
% 0.14/0.40      ((~?[Z: $i] : g(Z)) <=> (~?[Z: $i] : g(Z))),
% 0.14/0.40      inference(rewrite,[status(thm)],[])).
% 0.14/0.40  tff(22,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(or_elim,[status(thm)],[6])).
% 0.14/0.40  tff(23,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[22, 21])).
% 0.14/0.40  tff(24,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[23, 21])).
% 0.14/0.40  tff(25,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[24, 21])).
% 0.14/0.40  tff(26,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[25, 21])).
% 0.14/0.40  tff(27,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[26, 21])).
% 0.14/0.40  tff(28,plain,
% 0.14/0.40      (~?[Z: $i] : g(Z)),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[27, 21])).
% 0.14/0.40  tff(29,plain,
% 0.14/0.40      (^[Z: $i] : refl($oeq((~g(Z)), (~g(Z))))),
% 0.14/0.40      inference(bind,[status(th)],[])).
% 0.14/0.40  tff(30,plain,(
% 0.14/0.40      ![Z: $i] : (~g(Z))),
% 0.14/0.40      inference(nnf-neg,[status(sab)],[28, 29])).
% 0.14/0.40  tff(31,plain,
% 0.14/0.40      (![Z: $i] : (~g(Z))),
% 0.14/0.40      inference(modus_ponens,[status(thm)],[30, 20])).
% 0.14/0.40  tff(32,plain,
% 0.14/0.40      ((~![Z: $i] : (~g(Z))) | (~g(Y!0))),
% 0.14/0.40      inference(quant_inst,[status(thm)],[])).
% 0.14/0.40  tff(33,plain,
% 0.14/0.40      ($false),
% 0.14/0.40      inference(unit_resolution,[status(thm)],[32, 31, 18])).
% 0.14/0.40  % SZS output end Proof
%------------------------------------------------------------------------------