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

% Computer : n011.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:17:51 EDT 2022

% Result   : Theorem 0.21s 0.44s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   5 unt;   0 nHn;   9 RR)
%            Number of literals    :   14 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 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,
    ~ big_h(skc1,u),
    file('SYN065+1.p',unknown),
    [] ).

cnf(2,axiom,
    big(u,skf2(u)),
    file('SYN065+1.p',unknown),
    [] ).

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

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

cnf(7,plain,
    ( ~ skP0(u,v)
    | ~ skP0(v,skc1) ),
    inference(res,[status(thm),theory(equality)],[6,1]),
    [iquote('0:Res:6.2,1.0')] ).

cnf(8,plain,
    ( ~ big(u,v)
    | ~ skP0(u,skc1) ),
    inference(res,[status(thm),theory(equality)],[4,7]),
    [iquote('0:Res:4.1,7.0')] ).

cnf(10,plain,
    ~ skP0(u,skc1),
    inference(res,[status(thm),theory(equality)],[2,8]),
    [iquote('0:Res:2.0,8.0')] ).

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

cnf(13,plain,
    $false,
    inference(unc,[status(thm)],[11,2]),
    [iquote('0:UnC:11.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command  : run_spass %d %s
% 0.15/0.35  % Computer : n011.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Tue Jul 12 09:03:43 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.21/0.44  
% 0.21/0.44  SPASS V 3.9 
% 0.21/0.44  SPASS beiseite: Proof found.
% 0.21/0.44  % SZS status Theorem
% 0.21/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.44  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.21/0.44  SPASS allocated 85068 KBytes.
% 0.21/0.44  SPASS spent	0:00:00.08 on the problem.
% 0.21/0.44  		0:00:00.03 for the input.
% 0.21/0.44  		0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.44  		0:00:00.00 for inferences.
% 0.21/0.44  		0:00:00.00 for the backtracking.
% 0.21/0.44  		0:00:00.00 for the reduction.
% 0.21/0.44  
% 0.21/0.44  
% 0.21/0.44  Here is a proof with depth 4, length 9 :
% 0.21/0.44  % SZS output start Refutation
% See solution above
% 0.21/0.44  Formulae used in the proof : pel36 pel36_1 pel36_3
% 0.21/0.44  
%------------------------------------------------------------------------------