%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN571-1 : TPTP v8.1.0. Released v2.5.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:22:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    p2(u,u),
    file('SYN571-1.p',unknown),
    [] ).

cnf(3,axiom,
    p11(f5(u),c14),
    file('SYN571-1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ p11(u,f3(u,f5(f6(f7(c12))))),
    file('SYN571-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ p11(f5(f10(u)),u)
    | p11(c14,u) ),
    file('SYN571-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ p2(u,v)
    | ~ p2(u,w)
    | p2(w,v) ),
    file('SYN571-1.p',unknown),
    [] ).

cnf(14,axiom,
    p2(f9(f5(u),f5(v)),f5(f8(u,v))),
    file('SYN571-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ p11(f9(u,v),w)
    | p11(u,f3(w,v)) ),
    file('SYN571-1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ p11(u,v)
    | ~ p2(v,w)
    | ~ p2(u,x)
    | p11(x,w) ),
    file('SYN571-1.p',unknown),
    [] ).

cnf(51,plain,
    ( ~ p2(u,v)
    | p2(v,u) ),
    inference(res,[status(thm),theory(equality)],[2,12]),
    [iquote('0:Res:2.0,12.0')] ).

cnf(56,plain,
    p2(f5(f8(u,v)),f9(f5(u),f5(v))),
    inference(res,[status(thm),theory(equality)],[14,51]),
    [iquote('0:Res:14.0,51.0')] ).

cnf(106,plain,
    ( ~ p2(c14,u)
    | ~ p2(f5(v),w)
    | p11(w,u) ),
    inference(res,[status(thm),theory(equality)],[3,17]),
    [iquote('0:Res:3.0,17.0')] ).

cnf(141,plain,
    ( ~ p2(c14,u)
    | p11(f9(f5(v),f5(w)),u) ),
    inference(res,[status(thm),theory(equality)],[56,106]),
    [iquote('0:Res:56.0,106.1')] ).

cnf(182,plain,
    ( ~ p2(c14,u)
    | p11(f5(v),f3(u,f5(w))) ),
    inference(res,[status(thm),theory(equality)],[141,15]),
    [iquote('0:Res:141.1,15.0')] ).

cnf(186,plain,
    ( ~ p2(c14,u)
    | p11(c14,f3(u,f5(v))) ),
    inference(res,[status(thm),theory(equality)],[182,7]),
    [iquote('0:Res:182.1,7.0')] ).

cnf(188,plain,
    ~ p2(c14,c14),
    inference(res,[status(thm),theory(equality)],[186,6]),
    [iquote('0:Res:186.1,6.0')] ).

cnf(190,plain,
    $false,
    inference(mrr,[status(thm)],[188,2]),
    [iquote('0:MRR:188.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN571-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.14/0.33  % Computer : n012.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Mon Jul 11 23:32:57 EDT 2022
% 0.14/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 169 clauses, backtracked 0 clauses, performed 0 splits and kept 156 clauses.
% 0.19/0.43  SPASS allocated 63324 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.02 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 6, length 16 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : p2_2 p11_3 not_p11_6 p11_7 p2_12 p2_14 p11_15 p11_17
% 0.19/0.43  
%------------------------------------------------------------------------------