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

% Computer : n022.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 : Fri Jul 15 23:24:49 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    mtvisible(c_englishmt),
    file('CSR058+2.p',unknown),
    [] ).

cnf(999,axiom,
    ~ prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),u),
    file('CSR058+2.p',unknown),
    [] ).

cnf(1068,axiom,
    ( ~ mtvisible(c_englishmt)
    | prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroristthathasbeenamemberofaterroristorganization) ),
    file('CSR058+2.p',unknown),
    [] ).

cnf(1135,plain,
    $false,
    inference(mrr,[status(thm)],[1068,1,999]),
    [iquote('0:MRR:1068.0,1068.1,1.0,999.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : CSR058+2 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n022.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 : Fri Jun 10 09:58:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.63/0.84  
% 0.63/0.84  SPASS V 3.9 
% 0.63/0.84  SPASS beiseite: Proof found.
% 0.63/0.84  % SZS status Theorem
% 0.63/0.84  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.63/0.84  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 1010 clauses.
% 0.63/0.84  SPASS allocated 99817 KBytes.
% 0.63/0.84  SPASS spent	0:00:00.47 on the problem.
% 0.63/0.84  		0:00:00.05 for the input.
% 0.63/0.84  		0:00:00.18 for the FLOTTER CNF translation.
% 0.63/0.84  		0:00:00.00 for inferences.
% 0.63/0.84  		0:00:00.00 for the backtracking.
% 0.63/0.84  		0:00:00.12 for the reduction.
% 0.63/0.84  
% 0.63/0.84  
% 0.63/0.84  Here is a proof with depth 0, length 4 :
% 0.63/0.84  % SZS output start Refutation
% See solution above
% 0.63/0.84  Formulae used in the proof : query108 ax1_126
% 0.63/0.84  
%------------------------------------------------------------------------------