TSTP Solution File: LCL355-1 by Moca---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Moca---0.1
% Problem : LCL355-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : moca.sh %s
% Computer : n011.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 : Sun Jul 17 13:00:37 EDT 2022
% Result : Unsatisfiable 9.89s 9.89s
% Output : Proof 9.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL355-1 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.13 % Command : moca.sh %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 2 14:33:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 9.89/9.89 % SZS status Unsatisfiable
% 9.89/9.89 % SZS output start Proof
% 9.89/9.89 The input problem is unsatisfiable because
% 9.89/9.89
% 9.89/9.89 [1] the following set of Horn clauses is unsatisfiable:
% 9.89/9.89
% 9.89/9.89 is_a_theorem(implies(X, Y)) & is_a_theorem(X) ==> is_a_theorem(Y)
% 9.89/9.89 is_a_theorem(implies(implies(X, Y), implies(implies(Y, Z), implies(X, Z))))
% 9.89/9.89 is_a_theorem(implies(implies(not(X), X), X))
% 9.89/9.89 is_a_theorem(implies(X, implies(not(X), Y)))
% 9.89/9.89 is_a_theorem(implies(implies(implies(implies(x, y), implies(z, y)), u), implies(implies(z, x), u))) ==> \bottom
% 9.89/9.89
% 9.89/9.89 This holds because
% 9.89/9.89
% 9.89/9.89 [2] the following E entails the following G (Claessen-Smallbone's transformation (2018)):
% 9.89/9.89
% 9.89/9.89 E:
% 9.89/9.89 f1(true__, Y) = is_a_theorem(Y)
% 9.89/9.89 f2(is_a_theorem(X), X, Y) = true__
% 9.89/9.89 f2(true__, X, Y) = f1(is_a_theorem(implies(X, Y)), Y)
% 9.89/9.89 f3(is_a_theorem(implies(implies(implies(implies(x, y), implies(z, y)), u), implies(implies(z, x), u)))) = true__
% 9.89/9.89 f3(true__) = false__
% 9.89/9.89 is_a_theorem(implies(X, implies(not(X), Y))) = true__
% 9.89/9.89 is_a_theorem(implies(implies(X, Y), implies(implies(Y, Z), implies(X, Z)))) = true__
% 9.89/9.89 is_a_theorem(implies(implies(not(X), X), X)) = true__
% 9.89/9.89 G:
% 9.89/9.89 true__ = false__
% 9.89/9.89
% 9.89/9.89 This holds because
% 9.89/9.89
% 9.89/9.89 [3] E entails the following ordered TRS and the lhs and rhs of G join by the TRS:
% 9.89/9.89
% 9.89/9.89
% 9.89/9.89 f1(f1(true__, implies(implies(X0, implies(not(X0), X1)), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(implies(X0, X1), implies(implies(X1, X2), implies(X0, X2))), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(implies(X0, X1), implies(implies(not(X0), X0), X1)), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(implies(implies(implies(X0, X1), implies(X2, X1)), X3), implies(implies(X2, X0), X3)), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(implies(implies(not(X0), X1), X2), implies(X0, X2)), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(implies(not(X0), X0), X0), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(not(implies(X0, implies(not(X0), X1))), X2), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(not(implies(implies(X0, X1), implies(implies(X1, X2), implies(X0, X2)))), X3), Y1)), Y1) -> true__
% 9.89/9.89 f1(f1(true__, implies(implies(not(implies(implies(not(X0), X0), X0)), X1), Y1)), Y1) -> true__
% 9.89/9.89 f1(true__, implies(X0, implies(implies(Y1, Y2), implies(not(X0), Y2)))) -> true__
% 9.89/9.89 f1(true__, implies(X0, implies(not(implies(not(X0), X1)), Y1))) -> true__
% 9.89/9.89 f1(true__, implies(Y0, Y0)) -> true__
% 9.89/9.89 f1(true__, implies(Y0, implies(not(Y0), Y1))) -> true__
% 9.89/9.89 f1(true__, implies(implies(X2, X0), implies(implies(implies(X2, X1), Y2), implies(implies(X0, X1), Y2)))) -> true__
% 9.89/9.89 f1(true__, implies(implies(X2, X0), implies(not(implies(implies(X0, X1), implies(X2, X1))), Y1))) -> true__
% 9.89/9.89 f1(true__, implies(implies(Y0, X2), implies(implies(not(Y0), Y0), X2))) -> true__
% 9.89/9.89 f1(true__, implies(implies(Y0, Y1), implies(implies(Y1, Y2), implies(Y0, Y2)))) -> true__
% 9.89/9.89 f1(true__, implies(implies(implies(implies(Y1, Y2), implies(Y0, Y2)), X2), implies(implies(Y0, Y1), X2))) -> true__
% 9.89/9.89 f1(true__, implies(implies(implies(not(Y0), Y1), X2), implies(Y0, X2))) -> true__
% 9.89/9.89 f1(true__, implies(implies(not(Y0), Y0), Y0)) -> true__
% 9.89/9.89 f1(true__, implies(implies(not(Y0), Y0), implies(not(Y0), Y1))) -> true__
% 9.89/9.89 f1(true__, implies(implies(not(implies(Y0, Y1)), implies(Y0, Y1)), implies(implies(Y1, Y2), implies(Y0, Y2)))) -> true__
% 9.89/9.89 f1(true__, implies(implies(not(implies(not(Y0), Y0)), implies(not(Y0), Y0)), Y0)) -> true__
% 9.89/9.89 f1(true__, implies(not(implies(Y0, implies(not(Y0), Y1))), X1)) -> true__
% 9.89/9.89 f1(true__, implies(not(implies(implies(Y0, Y1), implies(implies(Y1, Y2), implies(Y0, Y2)))), X1)) -> true__
% 9.89/9.89 f1(true__, implies(not(implies(implies(not(Y0), Y0), Y0)), X1)) -> true__
% 9.89/9.89 f2(f1(true__, Y0), Y0, Y1) -> true__
% 9.89/9.89 f2(is_a_theorem(X), X, Y) -> true__
% 9.89/9.89 f2(true__, X, Y) -> f1(is_a_theorem(implies(X, Y)), Y)
% 9.89/9.89 f3(f1(true__, implies(implies(implies(implies(x, y), implies(z, y)), u), implies(implies(z, x), u)))) -> true__
% 9.89/9.89 f3(is_a_theorem(implies(implies(implies(implies(x, y), implies(z, y)), u), implies(implies(z, x), u)))) -> true__
% 9.89/9.89 f3(true__) -> false__
% 9.89/9.89 false__ -> true__
% 9.89/9.89 is_a_theorem(Y) -> f1(true__, Y)
% 9.89/9.89 is_a_theorem(implies(X, implies(not(X), Y))) -> true__
% 9.89/9.89 is_a_theorem(implies(implies(X, Y), implies(implies(Y, Z), implies(X, Z)))) -> true__
% 9.89/9.89 is_a_theorem(implies(implies(not(X), X), X)) -> true__
% 9.89/9.89 with the LPO induced by
% 9.89/9.89 u > z > y > x > f3 > not > f2 > implies > is_a_theorem > f1 > false__ > true__
% 9.89/9.89
% 9.89/9.89 % SZS output end Proof
% 9.89/9.89
%------------------------------------------------------------------------------