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

View Problem - Process Solution

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

% Computer : n009.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 14.47s 14.66s
% Output   : Refutation 14.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (  15 unt;   0 nHn;  17 RR)
%            Number of literals    :   19 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    equal(c_Message_Oparts(c_Message_Oparts(u)),c_Message_Oparts(u)),
    file('SWV268-1.p',unknown),
    [] ).

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

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

cnf(121,axiom,
    c_lessequals(u,u,tc_set(v)),
    file('SWV268-1.p',unknown),
    [] ).

cnf(2601,axiom,
    ( ~ c_lessequals(u,v,tc_set(w))
    | equal(c_minus(u,v,tc_set(w)),c_emptyset) ),
    file('SWV268-1.p',unknown),
    [] ).

cnf(2640,axiom,
    equal(c_union(u,c_minus(v,u,tc_set(w)),w),c_union(u,v,w)),
    file('SWV268-1.p',unknown),
    [] ).

cnf(2648,axiom,
    equal(c_union(u,c_emptyset,v),u),
    file('SWV268-1.p',unknown),
    [] ).

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

cnf(2777,axiom,
    equal(c_union(c_Message_Oparts(u),c_Message_Oparts(v),tc_Message_Omsg),c_Message_Oparts(c_union(u,v,tc_Message_Omsg))),
    file('SWV268-1.p',unknown),
    [] ).

cnf(2977,plain,
    equal(c_minus(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),c_emptyset),
    inference(res,[status(thm),theory(equality)],[8,2601]),
    [iquote('0:Res:8.0,2601.0')] ).

cnf(28278,plain,
    equal(c_union(c_Message_Oparts(v_H),c_emptyset,tc_Message_Omsg),c_union(c_Message_Oparts(v_H),v_G,tc_Message_Omsg)),
    inference(spr,[status(thm),theory(equality)],[2977,2640]),
    [iquote('0:SpR:2977.0,2640.0')] ).

cnf(28289,plain,
    equal(c_union(c_Message_Oparts(v_H),v_G,tc_Message_Omsg),c_Message_Oparts(v_H)),
    inference(rew,[status(thm),theory(equality)],[2648,28278]),
    [iquote('0:Rew:2648.0,28278.0')] ).

cnf(44124,plain,
    c_lessequals(u,c_union(v,u,w),tc_set(w)),
    inference(res,[status(thm),theory(equality)],[121,2655]),
    [iquote('0:Res:121.0,2655.0')] ).

cnf(44141,plain,
    c_lessequals(c_Message_Oparts(u),c_Message_Oparts(c_union(v,u,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(spr,[status(thm),theory(equality)],[2777,44124]),
    [iquote('0:SpR:2777.0,44124.0')] ).

cnf(47362,plain,
    c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(c_Message_Oparts(v_H)),tc_set(tc_Message_Omsg)),
    inference(spr,[status(thm),theory(equality)],[28289,44141]),
    [iquote('0:SpR:28289.0,44141.0')] ).

cnf(47369,plain,
    c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(rew,[status(thm),theory(equality)],[3,47362]),
    [iquote('0:Rew:3.0,47362.0')] ).

cnf(47370,plain,
    $false,
    inference(mrr,[status(thm)],[47369,9]),
    [iquote('0:MRR:47369.0,9.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SWV268-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n009.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun 14 18:51:23 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 14.47/14.66  
% 14.47/14.66  SPASS V 3.9 
% 14.47/14.66  SPASS beiseite: Proof found.
% 14.47/14.66  % SZS status Theorem
% 14.47/14.66  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 14.47/14.66  SPASS derived 36269 clauses, backtracked 71 clauses, performed 3 splits and kept 8215 clauses.
% 14.47/14.66  SPASS allocated 104864 KBytes.
% 14.47/14.66  SPASS spent	0:0:13.78 on the problem.
% 14.47/14.66  		0:00:00.24 for the input.
% 14.47/14.66  		0:00:00.00 for the FLOTTER CNF translation.
% 14.47/14.66  		0:00:00.74 for inferences.
% 14.47/14.66  		0:00:00.00 for the backtracking.
% 14.47/14.66  		0:0:11.99 for the reduction.
% 14.47/14.66  
% 14.47/14.66  
% 14.47/14.66  Here is a proof with depth 3, length 17 :
% 14.47/14.66  % SZS output start Refutation
% See solution above
% 14.47/14.66  Formulae used in the proof : cls_Message_Oparts__idem_0 cls_conjecture_0 cls_conjecture_1 cls_Set_Osubset__refl_0 cls_Set_ODiff__eq__empty__iff_1 cls_Set_OUn__Diff__cancel_0 cls_Set_OUn__empty__right_0 cls_Set_OUn__subset__iff_1 cls_Message_Oparts__Un_0
% 14.47/14.66  
%------------------------------------------------------------------------------