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

% Computer : n029.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:12 EDT 2022

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

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

cnf(2,axiom,
    ( p(f(u))
    | skP0(v,u) ),
    file('SYN939+1.p',unknown),
    [] ).

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

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

cnf(5,axiom,
    ( ~ q(u)
    | ~ r(skc3)
    | ~ r(skc2)
    | ~ skP0(u,v) ),
    file('SYN939+1.p',unknown),
    [] ).

cnf(9,plain,
    ( ~ q(u)
    | ~ skP0(u,v) ),
    inference(spt,[spt(split,[position(s1)])],[5]),
    [iquote('1:Spt:5.0,5.3')] ).

cnf(10,plain,
    ( ~ p(u)
    | ~ q(u) ),
    inference(res,[status(thm),theory(equality)],[3,9]),
    [iquote('1:Res:3.1,9.1')] ).

cnf(11,plain,
    ( ~ q(u)
    | p(f(v)) ),
    inference(res,[status(thm),theory(equality)],[2,9]),
    [iquote('1:Res:2.1,9.1')] ).

cnf(12,plain,
    p(f(u)),
    inference(ems,[status(thm)],[11,1]),
    [iquote('1:EmS:11.0,1.0')] ).

cnf(13,plain,
    $false,
    inference(ems,[status(thm)],[10,12,1]),
    [iquote('1:EmS:10.0,10.1,12.0,1.0')] ).

cnf(14,plain,
    ( ~ r(skc3)
    | ~ r(skc2) ),
    inference(spt,[spt(split,[position(s2)])],[5]),
    [iquote('1:Spt:13.0,5.1,5.2')] ).

cnf(15,plain,
    ( ~ p(u)
    | ~ q(u)
    | r(v) ),
    inference(res,[status(thm),theory(equality)],[3,4]),
    [iquote('0:Res:3.1,4.1')] ).

cnf(16,plain,
    ( ~ q(u)
    | p(f(v))
    | r(v) ),
    inference(res,[status(thm),theory(equality)],[2,4]),
    [iquote('0:Res:2.1,4.1')] ).

cnf(17,plain,
    ( p(f(u))
    | r(u) ),
    inference(ems,[status(thm)],[16,1]),
    [iquote('0:EmS:16.0,1.0')] ).

cnf(18,plain,
    ( r(u)
    | r(v) ),
    inference(ems,[status(thm)],[15,17,1]),
    [iquote('0:EmS:15.0,15.1,17.0,1.0')] ).

cnf(19,plain,
    r(u),
    inference(con,[status(thm)],[18]),
    [iquote('0:Con:18.1')] ).

cnf(20,plain,
    $false,
    inference(mrr,[status(thm)],[14,19]),
    [iquote('1:MRR:14.1,14.0,19.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN939+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jul 12 06:09:32 EDT 2022
% 0.13/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 10 clauses, backtracked 3 clauses, performed 1 splits and kept 16 clauses.
% 0.20/0.44  SPASS allocated 97562 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 4, length 17 :
% 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  
%------------------------------------------------------------------------------