%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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 21 12:20:49 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ big_q(skc2),
    file('SYN367+1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ big_r(skc3),
    file('SYN367+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ p
    | skP0(u) ),
    file('SYN367+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( skP0(u)
    | big_r(u) ),
    file('SYN367+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ skP0(u)
    | p ),
    file('SYN367+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ skP0(u)
    | big_q(u) ),
    file('SYN367+1.p',unknown),
    [] ).

cnf(11,plain,
    skP0(u),
    inference(spt,[spt(split,[position(s1)])],[3]),
    [iquote('1:Spt:3.1')] ).

cnf(13,plain,
    big_q(u),
    inference(mrr,[status(thm)],[6,11]),
    [iquote('1:MRR:6.0,11.0')] ).

cnf(14,plain,
    $false,
    inference(unc,[status(thm)],[13,1]),
    [iquote('1:UnC:13.0,1.0')] ).

cnf(15,plain,
    ~ p,
    inference(spt,[spt(split,[position(s2)])],[3]),
    [iquote('1:Spt:14.0,3.0')] ).

cnf(16,plain,
    ~ skP0(u),
    inference(mrr,[status(thm)],[5,15]),
    [iquote('1:MRR:5.1,15.0')] ).

cnf(17,plain,
    big_r(u),
    inference(mrr,[status(thm)],[4,16]),
    [iquote('1:MRR:4.0,16.0')] ).

cnf(18,plain,
    $false,
    inference(unc,[status(thm)],[17,2]),
    [iquote('1:UnC:17.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n006.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 : Mon Jul 11 14:49:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 4 clauses, backtracked 4 clauses, performed 1 splits and kept 13 clauses.
% 0.20/0.44  SPASS allocated 97556 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.44  		0:00:00.04 for the input.
% 0.20/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.00 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 1, length 13 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : x2118
% 0.20/0.44  
%------------------------------------------------------------------------------