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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SYN926+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:17 EDT 2022

% Result   : Theorem 0.13s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN926+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n024.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 09:34:33 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(q_type, type, (
% 0.13/0.38     q: $i > $o)).
% 0.13/0.38  tff(p_type, type, (
% 0.13/0.38     p: $i > $o)).
% 0.13/0.38  tff(tptp_fun_X_0_type, type, (
% 0.13/0.38     tptp_fun_X_0: $i)).
% 0.13/0.38  tff(1,assumption,(![X: $i] : (~p(X))), introduced(assumption)).
% 0.13/0.38  tff(2,plain,
% 0.13/0.38      (?[X: $i] : (p(X) & q(X)) <=> ?[X: $i] : (p(X) & q(X))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(3,plain,
% 0.13/0.38      ((~(?[X: $i] : (p(X) & q(X)) => (?[X: $i] : p(X) & ?[X: $i] : q(X)))) <=> (~((~?[X: $i] : (p(X) & q(X))) | (?[X: $i] : p(X) & ?[X: $i] : q(X))))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(4,axiom,(~(?[X: $i] : (p(X) & q(X)) => (?[X: $i] : p(X) & ?[X: $i] : q(X)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.13/0.38  tff(5,plain,
% 0.13/0.38      (~((~?[X: $i] : (p(X) & q(X))) | (?[X: $i] : p(X) & ?[X: $i] : q(X)))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[4, 3])).
% 0.13/0.38  tff(6,plain,
% 0.13/0.38      (?[X: $i] : (p(X) & q(X))),
% 0.13/0.38      inference(or_elim,[status(thm)],[5])).
% 0.13/0.38  tff(7,plain,
% 0.13/0.38      (?[X: $i] : (p(X) & q(X))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[6, 2])).
% 0.13/0.38  tff(8,plain,(
% 0.13/0.38      p(X!0) & q(X!0)),
% 0.13/0.38      inference(skolemize,[status(sab)],[7])).
% 0.13/0.38  tff(9,plain,
% 0.13/0.38      (p(X!0)),
% 0.13/0.38      inference(and_elim,[status(thm)],[8])).
% 0.13/0.38  tff(10,plain,
% 0.13/0.38      ((~![X: $i] : (~p(X))) | (~p(X!0))),
% 0.13/0.38      inference(quant_inst,[status(thm)],[])).
% 0.13/0.38  tff(11,plain,
% 0.13/0.38      ($false),
% 0.13/0.38      inference(unit_resolution,[status(thm)],[10, 9, 1])).
% 0.13/0.38  tff(12,plain,(~![X: $i] : (~p(X))), inference(lemma,lemma(discharge,[]))).
% 0.13/0.38  tff(13,plain,
% 0.13/0.38      ((![X: $i] : (~p(X)) | ![X: $i] : (~q(X))) <=> (![X: $i] : (~p(X)) | ![X: $i] : (~q(X)))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(14,plain,
% 0.13/0.38      ((![X: $i] : (~p(X)) | ![X: $i] : (~q(X))) <=> (![X: $i] : (~p(X)) | ![X: $i] : (~q(X)))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(15,plain,
% 0.13/0.38      ((?[X: $i] : p(X) & ?[X: $i] : q(X)) <=> (?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(16,plain,
% 0.13/0.38      ((~(?[X: $i] : p(X) & ?[X: $i] : q(X))) <=> (~(?[X: $i] : p(X) & ?[X: $i] : q(X)))),
% 0.13/0.38      inference(monotonicity,[status(thm)],[15])).
% 0.13/0.38  tff(17,plain,
% 0.13/0.38      ((~(?[X: $i] : p(X) & ?[X: $i] : q(X))) <=> (~(?[X: $i] : p(X) & ?[X: $i] : q(X)))),
% 0.13/0.38      inference(rewrite,[status(thm)],[])).
% 0.13/0.38  tff(18,plain,
% 0.13/0.38      (~(?[X: $i] : p(X) & ?[X: $i] : q(X))),
% 0.13/0.38      inference(or_elim,[status(thm)],[5])).
% 0.13/0.38  tff(19,plain,
% 0.13/0.38      (~(?[X: $i] : p(X) & ?[X: $i] : q(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] : p(X) & ?[X: $i] : q(X))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[19, 17])).
% 0.13/0.38  tff(21,plain,
% 0.13/0.38      (~(?[X: $i] : p(X) & ?[X: $i] : q(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] : p(X) & ?[X: $i] : q(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] : p(X) & ?[X: $i] : q(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] : p(X) & ?[X: $i] : q(X))),
% 0.13/0.38      inference(modus_ponens,[status(thm)],[23, 16])).
% 0.13/0.38  unexpected number of arguments: (let ((a!1 (lambda ((X $i)) (refl (~ (not (p X)) (not (p X))))))
% 0.13/0.38        (a!2 (exists ((X $i)) (p X)))
% 0.13/0.38        (a!3 (forall ((X $i)) (not (p X))))
% 0.13/0.38        (a!4 (lambda ((X $i)) (refl (~ (not (q X)) (not (q X))))))
% 0.13/0.38        (a!5 (exists ((X $i)) (q X)))
% 0.13/0.38        (a!6 (forall ((X $i)) (not (q X)))))
% 0.13/0.38    (nnf-neg (nnf-neg (proof-bind a!1) (~ (not a!2) a!3))
% 0.13/0.38             (nnf-neg (proof-bind a!4) (~ (not a!5) a!6))
% 0.13/0.38             (~ (not (and a!2 a!5)) (or a!3 a!6))))
% 0.13/0.38  Proof display could not be completed: unexpected number of arguments
%------------------------------------------------------------------------------