↑ Up

Twee---2.7.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : KLE148+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.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 : Tue Sep 29 11:39:55 AM UTC 2026

% Result   : Theorem 0.24s 0.62s
% Output   : Proof 0.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : KLE148+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n007.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Sun Sep 27 13:10:39 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.62  Command-line arguments: --no-flatten-goal
% 0.24/0.62  
% 0.24/0.62  % SZS status Theorem
% 0.24/0.62  
% 0.24/0.62  % SZS output start Proof
% 0.24/0.62  Axiom 1 (additive_commutativity): addition(X, Y) = addition(Y, X).
% 0.24/0.62  Axiom 2 (additive_identity): addition(X, zero) = X.
% 0.24/0.62  Axiom 3 (multiplicative_right_identity): multiplication(X, one) = X.
% 0.24/0.62  Axiom 4 (goals): multiplication(x0, x1) = zero.
% 0.24/0.62  Axiom 5 (left_annihilation): multiplication(zero, X) = zero.
% 0.24/0.62  Axiom 6 (multiplicative_associativity): multiplication(X, multiplication(Y, Z)) = multiplication(multiplication(X, Y), Z).
% 0.24/0.62  Axiom 7 (infty_unfold1): strong_iteration(X) = addition(multiplication(X, strong_iteration(X)), one).
% 0.24/0.62  Axiom 8 (distributivity1): multiplication(X, addition(Y, Z)) = addition(multiplication(X, Y), multiplication(X, Z)).
% 0.24/0.62  
% 0.24/0.62  Goal 1 (goals_1): multiplication(x0, strong_iteration(x1)) = x0.
% 0.24/0.62  Proof:
% 0.24/0.62    multiplication(x0, strong_iteration(x1))
% 0.24/0.62  = { by axiom 7 (infty_unfold1) }
% 0.24/0.62    multiplication(x0, addition(multiplication(x1, strong_iteration(x1)), one))
% 0.24/0.62  = { by axiom 8 (distributivity1) }
% 0.24/0.62    addition(multiplication(x0, multiplication(x1, strong_iteration(x1))), multiplication(x0, one))
% 0.24/0.62  = { by axiom 6 (multiplicative_associativity) }
% 0.24/0.62    addition(multiplication(multiplication(x0, x1), strong_iteration(x1)), multiplication(x0, one))
% 0.24/0.62  = { by axiom 4 (goals) }
% 0.24/0.62    addition(multiplication(zero, strong_iteration(x1)), multiplication(x0, one))
% 0.24/0.62  = { by axiom 5 (left_annihilation) }
% 0.24/0.62    addition(zero, multiplication(x0, one))
% 0.24/0.62  = { by axiom 1 (additive_commutativity) R->L }
% 0.24/0.62    addition(multiplication(x0, one), zero)
% 0.24/0.62  = { by axiom 2 (additive_identity) }
% 0.24/0.62    multiplication(x0, one)
% 0.24/0.62  = { by axiom 3 (multiplicative_right_identity) }
% 0.24/0.62    x0
% 0.24/0.62  % SZS output end Proof
% 0.24/0.62  
% 0.24/0.62  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------