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

% Computer : n010.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:23 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ f(z__dfg(u,v),z__dfg(u,v))
    | f(u,v) ),
    file('SYN331-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( f(u,v)
    | f(z__dfg(v,u),z__dfg(v,u)) ),
    file('SYN331-1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ f(z__dfg(u,v),u),
    file('SYN331-1.p',unknown),
    [] ).

cnf(9,plain,
    ( f(u,v)
    | f(v,u) ),
    inference(res,[status(thm),theory(equality)],[5,3]),
    [iquote('0:Res:5.1,3.0')] ).

cnf(10,plain,
    f(u,u),
    inference(fac,[status(thm)],[9]),
    [iquote('0:Fac:9.0,9.1')] ).

cnf(15,plain,
    f(u,v),
    inference(mrr,[status(thm)],[3,10]),
    [iquote('0:MRR:3.0,10.0')] ).

cnf(16,plain,
    $false,
    inference(unc,[status(thm)],[15,6]),
    [iquote('0:UnC:15.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SYN331-1 : TPTP v8.1.0. Released v1.2.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n010.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 22:48:15 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.20/0.42  SPASS allocated 63082 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.42  		0:00:00.04 for the input.
% 0.20/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.00 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 2, length 7 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : clause3 clause5 clause6
% 0.20/0.42  
%------------------------------------------------------------------------------