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

% Computer : n012.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:02 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ q1(e,b,e),
    file('SYN296-1.p',unknown),
    [] ).

cnf(8,axiom,
    n0(d,b),
    file('SYN296-1.p',unknown),
    [] ).

cnf(15,axiom,
    p0(b,u),
    file('SYN296-1.p',unknown),
    [] ).

cnf(131,axiom,
    ( ~ p0(u,v)
    | ~ n0(w,x)
    | q1(v,x,v) ),
    file('SYN296-1.p',unknown),
    [] ).

cnf(419,plain,
    ( ~ p0(u,e)
    | ~ n0(v,b) ),
    inference(res,[status(thm),theory(equality)],[131,1]),
    [iquote('0:Res:131.2,1.0')] ).

cnf(494,plain,
    ~ n0(u,b),
    inference(res,[status(thm),theory(equality)],[15,419]),
    [iquote('0:Res:15.0,419.0')] ).

cnf(495,plain,
    $false,
    inference(unc,[status(thm)],[494,8]),
    [iquote('0:UnC:494.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN296-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n012.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 12:08:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  
% 0.20/0.47  SPASS V 3.9 
% 0.20/0.47  SPASS beiseite: Proof found.
% 0.20/0.47  % SZS status Theorem
% 0.20/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.47  SPASS derived 42 clauses, backtracked 0 clauses, performed 0 splits and kept 368 clauses.
% 0.20/0.47  SPASS allocated 76126 KBytes.
% 0.20/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.20/0.47  		0:00:00.04 for the input.
% 0.20/0.47  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.47  		0:00:00.00 for inferences.
% 0.20/0.47  		0:00:00.00 for the backtracking.
% 0.20/0.47  		0:00:00.03 for the reduction.
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  Here is a proof with depth 2, length 7 :
% 0.20/0.47  % SZS output start Refutation
% See solution above
% 0.20/0.47  Formulae used in the proof : prove_this axiom_7 axiom_14 rule_092
% 0.20/0.47  
%------------------------------------------------------------------------------