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

% Computer : n018.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:18:51 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   21 (  12 unt;   0 nHn;  21 RR)
%            Number of literals    :   37 (   0 equ;  20 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    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ l2(a,b),
    file('SYN121-1.p',unknown),
    [] ).

cnf(12,axiom,
    n0(e,b),
    file('SYN121-1.p',unknown),
    [] ).

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

cnf(18,axiom,
    q0(u,d),
    file('SYN121-1.p',unknown),
    [] ).

cnf(20,axiom,
    m0(u,d,v),
    file('SYN121-1.p',unknown),
    [] ).

cnf(37,axiom,
    q0(a,b),
    file('SYN121-1.p',unknown),
    [] ).

cnf(164,axiom,
    ( ~ p0(u,u)
    | s1(u) ),
    file('SYN121-1.p',unknown),
    [] ).

cnf(165,axiom,
    ( ~ s1(u)
    | ~ q0(v,w)
    | s1(v) ),
    file('SYN121-1.p',unknown),
    [] ).

cnf(170,axiom,
    ( ~ s1(u)
    | ~ l2(v,v)
    | ~ n0(e,v)
    | l2(u,v) ),
    file('SYN121-1.p',unknown),
    [] ).

cnf(172,axiom,
    ( ~ s1(u)
    | ~ p0(v,v)
    | ~ m0(w,u,x)
    | l2(x,x) ),
    file('SYN121-1.p',unknown),
    [] ).

cnf(419,plain,
    ( ~ s1(a)
    | ~ n0(e,b)
    | ~ l2(b,b) ),
    inference(res,[status(thm),theory(equality)],[170,1]),
    [iquote('0:Res:170.3,1.0')] ).

cnf(420,plain,
    ( ~ s1(a)
    | ~ l2(b,b) ),
    inference(mrr,[status(thm)],[419,12]),
    [iquote('0:MRR:419.1,12.0')] ).

cnf(455,plain,
    s1(b),
    inference(res,[status(thm),theory(equality)],[15,164]),
    [iquote('0:Res:15.0,164.0')] ).

cnf(603,plain,
    ( ~ q0(u,v)
    | s1(u) ),
    inference(ems,[status(thm)],[165,455]),
    [iquote('0:EmS:165.0,455.0')] ).

cnf(604,plain,
    s1(a),
    inference(res,[status(thm),theory(equality)],[37,603]),
    [iquote('0:Res:37.0,603.0')] ).

cnf(609,plain,
    s1(u),
    inference(res,[status(thm),theory(equality)],[18,603]),
    [iquote('0:Res:18.0,603.0')] ).

cnf(611,plain,
    ~ l2(b,b),
    inference(mrr,[status(thm)],[420,604]),
    [iquote('0:MRR:420.0,604.0')] ).

cnf(617,plain,
    ( ~ p0(u,u)
    | ~ m0(v,w,x)
    | l2(x,x) ),
    inference(mrr,[status(thm)],[172,609]),
    [iquote('0:MRR:172.0,609.0')] ).

cnf(993,plain,
    ( ~ p0(u,u)
    | l2(v,v) ),
    inference(res,[status(thm),theory(equality)],[20,617]),
    [iquote('0:Res:20.0,617.1')] ).

cnf(994,plain,
    l2(u,u),
    inference(res,[status(thm),theory(equality)],[15,993]),
    [iquote('0:Res:15.0,993.0')] ).

cnf(995,plain,
    $false,
    inference(unc,[status(thm)],[994,611]),
    [iquote('0:UnC:994.0,611.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN121-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n018.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 : Tue Jul 12 06:00:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.51  
% 0.20/0.51  SPASS V 3.9 
% 0.20/0.51  SPASS beiseite: Proof found.
% 0.20/0.51  % SZS status Theorem
% 0.20/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.51  SPASS derived 502 clauses, backtracked 0 clauses, performed 0 splits and kept 599 clauses.
% 0.20/0.51  SPASS allocated 76365 KBytes.
% 0.20/0.51  SPASS spent	0:00:00.15 on the problem.
% 0.20/0.51  		0:00:00.04 for the input.
% 0.20/0.51  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.51  		0:00:00.00 for inferences.
% 0.20/0.51  		0:00:00.00 for the backtracking.
% 0.20/0.51  		0:00:00.05 for the reduction.
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  Here is a proof with depth 3, length 21 :
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.51  Formulae used in the proof : prove_this axiom_11 axiom_14 axiom_17 axiom_19 axiom_36 rule_125 rule_126 rule_131 rule_133
% 0.20/0.51  
%------------------------------------------------------------------------------