%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV369+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:33 EDT 2022

% Result   : Theorem 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   2 nHn;   9 RR)
%            Number of literals    :   12 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 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(7,axiom,
    ~ contains_pq(create_pq,u),
    file('SWV369+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ contains_slb(create_slb,u),
    file('SWV369+1.p',unknown),
    [] ).

cnf(22,axiom,
    equal(i(triple(u,create_slb,v)),create_pq),
    file('SWV369+1.p',unknown),
    [] ).

cnf(49,axiom,
    ( ~ contains_cpq(triple(u,v,w),x)
    | contains_slb(v,x) ),
    file('SWV369+1.p',unknown),
    [] ).

cnf(62,axiom,
    ( contains_cpq(triple(skc3,create_slb,skc4),skc5)
    | contains_pq(i(triple(skc3,create_slb,skc4)),skc5) ),
    file('SWV369+1.p',unknown),
    [] ).

cnf(92,plain,
    ( contains_cpq(triple(skc3,create_slb,skc4),skc5)
    | contains_pq(create_pq,skc5) ),
    inference(rew,[status(thm),theory(equality)],[22,62]),
    [iquote('0:Rew:22.0,62.1')] ).

cnf(93,plain,
    contains_cpq(triple(skc3,create_slb,skc4),skc5),
    inference(mrr,[status(thm)],[92,7]),
    [iquote('0:MRR:92.1,7.0')] ).

cnf(97,plain,
    contains_slb(create_slb,skc5),
    inference(res,[status(thm),theory(equality)],[93,49]),
    [iquote('0:Res:93.0,49.0')] ).

cnf(98,plain,
    $false,
    inference(mrr,[status(thm)],[97,8]),
    [iquote('0:MRR:97.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n006.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 : Wed Jun 15 22:05:11 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  
% 0.19/0.46  SPASS V 3.9 
% 0.19/0.46  SPASS beiseite: Proof found.
% 0.19/0.46  % SZS status Theorem
% 0.19/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 87 clauses.
% 0.19/0.46  SPASS allocated 98075 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.46  		0:00:00.04 for the input.
% 0.19/0.46  		0:00:00.05 for the FLOTTER CNF translation.
% 0.19/0.46  		0:00:00.00 for inferences.
% 0.19/0.46  		0:00:00.00 for the backtracking.
% 0.19/0.46  		0:00:00.01 for the reduction.
% 0.19/0.46  
% 0.19/0.46  
% 0.19/0.46  Here is a proof with depth 1, length 9 :
% 0.19/0.46  % SZS output start Refutation
% See solution above
% 0.19/0.46  Formulae used in the proof : ax8 ax20 ax54 ax39 l5_co
% 0.19/0.46  
%------------------------------------------------------------------------------