TSTP Solution File: AGT003+2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : AGT003+2 : TPTP v8.1.2. Bugfixed v3.1.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 : n017.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 : Wed Aug 30 15:55:39 EDT 2023
% Result : Theorem 14.85s 2.29s
% Output : Proof 14.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.15 % Problem : AGT003+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.13/0.16 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun Aug 27 16:46:57 EDT 2023
% 0.15/0.36 % CPUTime :
% 14.85/2.29 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 14.85/2.29
% 14.85/2.29 % SZS status Theorem
% 14.85/2.29
% 14.85/2.29 % SZS output start Proof
% 14.85/2.29 Take the following subset of the input axioms:
% 14.85/2.30 fof(a1_1, axiom, ![C, N, L, A2]: (accept_team(A2, L, C, N) <=> (accept_city(A2, C) & (accept_leader(A2, L) & accept_number(A2, N))))).
% 14.85/2.30 fof(deduced_164, axiom, accept_number(christiansufferterrahumanitarianorganization, n5)).
% 14.85/2.30 fof(deduced_83, axiom, accept_city(christiansufferterrahumanitarianorganization, towna)).
% 14.85/2.30 fof(deduced_84, axiom, accept_leader(christiansufferterrahumanitarianorganization, countryafirstaidorganization)).
% 14.85/2.30 fof(query_3, conjecture, accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, towna, n5)).
% 14.85/2.30
% 14.85/2.30 Now clausify the problem and encode Horn clauses using encoding 3 of
% 14.85/2.30 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 14.85/2.30 We repeatedly replace C & s=t => u=v by the two clauses:
% 14.85/2.30 fresh(y, y, x1...xn) = u
% 14.85/2.30 C => fresh(s, t, x1...xn) = v
% 14.85/2.30 where fresh is a fresh function symbol and x1..xn are the free
% 14.85/2.30 variables of u and v.
% 14.85/2.30 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 14.85/2.30 input problem has no model of domain size 1).
% 14.85/2.30
% 14.85/2.30 The encoding turns the above axioms into the following unit equations and goals:
% 14.85/2.30
% 14.85/2.30 Axiom 1 (deduced_84): accept_leader(christiansufferterrahumanitarianorganization, countryafirstaidorganization) = true2.
% 14.85/2.30 Axiom 2 (deduced_164): accept_number(christiansufferterrahumanitarianorganization, n5) = true2.
% 14.85/2.30 Axiom 3 (deduced_83): accept_city(christiansufferterrahumanitarianorganization, towna) = true2.
% 14.85/2.30 Axiom 4 (a1_1_3): fresh163(X, X, Y, Z, W, V) = true2.
% 14.85/2.30 Axiom 5 (a1_1_3): fresh89(X, X, Y, Z, W, V) = accept_team(Y, V, Z, W).
% 14.85/2.30 Axiom 6 (a1_1_3): fresh162(X, X, Y, Z, W, V) = fresh163(accept_city(Y, Z), true2, Y, Z, W, V).
% 14.85/2.30 Axiom 7 (a1_1_3): fresh162(accept_number(X, Y), true2, X, Z, Y, W) = fresh89(accept_leader(X, W), true2, X, Z, Y, W).
% 14.85/2.30
% 14.85/2.30 Goal 1 (query_3): accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, towna, n5) = true2.
% 14.85/2.30 Proof:
% 14.85/2.30 accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, towna, n5)
% 14.85/2.30 = { by axiom 5 (a1_1_3) R->L }
% 14.85/2.30 fresh89(true2, true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 14.85/2.30 = { by axiom 1 (deduced_84) R->L }
% 14.85/2.30 fresh89(accept_leader(christiansufferterrahumanitarianorganization, countryafirstaidorganization), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 14.85/2.30 = { by axiom 7 (a1_1_3) R->L }
% 14.85/2.30 fresh162(accept_number(christiansufferterrahumanitarianorganization, n5), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 14.85/2.30 = { by axiom 2 (deduced_164) }
% 14.85/2.30 fresh162(true2, true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 14.85/2.30 = { by axiom 6 (a1_1_3) }
% 14.85/2.30 fresh163(accept_city(christiansufferterrahumanitarianorganization, towna), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 14.85/2.30 = { by axiom 3 (deduced_83) }
% 14.85/2.30 fresh163(true2, true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 14.85/2.30 = { by axiom 4 (a1_1_3) }
% 14.85/2.30 true2
% 14.85/2.30 % SZS output end Proof
% 14.85/2.30
% 14.85/2.30 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------