↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n020.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:01 AM UTC 2026

% Result   : Theorem 0.22s 0.54s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    5 (   4 unt;   0 nHn;   5 RR)
%            Number of literals    :    7 (   0 equ;   3 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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    is_verdict(conflict),
    file('MGT093+1.p',unknown),
    [] ).

cnf(2,axiom,
    is_verdict(compatible),
    file('MGT093+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ equal(xone_verdict(compatible,conflict),compatible),
    file('MGT093+1.p',unknown),
    [] ).

cnf(32,axiom,
    ( ~ is_verdict(compatible)
    | ~ is_verdict(conflict)
    | equal(xone_verdict(compatible,conflict),compatible) ),
    file('MGT093+1.p',unknown),
    [] ).

cnf(66,plain,
    $false,
    inference(mrr,[status(thm)],[32,2,1,8]),
    [iquote('0:MRR:32.0,32.1,32.2,2.0,1.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03  % Command  : run_spass %d %s
% 0.09/0.34  % Computer : n020.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Mon Sep  7 14:02:13 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.22/0.54  
% 0.22/0.54  SPASS V 3.9 
% 0.22/0.54  SPASS beiseite: Proof found.
% 0.22/0.54  % SZS status Theorem
% 0.22/0.54  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.54  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.22/0.54  SPASS allocated 98187 KBytes.
% 0.22/0.54  SPASS spent	0:00:00.18 on the problem.
% 0.22/0.54  		0:00:00.06 for the input.
% 0.22/0.54  		0:00:00.07 for the FLOTTER CNF translation.
% 0.22/0.54  		0:00:00.00 for inferences.
% 0.22/0.54  		0:00:00.00 for the backtracking.
% 0.22/0.54  		0:00:00.00 for the reduction.
% 0.22/0.54  
% 0.22/0.54  
% 0.22/0.54  Here is a proof with depth 0, length 5 :
% 0.22/0.54  % SZS output start Refutation
% See solution above
% 0.22/0.54  Formulae used in the proof : conflict_is_verdict compatible_is_verdict odrl644 xone_compat
% 0.22/0.54  
%------------------------------------------------------------------------------