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

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

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

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

cnf(2,axiom,
    big_k(skc1),
    file('SYN062+1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ big_j(skc1),
    file('SYN062+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big_k(u)
    | big_h(u) ),
    file('SYN062+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ big(u)
    | ~ big_h(u)
    | big_i(u) ),
    file('SYN062+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ big_h(u)
    | ~ big_i(u)
    | big_j(u) ),
    file('SYN062+1.p',unknown),
    [] ).

cnf(8,plain,
    big_h(skc1),
    inference(res,[status(thm),theory(equality)],[2,4]),
    [iquote('0:Res:2.0,4.0')] ).

cnf(10,plain,
    ( ~ big_h(skc1)
    | big_i(skc1) ),
    inference(res,[status(thm),theory(equality)],[1,6]),
    [iquote('0:Res:1.0,6.1')] ).

cnf(11,plain,
    ( ~ big_i(skc1)
    | ~ big_h(skc1) ),
    inference(res,[status(thm),theory(equality)],[7,3]),
    [iquote('0:Res:7.2,3.0')] ).

cnf(12,plain,
    big_i(skc1),
    inference(mrr,[status(thm)],[10,8]),
    [iquote('0:MRR:10.0,8.0')] ).

cnf(13,plain,
    $false,
    inference(mrr,[status(thm)],[11,12,8]),
    [iquote('0:MRR:11.0,11.1,12.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN062+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 18:52:19 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  
% 0.19/0.44  SPASS V 3.9 
% 0.19/0.44  SPASS beiseite: Proof found.
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.44  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.19/0.44  SPASS allocated 97562 KBytes.
% 0.19/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.44  		0:00:00.04 for the input.
% 0.19/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44  		0:00:00.00 for inferences.
% 0.19/0.44  		0:00:00.00 for the backtracking.
% 0.19/0.44  		0:00:00.00 for the reduction.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Here is a proof with depth 1, length 11 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : pel32 pel32_3 pel32_1 pel32_2
% 0.19/0.44  
%------------------------------------------------------------------------------