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

% Computer : n021.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:17:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    big(u,f(u)),
    file('SYN065-1.p',unknown),
    [] ).

cnf(2,axiom,
    big_g(u,g(u)),
    file('SYN065-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big(u,v)
    | ~ big_g(w,u)
    | big_h(w,v) ),
    file('SYN065-1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ big_h(a,u),
    file('SYN065-1.p',unknown),
    [] ).

cnf(10,plain,
    ( ~ big(u,v)
    | ~ big_g(a,u) ),
    inference(res,[status(thm),theory(equality)],[5,7]),
    [iquote('0:Res:5.2,7.0')] ).

cnf(12,plain,
    ~ big_g(a,u),
    inference(res,[status(thm),theory(equality)],[1,10]),
    [iquote('0:Res:1.0,10.0')] ).

cnf(13,plain,
    $false,
    inference(unc,[status(thm)],[12,2]),
    [iquote('0:UnC:12.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN065-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n021.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:26:08 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.41  
% 0.14/0.41  SPASS V 3.9 
% 0.14/0.41  SPASS beiseite: Proof found.
% 0.14/0.41  % SZS status Theorem
% 0.14/0.41  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.14/0.41  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.14/0.41  SPASS allocated 63081 KBytes.
% 0.14/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.14/0.41  		0:00:00.04 for the input.
% 0.14/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.14/0.41  		0:00:00.00 for inferences.
% 0.14/0.41  		0:00:00.00 for the backtracking.
% 0.14/0.41  		0:00:00.00 for the reduction.
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  Here is a proof with depth 2, length 7 :
% 0.14/0.41  % SZS output start Refutation
% See solution above
% 0.14/0.41  Formulae used in the proof : clause_1 clause_2 clause_5 clause_7
% 0.14/0.41  
%------------------------------------------------------------------------------