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

% Computer : n004.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:04 EDT 2022

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

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

cnf(2,axiom,
    ( ~ p(u)
    | ~ p(f(f(f(f(f(f(f(f(u))))))))) ),
    file('SYN002-1.007.008.p',unknown),
    [] ).

cnf(5,plain,
    ( ~ p(u)
    | p(f(u)) ),
    inference(res,[status(thm),theory(equality)],[1,2]),
    [iquote('0:Res:1.1,2.1')] ).

cnf(6,plain,
    ( ~ p(f(f(f(f(f(f(f(u))))))))
    | ~ p(u) ),
    inference(res,[status(thm),theory(equality)],[5,2]),
    [iquote('0:Res:5.1,2.1')] ).

cnf(7,plain,
    ~ p(u),
    inference(ssi,[status(thm)],[6,5]),
    [iquote('0:SSi:6.0,5.1,5.1,5.1,5.1,5.1,5.1,5.1')] ).

cnf(8,plain,
    $false,
    inference(mrr,[status(thm)],[1,7]),
    [iquote('0:MRR:1.1,1.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN002-1.007.008 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n004.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 23:20:52 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.40  
% 0.13/0.40  SPASS V 3.9 
% 0.13/0.40  SPASS beiseite: Proof found.
% 0.13/0.40  % SZS status Theorem
% 0.13/0.40  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.13/0.40  SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 4 clauses.
% 0.13/0.40  SPASS allocated 75582 KBytes.
% 0.13/0.40  SPASS spent	0:00:00.05 on the problem.
% 0.13/0.40  		0:00:00.03 for the input.
% 0.13/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.40  		0:00:00.00 for inferences.
% 0.13/0.40  		0:00:00.00 for the backtracking.
% 0.13/0.40  		0:00:00.00 for the reduction.
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  Here is a proof with depth 2, length 6 :
% 0.13/0.40  % SZS output start Refutation
% See solution above
% 0.13/0.40  Formulae used in the proof : positive negative
% 0.13/0.40  
%------------------------------------------------------------------------------