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

% Computer : n029.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:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ ok(triple(skc4,skc5,skc6)),
    file('SWV377+1.p',unknown),
    [] ).

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

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

cnf(20,axiom,
    ( ok(triple(u,v,w))
    | equal(w,bad) ),
    file('SWV377+1.p',unknown),
    [] ).

cnf(41,axiom,
    equal(triple(insert_pqp(u,v),insert_slb(w,pair(v,bottom)),x),insert_cpq(triple(u,w,x),v)),
    file('SWV377+1.p',unknown),
    [] ).

cnf(58,plain,
    equal(skc6,bad),
    inference(res,[status(thm),theory(equality)],[20,10]),
    [iquote('0:Res:20.0,10.0')] ).

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

cnf(189,plain,
    ~ ok(insert_cpq(triple(u,v,bad),w)),
    inference(spl,[status(thm),theory(equality)],[41,13]),
    [iquote('0:SpL:41.0,13.0')] ).

cnf(193,plain,
    $false,
    inference(unc,[status(thm)],[189,60]),
    [iquote('0:UnC:189.0,60.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV377+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n029.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Tue Jun 14 14:53:41 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.48  
% 0.21/0.48  SPASS V 3.9 
% 0.21/0.48  SPASS beiseite: Proof found.
% 0.21/0.48  % SZS status Theorem
% 0.21/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.48  SPASS derived 126 clauses, backtracked 0 clauses, performed 0 splits and kept 84 clauses.
% 0.21/0.48  SPASS allocated 85351 KBytes.
% 0.21/0.48  SPASS spent	0:00:00.11 on the problem.
% 0.21/0.48  		0:00:00.04 for the input.
% 0.21/0.48  		0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.48  		0:00:00.00 for inferences.
% 0.21/0.48  		0:00:00.00 for the backtracking.
% 0.21/0.48  		0:00:00.01 for the reduction.
% 0.21/0.48  
% 0.21/0.48  
% 0.21/0.48  Here is a proof with depth 1, length 9 :
% 0.21/0.48  % SZS output start Refutation
% See solution above
% 0.21/0.48  Formulae used in the proof : l13_co ax40 ax41 ax42
% 0.21/0.48  
%------------------------------------------------------------------------------