%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN965+1 : TPTP v8.1.0. Released v3.1.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:32:21 EDT 2022

% Result   : Theorem 0.18s 0.42s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   12 (   4 unt;   4 nHn;  12 RR)
%            Number of literals    :   20 (   0 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 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,
    ( skP0(u,v)
    | p(v,u) ),
    file('SYN965+1.p',unknown),
    [] ).

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

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

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

cnf(6,plain,
    ( p(u,skf1(v))
    | p(u,v) ),
    inference(res,[status(thm),theory(equality)],[1,4]),
    [iquote('0:Res:1.0,4.0')] ).

cnf(7,plain,
    ( p(u,v)
    | skP0(w,skf1(v)) ),
    inference(res,[status(thm),theory(equality)],[6,2]),
    [iquote('0:Res:6.0,2.0')] ).

cnf(11,plain,
    ( p(u,v)
    | p(skf1(v),w) ),
    inference(res,[status(thm),theory(equality)],[7,4]),
    [iquote('0:Res:7.1,4.0')] ).

cnf(21,plain,
    ( ~ p(skf1(u),skf1(v))
    | p(w,u) ),
    inference(res,[status(thm),theory(equality)],[7,5]),
    [iquote('0:Res:7.1,5.1')] ).

cnf(24,plain,
    p(u,v),
    inference(mrr,[status(thm)],[21,11]),
    [iquote('0:MRR:21.0,11.1')] ).

cnf(25,plain,
    skP0(u,v),
    inference(mrr,[status(thm)],[2,24]),
    [iquote('0:MRR:2.0,24.0')] ).

cnf(26,plain,
    ~ skP0(skf1(u),v),
    inference(mrr,[status(thm)],[5,24]),
    [iquote('0:MRR:5.0,24.0')] ).

cnf(27,plain,
    $false,
    inference(mrr,[status(thm)],[26,25]),
    [iquote('0:MRR:26.0,25.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN965+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 18:44:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  
% 0.18/0.42  SPASS V 3.9 
% 0.18/0.42  SPASS beiseite: Proof found.
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.42  SPASS derived 19 clauses, backtracked 0 clauses, performed 0 splits and kept 18 clauses.
% 0.18/0.42  SPASS allocated 85062 KBytes.
% 0.18/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.18/0.42  		0:00:00.03 for the input.
% 0.18/0.42  		0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.42  		0:00:00.00 for inferences.
% 0.18/0.42  		0:00:00.00 for the backtracking.
% 0.18/0.42  		0:00:00.00 for the reduction.
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Here is a proof with depth 3, length 12 :
% 0.18/0.42  % SZS output start Refutation
% See solution above
% 0.18/0.42  Formulae used in the proof : prove_this
% 0.18/0.42  
%------------------------------------------------------------------------------