%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : COL054-1 : TPTP v8.1.0. Released v1.0.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 : Fri Jul 15 00:42:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(response(mocking_bird,u),response(u,u)),
    file('COL054-1.p',unknown),
    [] ).

cnf(2,axiom,
    equal(response(compose(u,v),w),response(u,response(v,w))),
    file('COL054-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ equal(response(b,u),v)
    | ~ equal(response(a,v),u) ),
    file('COL054-1.p',unknown),
    [] ).

cnf(12,plain,
    equal(response(u,response(v,compose(u,v))),response(mocking_bird,compose(u,v))),
    inference(spr,[status(thm),theory(equality)],[2,1]),
    [iquote('0:SpR:2.0,1.0')] ).

cnf(14,plain,
    ~ equal(response(a,response(b,u)),u),
    inference(eqr,[status(thm),theory(equality)],[3]),
    [iquote('0:EqR:3.0')] ).

cnf(22,plain,
    ~ equal(response(a,response(mocking_bird,compose(b,u))),response(u,compose(b,u))),
    inference(spl,[status(thm),theory(equality)],[12,14]),
    [iquote('0:SpL:12.0,14.0')] ).

cnf(25,plain,
    $false,
    inference(unc,[status(thm)],[22,2]),
    [iquote('0:UnC:22.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : COL054-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue May 31 11:54:26 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.42  
% 0.21/0.42  SPASS V 3.9 
% 0.21/0.42  SPASS beiseite: Proof found.
% 0.21/0.42  % SZS status Theorem
% 0.21/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.42  SPASS derived 17 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.21/0.42  SPASS allocated 63114 KBytes.
% 0.21/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.21/0.42  		0:00:00.03 for the input.
% 0.21/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.42  		0:00:00.00 for inferences.
% 0.21/0.42  		0:00:00.00 for the backtracking.
% 0.21/0.42  		0:00:00.00 for the reduction.
% 0.21/0.42  
% 0.21/0.42  
% 0.21/0.42  Here is a proof with depth 2, length 7 :
% 0.21/0.42  % SZS output start Refutation
% See solution above
% 0.21/0.42  Formulae used in the proof : mocking_bird_exists composer_exists prove_birds_are_compatible
% 0.21/0.42  
%------------------------------------------------------------------------------