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

% Computer : n009.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:23:59 EDT 2022

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

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

cnf(2,axiom,
    ( ~ p(u,v)
    | p(w,w) ),
    file('SYN728+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ q(u)
    | ~ m(g(u)) ),
    file('SYN728+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( q(f(u,skf3(u)))
    | p(u,skf2(u)) ),
    file('SYN728+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ p(g(skc2),u)
    | ~ p(skc3,skc3) ),
    file('SYN728+1.p',unknown),
    [] ).

cnf(6,plain,
    ~ p(g(skc2),u),
    inference(mrr,[status(thm)],[5,2]),
    [iquote('0:MRR:5.1,2.1')] ).

cnf(9,plain,
    ~ p(u,v),
    inference(spt,[spt(split,[position(s1)])],[2]),
    [iquote('1:Spt:2.0')] ).

cnf(10,plain,
    m(u),
    inference(mrr,[status(thm)],[1,9]),
    [iquote('1:MRR:1.1,9.0')] ).

cnf(11,plain,
    q(f(u,skf3(u))),
    inference(mrr,[status(thm)],[4,9]),
    [iquote('1:MRR:4.1,9.0')] ).

cnf(12,plain,
    ~ q(u),
    inference(mrr,[status(thm)],[3,10]),
    [iquote('1:MRR:3.1,10.0')] ).

cnf(13,plain,
    $false,
    inference(mrr,[status(thm)],[11,12]),
    [iquote('1:MRR:11.0,12.0')] ).

cnf(14,plain,
    p(u,u),
    inference(spt,[spt(split,[position(s2)])],[2]),
    [iquote('1:Spt:13.0,2.1')] ).

cnf(15,plain,
    $false,
    inference(unc,[status(thm)],[6,14]),
    [iquote('1:UnC:6.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN728+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n009.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 : Tue Jul 12 07:21:07 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 4 clauses, backtracked 5 clauses, performed 1 splits and kept 14 clauses.
% 0.19/0.44  SPASS allocated 97562 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 1, length 13 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : thm69
% 0.19/0.44  
%------------------------------------------------------------------------------