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

% Computer : n024.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 : Fri Jul 15 00:42:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(apply(apply(apply(n1,u),v),w),apply(apply(apply(u,v),v),w)),
    file('COL070-1.p',unknown),
    [] ).

cnf(2,axiom,
    equal(apply(apply(apply(b,u),v),w),apply(u,apply(v,w))),
    file('COL070-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ equal(apply(combinator,u),u),
    file('COL070-1.p',unknown),
    [] ).

cnf(15,plain,
    equal(apply(apply(apply(n1,apply(b,u)),v),w),apply(apply(u,apply(v,v)),w)),
    inference(spr,[status(thm),theory(equality)],[2,1]),
    [iquote('0:SpR:2.0,1.0')] ).

cnf(204,plain,
    equal(apply(apply(apply(n1,apply(b,apply(b,u))),v),w),apply(u,apply(apply(v,v),w))),
    inference(spr,[status(thm),theory(equality)],[15,2]),
    [iquote('0:SpR:15.0,2.0')] ).

cnf(231,plain,
    $false,
    inference(unc,[status(thm)],[204,3]),
    [iquote('0:UnC:204.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n024.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 : Tue May 31 12:45:36 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.48  
% 0.20/0.48  SPASS V 3.9 
% 0.20/0.48  SPASS beiseite: Proof found.
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.48  SPASS derived 152 clauses, backtracked 0 clauses, performed 0 splits and kept 95 clauses.
% 0.20/0.48  SPASS allocated 63793 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.12 on the problem.
% 0.20/0.48  		0:00:00.03 for the input.
% 0.20/0.48  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.48  		0:00:00.01 for inferences.
% 0.20/0.48  		0:00:00.00 for the backtracking.
% 0.20/0.48  		0:00:00.06 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 2, length 6 :
% 0.20/0.48  % SZS output start Refutation
% See solution above
% 0.20/0.48  Formulae used in the proof : n1_definition b_definition prove_fixed_point
% 0.20/0.48  
%------------------------------------------------------------------------------