↑ Up

Z3---4.15.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN960+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% 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 : Sat Jun 21 05:41:04 AM UTC 2025

% Result   : Theorem 0.12s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN960+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n001.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Fri Jun 20 13:06:05 EDT 2025
% 0.12/0.33  % CPUTime    : 
% 0.12/0.37  % SZS status Theorem
% 0.12/0.37  % SZS output start Proof
% 0.12/0.37  tff(a_type, type, (
% 0.12/0.37     a: ( $i * $i ) > $o)).
% 0.12/0.37  tff(tptp_fun_Y_3_type, type, (
% 0.12/0.37     tptp_fun_Y_3: $i)).
% 0.12/0.37  tff(tptp_fun_X_2_type, type, (
% 0.12/0.37     tptp_fun_X_2: $i)).
% 0.12/0.37  tff(tptp_fun_Y_0_type, type, (
% 0.12/0.37     tptp_fun_Y_0: $i)).
% 0.12/0.37  tff(tptp_fun_X_1_type, type, (
% 0.12/0.37     tptp_fun_X_1: $i)).
% 0.12/0.37  tff(1,assumption,(![X: $i, Y: $i] : (~a(X, Y))), introduced(assumption)).
% 0.12/0.37  tff(2,assumption,(a(X!1, Y!0)), introduced(assumption)).
% 0.12/0.37  tff(3,plain,
% 0.12/0.37      ((~![X: $i, Y: $i] : (~a(X, Y))) | (~a(X!1, Y!0))),
% 0.12/0.37      inference(quant_inst,[status(thm)],[])).
% 0.12/0.37  tff(4,plain,
% 0.12/0.37      ($false),
% 0.12/0.37      inference(unit_resolution,[status(thm)],[3, 2, 1])).
% 0.12/0.37  tff(5,plain,((~a(X!1, Y!0)) | (~![X: $i, Y: $i] : (~a(X, Y)))), inference(lemma,lemma(discharge,[]))).
% 0.12/0.37  tff(6,plain,
% 0.12/0.37      (~a(X!1, Y!0)),
% 0.12/0.37      inference(unit_resolution,[status(thm)],[5, 1])).
% 0.12/0.37  tff(7,plain,
% 0.12/0.37      ((![X: $i, Y: $i] : (~a(X, Y)) | ![Y: $i, X: $i] : (~a(X, Y))) <=> (![X: $i, Y: $i] : (~a(X, Y)) | ![Y: $i, X: $i] : (~a(X, Y)))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(8,plain,
% 0.12/0.37      (((a(X!1, Y!0) | a(X!2, Y!3)) & (![X: $i, Y: $i] : (~a(X, Y)) | ![Y: $i, X: $i] : (~a(X, Y)))) <=> ((a(X!1, Y!0) | a(X!2, Y!3)) & (![X: $i, Y: $i] : (~a(X, Y)) | ![Y: $i, X: $i] : (~a(X, Y))))),
% 0.12/0.37      inference(monotonicity,[status(thm)],[7])).
% 0.12/0.37  tff(9,plain,
% 0.12/0.37      ((~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))) <=> (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y)))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(10,plain,
% 0.12/0.37      ((?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y)) <=> (?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))),
% 0.12/0.37      inference(rewrite,[status(thm)],[])).
% 0.12/0.37  tff(11,plain,
% 0.12/0.37      ((~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))) <=> (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y)))),
% 0.12/0.37      inference(monotonicity,[status(thm)],[10])).
% 0.12/0.37  tff(12,plain,
% 0.12/0.37      ((~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))) <=> (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y)))),
% 0.12/0.37      inference(transitivity,[status(thm)],[11, 9])).
% 0.12/0.37  tff(13,axiom,(~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_this')).
% 0.12/0.37  tff(14,plain,
% 0.12/0.37      (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[13, 12])).
% 0.12/0.37  tff(15,plain,
% 0.12/0.37      (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[14, 12])).
% 0.12/0.37  tff(16,plain,
% 0.12/0.37      (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[15, 9])).
% 0.12/0.37  tff(17,plain,
% 0.12/0.37      (~(?[X: $i, Y: $i] : a(X, Y) <=> ?[Y: $i, X: $i] : a(X, Y))),
% 0.12/0.37      inference(modus_ponens,[status(thm)],[16, 12])).
% 0.12/0.37  unexpected number of arguments: (let ((a!1 (exists ((X $i) (Y $i)) (a X Y)))
% 0.12/0.37        (a!2 (lambda ((X $i) (Y $i)) (refl (~ (not (a X Y)) (not (a X Y))))))
% 0.12/0.37        (a!3 (forall ((X $i) (Y $i)) (not (a X Y))))
% 0.12/0.37        (a!4 (exists ((Y $i) (X $i)) (a X Y)))
% 0.12/0.37        (a!5 (lambda ((Y $i) (X $i)) (refl (~ (not (a X Y)) (not (a X Y))))))
% 0.12/0.37        (a!6 (forall ((Y $i) (X $i)) (not (a X Y)))))
% 0.12/0.37  (let ((a!7 (~ (not (= a!1 a!4)) (and (or (a X!1 Y!0) (a X!2 Y!3)) (or a!3 a!6)))))
% 0.12/0.37    (nnf-neg (sk (~ a!1 (a X!1 Y!0)))
% 0.12/0.37             (nnf-neg (proof-bind a!2) (~ (not a!1) a!3))
% 0.12/0.37             (sk (~ a!4 (a X!2 Y!3)))
% 0.12/0.37             (nnf-neg (proof-bind a!5) (~ (not a!4) a!6))
% 0.12/0.37             a!7)))
% 0.12/0.37  Proof display could not be completed: unexpected number of arguments
% 0.12/0.37  % E exiting
%------------------------------------------------------------------------------