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

% Computer : n016.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:18:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    big_j(skc1),
    file('SYN068+1.p',unknown),
    [] ).

cnf(2,axiom,
    big_g(skf3(u)),
    file('SYN068+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big_j(u)
    | big(u) ),
    file('SYN068+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big_g(u)
    | big_h(skc1,u) ),
    file('SYN068+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ big(u)
    | ~ big_h(u,skf3(u)) ),
    file('SYN068+1.p',unknown),
    [] ).

cnf(8,plain,
    big(skc1),
    inference(res,[status(thm),theory(equality)],[1,4]),
    [iquote('0:Res:1.0,4.0')] ).

cnf(14,plain,
    ( ~ big_g(skf3(skc1))
    | ~ big(skc1) ),
    inference(res,[status(thm),theory(equality)],[5,7]),
    [iquote('0:Res:5.1,7.1')] ).

cnf(15,plain,
    $false,
    inference(ssi,[status(thm)],[14,1,8,2]),
    [iquote('0:SSi:14.1,14.0,1.0,8.0,2.0,1.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SYN068+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 00:51:13 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.45  
% 0.20/0.45  SPASS V 3.9 
% 0.20/0.45  SPASS beiseite: Proof found.
% 0.20/0.45  % SZS status Theorem
% 0.20/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.45  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.20/0.45  SPASS allocated 97562 KBytes.
% 0.20/0.45  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.45  		0:00:00.04 for the input.
% 0.20/0.45  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45  		0:00:00.00 for inferences.
% 0.20/0.45  		0:00:00.00 for the backtracking.
% 0.20/0.45  		0:00:00.00 for the reduction.
% 0.20/0.45  
% 0.20/0.45  
% 0.20/0.45  Here is a proof with depth 1, length 8 :
% 0.20/0.45  % SZS output start Refutation
% See solution above
% 0.20/0.45  Formulae used in the proof : pel44_2 pel44_1 pel44
% 0.20/0.45  
%------------------------------------------------------------------------------