↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MGT112+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:20:02 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.45s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   18 (  12 unt;   0 nHn;  18 RR)
%            Number of literals    :   45 (   0 equ;  34 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(8,axiom,
    position(db),
    file('MGT112+1.p',unknown),
    [] ).

cnf(14,axiom,
    disability(db),
    file('MGT112+1.p',unknown),
    [] ).

cnf(15,axiom,
    rule(f2),
    file('MGT112+1.p',unknown),
    [] ).

cnf(16,axiom,
    proh(f2),
    file('MGT112+1.p',unknown),
    [] ).

cnf(20,axiom,
    bearer(db,museen),
    file('MGT112+1.p',unknown),
    [] ).

cnf(21,axiom,
    aee(f2,bibliothek),
    file('MGT112+1.p',unknown),
    [] ).

cnf(22,axiom,
    aer(f2,museen),
    file('MGT112+1.p',unknown),
    [] ).

cnf(23,axiom,
    act(f2,read),
    file('MGT112+1.p',unknown),
    [] ).

cnf(24,axiom,
    tgt(f2,museum_api),
    file('MGT112+1.p',unknown),
    [] ).

cnf(28,axiom,
    cnt(db,read,museum_api),
    file('MGT112+1.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ disability(u)
    | ~ proh(v)
    | ~ bearer(u,w)
    | ~ tgt(v,x)
    | ~ aee(v,y)
    | ~ aer(v,w)
    | ~ act(v,z)
    | ~ cnt(u,z,x) ),
    file('MGT112+1.p',unknown),
    [] ).

cnf(46,plain,
    ( ~ disability(db)
    | ~ proh(u)
    | ~ bearer(db,v)
    | ~ tgt(u,museum_api)
    | ~ aee(u,w)
    | ~ aer(u,v)
    | ~ act(u,read) ),
    inference(res,[status(thm),theory(equality)],[28,29]),
    [iquote('0:Res:28.0,29.7')] ).

cnf(50,plain,
    ( ~ proh(u)
    | ~ bearer(db,v)
    | ~ tgt(u,museum_api)
    | ~ aee(u,w)
    | ~ aer(u,v)
    | ~ act(u,read) ),
    inference(ssi,[status(thm)],[46,14,8]),
    [iquote('0:SSi:46.0,14.0,8.0')] ).

cnf(51,plain,
    ( ~ proh(u)
    | ~ tgt(u,museum_api)
    | ~ aee(u,v)
    | ~ aer(u,museen)
    | ~ act(u,read) ),
    inference(res,[status(thm),theory(equality)],[20,50]),
    [iquote('0:Res:20.0,50.1')] ).

cnf(52,plain,
    ( ~ proh(f2)
    | ~ aee(f2,u)
    | ~ aer(f2,museen)
    | ~ act(f2,read) ),
    inference(res,[status(thm),theory(equality)],[24,51]),
    [iquote('0:Res:24.0,51.1')] ).

cnf(53,plain,
    ( ~ aee(f2,u)
    | ~ aer(f2,museen)
    | ~ act(f2,read) ),
    inference(ssi,[status(thm)],[52,15,16]),
    [iquote('0:SSi:52.0,15.0,16.0')] ).

cnf(54,plain,
    ~ aee(f2,u),
    inference(mrr,[status(thm)],[53,22,23]),
    [iquote('0:MRR:53.1,53.2,22.0,23.0')] ).

cnf(55,plain,
    $false,
    inference(unc,[status(thm)],[54,21]),
    [iquote('0:UnC:54.0,21.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT112+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04  % Command  : run_spass %d %s
% 0.08/0.36  % Computer : n015.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep  7 14:09:45 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.14/0.45  
% 0.14/0.45  SPASS V 3.9 
% 0.14/0.45  SPASS beiseite: Proof found.
% 0.14/0.45  % SZS status Theorem
% 0.14/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.14/0.45  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 32 clauses.
% 0.14/0.45  SPASS allocated 97764 KBytes.
% 0.14/0.45  SPASS spent	0:00:00.08 on the problem.
% 0.14/0.45  		0:00:00.03 for the input.
% 0.14/0.45  		0:00:00.02 for the FLOTTER CNF translation.
% 0.14/0.45  		0:00:00.00 for inferences.
% 0.14/0.45  		0:00:00.00 for the backtracking.
% 0.14/0.45  		0:00:00.00 for the reduction.
% 0.14/0.45  
% 0.14/0.45  
% 0.14/0.45  Here is a proof with depth 3, length 18 :
% 0.14/0.45  % SZS output start Refutation
% See solution above
% 0.14/0.45  Formulae used in the proof : pos_db disability_db rule_f2 proh_f2 bearer_db aee_f2 aer_f2 act_f2 tgt_f2 cnt_db ax_disability_block
% 0.14/0.45  
%------------------------------------------------------------------------------