%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : AGT002+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 : n001.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 5.00s 1.05s
% Output   : Proof 5.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : AGT002+1 : 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.33  % Computer : n001.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Sun Aug 27 17:56:03 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 5.00/1.05  Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 5.00/1.05  
% 5.00/1.05  % SZS status Theorem
% 5.00/1.05  
% 5.75/1.10  % SZS output start Proof
% 5.75/1.10  Take the following subset of the input axioms:
% 5.75/1.10    fof(event_213, axiom, ~accept_team(christiansufferterrahumanitarianorganization, sufferterragovernment, towna, n6)).
% 5.75/1.10    fof(query_2, conjecture, ~accept_team(christiansufferterrahumanitarianorganization, sufferterragovernment, towna, n6)).
% 5.75/1.10  
% 5.75/1.10  Now clausify the problem and encode Horn clauses using encoding 3 of
% 5.75/1.10  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 5.75/1.10  We repeatedly replace C & s=t => u=v by the two clauses:
% 5.75/1.10    fresh(y, y, x1...xn) = u
% 5.75/1.10    C => fresh(s, t, x1...xn) = v
% 5.75/1.10  where fresh is a fresh function symbol and x1..xn are the free
% 5.75/1.10  variables of u and v.
% 5.75/1.10  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 5.75/1.10  input problem has no model of domain size 1).
% 5.75/1.10  
% 5.75/1.10  The encoding turns the above axioms into the following unit equations and goals:
% 5.75/1.10  
% 5.75/1.10  Axiom 1 (query_2): accept_team(christiansufferterrahumanitarianorganization, sufferterragovernment, towna, n6) = true2.
% 5.75/1.10  
% 5.75/1.10  Goal 1 (event_213): accept_team(christiansufferterrahumanitarianorganization, sufferterragovernment, towna, n6) = true2.
% 5.75/1.10  Proof:
% 5.75/1.10    accept_team(christiansufferterrahumanitarianorganization, sufferterragovernment, towna, n6)
% 5.75/1.10  = { by axiom 1 (query_2) }
% 5.75/1.10    true2
% 5.75/1.10  % SZS output end Proof
% 5.75/1.10  
% 5.75/1.10  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------