TSTP Solution File: CAT014-4 by Moca---0.1

View Problem - Process Solution

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

% Computer : n018.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 : Fri Jul 15 00:04:59 EDT 2022

% Result   : Unsatisfiable 9.60s 9.58s
% Output   : Proof 9.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : CAT014-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : moca.sh %s
% 0.12/0.33  % Computer : n018.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 : Sun May 29 17:44:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 9.60/9.58  % SZS status Unsatisfiable
% 9.60/9.58  % SZS output start Proof
% 9.60/9.58  The input problem is unsatisfiable because
% 9.60/9.58  
% 9.60/9.58  [1] the following set of Horn clauses is unsatisfiable:
% 9.60/9.58  
% 9.60/9.58  	equivalent(X, Y) ==> there_exists(X)
% 9.60/9.58  	equivalent(X, Y) ==> X = Y
% 9.60/9.58  	there_exists(X) & X = Y ==> equivalent(X, Y)
% 9.60/9.58  	there_exists(domain(X)) ==> there_exists(X)
% 9.60/9.58  	there_exists(codomain(X)) ==> there_exists(X)
% 9.60/9.58  	there_exists(compose(X, Y)) ==> there_exists(domain(X))
% 9.60/9.58  	there_exists(compose(X, Y)) ==> domain(X) = codomain(Y)
% 9.60/9.58  	there_exists(domain(X)) & domain(X) = codomain(Y) ==> there_exists(compose(X, Y))
% 9.60/9.58  	compose(X, compose(Y, Z)) = compose(compose(X, Y), Z)
% 9.60/9.58  	compose(X, domain(X)) = X
% 9.60/9.58  	compose(codomain(X), X) = X
% 9.60/9.58  	there_exists(codomain(a))
% 9.60/9.58  	codomain(codomain(a)) = codomain(a) ==> \bottom
% 9.60/9.58  
% 9.60/9.58  This holds because
% 9.60/9.58  
% 9.60/9.58  [2] the following E entails the following G (Claessen-Smallbone's transformation (2018)):
% 9.60/9.58  
% 9.60/9.58  E:
% 9.60/9.58  	compose(X, compose(Y, Z)) = compose(compose(X, Y), Z)
% 9.60/9.58  	compose(X, domain(X)) = X
% 9.60/9.58  	compose(codomain(X), X) = X
% 9.60/9.58  	f1(equivalent(X, Y), X) = true__
% 9.60/9.58  	f1(true__, X) = there_exists(X)
% 9.60/9.58  	f10(codomain(Y), Y, X) = f9(there_exists(domain(X)), X, Y)
% 9.60/9.58  	f10(domain(X), Y, X) = true__
% 9.60/9.58  	f11(codomain(a)) = false__
% 9.60/9.58  	f11(codomain(codomain(a))) = true__
% 9.60/9.58  	f2(equivalent(X, Y), X, Y) = Y
% 9.60/9.58  	f2(true__, X, Y) = X
% 9.60/9.58  	f3(true__, X, Y) = equivalent(X, Y)
% 9.60/9.58  	f4(X, Y, X) = true__
% 9.60/9.58  	f4(Y, Y, X) = f3(there_exists(X), X, Y)
% 9.60/9.58  	f5(there_exists(domain(X)), X) = true__
% 9.60/9.58  	f5(true__, X) = there_exists(X)
% 9.60/9.58  	f6(there_exists(codomain(X)), X) = true__
% 9.60/9.58  	f6(true__, X) = there_exists(X)
% 9.60/9.58  	f7(there_exists(compose(X, Y)), X) = true__
% 9.60/9.58  	f7(true__, X) = there_exists(domain(X))
% 9.60/9.58  	f8(there_exists(compose(X, Y)), X, Y) = codomain(Y)
% 9.60/9.58  	f8(true__, X, Y) = domain(X)
% 9.60/9.58  	f9(true__, X, Y) = there_exists(compose(X, Y))
% 9.60/9.58  	there_exists(codomain(a)) = true__
% 9.60/9.58  G:
% 9.60/9.58  	true__ = false__
% 9.60/9.58  
% 9.60/9.58  This holds because
% 9.60/9.58  
% 9.60/9.58  [3] E entails the following ordered TRS and the lhs and rhs of G join by the TRS:
% 9.60/9.58  
% 9.60/9.58  
% 9.60/9.58  	codomain(codomain(a)) -> codomain(a)
% 9.60/9.58  	codomain(domain(a)) -> domain(a)
% 9.60/9.58  	codomain(domain(codomain(a))) -> domain(codomain(a))
% 9.60/9.58  	compose(X, domain(X)) -> X
% 9.60/9.58  	compose(Y0, compose(Y1, domain(compose(Y0, Y1)))) -> compose(Y0, Y1)
% 9.60/9.58  	compose(Y0, compose(domain(Y0), Y2)) -> compose(Y0, Y2)
% 9.60/9.58  	compose(Y0, compose(domain(Y0), domain(Y0))) -> Y0
% 9.60/9.58  	compose(Y0, domain(domain(Y0))) -> Y0
% 9.60/9.58  	compose(codomain(X), X) -> X
% 9.60/9.58  	compose(codomain(Y1), compose(Y1, Y2)) -> compose(Y1, Y2)
% 9.60/9.58  	compose(codomain(a), codomain(a)) -> codomain(a)
% 9.60/9.58  	compose(codomain(a), compose(codomain(a), Y1)) -> compose(codomain(a), Y1)
% 9.60/9.58  	compose(codomain(codomain(Y1)), Y1) -> Y1
% 9.60/9.58  	compose(compose(X, Y), Z) -> compose(X, compose(Y, Z))
% 9.60/9.58  	compose(domain(a), compose(domain(a), Y1)) -> compose(domain(a), Y1)
% 9.60/9.58  	compose(domain(a), domain(a)) -> domain(a)
% 9.60/9.58  	compose(domain(codomain(a)), domain(codomain(a))) -> domain(codomain(a))
% 9.60/9.58  	domain(codomain(a)) -> codomain(a)
% 9.60/9.58  	domain(codomain(codomain(a))) -> codomain(codomain(a))
% 9.60/9.58  	domain(domain(a)) -> domain(a)
% 9.60/9.58  	equivalent(a, a) -> true__
% 9.60/9.58  	equivalent(codomain(a), codomain(a)) -> true__
% 9.60/9.58  	equivalent(domain(a), domain(a)) -> true__
% 9.60/9.58  	equivalent(domain(codomain(a)), domain(codomain(a))) -> true__
% 9.60/9.58  	equivalent(domain(domain(a)), domain(domain(a))) -> true__
% 9.60/9.58  	f1(equivalent(X, Y), X) -> true__
% 9.60/9.58  	f1(true__, a) -> true__
% 9.60/9.58  	f1(true__, codomain(a)) -> true__
% 9.60/9.58  	f1(true__, domain(a)) -> true__
% 9.60/9.58  	f1(true__, domain(codomain(a))) -> true__
% 9.60/9.58  	f1(true__, domain(codomain(codomain(a)))) -> true__
% 9.60/9.58  	f1(true__, domain(codomain(domain(codomain(a))))) -> true__
% 9.60/9.58  	f1(true__, domain(codomain(domain(domain(a))))) -> true__
% 9.60/9.58  	f1(true__, domain(domain(a))) -> true__
% 9.60/9.58  	f1(true__, domain(domain(codomain(a)))) -> true__
% 9.60/9.58  	f1(true__, domain(domain(codomain(codomain(a))))) -> true__
% 9.60/9.58  	f1(true__, domain(domain(domain(a)))) -> true__
% 9.60/9.58  	f1(true__, domain(domain(domain(domain(a))))) -> true__
% 9.60/9.58  	f10(codomain(Y), Y, X) -> f9(there_exists(domain(X)), X, Y)
% 9.60/9.58  	f10(codomain(a), Y1, codomain(a)) -> true__
% 9.60/9.58  	f10(codomain(a), codomain(a), Y1) -> f9(f1(true__, domain(Y1)), Y1, codomain(a))
% 9.60/9.58  	f10(domain(X), Y, X) -> true__
% 9.60/9.58  	f10(domain(a), Y1, domain(a)) -> true__
% 9.60/9.58  	f10(domain(a), domain(a), Y1) -> f9(f1(true__, domain(Y1)), Y1, domain(a))
% 9.60/9.58  	f11(codomain(a)) -> false__
% 9.60/9.58  	f11(codomain(codomain(a))) -> true__
% 9.60/9.58  	f2(equivalent(X, Y), X, Y) -> Y
% 9.60/9.58  	f2(true__, X, Y) -> X
% 9.60/9.58  	f3(f1(true__, Y1), Y1, Y1) -> true__
% 9.60/9.58  	f3(true__, X, Y) -> equivalent(X, Y)
% 9.60/9.58  	f4(X, Y, X) -> true__
% 9.60/9.58  	f4(Y, Y, X) -> f3(there_exists(X), X, Y)
% 9.60/9.58  	f5(f1(true__, domain(Y0)), Y0) -> true__
% 9.60/9.58  	f5(there_exists(domain(X)), X) -> true__
% 9.60/9.58  	f5(true__, X) -> there_exists(X)
% 9.60/9.58  	f6(f1(true__, codomain(Y0)), Y0) -> true__
% 9.60/9.58  	f6(there_exists(codomain(X)), X) -> true__
% 9.60/9.58  	f6(true__, X) -> there_exists(X)
% 9.60/9.58  	f7(f1(true__, Y0), Y0) -> true__
% 9.60/9.58  	f7(f1(true__, Y1), codomain(Y1)) -> true__
% 9.60/9.58  	f7(f1(true__, Y1), codomain(codomain(Y1))) -> true__
% 9.60/9.58  	f7(f1(true__, compose(Y0, Y1)), Y0) -> true__
% 9.60/9.58  	f7(there_exists(compose(X, Y)), X) -> true__
% 9.60/9.58  	f7(true__, X) -> there_exists(domain(X))
% 9.60/9.58  	f8(f1(true__, Y0), Y0, domain(Y0)) -> codomain(domain(Y0))
% 9.60/9.58  	f8(f1(true__, Y1), codomain(Y1), Y1) -> codomain(Y1)
% 9.60/9.58  	f8(f1(true__, compose(Y0, Y1)), Y0, Y1) -> codomain(Y1)
% 9.60/9.58  	f8(there_exists(compose(X, Y)), X, Y) -> codomain(Y)
% 9.60/9.58  	f8(true__, X, Y) -> domain(X)
% 9.60/9.58  	f9(true__, X, Y) -> there_exists(compose(X, Y))
% 9.60/9.58  	false__ -> true__
% 9.60/9.58  	there_exists(X) -> f1(true__, X)
% 9.60/9.58  	there_exists(codomain(a)) -> true__
% 9.60/9.58  with the LPO induced by
% 9.60/9.58  	f11 > f7 > f10 > f9 > a > f2 > f8 > domain > f6 > f5 > f4 > f3 > there_exists > f1 > compose > codomain > equivalent > false__ > true__
% 9.60/9.58  
% 9.60/9.58  % SZS output end Proof
% 9.60/9.58  
%------------------------------------------------------------------------------