%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWB002+3 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n025.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 : Tue Jul 19 19:20:53 EDT 2022

% Result   : Theorem 0.48s 0.64s
% 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;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(12,axiom,
    iext(uri_ex,uri_ex_s,skc2),
    file('SWB002+3.p',unknown),
    [] ).

cnf(13,axiom,
    iext(uri_ex_q,skc2,uri_ex_s),
    file('SWB002+3.p',unknown),
    [] ).

cnf(161,axiom,
    ( ~ iext(uri_ex_q,u,v)
    | ~ iext(uri_ex,v,u) ),
    file('SWB002+3.p',unknown),
    [] ).

cnf(256,plain,
    ~ iext(uri_ex_q,skc2,uri_ex_s),
    inference(res,[status(thm),theory(equality)],[12,161]),
    [iquote('0:Res:12.0,161.0')] ).

cnf(258,plain,
    $false,
    inference(mrr,[status(thm)],[256,13]),
    [iquote('0:MRR:256.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWB002+3 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n025.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 : Wed Jun  1 02:13:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.48/0.64  
% 0.48/0.64  SPASS V 3.9 
% 0.48/0.64  SPASS beiseite: Proof found.
% 0.48/0.64  % SZS status Theorem
% 0.48/0.64  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.48/0.64  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 210 clauses.
% 0.48/0.64  SPASS allocated 100546 KBytes.
% 0.48/0.64  SPASS spent	0:00:00.29 on the problem.
% 0.48/0.64  		0:00:00.03 for the input.
% 0.48/0.64  		0:00:00.21 for the FLOTTER CNF translation.
% 0.48/0.64  		0:00:00.00 for inferences.
% 0.48/0.64  		0:00:00.00 for the backtracking.
% 0.48/0.64  		0:00:00.02 for the reduction.
% 0.48/0.64  
% 0.48/0.64  
% 0.48/0.64  Here is a proof with depth 1, length 5 :
% 0.48/0.64  % SZS output start Refutation
% See solution above
% 0.48/0.64  Formulae used in the proof : testcase_premise_fullish_002_Existential_Blank_Nodes testcase_conclusion_fullish_002_Existential_Blank_Nodes
% 0.48/0.64  
%------------------------------------------------------------------------------