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