↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWV262-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 : n005.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.71s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   5 RR)
%            Number of literals    :   13 (  12 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   23 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Message_Oparts__Un_0,axiom,
    c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__Un_0) ).

cnf(cls_Set_OUn__insert__left_0,axiom,
    c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__insert__left_0) ).

cnf(cls_Set_OUn__empty__left_0,axiom,
    c_union(c_emptyset,X1,X2) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__empty__left_0) ).

cnf(c_0_4,negated_conjecture,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    cls_conjecture_0 ).

cnf(c_0_5,axiom,
    c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),
    cls_Message_Oparts__Un_0 ).

cnf(c_0_6,axiom,
    c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
    cls_Set_OUn__insert__left_0 ).

cnf(c_0_7,axiom,
    c_union(c_emptyset,X1,X2) = X1,
    cls_Set_OUn__empty__left_0 ).

cnf(c_0_8,negated_conjecture,
    c_Message_Oparts(c_union(c_union(c_insert(v_X,c_emptyset,tc_Message_Omsg),c_insert(v_Y,c_emptyset,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg)) != c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).

cnf(c_0_9,plain,
    c_union(c_insert(X1,c_emptyset,X2),X3,X2) = c_insert(X1,X3,X2),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    c_Message_Oparts(c_union(c_insert(v_X,c_insert(v_Y,c_emptyset,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg)) != c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,plain,
    c_union(c_insert(X1,c_insert(X2,c_emptyset,X3),X3),X4,X3) = c_insert(X1,c_insert(X2,X4,X3),X3),
    inference(spm,[status(thm)],[c_0_6,c_0_9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWV262-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.15/0.32  % Computer : n005.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 05:00:00 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.23/1.71  % Version  : CSE_E---1.7
% 1.23/1.71  % Problem  : theBenchmark.p
% 1.23/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71  % SZS output start CNFRefutation
% See solution above
% 1.23/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------