%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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 : Wed Jul 20 21:42:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    ~ contains_slb(skc4,skc5),
    file('SWV397+1.p',unknown),
    [] ).

cnf(13,axiom,
    ~ ok(triple(u,v,bad)),
    file('SWV397+1.p',unknown),
    [] ).

cnf(14,axiom,
    ok(remove_cpq(triple(skc6,skc4,skc7),skc5)),
    file('SWV397+1.p',unknown),
    [] ).

cnf(37,axiom,
    ( contains_slb(u,v)
    | equal(remove_cpq(triple(w,u,x),v),triple(w,u,bad)) ),
    file('SWV397+1.p',unknown),
    [] ).

cnf(58,plain,
    equal(remove_cpq(triple(u,skc4,v),skc5),triple(u,skc4,bad)),
    inference(res,[status(thm),theory(equality)],[37,5]),
    [iquote('0:Res:37.1,5.0')] ).

cnf(61,plain,
    ok(triple(skc6,skc4,bad)),
    inference(rew,[status(thm),theory(equality)],[58,14]),
    [iquote('0:Rew:58.0,14.0')] ).

cnf(62,plain,
    $false,
    inference(mrr,[status(thm)],[61,13]),
    [iquote('0:MRR:61.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n006.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 : Wed Jun 15 18:46:56 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.46  
% 0.20/0.46  SPASS V 3.9 
% 0.20/0.46  SPASS beiseite: Proof found.
% 0.20/0.46  % SZS status Theorem
% 0.20/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.46  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.20/0.46  SPASS allocated 85349 KBytes.
% 0.20/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.20/0.46  		0:00:00.04 for the input.
% 0.20/0.46  		0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.46  		0:00:00.00 for inferences.
% 0.20/0.46  		0:00:00.00 for the backtracking.
% 0.20/0.46  		0:00:00.00 for the reduction.
% 0.20/0.46  
% 0.20/0.46  
% 0.20/0.46  Here is a proof with depth 1, length 7 :
% 0.20/0.46  % SZS output start Refutation
% See solution above
% 0.20/0.46  Formulae used in the proof : l33_co ax40 ax43
% 0.20/0.46  
%------------------------------------------------------------------------------