%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : AGT015+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 : n015.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:43 EDT 2023

% Result   : Theorem 7.20s 1.31s
% Output   : Proof 7.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : AGT015+2 : TPTP v8.1.2. Bugfixed v3.1.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.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sun Aug 27 17:40:54 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 7.20/1.31  Command-line arguments: --no-flatten-goal
% 7.20/1.31  
% 7.20/1.31  % SZS status Theorem
% 7.20/1.31  
% 7.20/1.37  % SZS output start Proof
% 7.20/1.37  Take the following subset of the input axioms:
% 7.20/1.37    fof(deduced_13, axiom, ~accept_city(countryamedicalorganization, coastvillage)).
% 7.20/1.37    fof(deduced_366, axiom, ~accept_city(muslimcountrybhumanitarianorganization, towna)).
% 7.20/1.37    fof(query_15, conjecture, ?[X, Y]: ~accept_city(X, Y)).
% 7.20/1.37  
% 7.20/1.37  Now clausify the problem and encode Horn clauses using encoding 3 of
% 7.20/1.37  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 7.20/1.37  We repeatedly replace C & s=t => u=v by the two clauses:
% 7.20/1.37    fresh(y, y, x1...xn) = u
% 7.20/1.37    C => fresh(s, t, x1...xn) = v
% 7.20/1.37  where fresh is a fresh function symbol and x1..xn are the free
% 7.20/1.37  variables of u and v.
% 7.20/1.37  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 7.20/1.37  input problem has no model of domain size 1).
% 7.20/1.37  
% 7.20/1.37  The encoding turns the above axioms into the following unit equations and goals:
% 7.20/1.37  
% 7.20/1.37  Axiom 1 (query_15): accept_city(X, Y) = true2.
% 7.20/1.37  
% 7.20/1.37  Goal 1 (deduced_366): accept_city(muslimcountrybhumanitarianorganization, towna) = true2.
% 7.20/1.37  Proof:
% 7.20/1.37    accept_city(muslimcountrybhumanitarianorganization, towna)
% 7.20/1.37  = { by axiom 1 (query_15) }
% 7.20/1.37    true2
% 7.20/1.37  
% 7.20/1.37  Goal 2 (deduced_13): accept_city(countryamedicalorganization, coastvillage) = true2.
% 7.20/1.37  Proof:
% 7.20/1.37    accept_city(countryamedicalorganization, coastvillage)
% 7.20/1.37  = { by axiom 1 (query_15) }
% 7.20/1.37    true2
% 7.20/1.37  % SZS output end Proof
% 7.20/1.37  
% 7.20/1.37  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------