TSTP Solution File: SEU196+2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SEU196+2 : TPTP v8.1.2. Released v3.3.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 : n012.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 17:51:30 EDT 2023
% Result : Theorem 5.63s 1.15s
% Output : Proof 5.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU196+2 : TPTP v8.1.2. Released v3.3.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.14/0.35 % Computer : n012.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 : 300
% 0.14/0.35 % DateTime : Wed Aug 23 15:36:27 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.63/1.15 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 5.63/1.15
% 5.63/1.15 % SZS status Theorem
% 5.63/1.15
% 5.63/1.15 % SZS output start Proof
% 5.63/1.15 Take the following subset of the input axioms:
% 5.63/1.15 fof(dt_k7_relat_1, axiom, ![B, A2]: (relation(A2) => relation(relation_dom_restriction(A2, B)))).
% 5.63/1.15 fof(t25_relat_1, lemma, ![A2_2]: (relation(A2_2) => ![B2]: (relation(B2) => (subset(A2_2, B2) => (subset(relation_dom(A2_2), relation_dom(B2)) & subset(relation_rng(A2_2), relation_rng(B2))))))).
% 5.63/1.15 fof(t88_relat_1, lemma, ![B2, A2_2]: (relation(B2) => subset(relation_dom_restriction(B2, A2_2), B2))).
% 5.63/1.15 fof(t99_relat_1, conjecture, ![A, B2]: (relation(B2) => subset(relation_rng(relation_dom_restriction(B2, A)), relation_rng(B2)))).
% 5.63/1.15
% 5.63/1.15 Now clausify the problem and encode Horn clauses using encoding 3 of
% 5.63/1.15 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 5.63/1.15 We repeatedly replace C & s=t => u=v by the two clauses:
% 5.63/1.15 fresh(y, y, x1...xn) = u
% 5.63/1.15 C => fresh(s, t, x1...xn) = v
% 5.63/1.15 where fresh is a fresh function symbol and x1..xn are the free
% 5.63/1.15 variables of u and v.
% 5.63/1.15 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 5.63/1.15 input problem has no model of domain size 1).
% 5.63/1.15
% 5.63/1.15 The encoding turns the above axioms into the following unit equations and goals:
% 5.63/1.15
% 5.63/1.15 Axiom 1 (t99_relat_1): relation(b2) = true2.
% 5.63/1.15 Axiom 2 (t25_relat_1_1): fresh293(X, X, Y, Z) = true2.
% 5.63/1.15 Axiom 3 (dt_k7_relat_1): fresh171(X, X, Y, Z) = true2.
% 5.63/1.15 Axiom 4 (t25_relat_1_1): fresh105(X, X, Y, Z) = subset(relation_rng(Y), relation_rng(Z)).
% 5.63/1.15 Axiom 5 (t88_relat_1): fresh56(X, X, Y, Z) = true2.
% 5.63/1.15 Axiom 6 (t25_relat_1_1): fresh292(X, X, Y, Z) = fresh293(relation(Y), true2, Y, Z).
% 5.63/1.15 Axiom 7 (dt_k7_relat_1): fresh171(relation(X), true2, X, Y) = relation(relation_dom_restriction(X, Y)).
% 5.63/1.15 Axiom 8 (t25_relat_1_1): fresh292(subset(X, Y), true2, X, Y) = fresh105(relation(Y), true2, X, Y).
% 5.63/1.15 Axiom 9 (t88_relat_1): fresh56(relation(X), true2, Y, X) = subset(relation_dom_restriction(X, Y), X).
% 5.63/1.15
% 5.63/1.15 Goal 1 (t99_relat_1_1): subset(relation_rng(relation_dom_restriction(b2, a)), relation_rng(b2)) = true2.
% 5.63/1.15 Proof:
% 5.63/1.15 subset(relation_rng(relation_dom_restriction(b2, a)), relation_rng(b2))
% 5.63/1.15 = { by axiom 4 (t25_relat_1_1) R->L }
% 5.63/1.15 fresh105(true2, true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.15 = { by axiom 1 (t99_relat_1) R->L }
% 5.63/1.15 fresh105(relation(b2), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.15 = { by axiom 8 (t25_relat_1_1) R->L }
% 5.63/1.15 fresh292(subset(relation_dom_restriction(b2, a), b2), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.15 = { by axiom 9 (t88_relat_1) R->L }
% 5.63/1.15 fresh292(fresh56(relation(b2), true2, a, b2), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.15 = { by axiom 1 (t99_relat_1) }
% 5.63/1.15 fresh292(fresh56(true2, true2, a, b2), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.15 = { by axiom 5 (t88_relat_1) }
% 5.63/1.15 fresh292(true2, true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.15 = { by axiom 6 (t25_relat_1_1) }
% 5.63/1.15 fresh293(relation(relation_dom_restriction(b2, a)), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.16 = { by axiom 7 (dt_k7_relat_1) R->L }
% 5.63/1.16 fresh293(fresh171(relation(b2), true2, b2, a), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.16 = { by axiom 1 (t99_relat_1) }
% 5.63/1.16 fresh293(fresh171(true2, true2, b2, a), true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.16 = { by axiom 3 (dt_k7_relat_1) }
% 5.63/1.16 fresh293(true2, true2, relation_dom_restriction(b2, a), b2)
% 5.63/1.16 = { by axiom 2 (t25_relat_1_1) }
% 5.63/1.16 true2
% 5.63/1.16 % SZS output end Proof
% 5.63/1.16
% 5.63/1.16 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------