%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( ~ q_1_1(u,v)
    | ~ q_2_2(u,v)
    | p_1_2(u,v) ),
    file('SYN101-1.002.002.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ nq_2(u)
    | ~ nq_1(v)
    | q_1_1(v,u) ),
    file('SYN101-1.002.002.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ nq_2(u)
    | ~ nq_1(v)
    | q_2_2(v,u) ),
    file('SYN101-1.002.002.p',unknown),
    [] ).

cnf(13,axiom,
    nq_1(a),
    file('SYN101-1.002.002.p',unknown),
    [] ).

cnf(15,axiom,
    nq_2(a),
    file('SYN101-1.002.002.p',unknown),
    [] ).

cnf(17,axiom,
    ~ p_1_2(a,a),
    file('SYN101-1.002.002.p',unknown),
    [] ).

cnf(19,plain,
    ( ~ q_1_1(a,a)
    | ~ q_2_2(a,a) ),
    inference(res,[status(thm),theory(equality)],[2,17]),
    [iquote('0:Res:2.2,17.0')] ).

cnf(24,plain,
    ( ~ nq_2(a)
    | ~ nq_1(a)
    | ~ q_2_2(a,a) ),
    inference(res,[status(thm),theory(equality)],[10,19]),
    [iquote('0:Res:10.2,19.0')] ).

cnf(25,plain,
    ~ q_2_2(a,a),
    inference(ssi,[status(thm)],[24,15,13]),
    [iquote('0:SSi:24.1,24.0,15.0,13.0,15.0,13.0')] ).

cnf(28,plain,
    ( ~ nq_2(a)
    | ~ nq_1(a) ),
    inference(res,[status(thm),theory(equality)],[12,25]),
    [iquote('0:Res:12.2,25.0')] ).

cnf(29,plain,
    $false,
    inference(ssi,[status(thm)],[28,15,13]),
    [iquote('0:SSi:28.1,28.0,15.0,13.0,15.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul 12 06:07:39 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.41  
% 0.18/0.41  SPASS V 3.9 
% 0.18/0.41  SPASS beiseite: Proof found.
% 0.18/0.41  % SZS status Theorem
% 0.18/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.41  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.18/0.41  SPASS allocated 75598 KBytes.
% 0.18/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.18/0.41  		0:00:00.04 for the input.
% 0.18/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.41  		0:00:00.00 for inferences.
% 0.18/0.41  		0:00:00.00 for the backtracking.
% 0.18/0.41  		0:00:00.00 for the reduction.
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  Here is a proof with depth 3, length 11 :
% 0.18/0.41  % SZS output start Refutation
% See solution above
% 0.18/0.41  Formulae used in the proof : n_s2_type11_2 n_t2_2 n_t2_4 n_1 n_3 n_s2_goal_1
% 0.18/0.41  
%------------------------------------------------------------------------------