%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN256-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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:19:46 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ n2(c),
    file('SYN256-1.p',unknown),
    [] ).

cnf(25,axiom,
    l0(c),
    file('SYN256-1.p',unknown),
    [] ).

cnf(27,axiom,
    n0(d,c),
    file('SYN256-1.p',unknown),
    [] ).

cnf(29,axiom,
    k0(e),
    file('SYN256-1.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ n0(u,v)
    | k1(v) ),
    file('SYN256-1.p',unknown),
    [] ).

cnf(118,axiom,
    ( ~ k1(u)
    | ~ k0(e)
    | ~ l0(c)
    | p1(u,u,u) ),
    file('SYN256-1.p',unknown),
    [] ).

cnf(176,axiom,
    ( ~ p1(u,v,w)
    | n2(w) ),
    file('SYN256-1.p',unknown),
    [] ).

cnf(398,plain,
    ( ~ k1(u)
    | p1(u,u,u) ),
    inference(mrr,[status(thm)],[118,29,25]),
    [iquote('0:MRR:118.1,118.2,29.0,25.0')] ).

cnf(419,plain,
    ~ p1(u,v,c),
    inference(res,[status(thm),theory(equality)],[176,1]),
    [iquote('0:Res:176.1,1.0')] ).

cnf(458,plain,
    k1(c),
    inference(res,[status(thm),theory(equality)],[27,40]),
    [iquote('0:Res:27.0,40.0')] ).

cnf(473,plain,
    ~ k1(c),
    inference(res,[status(thm),theory(equality)],[398,419]),
    [iquote('0:Res:398.1,419.0')] ).

cnf(474,plain,
    $false,
    inference(ssi,[status(thm)],[473,25,458]),
    [iquote('0:SSi:473.0,25.0,458.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN256-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n006.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 22:40:35 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  
% 0.19/0.47  SPASS V 3.9 
% 0.19/0.47  SPASS beiseite: Proof found.
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 23 clauses, backtracked 0 clauses, performed 0 splits and kept 349 clauses.
% 0.19/0.47  SPASS allocated 76113 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.47  		0:00:00.04 for the input.
% 0.19/0.47  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.47  		0:00:00.00 for inferences.
% 0.19/0.47  		0:00:00.00 for the backtracking.
% 0.19/0.47  		0:00:00.03 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 2, length 12 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : prove_this axiom_24 axiom_26 axiom_28 rule_001 rule_079 rule_137
% 0.19/0.47  
%------------------------------------------------------------------------------