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

% Computer : n014.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:46 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ big_h(u)
    | ~ big(u) ),
    file('SYN060-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( big(u)
    | big_i(u) ),
    file('SYN060-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( big_h(u)
    | big_i(u) ),
    file('SYN060-1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ big_i(a),
    file('SYN060-1.p',unknown),
    [] ).

cnf(8,plain,
    big(a),
    inference(res,[status(thm),theory(equality)],[5,7]),
    [iquote('0:Res:5.0,7.0')] ).

cnf(9,plain,
    big_h(a),
    inference(res,[status(thm),theory(equality)],[6,7]),
    [iquote('0:Res:6.0,7.0')] ).

cnf(28,plain,
    $false,
    inference(ems,[status(thm)],[1,9,8]),
    [iquote('0:EmS:1.0,1.1,9.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN060-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 21:27:49 EDT 2022
% 0.12/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/sandbox/benchmark/theBenchmark.p 
% 0.18/0.40  SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.18/0.40  SPASS allocated 75584 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 2, length 7 :
% 0.18/0.40  % SZS output start Refutation
% See solution above
% 0.18/0.40  Formulae used in the proof : clause_1 clause_5 clause_6 clause_7
% 0.18/0.40  
%------------------------------------------------------------------------------