TSTP Solution File: GRP020-1 by Moca---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Moca---0.1
% Problem  : GRP020-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : moca.sh %s

% Computer : n015.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  : 600s
% DateTime : Sat Jul 16 10:51:52 EDT 2022

% Result   : Unsatisfiable 6.21s 6.31s
% Output   : Proof 6.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP020-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : moca.sh %s
% 0.12/0.33  % Computer : n015.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  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 22:10:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 6.21/6.31  % SZS status Unsatisfiable
% 6.21/6.31  % SZS output start Proof
% 6.21/6.31  The input problem is unsatisfiable because
% 6.21/6.31  
% 6.21/6.31  [1] the following set of Horn clauses is unsatisfiable:
% 6.21/6.31  
% 6.21/6.31  	product(identity, X, X)
% 6.21/6.31  	product(X, identity, X)
% 6.21/6.31  	product(inverse(X), X, identity)
% 6.21/6.31  	product(X, inverse(X), identity)
% 6.21/6.31  	product(X, Y, multiply(X, Y))
% 6.21/6.31  	product(X, Y, Z) & product(X, Y, W) ==> Z = W
% 6.21/6.31  	product(X, Y, U) & product(Y, Z, V) & product(U, Z, W) ==> product(X, V, W)
% 6.21/6.31  	product(X, Y, U) & product(Y, Z, V) & product(X, V, W) ==> product(U, Z, W)
% 6.21/6.31  	multiply(inverse(a), a) = identity ==> \bottom
% 6.21/6.31  
% 6.21/6.31  This holds because
% 6.21/6.31  
% 6.21/6.31  [2] the following E entails the following G (Claessen-Smallbone's transformation (2018)):
% 6.21/6.31  
% 6.21/6.31  E:
% 6.21/6.31  	f1(true__, Z, W) = Z
% 6.21/6.31  	f2(product(X, Y, W), X, Y, Z, W) = W
% 6.21/6.31  	f2(true__, X, Y, Z, W) = f1(product(X, Y, Z), Z, W)
% 6.21/6.31  	f3(true__, X, V, W) = product(X, V, W)
% 6.21/6.31  	f4(true__, X, Y, U, V, W) = f3(product(X, Y, U), X, V, W)
% 6.21/6.31  	f5(product(U, Z, W), Y, Z, V, X, U, W) = true__
% 6.21/6.31  	f5(true__, Y, Z, V, X, U, W) = f4(product(Y, Z, V), X, Y, U, V, W)
% 6.21/6.31  	f6(true__, U, Z, W) = product(U, Z, W)
% 6.21/6.31  	f7(true__, X, Y, U, Z, W) = f6(product(X, Y, U), U, Z, W)
% 6.21/6.31  	f8(product(X, V, W), Y, Z, V, X, U, W) = true__
% 6.21/6.31  	f8(true__, Y, Z, V, X, U, W) = f7(product(Y, Z, V), X, Y, U, Z, W)
% 6.21/6.31  	f9(identity) = false__
% 6.21/6.31  	f9(multiply(inverse(a), a)) = true__
% 6.21/6.31  	product(X, Y, multiply(X, Y)) = true__
% 6.21/6.31  	product(X, identity, X) = true__
% 6.21/6.31  	product(X, inverse(X), identity) = true__
% 6.21/6.31  	product(identity, X, X) = true__
% 6.21/6.31  	product(inverse(X), X, identity) = true__
% 6.21/6.31  G:
% 6.21/6.31  	true__ = false__
% 6.21/6.31  
% 6.21/6.31  This holds because
% 6.21/6.31  
% 6.21/6.31  [3] E entails the following ordered TRS and the lhs and rhs of G join by the TRS:
% 6.21/6.31  
% 6.21/6.31  
% 6.21/6.31  	f1(f3(true__, Y0, Y1, Y3), Y3, multiply(Y0, Y1)) -> multiply(Y0, Y1)
% 6.21/6.31  	f1(f3(true__, Y0, inverse(Y0), Y3), Y3, identity) -> identity
% 6.21/6.31  	f1(f3(true__, Y2, identity, Y3), Y3, Y2) -> Y2
% 6.21/6.31  	f1(f3(true__, identity, Y2, Y3), Y3, Y2) -> Y2
% 6.21/6.31  	f1(f3(true__, inverse(X0), multiply(X0, Y2), Y3), Y3, Y2) -> Y2
% 6.21/6.31  	f1(f3(true__, inverse(Y1), Y1, Y3), Y3, identity) -> identity
% 6.21/6.31  	f1(true__, Z, W) -> Z
% 6.21/6.31  	f2(f3(true__, Y0, Y1, Y2), Y0, Y1, Y3, Y2) -> Y2
% 6.21/6.31  	f2(true__, X, Y, Z, W) -> f1(f3(true__, X, Y, Z), Z, W)
% 6.21/6.31  	f3(f3(true__, Y0, identity, inverse(X0)), Y0, X0, identity) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, Y0, identity), Y3, identity, inverse(Y0)) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, Y0, identity), Y3, multiply(Y0, Y1), Y1) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, Y1, Y1), Y3, identity, identity) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, Y2, identity), Y3, Y2, identity) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, identity, Y1), Y3, inverse(Y1), identity) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, identity, identity), Y3, Y2, Y2) -> true__
% 6.21/6.31  	f3(f3(true__, Y3, inverse(Y1), identity), Y3, identity, Y1) -> true__
% 6.21/6.31  	f3(true__, X0, multiply(inverse(X0), Y1), Y1) -> true__
% 6.21/6.31  	f3(true__, Y0, Y1, multiply(Y0, Y1)) -> true__
% 6.21/6.31  	f3(true__, Y0, inverse(Y0), identity) -> true__
% 6.21/6.31  	f3(true__, Y2, identity, Y2) -> true__
% 6.21/6.31  	f3(true__, identity, Y2, Y2) -> true__
% 6.21/6.31  	f3(true__, inverse(Y1), Y1, identity) -> true__
% 6.21/6.31  	f3(true__, inverse(Y1), multiply(Y1, Y2), Y2) -> true__
% 6.21/6.31  	f4(f3(true__, Y0, X0, Y2), Y3, Y0, inverse(X0), Y2, identity) -> true__
% 6.21/6.31  	f4(f3(true__, Y3, Y2, Y4), Y5, Y3, identity, Y4, Y2) -> true__
% 6.21/6.31  	f4(f3(true__, Y3, inverse(Y0), Y4), Y5, Y3, Y0, Y4, identity) -> true__
% 6.21/6.31  	f4(true__, X, Y, U, V, W) -> f3(f3(true__, X, Y, U), X, V, W)
% 6.21/6.31  	f5(product(U, Z, W), Y, Z, V, X, U, W) -> true__
% 6.21/6.31  	f5(true__, Y, Z, V, X, U, W) -> f4(f3(true__, Y, Z, V), X, Y, U, V, W)
% 6.21/6.31  	f6(f3(true__, Y2, identity, Y3), Y3, inverse(Y2), identity) -> true__
% 6.21/6.31  	f6(f3(true__, Y2, inverse(Y2), Y3), Y3, identity, identity) -> true__
% 6.21/6.31  	f6(f3(true__, identity, Y0, Y3), Y3, inverse(Y0), identity) -> true__
% 6.21/6.31  	f6(f3(true__, identity, Y2, Y3), Y3, identity, Y2) -> true__
% 6.21/6.31  	f6(f3(true__, identity, identity, Y3), Y3, Y2, Y2) -> true__
% 6.21/6.31  	f6(f3(true__, identity, inverse(Y1), Y3), Y3, Y1, identity) -> true__
% 6.21/6.31  	f6(f3(true__, inverse(X0), X0, Y1), Y1, identity, identity) -> true__
% 6.21/6.31  	f6(f3(true__, inverse(X0), identity, Y1), Y1, X0, identity) -> true__
% 6.21/6.31  	f6(true__, U, Z, W) -> f3(true__, U, Z, W)
% 6.21/6.31  	f7(f3(true__, Y3, Y4, Y2), identity, Y3, Y5, Y4, Y2) -> true__
% 6.21/6.31  	f7(f3(true__, Y3, Y4, inverse(Y0)), Y0, Y3, Y5, Y4, identity) -> true__
% 6.21/6.31  	f7(true__, X, Y, U, Z, W) -> f6(f3(true__, X, Y, U), U, Z, W)
% 6.21/6.31  	f8(product(X, V, W), Y, Z, V, X, U, W) -> true__
% 6.21/6.31  	f8(true__, Y, Z, V, X, U, W) -> f7(f3(true__, Y, Z, V), X, Y, U, Z, W)
% 6.21/6.31  	f9(identity) -> false__
% 6.21/6.31  	f9(multiply(inverse(a), a)) -> true__
% 6.21/6.31  	inverse(identity) -> identity
% 6.21/6.31  	inverse(inverse(Y1)) -> Y1
% 6.21/6.31  	multiply(Y0, identity) -> Y0
% 6.21/6.31  	multiply(Y0, inverse(Y0)) -> identity
% 6.21/6.31  	multiply(identity, Y0) -> Y0
% 6.21/6.31  	multiply(inverse(Y0), Y0) -> identity
% 6.21/6.31  	product(X, V, W) -> f3(true__, X, V, W)
% 6.21/6.31  	true__ -> false__
% 6.21/6.31  with the LPO induced by
% 6.21/6.31  	f2 > f1 > f8 > f7 > f6 > f5 > f4 > product > f3 > a > inverse > identity > multiply > f9 > true__ > false__
% 6.21/6.31  
% 6.21/6.31  % SZS output end Proof
% 6.21/6.31  
%------------------------------------------------------------------------------