TSTP Solution File: AGT003+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : AGT003+1 : 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 : n003.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 29.17s 4.13s
% Output : Proof 29.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : AGT003+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.13/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 : n003.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 : Sun Aug 27 17:27:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 29.17/4.13 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 29.17/4.13
% 29.17/4.13 % SZS status Theorem
% 29.17/4.13
% 29.17/4.13 % SZS output start Proof
% 29.17/4.13 Take the following subset of the input axioms:
% 29.17/4.13 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))))).
% 29.17/4.13 fof(event_26, axiom, accept_team(christiansufferterrahumanitarianorganization, countryacivilorganization, towna, n6)).
% 29.17/4.13 fof(event_90, axiom, accept_team(christiansufferterrahumanitarianorganization, countryahumanitarianorganization, coastvillage, n5)).
% 29.17/4.13 fof(event_93, axiom, accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, coastvillage, n6)).
% 29.17/4.13 fof(query_3, conjecture, accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, towna, n5)).
% 29.17/4.13
% 29.17/4.13 Now clausify the problem and encode Horn clauses using encoding 3 of
% 29.17/4.13 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 29.17/4.13 We repeatedly replace C & s=t => u=v by the two clauses:
% 29.17/4.13 fresh(y, y, x1...xn) = u
% 29.17/4.13 C => fresh(s, t, x1...xn) = v
% 29.17/4.13 where fresh is a fresh function symbol and x1..xn are the free
% 29.17/4.13 variables of u and v.
% 29.17/4.13 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 29.17/4.13 input problem has no model of domain size 1).
% 29.17/4.13
% 29.17/4.13 The encoding turns the above axioms into the following unit equations and goals:
% 29.17/4.13
% 29.17/4.13 Axiom 1 (a1_1_1): fresh92(X, X, Y, Z) = true2.
% 29.17/4.13 Axiom 2 (a1_1): fresh91(X, X, Y, Z) = true2.
% 29.17/4.13 Axiom 3 (a1_1_2): fresh90(X, X, Y, Z) = true2.
% 29.17/4.13 Axiom 4 (event_93): accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, coastvillage, n6) = true2.
% 29.17/4.14 Axiom 5 (event_26): accept_team(christiansufferterrahumanitarianorganization, countryacivilorganization, towna, n6) = true2.
% 29.17/4.14 Axiom 6 (event_90): accept_team(christiansufferterrahumanitarianorganization, countryahumanitarianorganization, coastvillage, n5) = true2.
% 29.17/4.14 Axiom 7 (a1_1_3): fresh163(X, X, Y, Z, W, V) = true2.
% 29.17/4.14 Axiom 8 (a1_1_3): fresh89(X, X, Y, Z, W, V) = accept_team(Y, V, Z, W).
% 29.17/4.14 Axiom 9 (a1_1_3): fresh162(X, X, Y, Z, W, V) = fresh163(accept_city(Y, Z), true2, Y, Z, W, V).
% 29.17/4.14 Axiom 10 (a1_1_1): fresh92(accept_team(X, Y, Z, W), true2, X, Y) = accept_leader(X, Y).
% 29.17/4.14 Axiom 11 (a1_1): fresh91(accept_team(X, Y, Z, W), true2, X, Z) = accept_city(X, Z).
% 29.17/4.14 Axiom 12 (a1_1_2): fresh90(accept_team(X, Y, Z, W), true2, X, W) = accept_number(X, W).
% 29.17/4.14 Axiom 13 (a1_1_3): fresh162(accept_number(X, Y), true2, X, Z, Y, W) = fresh89(accept_leader(X, W), true2, X, Z, Y, W).
% 29.17/4.14
% 29.17/4.14 Goal 1 (query_3): accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, towna, n5) = true2.
% 29.17/4.14 Proof:
% 29.17/4.14 accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, towna, n5)
% 29.17/4.14 = { by axiom 8 (a1_1_3) R->L }
% 29.17/4.14 fresh89(true2, true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 1 (a1_1_1) R->L }
% 29.17/4.14 fresh89(fresh92(true2, true2, christiansufferterrahumanitarianorganization, countryafirstaidorganization), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 4 (event_93) R->L }
% 29.17/4.14 fresh89(fresh92(accept_team(christiansufferterrahumanitarianorganization, countryafirstaidorganization, coastvillage, n6), true2, christiansufferterrahumanitarianorganization, countryafirstaidorganization), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 10 (a1_1_1) }
% 29.17/4.14 fresh89(accept_leader(christiansufferterrahumanitarianorganization, countryafirstaidorganization), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 13 (a1_1_3) R->L }
% 29.17/4.14 fresh162(accept_number(christiansufferterrahumanitarianorganization, n5), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 12 (a1_1_2) R->L }
% 29.17/4.14 fresh162(fresh90(accept_team(christiansufferterrahumanitarianorganization, countryahumanitarianorganization, coastvillage, n5), true2, christiansufferterrahumanitarianorganization, n5), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 6 (event_90) }
% 29.17/4.14 fresh162(fresh90(true2, true2, christiansufferterrahumanitarianorganization, n5), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 3 (a1_1_2) }
% 29.17/4.14 fresh162(true2, true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 9 (a1_1_3) }
% 29.17/4.14 fresh163(accept_city(christiansufferterrahumanitarianorganization, towna), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 11 (a1_1) R->L }
% 29.17/4.14 fresh163(fresh91(accept_team(christiansufferterrahumanitarianorganization, countryacivilorganization, towna, n6), true2, christiansufferterrahumanitarianorganization, towna), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 5 (event_26) }
% 29.17/4.14 fresh163(fresh91(true2, true2, christiansufferterrahumanitarianorganization, towna), true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 2 (a1_1) }
% 29.17/4.14 fresh163(true2, true2, christiansufferterrahumanitarianorganization, towna, n5, countryafirstaidorganization)
% 29.17/4.14 = { by axiom 7 (a1_1_3) }
% 29.17/4.14 true2
% 29.17/4.14 % SZS output end Proof
% 29.17/4.14
% 29.17/4.14 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------