%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN265-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:19:50 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p3(u,u,a),
    file('SYN265-1.p',unknown),
    [] ).

cnf(21,axiom,
    l0(a),
    file('SYN265-1.p',unknown),
    [] ).

cnf(38,axiom,
    n0(b,a),
    file('SYN265-1.p',unknown),
    [] ).

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

cnf(198,axiom,
    ( ~ k1(u)
    | p2(u,u,u) ),
    file('SYN265-1.p',unknown),
    [] ).

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

cnf(287,axiom,
    ( ~ n3(u)
    | ~ p2(v,u,u)
    | p3(u,u,u) ),
    file('SYN265-1.p',unknown),
    [] ).

cnf(387,plain,
    ( ~ p2(u,v,v)
    | p3(v,v,v) ),
    inference(mrr,[status(thm)],[287,279]),
    [iquote('0:MRR:287.0,279.1')] ).

cnf(423,plain,
    ~ p2(u,a,a),
    inference(res,[status(thm),theory(equality)],[387,1]),
    [iquote('0:Res:387.1,1.0')] ).

cnf(465,plain,
    k1(a),
    inference(res,[status(thm),theory(equality)],[38,40]),
    [iquote('0:Res:38.0,40.0')] ).

cnf(482,plain,
    ~ k1(a),
    inference(res,[status(thm),theory(equality)],[198,423]),
    [iquote('0:Res:198.1,423.0')] ).

cnf(483,plain,
    $false,
    inference(ssi,[status(thm)],[482,21,465]),
    [iquote('0:SSi:482.0,21.0,465.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN265-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.32  % Computer : n012.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Tue Jul 12 02:15:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.46  
% 0.18/0.46  SPASS V 3.9 
% 0.18/0.46  SPASS beiseite: Proof found.
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.46  SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 361 clauses.
% 0.18/0.46  SPASS allocated 76118 KBytes.
% 0.18/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.18/0.46  		0:00:00.04 for the input.
% 0.18/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.46  		0:00:00.00 for inferences.
% 0.18/0.46  		0:00:00.00 for the backtracking.
% 0.18/0.46  		0:00:00.03 for the reduction.
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Here is a proof with depth 2, length 12 :
% 0.18/0.46  % SZS output start Refutation
% See solution above
% 0.18/0.46  Formulae used in the proof : prove_this axiom_20 axiom_37 rule_001 rule_159 rule_240 rule_248
% 0.18/0.46  
%------------------------------------------------------------------------------