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

% Computer : n017.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:18 EDT 2022

% Result   : Theorem 0.20s 0.48s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    7 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :    9 (   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    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(15,axiom,
    equal(nil,skc7),
    file('SWC040+1.p',unknown),
    [] ).

cnf(54,axiom,
    ~ equal(nil,skc6),
    file('SWC040+1.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ equal(nil,skc7)
    | equal(nil,skc6) ),
    file('SWC040+1.p',unknown),
    [] ).

cnf(205,plain,
    ~ equal(skc7,skc6),
    inference(rew,[status(thm),theory(equality)],[15,54]),
    [iquote('0:Rew:15.0,54.0')] ).

cnf(217,plain,
    ( ~ equal(skc7,skc7)
    | equal(skc7,skc6) ),
    inference(rew,[status(thm),theory(equality)],[15,70]),
    [iquote('0:Rew:15.0,70.1,15.0,70.0')] ).

cnf(218,plain,
    equal(skc7,skc6),
    inference(obv,[status(thm),theory(equality)],[217]),
    [iquote('0:Obv:217.0')] ).

cnf(219,plain,
    $false,
    inference(mrr,[status(thm)],[218,205]),
    [iquote('0:MRR:218.0,205.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC040+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 01:21:21 EDT 2022
% 0.13/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/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.48  SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 87 clauses.
% 0.20/0.48  SPASS allocated 98242 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.13 on the problem.
% 0.20/0.48  		0:00:00.04 for the input.
% 0.20/0.48  		0:00:00.07 for the FLOTTER CNF translation.
% 0.20/0.48  		0:00:00.00 for inferences.
% 0.20/0.48  		0:00:00.00 for the backtracking.
% 0.20/0.48  		0:00:00.00 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 0, length 7 :
% 0.20/0.48  % SZS output start Refutation
% See solution above
% 0.20/0.48  Formulae used in the proof : co1 ax2 ax17
% 0.20/0.48  
%------------------------------------------------------------------------------