↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n016.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:19:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( ~ organization(u)
    | ~ equal(external_ties(u,v),external_ties(u,w))
    | equal(position(u,v),position(u,w)) ),
    file('MGT049-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ organization(u)
    | equal(external_ties(u,v),external_ties(u,w)) ),
    file('MGT049-1.p',unknown),
    [] ).

cnf(4,axiom,
    organization(sk1),
    file('MGT049-1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ equal(position(sk1,sk2),position(sk1,sk3)),
    file('MGT049-1.p',unknown),
    [] ).

cnf(20,plain,
    equal(external_ties(sk1,u),external_ties(sk1,v)),
    inference(res,[status(thm),theory(equality)],[4,3]),
    [iquote('0:Res:4.0,3.0')] ).

cnf(24,plain,
    ( ~ organization(sk1)
    | ~ equal(external_ties(sk1,sk2),external_ties(sk1,sk3)) ),
    inference(res,[status(thm),theory(equality)],[2,6]),
    [iquote('0:Res:2.2,6.0')] ).

cnf(33,plain,
    ~ equal(external_ties(sk1,sk2),external_ties(sk1,sk3)),
    inference(mrr,[status(thm)],[24,4]),
    [iquote('0:MRR:24.0,4.0')] ).

cnf(34,plain,
    $false,
    inference(unc,[status(thm)],[33,20]),
    [iquote('0:UnC:33.0,20.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT049-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04  % Command  : run_spass %d %s
% 0.09/0.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep  7 13:21:02 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.14/0.42  
% 0.14/0.42  SPASS V 3.9 
% 0.14/0.42  SPASS beiseite: Proof found.
% 0.14/0.42  % SZS status Theorem
% 0.14/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.14/0.42  SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 20 clauses.
% 0.14/0.42  SPASS allocated 75610 KBytes.
% 0.14/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.14/0.42  		0:00:00.03 for the input.
% 0.14/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.14/0.42  		0:00:00.00 for inferences.
% 0.14/0.42  		0:00:00.00 for the backtracking.
% 0.14/0.42  		0:00:00.00 for the reduction.
% 0.14/0.42  
% 0.14/0.42  
% 0.14/0.42  Here is a proof with depth 1, length 8 :
% 0.14/0.42  % SZS output start Refutation
% See solution above
% 0.14/0.42  Formulae used in the proof : assumption_6_31 assumption_11_32 lemma_6_33 lemma_6_35
% 0.14/0.42  
%------------------------------------------------------------------------------