TSTP Solution File: LCL670+1.001 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL670+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n018.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 : Sun Jul 17 14:38:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    r1(skc5,skc14),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(6,axiom,
    r1(u,u),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(8,axiom,
    r1(u,skf17(u)),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(10,axiom,
    r1(u,skf15(u)),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(12,axiom,
    r1(u,skf13(u)),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(13,axiom,
    r1(u,skf12(u)),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(14,axiom,
    r1(u,skf10(u)),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ p2(skf15(u))
    | ~ r1(skc14,u) ),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ skP1(u)
    | ~ r1(u,v)
    | p2(v) ),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ r1(u,v)
    | ~ r1(skc5,u)
    | p2(skf10(v)) ),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ p2(u)
    | ~ r1(skc5,v)
    | ~ r1(skf13(v),u)
    | skP0(v) ),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ skP0(u)
    | ~ r1(v,w)
    | ~ r1(u,v)
    | p2(skf17(w)) ),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ p2(u)
    | ~ p2(v)
    | ~ r1(w,v)
    | ~ r1(v,x)
    | ~ r1(skc5,w)
    | ~ r1(skf12(x),u)
    | skP1(v) ),
    file('LCL670+1.001.p',unknown),
    [] ).

cnf(67,plain,
    ( ~ skP1(u)
    | p2(skf15(u)) ),
    inference(res,[status(thm),theory(equality)],[10,20]),
    [iquote('0:Res:10.0,20.1')] ).

cnf(95,plain,
    ( ~ r1(skc5,u)
    | p2(skf10(skf13(u))) ),
    inference(res,[status(thm),theory(equality)],[12,21]),
    [iquote('0:Res:12.0,21.0')] ).

cnf(108,plain,
    ( ~ p2(skf10(skf13(u)))
    | ~ r1(skc5,u)
    | skP0(u) ),
    inference(res,[status(thm),theory(equality)],[14,24]),
    [iquote('0:Res:14.0,24.2')] ).

cnf(116,plain,
    ( ~ r1(skc5,u)
    | skP0(u) ),
    inference(mrr,[status(thm)],[108,95]),
    [iquote('0:MRR:108.0,95.1')] ).

cnf(119,plain,
    ( ~ skP0(u)
    | ~ r1(u,skc5)
    | p2(skf17(skc14)) ),
    inference(res,[status(thm),theory(equality)],[1,25]),
    [iquote('0:Res:1.0,25.1')] ).

cnf(124,plain,
    ( ~ skP0(u)
    | ~ r1(u,v)
    | p2(skf17(skf12(v))) ),
    inference(res,[status(thm),theory(equality)],[13,25]),
    [iquote('0:Res:13.0,25.1')] ).

cnf(133,plain,
    ( ~ skP1(u)
    | ~ r1(skc14,u) ),
    inference(res,[status(thm),theory(equality)],[67,19]),
    [iquote('0:Res:67.1,19.0')] ).

cnf(135,plain,
    skP0(skc14),
    inference(res,[status(thm),theory(equality)],[1,116]),
    [iquote('0:Res:1.0,116.0')] ).

cnf(136,plain,
    skP0(skc5),
    inference(res,[status(thm),theory(equality)],[6,116]),
    [iquote('0:Res:6.0,116.0')] ).

cnf(169,plain,
    ( ~ p2(skf17(skf12(u)))
    | ~ p2(v)
    | ~ r1(w,v)
    | ~ r1(v,u)
    | ~ r1(skc5,w)
    | skP1(v) ),
    inference(res,[status(thm),theory(equality)],[8,29]),
    [iquote('0:Res:8.0,29.5')] ).

cnf(178,plain,
    ~ skP1(skf17(skc14)),
    inference(res,[status(thm),theory(equality)],[8,133]),
    [iquote('0:Res:8.0,133.1')] ).

cnf(182,plain,
    ( ~ skP0(skc5)
    | p2(skf17(skc14)) ),
    inference(res,[status(thm),theory(equality)],[6,119]),
    [iquote('0:Res:6.0,119.1')] ).

cnf(183,plain,
    p2(skf17(skc14)),
    inference(ssi,[status(thm)],[182,136]),
    [iquote('0:SSi:182.0,136.0')] ).

cnf(410,plain,
    ( ~ p2(u)
    | ~ skP0(v)
    | ~ r1(w,u)
    | ~ r1(u,x)
    | ~ r1(skc5,w)
    | ~ r1(v,x)
    | skP1(u) ),
    inference(sor,[status(thm)],[169,124]),
    [iquote('0:SoR:169.0,124.2')] ).

cnf(626,plain,
    ( ~ p2(skf17(u))
    | ~ skP0(v)
    | ~ r1(skf17(u),w)
    | ~ r1(skc5,u)
    | ~ r1(v,w)
    | skP1(skf17(u)) ),
    inference(res,[status(thm),theory(equality)],[8,410]),
    [iquote('0:Res:8.0,410.2')] ).

cnf(1668,plain,
    ( ~ skP0(u)
    | ~ r1(skf17(skc14),v)
    | ~ r1(skc5,skc14)
    | ~ r1(u,v)
    | skP1(skf17(skc14)) ),
    inference(sor,[status(thm)],[626,183]),
    [iquote('0:SoR:626.0,183.0')] ).

cnf(1674,plain,
    ( ~ skP0(u)
    | ~ r1(skf17(skc14),v)
    | ~ r1(u,v) ),
    inference(mrr,[status(thm)],[1668,1,178]),
    [iquote('0:MRR:1668.2,1668.4,1.0,178.0')] ).

cnf(1677,plain,
    ( ~ skP0(u)
    | ~ r1(u,skf17(skc14)) ),
    inference(res,[status(thm),theory(equality)],[6,1674]),
    [iquote('0:Res:6.0,1674.1')] ).

cnf(1688,plain,
    ~ skP0(skc14),
    inference(res,[status(thm),theory(equality)],[8,1677]),
    [iquote('0:Res:8.0,1677.1')] ).

cnf(1689,plain,
    $false,
    inference(ssi,[status(thm)],[1688,135]),
    [iquote('0:SSi:1688.0,135.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL670+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n018.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul  4 00:41:35 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.55/0.75  
% 0.55/0.75  SPASS V 3.9 
% 0.55/0.75  SPASS beiseite: Proof found.
% 0.55/0.75  % SZS status Theorem
% 0.55/0.75  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.55/0.75  SPASS derived 1544 clauses, backtracked 0 clauses, performed 0 splits and kept 932 clauses.
% 0.55/0.75  SPASS allocated 99474 KBytes.
% 0.55/0.75  SPASS spent	0:00:00.40 on the problem.
% 0.55/0.75  		0:00:00.04 for the input.
% 0.55/0.75  		0:00:00.03 for the FLOTTER CNF translation.
% 0.55/0.75  		0:00:00.03 for inferences.
% 0.55/0.75  		0:00:00.00 for the backtracking.
% 0.55/0.75  		0:00:00.26 for the reduction.
% 0.55/0.75  
% 0.55/0.75  
% 0.55/0.75  Here is a proof with depth 6, length 33 :
% 0.55/0.75  % SZS output start Refutation
% See solution above
% 0.55/0.75  Formulae used in the proof : main reflexivity
% 0.55/0.75  
%------------------------------------------------------------------------------