↑ Up

Twee---2.7.THM-Prf.s

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

% Computer : n008.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:48 AM UTC 2026

% Result   : Theorem 0.13s 0.68s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE089+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.57  % Computer : n008.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.58  % WCLimit  : 300
% 0.09/0.58  % DateTime : Sun Sep 27 13:10:11 UTC 2026
% 0.09/0.58  % CPUTime  : 
% 0.09/0.58  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.68  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-regeneralise
% 0.13/0.68  
% 0.13/0.68  % SZS status Theorem
% 0.13/0.68  
% 0.13/0.68  % SZS output start Proof
% 0.13/0.68  Axiom 1 (domain1): multiplication(antidomain(X), X) = zero.
% 0.13/0.68  Axiom 2 (additive_identity): addition(X, zero) = X.
% 0.13/0.68  Axiom 3 (goals): addition(domain(x0), antidomain(x1)) = antidomain(x1).
% 0.13/0.68  Axiom 4 (left_distributivity): multiplication(addition(X, Y), Z) = addition(multiplication(X, Z), multiplication(Y, Z)).
% 0.13/0.68  
% 0.13/0.68  Goal 1 (goals_1): multiplication(domain(x0), x1) = zero.
% 0.13/0.68  Proof:
% 0.13/0.68    multiplication(domain(x0), x1)
% 0.13/0.68  = { by axiom 2 (additive_identity) R->L }
% 0.13/0.68    addition(multiplication(domain(x0), x1), zero)
% 0.13/0.68  = { by axiom 1 (domain1) R->L }
% 0.13/0.68    addition(multiplication(domain(x0), x1), multiplication(antidomain(x1), x1))
% 0.13/0.68  = { by axiom 4 (left_distributivity) R->L }
% 0.13/0.68    multiplication(addition(domain(x0), antidomain(x1)), x1)
% 0.13/0.68  = { by axiom 3 (goals) }
% 0.13/0.68    multiplication(antidomain(x1), x1)
% 0.13/0.68  = { by axiom 1 (domain1) }
% 0.13/0.68    zero
% 0.13/0.68  % SZS output end Proof
% 0.13/0.68  
% 0.13/0.68  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------