↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWV259-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 : n004.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:16 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Message_Oparts__subset__iff_0,axiom,
    ( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_0) ).

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

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

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

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

cnf(c_0_5,axiom,
    ( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    cls_Message_Oparts__subset__iff_0 ).

cnf(c_0_6,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    cls_Set_Osubset__refl_0 ).

cnf(c_0_7,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    cls_conjecture_1 ).

cnf(c_0_8,axiom,
    ( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
    cls_Message_Oparts__subset__iff_1 ).

cnf(c_0_9,axiom,
    ( c_lessequals(X2,X4,tc_set(X3))
    | ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
    cls_Set_Oinsert__subset_1 ).

cnf(c_0_10,plain,
    c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    ~ c_lessequals(v_H,c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    c_lessequals(X1,c_Message_Oparts(c_insert(X2,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWV259-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11  % 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 : n004.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 05:00:02 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.23/1.70  % Version  : CSE_E---1.7
% 1.23/1.70  % Problem  : theBenchmark.p
% 1.23/1.70  % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.70  % SZS output start CNFRefutation
% See solution above
% 1.23/1.70  % Total time : 1.366s
%------------------------------------------------------------------------------