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

% Computer : n007.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.20s 0.46s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   14 (   8 unt;   2 nHn;  14 RR)
%            Number of literals    :   20 (   0 equ;   9 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    :   13 (  13 usr;   8 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(9,axiom,
    equal(findmin_cpq_res(u),removemin_cpq_res(u)),
    file('SWV373+1.p',unknown),
    [] ).

cnf(10,axiom,
    ok(findmin_cpq_eff(triple(skc3,skc4,skc5))),
    file('SWV373+1.p',unknown),
    [] ).

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

cnf(29,axiom,
    ~ contains_cpq(triple(skc3,skc4,skc5),findmin_cpq_res(triple(skc3,skc4,skc5))),
    file('SWV373+1.p',unknown),
    [] ).

cnf(30,axiom,
    ( ~ ok(findmin_cpq_eff(triple(u,v,w)))
    | ~ equal(v,create_slb) ),
    file('SWV373+1.p',unknown),
    [] ).

cnf(31,axiom,
    ( ~ ok(findmin_cpq_eff(triple(u,v,w)))
    | contains_slb(v,findmin_pqp_res(u)) ),
    file('SWV373+1.p',unknown),
    [] ).

cnf(35,axiom,
    ( equal(findmin_cpq_res(triple(u,v,w)),findmin_pqp_res(u))
    | equal(v,create_slb) ),
    file('SWV373+1.p',unknown),
    [] ).

cnf(58,plain,
    ( equal(u,create_slb)
    | equal(removemin_cpq_res(triple(v,u,w)),findmin_pqp_res(v)) ),
    inference(rew,[status(thm),theory(equality)],[9,35]),
    [iquote('0:Rew:9.0,35.0')] ).

cnf(59,plain,
    ~ contains_cpq(triple(skc3,skc4,skc5),removemin_cpq_res(triple(skc3,skc4,skc5))),
    inference(rew,[status(thm),theory(equality)],[9,29]),
    [iquote('0:Rew:9.0,29.0')] ).

cnf(63,plain,
    contains_slb(skc4,findmin_pqp_res(skc3)),
    inference(res,[status(thm),theory(equality)],[10,31]),
    [iquote('0:Res:10.0,31.0')] ).

cnf(64,plain,
    ~ equal(skc4,create_slb),
    inference(res,[status(thm),theory(equality)],[10,30]),
    [iquote('0:Res:10.0,30.1')] ).

cnf(65,plain,
    ~ contains_slb(skc4,removemin_cpq_res(triple(skc3,skc4,skc5))),
    inference(res,[status(thm),theory(equality)],[27,59]),
    [iquote('0:Res:27.1,59.0')] ).

cnf(88,plain,
    ( ~ contains_slb(skc4,findmin_pqp_res(skc3))
    | equal(skc4,create_slb) ),
    inference(spl,[status(thm),theory(equality)],[58,65]),
    [iquote('0:SpL:58.1,65.0')] ).

cnf(90,plain,
    $false,
    inference(mrr,[status(thm)],[88,63,64]),
    [iquote('0:MRR:88.0,88.1,63.0,64.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n007.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 10:29:40 EDT 2022
% 0.13/0.35  % 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/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.46  SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 64 clauses.
% 0.20/0.46  SPASS allocated 85355 KBytes.
% 0.20/0.46  SPASS spent	0:00:00.10 on the problem.
% 0.20/0.46  		0:00:00.03 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 2, length 14 :
% 0.20/0.46  % SZS output start Refutation
% See solution above
% 0.20/0.46  Formulae used in the proof : ax53 l9_co ax39 l9_l10 ax51
% 0.20/0.46  
%------------------------------------------------------------------------------