TSTP Solution File: AGT003+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n027.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.47s 0.66s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   9 unt;   0 nHn;  15 RR)
%            Number of literals    :   24 (   0 equ;  13 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(122,axiom,
    accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
    file('AGT003+1.p',unknown),
    [] ).

cnf(148,axiom,
    accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
    file('AGT003+1.p',unknown),
    [] ).

cnf(151,axiom,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
    file('AGT003+1.p',unknown),
    [] ).

cnf(247,axiom,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
    file('AGT003+1.p',unknown),
    [] ).

cnf(543,axiom,
    ( ~ accept_team(u,v,w,x)
    | accept_city(u,w) ),
    file('AGT003+1.p',unknown),
    [] ).

cnf(544,axiom,
    ( ~ accept_team(u,v,w,x)
    | accept_leader(u,v) ),
    file('AGT003+1.p',unknown),
    [] ).

cnf(545,axiom,
    ( ~ accept_team(u,v,w,x)
    | accept_number(u,x) ),
    file('AGT003+1.p',unknown),
    [] ).

cnf(612,axiom,
    ( ~ accept_city(u,v)
    | ~ accept_leader(u,w)
    | ~ accept_number(u,x)
    | accept_team(u,w,v,x) ),
    file('AGT003+1.p',unknown),
    [] ).

cnf(630,plain,
    ( ~ accept_city(christiansufferterrahumanitarianorganization,towna)
    | ~ accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization)
    | ~ accept_number(christiansufferterrahumanitarianorganization,n5) ),
    inference(res,[status(thm),theory(equality)],[612,247]),
    [iquote('0:Res:612.3,247.0')] ).

cnf(813,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(res,[status(thm),theory(equality)],[151,544]),
    [iquote('0:Res:151.0,544.0')] ).

cnf(833,plain,
    ( ~ accept_city(christiansufferterrahumanitarianorganization,towna)
    | ~ accept_number(christiansufferterrahumanitarianorganization,n5) ),
    inference(mrr,[status(thm)],[630,813]),
    [iquote('0:MRR:630.1,813.0')] ).

cnf(938,plain,
    accept_number(christiansufferterrahumanitarianorganization,n5),
    inference(res,[status(thm),theory(equality)],[148,545]),
    [iquote('0:Res:148.0,545.0')] ).

cnf(946,plain,
    ~ accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(mrr,[status(thm)],[833,938]),
    [iquote('0:MRR:833.1,938.0')] ).

cnf(981,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(res,[status(thm),theory(equality)],[122,543]),
    [iquote('0:Res:122.0,543.0')] ).

cnf(1059,plain,
    $false,
    inference(mrr,[status(thm)],[981,946]),
    [iquote('0:MRR:981.0,946.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : AGT003+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n027.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  : 600
% 0.13/0.34  % DateTime : Sat Jun  4 06:07:36 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.47/0.66  
% 0.47/0.66  SPASS V 3.9 
% 0.47/0.66  SPASS beiseite: Proof found.
% 0.47/0.66  % SZS status Theorem
% 0.47/0.66  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.47/0.66  SPASS derived 428 clauses, backtracked 0 clauses, performed 0 splits and kept 759 clauses.
% 0.47/0.66  SPASS allocated 98919 KBytes.
% 0.47/0.66  SPASS spent	0:00:00.31 on the problem.
% 0.47/0.66  		0:00:00.04 for the input.
% 0.47/0.66  		0:00:00.09 for the FLOTTER CNF translation.
% 0.47/0.66  		0:00:00.02 for inferences.
% 0.47/0.66  		0:00:00.00 for the backtracking.
% 0.47/0.66  		0:00:00.06 for the reduction.
% 0.47/0.66  
% 0.47/0.66  
% 0.47/0.66  Here is a proof with depth 1, length 15 :
% 0.47/0.66  % SZS output start Refutation
% See solution above
% 0.47/0.66  Formulae used in the proof : event_26 event_90 event_93 query_3 a1_1
% 0.47/0.66  
%------------------------------------------------------------------------------