↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n023.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:31 EDT 2022

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

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

cnf(4,axiom,
    cp1(skf4(u)),
    file('KRS088+1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ cp1(skf5(u)),
    file('KRS088+1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ cUnsatisfiable(u)
    | rf(u,skf4(u)) ),
    file('KRS088+1.p',unknown),
    [] ).

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

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

cnf(15,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ rinvF(skf4(u),v)
    | rf(v,skf5(v)) ),
    file('KRS088+1.p',unknown),
    [] ).

cnf(21,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rf(u,v)
    | equal(v,skf4(u)) ),
    inference(res,[status(thm),theory(equality)],[8,13]),
    [iquote('0:Res:8.1,13.0')] ).

cnf(24,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rf(v,skf4(u))
    | rf(v,skf5(v)) ),
    inference(res,[status(thm),theory(equality)],[10,15]),
    [iquote('0:Res:10.1,15.1')] ).

cnf(25,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | rf(u,skf5(u)) ),
    inference(res,[status(thm),theory(equality)],[8,24]),
    [iquote('0:Res:8.1,24.1')] ).

cnf(26,plain,
    ( ~ cUnsatisfiable(u)
    | rf(u,skf5(u)) ),
    inference(obv,[status(thm),theory(equality)],[25]),
    [iquote('0:Obv:25.0')] ).

cnf(28,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf5(u),skf4(u)) ),
    inference(res,[status(thm),theory(equality)],[26,21]),
    [iquote('0:Res:26.1,21.1')] ).

cnf(30,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf5(u),skf4(u)) ),
    inference(obv,[status(thm),theory(equality)],[28]),
    [iquote('0:Obv:28.0')] ).

cnf(34,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cp1(skf4(u)) ),
    inference(spl,[status(thm),theory(equality)],[30,6]),
    [iquote('0:SpL:30.1,6.0')] ).

cnf(35,plain,
    ~ cUnsatisfiable(u),
    inference(mrr,[status(thm)],[34,4]),
    [iquote('0:MRR:34.1,4.0')] ).

cnf(36,plain,
    $false,
    inference(unc,[status(thm)],[35,2]),
    [iquote('0:UnC:35.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : KRS088+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n023.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 19:59:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  
% 0.19/0.44  SPASS V 3.9 
% 0.19/0.44  SPASS beiseite: Proof found.
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.44  SPASS derived 14 clauses, backtracked 0 clauses, performed 1 splits and kept 22 clauses.
% 0.19/0.44  SPASS allocated 97860 KBytes.
% 0.19/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.44  		0:00:00.04 for the input.
% 0.19/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44  		0:00:00.00 for inferences.
% 0.19/0.44  		0:00:00.00 for the backtracking.
% 0.19/0.44  		0:00:00.00 for the reduction.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Here is a proof with depth 4, length 16 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : axiom_7 axiom_2 axiom_4 axiom_3
% 0.19/0.44  
%------------------------------------------------------------------------------