↑ Up

Z3---4.15.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : LCL487+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : run_E %s %d THM

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 03:00:08 PM UTC 2026

% Result   : Theorem 6.25s 6.59s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem    : LCL487+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02  % Command    : run_E %s %d THM
% 0.09/0.34  % Computer : n029.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit   : 300
% 0.09/0.34  % WCLimit    : 300
% 0.09/0.34  % DateTime   : Sat Sep  5 14:19:42 UTC 2026
% 0.09/0.34  % CPUTime    : 
% 6.25/6.59  % SZS status Theorem
% 6.25/6.59  % SZS output start Proof
% 6.25/6.59  tff(is_a_theorem_type, type, (
% 6.25/6.59     is_a_theorem: $i > $o)).
% 6.25/6.59  tff(implies_type, type, (
% 6.25/6.59     implies: ( $i * $i ) > $i)).
% 6.25/6.59  tff(not_type, type, (
% 6.25/6.59     not: $i > $i)).
% 6.25/6.59  tff(and_type, type, (
% 6.25/6.59     and: ( $i * $i ) > $i)).
% 6.25/6.59  tff(tptp_fun_Y_13_type, type, (
% 6.25/6.59     tptp_fun_Y_13: $i)).
% 6.25/6.59  tff(tptp_fun_X_14_type, type, (
% 6.25/6.59     tptp_fun_X_14: $i)).
% 6.25/6.59  tff(or_type, type, (
% 6.25/6.59     or: ( $i * $i ) > $i)).
% 6.25/6.59  tff(op_or_type, type, (
% 6.25/6.59     op_or: $o)).
% 6.25/6.59  tff(r3_type, type, (
% 6.25/6.59     r3: $o)).
% 6.25/6.59  tff(tptp_fun_P_48_type, type, (
% 6.25/6.59     tptp_fun_P_48: $i)).
% 6.25/6.59  tff(tptp_fun_Q_47_type, type, (
% 6.25/6.59     tptp_fun_Q_47: $i)).
% 6.25/6.59  tff(op_implies_or_type, type, (
% 6.25/6.59     op_implies_or: $o)).
% 6.25/6.59  tff(op_and_type, type, (
% 6.25/6.59     op_and: $o)).
% 6.25/6.59  tff(op_implies_and_type, type, (
% 6.25/6.59     op_implies_and: $o)).
% 6.25/6.59  tff(modus_ponens_type, type, (
% 6.25/6.59     modus_ponens: $o)).
% 6.25/6.59  tff(tptp_fun_Y_0_type, type, (
% 6.25/6.59     tptp_fun_Y_0: $i)).
% 6.25/6.59  tff(tptp_fun_X_1_type, type, (
% 6.25/6.59     tptp_fun_X_1: $i)).
% 6.25/6.59  tff(r5_type, type, (
% 6.25/6.59     r5: $o)).
% 6.25/6.59  tff(tptp_fun_R_52_type, type, (
% 6.25/6.59     tptp_fun_R_52: $i)).
% 6.25/6.59  tff(tptp_fun_P_54_type, type, (
% 6.25/6.59     tptp_fun_P_54: $i)).
% 6.25/6.59  tff(tptp_fun_Q_53_type, type, (
% 6.25/6.59     tptp_fun_Q_53: $i)).
% 6.25/6.59  tff(r2_type, type, (
% 6.25/6.59     r2: $o)).
% 6.25/6.59  tff(tptp_fun_Q_45_type, type, (
% 6.25/6.59     tptp_fun_Q_45: $i)).
% 6.25/6.59  tff(tptp_fun_P_46_type, type, (
% 6.25/6.59     tptp_fun_P_46: $i)).
% 6.25/6.59  tff(and_1_type, type, (
% 6.25/6.59     and_1: $o)).
% 6.25/6.59  tff(1,plain,
% 6.25/6.59      (op_or <=> op_or),
% 6.25/6.59      inference(rewrite,[status(thm)],[])).
% 6.25/6.59  tff(2,axiom,(op_or), file('/export/starexec/sandbox/benchmark/theBenchmark.p','hilbert_op_or')).
% 6.25/6.59  tff(3,plain,
% 6.25/6.59      (op_or),
% 6.25/6.59      inference(modus_ponens,[status(thm)],[2, 1])).
% 6.25/6.59  tff(4,plain,
% 6.25/6.59      (((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))) <=> ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y)))))),
% 6.25/6.59      inference(rewrite,[status(thm)],[])).
% 6.25/6.59  tff(5,plain,
% 6.25/6.59      (((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))) <=> ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y)))))),
% 6.25/6.59      inference(rewrite,[status(thm)],[])).
% 6.25/6.59  tff(6,plain,
% 6.25/6.59      ((op_or => ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))) <=> ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y)))))),
% 6.25/6.59      inference(rewrite,[status(thm)],[])).
% 6.25/6.59  tff(7,axiom,(op_or => ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax','op_or')).
% 6.25/6.59  tff(8,plain,
% 6.25/6.59      ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))),
% 6.25/6.59      inference(modus_ponens,[status(thm)],[7, 6])).
% 6.25/6.59  tff(9,plain,
% 6.25/6.59      ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))),
% 6.25/6.59      inference(modus_ponens,[status(thm)],[8, 5])).
% 6.25/6.59  tff(10,plain,
% 6.25/6.59      ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))),
% 6.25/6.59      inference(modus_ponens,[status(thm)],[9, 5])).
% 6.25/6.59  tff(11,plain,
% 6.25/6.59      ((~op_or) | ![X: $i, Y: $i] : (or(X, Y) = not(and(not(X), not(Y))))),
% 6.25/6.59      inference(modus_ponens,[status(thm)],[10, 5])).
% 6.25/6.59  Proof display could not be completed: monotonicity rule is not handled
% 6.35/6.68  % E exiting
%------------------------------------------------------------------------------