%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : AGT004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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  : 600s
% DateTime : Thu Jul 14 12:04:09 EDT 2022

% Result   : Theorem 0.48s 0.69s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   4 unt;   0 nHn;   5 RR)
%            Number of literals    :    6 (   0 equ;   2 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(305,axiom,
    ~ accept_city(countryamedicalorganization,coastvillage),
    file('AGT004+2.p',unknown),
    [] ).

cnf(474,axiom,
    accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
    file('AGT004+2.p',unknown),
    [] ).

cnf(910,axiom,
    ( ~ accept_team(u,v,w,x)
    | accept_city(u,w) ),
    file('AGT004+2.p',unknown),
    [] ).

cnf(997,plain,
    accept_city(countryamedicalorganization,coastvillage),
    inference(res,[status(thm),theory(equality)],[474,910]),
    [iquote('0:Res:474.0,910.0')] ).

cnf(1000,plain,
    $false,
    inference(mrr,[status(thm)],[997,305]),
    [iquote('0:MRR:997.0,305.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : AGT004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.13/0.15  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jun  4 04:54:35 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.48/0.69  
% 0.48/0.69  SPASS V 3.9 
% 0.48/0.69  SPASS beiseite: Proof found.
% 0.48/0.69  % SZS status Theorem
% 0.48/0.69  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.48/0.69  SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 960 clauses.
% 0.48/0.69  SPASS allocated 99320 KBytes.
% 0.48/0.69  SPASS spent	0:00:00.30 on the problem.
% 0.48/0.69  		0:00:00.04 for the input.
% 0.48/0.69  		0:00:00.12 for the FLOTTER CNF translation.
% 0.48/0.69  		0:00:00.00 for inferences.
% 0.48/0.69  		0:00:00.00 for the backtracking.
% 0.48/0.69  		0:00:00.06 for the reduction.
% 0.48/0.69  
% 0.48/0.69  
% 0.48/0.69  Here is a proof with depth 1, length 5 :
% 0.48/0.69  % SZS output start Refutation
% See solution above
% 0.48/0.69  Formulae used in the proof : deduced_13 query_4 a1_1
% 0.48/0.69  
%------------------------------------------------------------------------------