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

% Computer : n023.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:21:06 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( f(u)
    | p ),
    file('SYN399+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ f(u)
    | p ),
    file('SYN399+1.p',unknown),
    [] ).

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

cnf(4,axiom,
    ( ~ f(skc1)
    | ~ p ),
    file('SYN399+1.p',unknown),
    [] ).

cnf(5,plain,
    f(u),
    inference(mrr,[status(thm)],[3,1]),
    [iquote('0:MRR:3.0,1.1')] ).

cnf(6,plain,
    p,
    inference(mrr,[status(thm)],[2,5]),
    [iquote('0:MRR:2.0,5.0')] ).

cnf(7,plain,
    $false,
    inference(mrr,[status(thm)],[4,5,6]),
    [iquote('0:MRR:4.0,4.1,5.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN399+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 14:22:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  
% 0.19/0.44  SPASS V 3.9 
% 0.19/0.44  SPASS beiseite: Proof found.
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.44  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 4 clauses.
% 0.19/0.44  SPASS allocated 97549 KBytes.
% 0.19/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.44  		0:00:00.04 for the input.
% 0.19/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44  		0:00:00.00 for inferences.
% 0.19/0.44  		0:00:00.00 for the backtracking.
% 0.19/0.44  		0:00:00.00 for the reduction.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Here is a proof with depth 0, length 7 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : kalish223
% 0.19/0.44  
%------------------------------------------------------------------------------