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

View Problem - Process Solution

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

% Computer : n008.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 0.20s 0.41s
% Output   : Refutation 0.20s
% 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(1,axiom,
    c_lessequals(u,c_Message_Oparts(u),tc_set(tc_Message_Omsg)),
    file('SWV267-2.p',unknown),
    [] ).

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

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

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

cnf(5,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)],[2,4]),
    [iquote('0:Res:2.2,4.0')] ).

cnf(8,plain,
    ~ c_lessequals(v_G,c_Message_Oparts(v_G),tc_set(tc_Message_Omsg)),
    inference(res,[status(thm),theory(equality)],[3,5]),
    [iquote('0:Res:3.0,5.0')] ).

cnf(9,plain,
    $false,
    inference(mrr,[status(thm)],[8,1]),
    [iquote('0:MRR:8.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV267-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun 15 09:22:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.41  
% 0.20/0.41  SPASS V 3.9 
% 0.20/0.41  SPASS beiseite: Proof found.
% 0.20/0.41  % SZS status Theorem
% 0.20/0.41  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.41  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 8 clauses.
% 0.20/0.41  SPASS allocated 63082 KBytes.
% 0.20/0.41  SPASS spent	0:00:00.05 on the problem.
% 0.20/0.41  		0:00:00.03 for the input.
% 0.20/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41  		0:00:00.00 for inferences.
% 0.20/0.41  		0:00:00.00 for the backtracking.
% 0.20/0.41  		0:00:00.00 for the reduction.
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Here is a proof with depth 2, length 7 :
% 0.20/0.41  % SZS output start Refutation
% See solution above
% 0.20/0.41  Formulae used in the proof : cls_Message_Oparts__increasing_0 cls_Set_Osubset__trans_0 cls_conjecture_0 cls_conjecture_1
% 0.20/0.41  
%------------------------------------------------------------------------------