TSTP Solution File: LCL169-3 by Moca---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Moca---0.1
% Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : moca.sh %s
% Computer : n027.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 12:58:38 EDT 2022
% Result : Unsatisfiable 1.07s 1.19s
% Output : Proof 1.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12 % Command : moca.sh %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 4 07:12:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.07/1.19 % SZS status Unsatisfiable
% 1.07/1.19 % SZS output start Proof
% 1.07/1.19 The input problem is unsatisfiable because
% 1.07/1.19
% 1.07/1.19 [1] the following set of Horn clauses is unsatisfiable:
% 1.07/1.19
% 1.07/1.19 axiom(implies(or(A, A), A))
% 1.07/1.19 axiom(implies(A, or(B, A)))
% 1.07/1.19 axiom(implies(or(A, B), or(B, A)))
% 1.07/1.19 axiom(implies(or(A, or(B, C)), or(B, or(A, C))))
% 1.07/1.19 axiom(implies(implies(A, B), implies(or(C, A), or(C, B))))
% 1.07/1.19 implies(X, Y) = or(not(X), Y)
% 1.07/1.19 axiom(X) ==> theorem(X)
% 1.07/1.19 theorem(implies(Y, X)) & theorem(Y) ==> theorem(X)
% 1.07/1.19 theorem(implies(implies(p, not(p)), not(p))) ==> \bottom
% 1.07/1.19
% 1.07/1.19 This holds because
% 1.07/1.19
% 1.07/1.19 [2] the following E entails the following G (Claessen-Smallbone's transformation (2018)):
% 1.07/1.19
% 1.07/1.19 E:
% 1.07/1.19 axiom(implies(A, or(B, A))) = true__
% 1.07/1.19 axiom(implies(implies(A, B), implies(or(C, A), or(C, B)))) = true__
% 1.07/1.19 axiom(implies(or(A, A), A)) = true__
% 1.07/1.19 axiom(implies(or(A, B), or(B, A))) = true__
% 1.07/1.19 axiom(implies(or(A, or(B, C)), or(B, or(A, C)))) = true__
% 1.07/1.19 f1(axiom(X), X) = true__
% 1.07/1.19 f1(true__, X) = theorem(X)
% 1.07/1.19 f2(true__, X) = theorem(X)
% 1.07/1.19 f3(theorem(Y), Y, X) = true__
% 1.07/1.19 f3(true__, Y, X) = f2(theorem(implies(Y, X)), X)
% 1.07/1.19 f4(theorem(implies(implies(p, not(p)), not(p)))) = true__
% 1.07/1.19 f4(true__) = false__
% 1.07/1.19 implies(X, Y) = or(not(X), Y)
% 1.07/1.19 G:
% 1.07/1.19 true__ = false__
% 1.07/1.19
% 1.07/1.19 This holds because
% 1.07/1.19
% 1.07/1.19 [3] E entails the following ordered TRS and the lhs and rhs of G join by the TRS:
% 1.07/1.19
% 1.07/1.19
% 1.07/1.19 axiom(implies(A, or(B, A))) -> true__
% 1.07/1.19 axiom(implies(implies(A, B), implies(or(C, A), or(C, B)))) -> true__
% 1.07/1.19 axiom(implies(or(A, A), A)) -> true__
% 1.07/1.19 axiom(implies(or(A, B), or(B, A))) -> true__
% 1.07/1.19 axiom(implies(or(A, or(B, C)), or(B, or(A, C)))) -> true__
% 1.07/1.19 axiom(or(not(Y0), or(Y1, Y0))) -> true__
% 1.07/1.19 axiom(or(not(or(Y0, Y0)), Y0)) -> true__
% 1.07/1.19 axiom(or(not(or(Y0, Y1)), or(Y1, Y0))) -> true__
% 1.07/1.19 axiom(or(not(or(Y0, or(Y1, Y2))), or(Y1, or(Y0, Y2)))) -> true__
% 1.07/1.19 axiom(or(not(or(not(Y0), Y1)), or(not(or(Y2, Y0)), or(Y2, Y1)))) -> true__
% 1.07/1.19 f1(axiom(X), X) -> true__
% 1.07/1.19 f1(true__, or(X1, or(not(Y0), or(Y1, Y0)))) -> true__
% 1.07/1.19 f1(true__, or(X1, or(not(or(Y0, Y0)), Y0))) -> true__
% 1.07/1.19 f1(true__, or(X1, or(not(or(Y0, Y1)), or(Y1, Y0)))) -> true__
% 1.07/1.19 f1(true__, or(not(X0), or(X1, X0))) -> true__
% 1.07/1.19 f1(true__, or(not(or(X0, X0)), X0)) -> true__
% 1.07/1.19 f1(true__, or(not(or(X0, X1)), or(X1, X0))) -> true__
% 1.07/1.19 f1(true__, or(not(or(X0, or(X1, X2))), or(X1, or(X0, X2)))) -> true__
% 1.07/1.19 f1(true__, or(not(or(not(X0), X1)), or(not(or(X2, X0)), or(X2, X1)))) -> true__
% 1.07/1.19 f2(f1(true__, or(not(or(not(X0), or(X1, X0))), Y1)), Y1) -> true__
% 1.07/1.19 f2(f1(true__, or(not(or(not(or(X0, X0)), X0)), Y1)), Y1) -> true__
% 1.07/1.19 f2(f1(true__, or(not(or(not(or(X0, X1)), or(X1, X0))), Y1)), Y1) -> true__
% 1.07/1.19 f2(f1(true__, or(not(or(not(or(X0, or(X1, X2))), or(X1, or(X0, X2)))), Y1)), Y1) -> true__
% 1.07/1.19 f2(f1(true__, or(not(or(not(or(not(X0), X1)), or(not(or(X2, X0)), or(X2, X1)))), Y1)), Y1) -> true__
% 1.07/1.19 f2(true__, X) -> theorem(X)
% 1.07/1.19 f3(f1(true__, Y0), Y0, Y1) -> true__
% 1.07/1.19 f3(theorem(Y), Y, X) -> true__
% 1.07/1.19 f3(true__, Y, X) -> f2(theorem(implies(Y, X)), X)
% 1.07/1.19 f4(f1(true__, or(not(or(not(p), not(p))), not(p)))) -> true__
% 1.07/1.19 f4(theorem(implies(implies(p, not(p)), not(p)))) -> true__
% 1.07/1.19 f4(true__) -> false__
% 1.07/1.19 false__ -> true__
% 1.07/1.19 implies(X, Y) -> or(not(X), Y)
% 1.07/1.19 theorem(X) -> f1(true__, X)
% 1.07/1.19 with the LPO induced by
% 1.07/1.19 p > f4 > f3 > implies > f2 > theorem > f1 > not > or > axiom > false__ > true__
% 1.07/1.19
% 1.07/1.19 % SZS output end Proof
% 1.07/1.19
%------------------------------------------------------------------------------