TSTP Solution File: KRS128+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n025.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 03:30:38 EDT 2022

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   17 (   4 unt;   0 nHn;  17 RR)
%            Number of literals    :   36 (   0 equ;  24 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    cUnsatisfiable(i2003_11_14_17_22_31584),
    file('KRS128+1.p',unknown),
    [] ).

cnf(4,axiom,
    cexcomp(skf9(u)),
    file('KRS128+1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf9(u)) ),
    file('KRS128+1.p',unknown),
    [] ).

cnf(22,axiom,
    ( ~ ca_Cx4(u)
    | ra_Px4(u,skf16(u)) ),
    file('KRS128+1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ ca_Cx4xcomp(u)
    | ~ ra_Px4(u,v) ),
    file('KRS128+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ cexcomp(u)
    | ~ cd(u)
    | ca_Cx4xcomp(u) ),
    file('KRS128+1.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | cd(v) ),
    file('KRS128+1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | ca_Cx4(v) ),
    file('KRS128+1.p',unknown),
    [] ).

cnf(62,plain,
    ( ~ ca_Cx4(u)
    | ~ ca_Cx4xcomp(u) ),
    inference(res,[status(thm),theory(equality)],[22,23]),
    [iquote('0:Res:22.1,23.1')] ).

cnf(65,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | ca_Cx4(skf9(u)) ),
    inference(res,[status(thm),theory(equality)],[17,26]),
    [iquote('0:Res:17.1,26.1')] ).

cnf(66,plain,
    ( ~ cUnsatisfiable(u)
    | ca_Cx4(skf9(u)) ),
    inference(obv,[status(thm),theory(equality)],[65]),
    [iquote('0:Obv:65.0')] ).

cnf(67,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cd(skf9(u))
    | ~ cexcomp(skf9(u)) ),
    inference(ems,[status(thm)],[62,66,24]),
    [iquote('0:EmS:62.0,62.1,66.1,24.2')] ).

cnf(68,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cd(skf9(u)) ),
    inference(ssi,[status(thm)],[67,4,66]),
    [iquote('0:SSi:67.2,4.1,66.0')] ).

cnf(69,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | cd(skf9(u)) ),
    inference(res,[status(thm),theory(equality)],[17,25]),
    [iquote('0:Res:17.1,25.1')] ).

cnf(70,plain,
    ( ~ cUnsatisfiable(u)
    | cd(skf9(u)) ),
    inference(obv,[status(thm),theory(equality)],[69]),
    [iquote('0:Obv:69.0')] ).

cnf(71,plain,
    ~ cUnsatisfiable(u),
    inference(mrr,[status(thm)],[70,68]),
    [iquote('0:MRR:70.1,68.1')] ).

cnf(72,plain,
    $false,
    inference(unc,[status(thm)],[71,2]),
    [iquote('0:UnC:71.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS128+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n025.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 13:42:04 EDT 2022
% 0.12/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 20 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses.
% 0.19/0.46  SPASS allocated 97846 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.46  		0:00:00.04 for the input.
% 0.19/0.46  		0:00:00.04 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.00 for the reduction.
% 0.19/0.46  
% 0.19/0.46  
% 0.19/0.46  Here is a proof with depth 2, length 17 :
% 0.19/0.46  % SZS output start Refutation
% See solution above
% 0.19/0.46  Formulae used in the proof : axiom_11 axiom_2 axiom_10 axiom_8 axiom_9
% 0.19/0.46  
%------------------------------------------------------------------------------