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

% Computer : n007.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:32:27 EDT 2022

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

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

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

cnf(3,axiom,
    ( ~ p(u,v)
    | q(f(skc1),skc1) ),
    file('SYN980+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ p(u,v)
    | ~ q(u,v) ),
    file('SYN980+1.p',unknown),
    [] ).

cnf(6,plain,
    ~ p(u,v),
    inference(spt,[spt(split,[position(s1)])],[3]),
    [iquote('1:Spt:3.0')] ).

cnf(7,plain,
    r(skc1),
    inference(mrr,[status(thm)],[1,6]),
    [iquote('1:MRR:1.1,6.0')] ).

cnf(8,plain,
    ~ r(u),
    inference(mrr,[status(thm)],[2,6]),
    [iquote('1:MRR:2.1,6.0')] ).

cnf(9,plain,
    $false,
    inference(unc,[status(thm)],[8,7]),
    [iquote('1:UnC:8.0,7.0')] ).

cnf(10,plain,
    q(f(skc1),skc1),
    inference(spt,[spt(split,[position(s2)])],[3]),
    [iquote('1:Spt:9.0,3.1')] ).

cnf(11,plain,
    ~ p(f(skc1),skc1),
    inference(res,[status(thm),theory(equality)],[10,4]),
    [iquote('1:Res:10.0,4.1')] ).

cnf(12,plain,
    ~ r(skc1),
    inference(res,[status(thm),theory(equality)],[2,11]),
    [iquote('1:Res:2.1,11.0')] ).

cnf(13,plain,
    r(skc1),
    inference(res,[status(thm),theory(equality)],[1,11]),
    [iquote('1:Res:1.1,11.0')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.35  % Computer : n007.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 600
% 0.12/0.35  % DateTime : Mon Jul 11 13:38:17 EDT 2022
% 0.12/0.35  % 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 6 clauses, backtracked 4 clauses, performed 1 splits and kept 14 clauses.
% 0.20/0.44  SPASS allocated 97554 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.44  		0:00:00.03 for the input.
% 0.20/0.44  		0:00:00.02 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 3, length 13 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : prove_this
% 0.20/0.44  
%------------------------------------------------------------------------------