TSTP Solution File: SET800+4 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SET800+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n028.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 : 300s
% DateTime : Thu Aug 31 15:33:16 EDT 2023
% Result : Theorem 0.19s 0.66s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET800+4 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34 % Computer : n028.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 : 300
% 0.13/0.34 % DateTime : Sat Aug 26 09:56:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.66 Command-line arguments: --ground-connectedness --complete-subsets
% 0.19/0.66
% 0.19/0.66 % SZS status Theorem
% 0.19/0.66
% 0.19/0.66 % SZS output start Proof
% 0.19/0.66 Take the following subset of the input axioms:
% 0.19/0.66 fof(greatest_lower_bound, axiom, ![X, E, R, A2]: (greatest_lower_bound(A2, X, R, E) <=> (member(A2, X) & (lower_bound(A2, R, X) & ![M]: ((member(M, E) & lower_bound(M, R, X)) => apply(R, M, A2)))))).
% 0.19/0.66 fof(lower_bound, axiom, ![E2, R2, M3]: (lower_bound(M3, R2, E2) <=> ![X3]: (member(X3, E2) => apply(R2, M3, X3)))).
% 0.19/0.66 fof(subset, axiom, ![B, A2_2]: (subset(A2_2, B) <=> ![X3]: (member(X3, A2_2) => member(X3, B)))).
% 0.19/0.66 fof(thIV12, conjecture, ![E2, R2]: (order(R2, E2) => ![X1, X2]: ((subset(X1, E2) & (subset(X2, E2) & subset(X1, X2))) => ![M1, M2]: ((greatest_lower_bound(M1, X1, R2, E2) & greatest_lower_bound(M2, X2, R2, E2)) => apply(R2, M2, M1))))).
% 0.19/0.66
% 0.19/0.66 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.19/0.66 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.19/0.66 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.19/0.66 fresh(y, y, x1...xn) = u
% 0.19/0.66 C => fresh(s, t, x1...xn) = v
% 0.19/0.66 where fresh is a fresh function symbol and x1..xn are the free
% 0.19/0.66 variables of u and v.
% 0.19/0.66 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.19/0.66 input problem has no model of domain size 1).
% 0.19/0.66
% 0.19/0.66 The encoding turns the above axioms into the following unit equations and goals:
% 0.19/0.66
% 0.19/0.66 Axiom 1 (thIV12_2): subset(x1, x2) = true2.
% 0.19/0.66 Axiom 2 (greatest_lower_bound_4): fresh56(X, X, Y, Z) = true2.
% 0.19/0.66 Axiom 3 (subset_1): fresh19(X, X, Y, Z) = true2.
% 0.19/0.66 Axiom 4 (thIV12_4): greatest_lower_bound(m2, x2, r, e) = true2.
% 0.19/0.66 Axiom 5 (thIV12_5): greatest_lower_bound(m1, x1, r, e) = true2.
% 0.19/0.66 Axiom 6 (greatest_lower_bound_5): fresh55(X, X, Y, Z, W) = true2.
% 0.19/0.66 Axiom 7 (lower_bound_1): fresh40(X, X, Y, Z, W) = true2.
% 0.19/0.66 Axiom 8 (subset_1): fresh20(X, X, Y, Z, W) = member(W, Z).
% 0.19/0.67 Axiom 9 (lower_bound_1): fresh41(X, X, Y, Z, W, V) = apply(Y, W, V).
% 0.19/0.67 Axiom 10 (subset_1): fresh20(member(X, Y), true2, Y, Z, X) = fresh19(subset(Y, Z), true2, Z, X).
% 0.19/0.67 Axiom 11 (greatest_lower_bound_4): fresh56(greatest_lower_bound(X, Y, Z, W), true2, X, Y) = member(X, Y).
% 0.19/0.67 Axiom 12 (greatest_lower_bound_5): fresh55(greatest_lower_bound(X, Y, Z, W), true2, X, Y, Z) = lower_bound(X, Z, Y).
% 0.19/0.67 Axiom 13 (lower_bound_1): fresh41(lower_bound(X, Y, Z), true2, Y, Z, X, W) = fresh40(member(W, Z), true2, Y, X, W).
% 0.19/0.67
% 0.19/0.67 Goal 1 (thIV12_6): apply(r, m2, m1) = true2.
% 0.19/0.67 Proof:
% 0.19/0.67 apply(r, m2, m1)
% 0.19/0.67 = { by axiom 9 (lower_bound_1) R->L }
% 0.19/0.67 fresh41(true2, true2, r, x2, m2, m1)
% 0.19/0.67 = { by axiom 6 (greatest_lower_bound_5) R->L }
% 0.19/0.67 fresh41(fresh55(true2, true2, m2, x2, r), true2, r, x2, m2, m1)
% 0.19/0.67 = { by axiom 4 (thIV12_4) R->L }
% 0.19/0.67 fresh41(fresh55(greatest_lower_bound(m2, x2, r, e), true2, m2, x2, r), true2, r, x2, m2, m1)
% 0.19/0.67 = { by axiom 12 (greatest_lower_bound_5) }
% 0.19/0.67 fresh41(lower_bound(m2, r, x2), true2, r, x2, m2, m1)
% 0.19/0.67 = { by axiom 13 (lower_bound_1) }
% 0.19/0.67 fresh40(member(m1, x2), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 8 (subset_1) R->L }
% 0.19/0.67 fresh40(fresh20(true2, true2, x1, x2, m1), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 2 (greatest_lower_bound_4) R->L }
% 0.19/0.67 fresh40(fresh20(fresh56(true2, true2, m1, x1), true2, x1, x2, m1), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 5 (thIV12_5) R->L }
% 0.19/0.67 fresh40(fresh20(fresh56(greatest_lower_bound(m1, x1, r, e), true2, m1, x1), true2, x1, x2, m1), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 11 (greatest_lower_bound_4) }
% 0.19/0.67 fresh40(fresh20(member(m1, x1), true2, x1, x2, m1), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 10 (subset_1) }
% 0.19/0.67 fresh40(fresh19(subset(x1, x2), true2, x2, m1), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 1 (thIV12_2) }
% 0.19/0.67 fresh40(fresh19(true2, true2, x2, m1), true2, r, m2, m1)
% 0.19/0.67 = { by axiom 3 (subset_1) }
% 0.19/0.67 fresh40(true2, true2, r, m2, m1)
% 0.19/0.67 = { by axiom 7 (lower_bound_1) }
% 0.19/0.67 true2
% 0.19/0.67 % SZS output end Proof
% 0.19/0.67
% 0.19/0.67 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------