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

% Computer : n032.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 : Fri Jul 15 01:44:46 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(12,axiom,
    vtcheck(vempty,vvar(skc2),skc3),
    file('COM149+1.p',unknown),
    [] ).

cnf(15,axiom,
    ~ equal(vsomeType(u),vnoType),
    file('COM149+1.p',unknown),
    [] ).

cnf(17,axiom,
    equal(vlookup(u,vempty),vnoType),
    file('COM149+1.p',unknown),
    [] ).

cnf(23,axiom,
    ~ equal(vvar(u),vapp(v,w)),
    file('COM149+1.p',unknown),
    [] ).

cnf(34,axiom,
    ~ equal(vvar(u),vabs(v,w,x)),
    file('COM149+1.p',unknown),
    [] ).

cnf(87,axiom,
    ( ~ skP13(u,v,w)
    | equal(vlookup(skf101(w,u,v),v),vsomeType(u)) ),
    file('COM149+1.p',unknown),
    [] ).

cnf(111,axiom,
    ( ~ skP14(u,v,w)
    | equal(vabs(skf104(w,u,v),skf103(v,u,w),skf105(w,u,v)),w) ),
    file('COM149+1.p',unknown),
    [] ).

cnf(119,axiom,
    ( ~ vtcheck(u,v,w)
    | equal(vapp(skf100(v,w,u),skf98(w,u,v)),v)
    | skP14(u,w,v)
    | skP13(w,u,v) ),
    file('COM149+1.p',unknown),
    [] ).

cnf(960,plain,
    ( ~ skP13(u,vempty,v)
    | equal(vsomeType(u),vnoType) ),
    inference(spr,[status(thm),theory(equality)],[87,17]),
    [iquote('0:SpR:87.1,17.0')] ).

cnf(967,plain,
    ~ skP13(u,vempty,v),
    inference(mrr,[status(thm)],[960,15]),
    [iquote('0:MRR:960.1,15.0')] ).

cnf(2594,plain,
    ( ~ skP14(u,v,w)
    | ~ equal(vvar(x),w) ),
    inference(spl,[status(thm),theory(equality)],[111,34]),
    [iquote('0:SpL:111.1,34.0')] ).

cnf(3144,plain,
    ( ~ vtcheck(u,v,w)
    | ~ equal(vvar(x),v)
    | skP14(u,w,v)
    | skP13(w,u,v) ),
    inference(spl,[status(thm),theory(equality)],[119,23]),
    [iquote('0:SpL:119.1,23.0')] ).

cnf(3185,plain,
    ( ~ vtcheck(u,v,w)
    | ~ equal(vvar(x),v)
    | skP13(w,u,v) ),
    inference(mrr,[status(thm)],[3144,2594]),
    [iquote('0:MRR:3144.2,2594.0')] ).

cnf(8968,plain,
    ( ~ equal(vvar(u),vvar(skc2))
    | skP13(skc3,vempty,vvar(skc2)) ),
    inference(res,[status(thm),theory(equality)],[12,3185]),
    [iquote('0:Res:12.0,3185.0')] ).

cnf(8982,plain,
    ~ equal(vvar(u),vvar(skc2)),
    inference(mrr,[status(thm)],[8968,967]),
    [iquote('0:MRR:8968.1,967.0')] ).

cnf(8985,plain,
    $false,
    inference(eqr,[status(thm),theory(equality)],[8982]),
    [iquote('0:EqR:8982.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.08  % Problem  : COM149+1 : TPTP v8.1.0. Released v6.4.0.
% 0.06/0.08  % Command  : run_spass %d %s
% 0.08/0.27  % Computer : n032.cluster.edu
% 0.08/0.27  % Model    : x86_64 x86_64
% 0.08/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27  % Memory   : 8042.1875MB
% 0.08/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27  % CPULimit : 300
% 0.08/0.27  % WCLimit  : 600
% 0.08/0.27  % DateTime : Thu Jun 16 20:07:30 EDT 2022
% 0.08/0.27  % CPUTime  : 
% 3.25/3.48  
% 3.25/3.48  SPASS V 3.9 
% 3.25/3.48  SPASS beiseite: Proof found.
% 3.25/3.48  % SZS status Theorem
% 3.25/3.48  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 3.25/3.48  SPASS derived 7305 clauses, backtracked 0 clauses, performed 1 splits and kept 3336 clauses.
% 3.25/3.48  SPASS allocated 107730 KBytes.
% 3.25/3.48  SPASS spent	0:00:03.11 on the problem.
% 3.25/3.48  		0:00:00.03 for the input.
% 3.25/3.48  		0:00:00.25 for the FLOTTER CNF translation.
% 3.25/3.48  		0:00:00.12 for inferences.
% 3.25/3.48  		0:00:00.00 for the backtracking.
% 3.25/3.48  		0:00:02.64 for the reduction.
% 3.25/3.48  
% 3.25/3.48  
% 3.25/3.48  Here is a proof with depth 3, length 16 :
% 3.25/3.48  % SZS output start Refutation
% See solution above
% 3.25/3.48  Formulae used in the proof : T_a45_Progress_a45_T_a45_var DIFF_a45_noType_a45_someType lookup0 DIFF_a45_var_a45_app DIFF_a45_var_a45_abs T_a45_inv lookup1 T_a45_var T_a45_abs
% 3.25/3.48  
%------------------------------------------------------------------------------