↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWV239-2 : TPTP v9.2.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n001.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  : 300s
% DateTime : Tue May  5 05:21:09 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Message_Oanalz__subset__cong_0,axiom,
    ( c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__cong_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

cnf(cls_Message_Oanalz__analzD__dest_0,axiom,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__analzD__dest_0) ).

cnf(cls_Set_Osubset__refl_0,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

cnf(i_0_6,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    cls_conjecture_0,
    [final] ).

cnf(i_0_7,axiom,
    ( c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg)) ),
    cls_Message_Oanalz__subset__cong_0,
    [final] ).

cnf(i_0_8,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    cls_Set_OsubsetI_1,
    [final] ).

cnf(i_0_9,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    cls_Set_OsubsetI_0,
    [final] ).

cnf(i_0_10,axiom,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg) ),
    cls_Message_Oanalz__analzD__dest_0,
    [final] ).

cnf(i_0_11,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    cls_Set_Osubset__refl_0,
    [final] ).

cnf(i_0_12,plain,
    ~ c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg)),
    inference(scs_inference,[],[i_0_6,i_0_11,i_0_7]) ).

cnf(i_0_13,plain,
    c_lessequals(X1,X1,tc_set(X2)),
    inference(rename_variables,[],[i_0_11]) ).

cnf(i_0_14,plain,
    ( c_lessequals(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Oanalz(c_union(X3,X4,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X2),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X3),tc_set(tc_Message_Omsg)) ),
    inference(rename_variables,[],[i_0_7]) ).

cnf(i_0_15,plain,
    c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg),
    inference(scs_inference,[],[i_0_6,i_0_11,i_0_7,i_0_9]) ).

cnf(i_0_16,plain,
    ( c_lessequals(X1,X2,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
    inference(rename_variables,[],[i_0_9]) ).

cnf(i_0_17,plain,
    c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(v_G),tc_Message_Omsg),
    inference(scs_inference,[],[i_0_6,i_0_11,i_0_7,i_0_9,i_0_10]) ).

cnf(i_0_18,plain,
    ( ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
    inference(rename_variables,[],[i_0_10]) ).

cnf(i_0_19,plain,
    $false,
    inference(scs_inference,[],[i_0_6,i_0_11,i_0_7,i_0_9,i_0_10,i_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV239-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n001.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 05:00:03 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 0.26/1.62  % Version  : CSE_E---1.7
% 0.26/1.62  % Problem  : theBenchmark.p
% 0.26/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.62  % SZS output start CNFRefutation
% See solution above
% 0.26/1.65  % Total time : 1.271s
%------------------------------------------------------------------------------