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

% Computer : n010.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:14 EDT 2022

% Result   : Theorem 0.20s 0.45s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (   8 unt;   1 nHn;  14 RR)
%            Number of literals    :   20 (   0 equ;   9 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    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( ~ big_h(skc4)
    | big_h(u) ),
    file('SYN319+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big(u)
    | big_h(u) ),
    file('SYN319+1.p',unknown),
    [] ).

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

cnf(5,axiom,
    ( big(u)
    | skP0(v,u) ),
    file('SYN319+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ big_h(skc3)
    | ~ big_h(skc4) ),
    file('SYN319+1.p',unknown),
    [] ).

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

cnf(10,plain,
    ~ big_h(skc4),
    inference(mrr,[status(thm)],[6,2]),
    [iquote('0:MRR:6.0,2.1')] ).

cnf(17,plain,
    big_g(u),
    inference(spt,[spt(split,[position(s1)])],[8]),
    [iquote('1:Spt:8.1')] ).

cnf(18,plain,
    big_h(u),
    inference(mrr,[status(thm)],[4,17]),
    [iquote('1:MRR:4.0,17.0')] ).

cnf(20,plain,
    $false,
    inference(unc,[status(thm)],[18,10]),
    [iquote('1:UnC:18.0,10.0')] ).

cnf(22,plain,
    ~ skP0(skf1(u),u),
    inference(spt,[spt(split,[position(s2)])],[8]),
    [iquote('1:Spt:20.0,8.0')] ).

cnf(23,plain,
    ~ big(skc4),
    inference(res,[status(thm),theory(equality)],[3,10]),
    [iquote('0:Res:3.1,10.0')] ).

cnf(25,plain,
    big(u),
    inference(res,[status(thm),theory(equality)],[5,22]),
    [iquote('1:Res:5.1,22.0')] ).

cnf(26,plain,
    $false,
    inference(unc,[status(thm)],[25,23]),
    [iquote('1:UnC:25.0,23.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN319+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n010.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 : Mon Jul 11 21:20:30 EDT 2022
% 0.20/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/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.45  SPASS derived 7 clauses, backtracked 6 clauses, performed 1 splits and kept 21 clauses.
% 0.20/0.45  SPASS allocated 97568 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 2, length 14 :
% 0.20/0.45  % SZS output start Refutation
% See solution above
% 0.20/0.45  Formulae used in the proof : church_46_2_5
% 0.20/0.45  
%------------------------------------------------------------------------------