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

% Computer : n004.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:20:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    big_p(skc2),
    file('SYN365+1.p',unknown),
    [] ).

cnf(2,axiom,
    big_p(skf1(u)),
    file('SYN365+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big_p(u)
    | big_p(g(u)) ),
    file('SYN365+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big_p(u)
    | big_p(h(u)) ),
    file('SYN365+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_p(u)
    | ~ big_r(skc2,u) ),
    file('SYN365+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ big_p(u)
    | big_r(u,g(h(skf1(u)))) ),
    file('SYN365+1.p',unknown),
    [] ).

cnf(11,plain,
    ( ~ big_p(skc2)
    | ~ big_p(g(h(skf1(skc2)))) ),
    inference(res,[status(thm),theory(equality)],[6,5]),
    [iquote('0:Res:6.1,5.1')] ).

cnf(12,plain,
    $false,
    inference(ssi,[status(thm)],[11,3,4,2,1]),
    [iquote('0:SSi:11.1,11.0,3.0,4.0,2.0,1.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN365+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jul 11 17:02:52 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.45  
% 0.21/0.45  SPASS V 3.9 
% 0.21/0.45  SPASS beiseite: Proof found.
% 0.21/0.45  % SZS status Theorem
% 0.21/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.45  SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 7 clauses.
% 0.21/0.45  SPASS allocated 97568 KBytes.
% 0.21/0.45  SPASS spent	0:00:00.08 on the problem.
% 0.21/0.45  		0:00:00.03 for the input.
% 0.21/0.45  		0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.45  		0:00:00.00 for inferences.
% 0.21/0.45  		0:00:00.00 for the backtracking.
% 0.21/0.45  		0:00:00.00 for the reduction.
% 0.21/0.45  
% 0.21/0.45  
% 0.21/0.45  Here is a proof with depth 1, length 8 :
% 0.21/0.45  % SZS output start Refutation
% See solution above
% 0.21/0.45  Formulae used in the proof : x2116
% 0.21/0.45  
%------------------------------------------------------------------------------