↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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:36 EDT 2022

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            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    :    3 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(4,axiom,
    ca_Ax3(skf11(u)),
    file('KRS114+1.p',unknown),
    [] ).

cnf(5,axiom,
    ca_Ax4(skf10(u)),
    file('KRS114+1.p',unknown),
    [] ).

cnf(6,axiom,
    ca_Vx5(skf16(u)),
    file('KRS114+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ ca_Ax3(u)
    | cpxcomp(u) ),
    file('KRS114+1.p',unknown),
    [] ).

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

cnf(18,axiom,
    ( ~ cUnsatisfiable(u)
    | rs(u,skf11(u)) ),
    file('KRS114+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ cp(u)
    | ~ ra_Px1(u,v) ),
    file('KRS114+1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ cpxcomp(u)
    | ra_Px1(u,skf13(u)) ),
    file('KRS114+1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ ca_Ax4(u)
    | rinvR(u,skf16(u)) ),
    file('KRS114+1.p',unknown),
    [] ).

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

cnf(27,axiom,
    ( ~ ca_Vx5(u)
    | ~ rs(u,v)
    | cp(v) ),
    file('KRS114+1.p',unknown),
    [] ).

cnf(30,axiom,
    ( ~ ca_Ax4(u)
    | ~ rinvR(u,v)
    | ~ rinvR(u,w)
    | equal(v,w) ),
    file('KRS114+1.p',unknown),
    [] ).

cnf(41,plain,
    ( ~ cpxcomp(u)
    | ~ cp(u) ),
    inference(res,[status(thm),theory(equality)],[20,19]),
    [iquote('0:Res:20.1,19.1')] ).

cnf(44,plain,
    ( ~ cUnsatisfiable(u)
    | rinvR(skf10(u),u) ),
    inference(res,[status(thm),theory(equality)],[17,25]),
    [iquote('0:Res:17.1,25.0')] ).

cnf(47,plain,
    ( ~ cUnsatisfiable(u)
    | ~ ca_Vx5(u)
    | cp(skf11(u)) ),
    inference(res,[status(thm),theory(equality)],[18,27]),
    [iquote('0:Res:18.1,27.1')] ).

cnf(48,plain,
    ( ~ ca_Ax3(skf11(u))
    | ~ ca_Vx5(u)
    | ~ cUnsatisfiable(u) ),
    inference(ems,[status(thm)],[41,10,47]),
    [iquote('0:EmS:41.0,41.1,10.1,47.2')] ).

cnf(49,plain,
    ( ~ ca_Vx5(u)
    | ~ cUnsatisfiable(u) ),
    inference(ssi,[status(thm)],[48,4,47]),
    [iquote('0:SSi:48.0,4.2,47.0')] ).

cnf(54,plain,
    ( ~ ca_Ax4(u)
    | ~ ca_Ax4(u)
    | ~ rinvR(u,v)
    | equal(skf16(u),v) ),
    inference(res,[status(thm),theory(equality)],[23,30]),
    [iquote('0:Res:23.1,30.1')] ).

cnf(56,plain,
    ( ~ ca_Ax4(u)
    | ~ rinvR(u,v)
    | equal(skf16(u),v) ),
    inference(obv,[status(thm),theory(equality)],[54]),
    [iquote('0:Obv:54.0')] ).

cnf(59,plain,
    ( ~ cUnsatisfiable(u)
    | ~ ca_Ax4(skf10(u))
    | equal(skf16(skf10(u)),u) ),
    inference(res,[status(thm),theory(equality)],[44,56]),
    [iquote('0:Res:44.1,56.1')] ).

cnf(60,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf16(skf10(u)),u) ),
    inference(ssi,[status(thm)],[59,5]),
    [iquote('0:SSi:59.1,5.0')] ).

cnf(63,plain,
    ( ~ cUnsatisfiable(u)
    | ca_Vx5(u) ),
    inference(spr,[status(thm),theory(equality)],[60,6]),
    [iquote('0:SpR:60.1,6.0')] ).

cnf(66,plain,
    ~ cUnsatisfiable(u),
    inference(mrr,[status(thm)],[63,49]),
    [iquote('0:MRR:63.1,49.0')] ).

cnf(67,plain,
    $false,
    inference(unc,[status(thm)],[66,2]),
    [iquote('0:UnC:66.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n024.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 07:20:05 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/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 29 clauses, backtracked 0 clauses, performed 0 splits and kept 44 clauses.
% 0.19/0.46  SPASS allocated 97921 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 3, length 25 :
% 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_6 axiom_7 axiom_8 axiom_3 axiom_4 axiom_10 axiom_9
% 0.19/0.46  
%------------------------------------------------------------------------------