%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC035-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n011.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.43s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;  10 RR)
%            Number of literals    :   10 (   0 equ;   2 neg)
%            Maximal clause size   :    1 (   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('SWC035-1.p',unknown),
    [] ).

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

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

cnf(8,axiom,
    equal(sk4,sk3),
    file('SWC035-1.p',unknown),
    [] ).

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

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

cnf(207,plain,
    equal(sk2,sk1),
    inference(rew,[status(thm),theory(equality)],[6,197]),
    [iquote('0:Rew:6.0,197.0')] ).

cnf(210,plain,
    equal(nil,sk1),
    inference(rew,[status(thm),theory(equality)],[207,5]),
    [iquote('0:Rew:207.0,5.0')] ).

cnf(219,plain,
    ~ equal(sk1,sk1),
    inference(rew,[status(thm),theory(equality)],[210,9]),
    [iquote('0:Rew:210.0,9.0')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC035-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 12 05:04:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.43  
% 0.20/0.43  SPASS V 3.9 
% 0.20/0.43  SPASS beiseite: Proof found.
% 0.20/0.43  % SZS status Theorem
% 0.20/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.43  SPASS derived 22 clauses, backtracked 0 clauses, performed 0 splits and kept 81 clauses.
% 0.20/0.43  SPASS allocated 75861 KBytes.
% 0.20/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.43  		0:00:00.04 for the input.
% 0.20/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.43  		0:00:00.00 for inferences.
% 0.20/0.43  		0:00:00.00 for the backtracking.
% 0.20/0.43  		0:00:00.00 for the reduction.
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Here is a proof with depth 0, length 10 :
% 0.20/0.43  % SZS output start Refutation
% See solution above
% 0.20/0.43  Formulae used in the proof : co1_5 co1_6 co1_7 co1_8 co1_9
% 0.20/0.43  
%------------------------------------------------------------------------------