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

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

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

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

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

cnf(6,axiom,
    ( ~ big(u,skc1)
    | ~ big(skf3(u),u)
    | ~ skP0(u,skf2(u),skc1) ),
    file('SYN327+1.p',unknown),
    [] ).

cnf(7,plain,
    ( ~ big(skf3(u),u)
    | ~ skP0(u,skf2(u),skc1) ),
    inference(mrr,[status(thm)],[6,1]),
    [iquote('0:MRR:6.0,1.0')] ).

cnf(18,plain,
    ( ~ big(skc1,u)
    | ~ big(skf3(u),u) ),
    inference(res,[status(thm),theory(equality)],[3,7]),
    [iquote('0:Res:3.1,7.1')] ).

cnf(20,plain,
    ~ big(skc1,skc1),
    inference(res,[status(thm),theory(equality)],[1,18]),
    [iquote('0:Res:1.0,18.1')] ).

cnf(21,plain,
    $false,
    inference(mrr,[status(thm)],[20,1]),
    [iquote('0:MRR:20.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SYN327+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n021.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 : Tue Jul 12 04:27:54 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.22/0.46  
% 0.22/0.46  SPASS V 3.9 
% 0.22/0.46  SPASS beiseite: Proof found.
% 0.22/0.46  % SZS status Theorem
% 0.22/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.46  SPASS derived 11 clauses, backtracked 4 clauses, performed 1 splits and kept 18 clauses.
% 0.22/0.46  SPASS allocated 85120 KBytes.
% 0.22/0.46  SPASS spent	0:00:00.08 on the problem.
% 0.22/0.46  		0:00:00.03 for the input.
% 0.22/0.46  		0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.46  		0:00:00.00 for inferences.
% 0.22/0.46  		0:00:00.00 for the backtracking.
% 0.22/0.46  		0:00:00.00 for the reduction.
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Here is a proof with depth 2, length 7 :
% 0.22/0.46  % SZS output start Refutation
% See solution above
% 0.22/0.46  Formulae used in the proof : church_46_12_2
% 0.22/0.46  
%------------------------------------------------------------------------------