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

View Problem - Process Solution

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

% Computer : n022.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:37 EDT 2022

% Result   : Unsatisfiable 0.18s 0.44s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   25 (   6 unt;   0 nHn;  25 RR)
%            Number of literals    :   53 (   0 equ;  33 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    cowlThing(u),
    file('KRS120+1.p',unknown),
    [] ).

cnf(4,axiom,
    ca_Ax2(skf5(u)),
    file('KRS120+1.p',unknown),
    [] ).

cnf(5,axiom,
    ca_Vx3(skf8(u)),
    file('KRS120+1.p',unknown),
    [] ).

cnf(6,axiom,
    cp1xcomp(skf9(u)),
    file('KRS120+1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ ca_Ax2(u)
    | cp1(u) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ cUnsatisfiable(u)
    | rf(u,skf5(u)) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ cp1(u)
    | ~ ra_Px1(u,v) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ cp1xcomp(u)
    | ra_Px1(u,skf7(u)) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ ca_Ax2(u)
    | rinvF(u,skf8(u)) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ ca_Vx3(u)
    | rf(u,skf9(u)) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ rinvF(u,v)
    | rf(v,u) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ ca_Ax2(u)
    | ~ rf(v,u)
    | cUnsatisfiable(v) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ cowlThing(u)
    | ~ rf(u,v)
    | ~ rf(u,w)
    | equal(v,w) ),
    file('KRS120+1.p',unknown),
    [] ).

cnf(26,plain,
    ( ~ rf(u,v)
    | ~ rf(u,w)
    | equal(w,v) ),
    inference(mrr,[status(thm)],[25,1]),
    [iquote('0:MRR:25.0,1.0')] ).

cnf(30,plain,
    ( ~ cp1xcomp(u)
    | ~ cp1(u) ),
    inference(res,[status(thm),theory(equality)],[14,13]),
    [iquote('0:Res:14.1,13.1')] ).

cnf(33,plain,
    ( ~ ca_Ax2(u)
    | rf(skf8(u),u) ),
    inference(res,[status(thm),theory(equality)],[15,17]),
    [iquote('0:Res:15.1,17.0')] ).

cnf(37,plain,
    ( ~ ca_Ax2(u)
    | ~ ca_Ax2(u)
    | cUnsatisfiable(skf8(u)) ),
    inference(res,[status(thm),theory(equality)],[33,21]),
    [iquote('0:Res:33.1,21.1')] ).

cnf(38,plain,
    ( ~ ca_Ax2(u)
    | cUnsatisfiable(skf8(u)) ),
    inference(obv,[status(thm),theory(equality)],[37]),
    [iquote('0:Obv:37.0')] ).

cnf(42,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rf(u,v)
    | equal(v,skf5(u)) ),
    inference(res,[status(thm),theory(equality)],[12,26]),
    [iquote('0:Res:12.1,26.0')] ).

cnf(46,plain,
    ( ~ ca_Vx3(u)
    | ~ cUnsatisfiable(u)
    | equal(skf9(u),skf5(u)) ),
    inference(res,[status(thm),theory(equality)],[16,42]),
    [iquote('0:Res:16.1,42.1')] ).

cnf(52,plain,
    ( ~ ca_Vx3(u)
    | ~ cUnsatisfiable(u)
    | cp1xcomp(skf5(u)) ),
    inference(spr,[status(thm),theory(equality)],[46,6]),
    [iquote('0:SpR:46.2,6.0')] ).

cnf(56,plain,
    ( ~ ca_Vx3(u)
    | ~ cUnsatisfiable(u)
    | ~ ca_Ax2(skf5(u)) ),
    inference(ems,[status(thm)],[30,52,8]),
    [iquote('0:EmS:30.0,30.1,52.2,8.1')] ).

cnf(60,plain,
    ( ~ ca_Vx3(u)
    | ~ cUnsatisfiable(u) ),
    inference(ssi,[status(thm)],[56,4,52]),
    [iquote('0:SSi:56.2,4.2,52.0')] ).

cnf(62,plain,
    ~ ca_Ax2(u),
    inference(ems,[status(thm)],[60,5,38]),
    [iquote('0:EmS:60.0,60.1,5.0,38.1')] ).

cnf(63,plain,
    $false,
    inference(unc,[status(thm)],[62,4]),
    [iquote('0:UnC:62.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KRS120+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun  7 17:07:50 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  
% 0.18/0.44  SPASS V 3.9 
% 0.18/0.44  SPASS beiseite: Proof found.
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.44  SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses.
% 0.18/0.44  SPASS allocated 97778 KBytes.
% 0.18/0.44  SPASS spent	0:00:00.10 on the problem.
% 0.18/0.44  		0:00:00.04 for the input.
% 0.18/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44  		0:00:00.00 for inferences.
% 0.18/0.44  		0:00:00.00 for the backtracking.
% 0.18/0.44  		0:00:00.00 for the reduction.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Here is a proof with depth 5, length 25 :
% 0.18/0.44  % SZS output start Refutation
% See solution above
% 0.18/0.44  Formulae used in the proof : axiom_0 axiom_2 axiom_11 axiom_8 axiom_5 axiom_6 axiom_3 axiom_4 axiom_7
% 0.18/0.44  
%------------------------------------------------------------------------------