TSTP Solution File: SWV267-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV267-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n026.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 : Wed Jul 20 21:41:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    c_lessequals(u,c_Message_Oparts(u),tc_set(tc_Message_Omsg)),
    file('SWV267-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ c_lessequals(u,v,tc_set(w))
    | ~ c_lessequals(v,x,tc_set(w))
    | c_lessequals(u,x,tc_set(w)) ),
    file('SWV267-1.p',unknown),
    [] ).

cnf(8,axiom,
    c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('SWV267-1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('SWV267-1.p',unknown),
    [] ).

cnf(2976,plain,
    ( ~ c_lessequals(u,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_G,u,tc_set(tc_Message_Omsg)) ),
    inference(res,[status(thm),theory(equality)],[7,9]),
    [iquote('0:Res:7.2,9.0')] ).

cnf(3072,plain,
    ~ c_lessequals(v_G,c_Message_Oparts(v_G),tc_set(tc_Message_Omsg)),
    inference(res,[status(thm),theory(equality)],[8,2976]),
    [iquote('0:Res:8.0,2976.0')] ).

cnf(3074,plain,
    $false,
    inference(mrr,[status(thm)],[3072,4]),
    [iquote('0:MRR:3072.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV267-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n026.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 : Wed Jun 15 03:20:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.28/1.54  
% 1.28/1.54  SPASS V 3.9 
% 1.28/1.54  SPASS beiseite: Proof found.
% 1.28/1.54  % SZS status Theorem
% 1.28/1.54  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.28/1.54  SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 2662 clauses.
% 1.28/1.54  SPASS allocated 79976 KBytes.
% 1.28/1.54  SPASS spent	0:00:01.14 on the problem.
% 1.28/1.54  		0:00:00.19 for the input.
% 1.28/1.54  		0:00:00.00 for the FLOTTER CNF translation.
% 1.28/1.54  		0:00:00.00 for inferences.
% 1.28/1.54  		0:00:00.00 for the backtracking.
% 1.28/1.54  		0:00:00.63 for the reduction.
% 1.28/1.54  
% 1.28/1.54  
% 1.28/1.54  Here is a proof with depth 2, length 7 :
% 1.28/1.54  % SZS output start Refutation
% See solution above
% 1.28/1.54  Formulae used in the proof : cls_Message_Oparts__increasing_0 cls_Set_Osubset__trans_0 cls_conjecture_0 cls_conjecture_1
% 1.28/1.54  
%------------------------------------------------------------------------------