%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : AGT004+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 : n031.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:40 EDT 2023

% Result   : Theorem 8.63s 1.49s
% Output   : Proof 8.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : AGT004+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.11/0.14  % 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 : n031.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 : Sun Aug 27 17:41:09 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 8.63/1.49  Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 8.63/1.49  
% 8.63/1.49  % SZS status Theorem
% 8.63/1.49  
% 8.63/1.49  % SZS output start Proof
% 8.63/1.49  Take the following subset of the input axioms:
% 8.63/1.49    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))))).
% 8.63/1.49    fof(deduced_13, axiom, ~accept_city(countryamedicalorganization, coastvillage)).
% 8.63/1.49    fof(query_4, conjecture, ~accept_team(countryamedicalorganization, countryahumanitarianorganization, coastvillage, n5)).
% 8.63/1.49  
% 8.63/1.49  Now clausify the problem and encode Horn clauses using encoding 3 of
% 8.63/1.49  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 8.63/1.49  We repeatedly replace C & s=t => u=v by the two clauses:
% 8.63/1.49    fresh(y, y, x1...xn) = u
% 8.63/1.49    C => fresh(s, t, x1...xn) = v
% 8.63/1.49  where fresh is a fresh function symbol and x1..xn are the free
% 8.63/1.49  variables of u and v.
% 8.63/1.49  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 8.63/1.49  input problem has no model of domain size 1).
% 8.63/1.49  
% 8.63/1.49  The encoding turns the above axioms into the following unit equations and goals:
% 8.63/1.49  
% 8.63/1.49  Axiom 1 (query_4): accept_team(countryamedicalorganization, countryahumanitarianorganization, coastvillage, n5) = true2.
% 8.63/1.49  Axiom 2 (a1_1): fresh91(X, X, Y, Z) = true2.
% 8.63/1.49  Axiom 3 (a1_1): fresh91(accept_team(X, Y, Z, W), true2, X, Z) = accept_city(X, Z).
% 8.63/1.49  
% 8.63/1.49  Goal 1 (deduced_13): accept_city(countryamedicalorganization, coastvillage) = true2.
% 8.63/1.49  Proof:
% 8.63/1.49    accept_city(countryamedicalorganization, coastvillage)
% 8.63/1.49  = { by axiom 3 (a1_1) R->L }
% 8.63/1.49    fresh91(accept_team(countryamedicalorganization, countryahumanitarianorganization, coastvillage, n5), true2, countryamedicalorganization, coastvillage)
% 8.63/1.49  = { by axiom 1 (query_4) }
% 8.63/1.49    fresh91(true2, true2, countryamedicalorganization, coastvillage)
% 8.63/1.49  = { by axiom 2 (a1_1) }
% 8.63/1.49    true2
% 8.63/1.49  % SZS output end Proof
% 8.63/1.49  
% 8.63/1.49  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------