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

% Computer : n026.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:10 EDT 2022

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

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

cnf(2,axiom,
    ( ~ p(a)
    | f(u) ),
    file('SYN315-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ f(y__dfg(u))
    | ~ p(a) ),
    file('SYN315-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( p(a)
    | f(y__dfg(u)) ),
    file('SYN315-1.p',unknown),
    [] ).

cnf(5,plain,
    f(y__dfg(u)),
    inference(mrr,[status(thm)],[4,2]),
    [iquote('0:MRR:4.0,2.0')] ).

cnf(6,plain,
    ~ p(a),
    inference(mrr,[status(thm)],[3,5]),
    [iquote('0:MRR:3.0,5.0')] ).

cnf(7,plain,
    ~ f(u),
    inference(mrr,[status(thm)],[1,6]),
    [iquote('0:MRR:1.1,6.0')] ).

cnf(8,plain,
    $false,
    inference(unc,[status(thm)],[7,5]),
    [iquote('0:UnC:7.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYN315-1 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n026.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jul 12 04:40:27 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.40  
% 0.18/0.40  SPASS V 3.9 
% 0.18/0.40  SPASS beiseite: Proof found.
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.40  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 6 clauses.
% 0.18/0.40  SPASS allocated 75575 KBytes.
% 0.18/0.40  SPASS spent	0:00:00.06 on the problem.
% 0.18/0.40  		0:00:00.04 for the input.
% 0.18/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40  		0:00:00.00 for inferences.
% 0.18/0.40  		0:00:00.00 for the backtracking.
% 0.18/0.40  		0:00:00.00 for the reduction.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Here is a proof with depth 0, length 8 :
% 0.18/0.40  % SZS output start Refutation
% See solution above
% 0.18/0.40  Formulae used in the proof : clause1 clause2 clause3 clause4
% 0.18/0.40  
%------------------------------------------------------------------------------