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

View Problem - Process Solution

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

% Computer : n024.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 30 00:01:24 EDT 2022

% Result   : Theorem 0.12s 0.38s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN959+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34  % Computer : n024.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 09:44:18 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.38  % SZS status Theorem
% 0.12/0.38  % SZS output start Proof
% 0.12/0.38  tff(b_type, type, (
% 0.12/0.38     b: $i > $o)).
% 0.12/0.38  tff(tptp_fun_X_0_type, type, (
% 0.12/0.38     tptp_fun_X_0: $i)).
% 0.12/0.38  tff(a_type, type, (
% 0.12/0.38     a: $i > $o)).
% 0.12/0.38  tff(1,plain,
% 0.12/0.38      (?[X: $i] : b(X) <=> ?[X: $i] : b(X)),
% 0.12/0.38      inference(rewrite,[status(thm)],[])).
% 0.12/0.38  tff(2,plain,
% 0.12/0.38      ((~(?[X: $i] : b(X) => ?[X: $i] : (a(X) | b(X)))) <=> (~((~?[X: $i] : b(X)) | ?[X: $i] : (a(X) | b(X))))),
% 0.12/0.38      inference(rewrite,[status(thm)],[])).
% 0.12/0.38  tff(3,axiom,(~(?[X: $i] : b(X) => ?[X: $i] : (a(X) | b(X)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.12/0.38  tff(4,plain,
% 0.12/0.38      (~((~?[X: $i] : b(X)) | ?[X: $i] : (a(X) | b(X)))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[3, 2])).
% 0.12/0.38  tff(5,plain,
% 0.12/0.38      (?[X: $i] : b(X)),
% 0.12/0.38      inference(or_elim,[status(thm)],[4])).
% 0.12/0.38  tff(6,plain,
% 0.12/0.38      (?[X: $i] : b(X)),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[5, 1])).
% 0.12/0.38  tff(7,plain,(
% 0.12/0.38      b(X!0)),
% 0.12/0.38      inference(skolemize,[status(sab)],[6])).
% 0.12/0.38  tff(8,plain,
% 0.12/0.38      ((a(X!0) | b(X!0)) | (~b(X!0))),
% 0.12/0.38      inference(tautology,[status(thm)],[])).
% 0.12/0.38  tff(9,plain,
% 0.12/0.38      (a(X!0) | b(X!0)),
% 0.12/0.38      inference(unit_resolution,[status(thm)],[8, 7])).
% 0.12/0.38  tff(10,plain,
% 0.12/0.38      (^[X: $i] : refl((~(a(X) | b(X))) <=> (~(a(X) | b(X))))),
% 0.12/0.38      inference(bind,[status(th)],[])).
% 0.12/0.38  tff(11,plain,
% 0.12/0.38      (![X: $i] : (~(a(X) | b(X))) <=> ![X: $i] : (~(a(X) | b(X)))),
% 0.12/0.38      inference(quant_intro,[status(thm)],[10])).
% 0.12/0.38  tff(12,plain,
% 0.12/0.38      ((~?[X: $i] : (a(X) | b(X))) <=> (~?[X: $i] : (a(X) | b(X)))),
% 0.12/0.38      inference(rewrite,[status(thm)],[])).
% 0.12/0.38  tff(13,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(or_elim,[status(thm)],[4])).
% 0.12/0.38  tff(14,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[13, 12])).
% 0.12/0.38  tff(15,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[14, 12])).
% 0.12/0.38  tff(16,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[15, 12])).
% 0.12/0.38  tff(17,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[16, 12])).
% 0.12/0.38  tff(18,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[17, 12])).
% 0.12/0.38  tff(19,plain,
% 0.12/0.38      (~?[X: $i] : (a(X) | b(X))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[18, 12])).
% 0.12/0.38  tff(20,plain,
% 0.12/0.38      (^[X: $i] : refl($oeq((~(a(X) | b(X))), (~(a(X) | b(X)))))),
% 0.12/0.38      inference(bind,[status(th)],[])).
% 0.12/0.38  tff(21,plain,(
% 0.12/0.38      ![X: $i] : (~(a(X) | b(X)))),
% 0.12/0.38      inference(nnf-neg,[status(sab)],[19, 20])).
% 0.12/0.38  tff(22,plain,
% 0.12/0.38      (![X: $i] : (~(a(X) | b(X)))),
% 0.12/0.38      inference(modus_ponens,[status(thm)],[21, 11])).
% 0.12/0.38  tff(23,plain,
% 0.12/0.38      ((~![X: $i] : (~(a(X) | b(X)))) | (~(a(X!0) | b(X!0)))),
% 0.12/0.38      inference(quant_inst,[status(thm)],[])).
% 0.12/0.38  tff(24,plain,
% 0.12/0.38      ($false),
% 0.12/0.38      inference(unit_resolution,[status(thm)],[23, 22, 9])).
% 0.12/0.38  % SZS output end Proof
%------------------------------------------------------------------------------