↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n028.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:12 PM UTC 2026

% Result   : Unsatisfiable 1.26s 1.71s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   31 (   8 unt;   2 nHn;  22 RR)
%            Number of literals    :   56 (   0 equ;  29 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    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   71 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

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

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),c_Message_Oanalz(c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Set_OUn__least_0,axiom,
    ( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__least_0) ).

cnf(cls_Set_OUnCI_1,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).

cnf(cls_Message_Oanalz__mono_0,axiom,
    ( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__mono_0) ).

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/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OUnCI_0,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).

cnf(cls_Message_Osynth_OInj_0,axiom,
    ( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Osynth_OInj_0) ).

cnf(c_0_9,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    cls_Set_OsubsetI_1 ).

cnf(c_0_10,axiom,
    ( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    cls_Message_Oanalz_OInj_0 ).

cnf(c_0_11,negated_conjecture,
    ~ c_lessequals(c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),c_Message_Oanalz(c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    cls_conjecture_0 ).

cnf(c_0_12,axiom,
    ( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X2,tc_set(X3)) ),
    cls_Set_OUn__least_0 ).

cnf(c_0_13,plain,
    ( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oanalz(X2),tc_Message_Omsg),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUnCI_1 ).

cnf(c_0_15,negated_conjecture,
    ( ~ c_lessequals(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Osynth(v_G),c_Message_Oanalz(c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,axiom,
    ( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    cls_Message_Oanalz__mono_0 ).

cnf(c_0_17,plain,
    ( c_lessequals(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    cls_Set_OsubsetI_0 ).

cnf(c_0_19,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUnCI_0 ).

cnf(c_0_20,negated_conjecture,
    ( ~ c_lessequals(c_union(v_G,v_H,tc_Message_Omsg),c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Osynth(v_G),c_Message_Oanalz(c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    c_lessequals(X1,c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4) ),
    inference(spm,[status(thm)],[c_0_9,c_0_19]) ).

cnf(c_0_23,plain,
    ( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4) ),
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_24,axiom,
    ( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
    | ~ c_in(X1,X2,tc_Message_Omsg) ),
    cls_Message_Osynth_OInj_0 ).

cnf(c_0_25,negated_conjecture,
    ~ c_lessequals(c_union(v_G,v_H,tc_Message_Omsg),c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_26,plain,
    c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
    inference(spm,[status(thm)],[c_0_22,c_0_18]) ).

cnf(c_0_27,plain,
    ( c_lessequals(X1,c_union(c_Message_Osynth(X2),X3,tc_Message_Omsg),tc_set(tc_Message_Omsg))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(c_Message_Osynth(X2),X3,tc_Message_Omsg),tc_Message_Omsg),X2,tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ~ c_lessequals(v_G,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_26])]) ).

cnf(c_0_29,plain,
    c_lessequals(X1,c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_27,c_0_18]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV248-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32  % Computer : n028.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 04:59:15 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.26/1.71  % Version  : CSE_E---1.7
% 1.26/1.71  % Problem  : theBenchmark.p
% 1.26/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.71  % SZS output start CNFRefutation
% See solution above
% 1.26/1.71  % Total time : 1.370s
%------------------------------------------------------------------------------