%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC036-1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 22:01:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    equal(nil,sk2),
    file('SWC036-1.p',unknown),
    [] ).

cnf(6,axiom,
    equal(sk2,sk4),
    file('SWC036-1.p',unknown),
    [] ).

cnf(7,axiom,
    equal(sk3,sk1),
    file('SWC036-1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ equal(nil,sk1),
    file('SWC036-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ equal(nil,sk4)
    | equal(nil,sk3) ),
    file('SWC036-1.p',unknown),
    [] ).

cnf(197,plain,
    equal(nil,sk4),
    inference(rew,[status(thm),theory(equality)],[6,5]),
    [iquote('0:Rew:6.0,5.0')] ).

cnf(207,plain,
    ~ equal(sk4,sk1),
    inference(rew,[status(thm),theory(equality)],[197,8]),
    [iquote('0:Rew:197.0,8.0')] ).

cnf(219,plain,
    ( ~ equal(sk4,sk4)
    | equal(sk4,sk1) ),
    inference(rew,[status(thm),theory(equality)],[197,9,7]),
    [iquote('0:Rew:197.0,9.1,7.0,9.1,197.0,9.0')] ).

cnf(220,plain,
    equal(sk4,sk1),
    inference(obv,[status(thm),theory(equality)],[219]),
    [iquote('0:Obv:219.0')] ).

cnf(221,plain,
    $false,
    inference(mrr,[status(thm)],[220,207]),
    [iquote('0:MRR:220.0,207.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC036-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n026.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 : Sun Jun 12 06:34:50 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 11 clauses, backtracked 0 clauses, performed 0 splits and kept 89 clauses.
% 0.20/0.44  SPASS allocated 75864 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.44  		0:00:00.04 for the input.
% 0.20/0.44  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.00 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 0, length 10 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : co1_5 co1_6 co1_7 co1_8 co1_9
% 0.20/0.44  
%------------------------------------------------------------------------------