↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.26s 1.71s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  12 unt;   4 nHn;  10 RR)
%            Number of literals    :   30 (  15 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :   34 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Public_ONonce__supply__lemma_0,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Public_ONonce__supply__lemma_0) ).

cnf(cls_Nat_Ole__add2_0,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Ole__add2_0) ).

cnf(cls_Nat_Oop_A_L_Oadd__0_0,axiom,
    c_plus(c_0,X1,tc_nat) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Oop_A_L_Oadd__0_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( X1 = X2
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Nat_Onat__add__right__cancel_0,axiom,
    ( X1 = X3
    | c_plus(X1,X2,tc_nat) != c_plus(X3,X2,tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Onat__add__right__cancel_0) ).

cnf(cls_List_Olist_Odistinct__1_0,axiom,
    c_List_Olist_ONil != c_List_Olist_OCons(X1,X2,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_List_Olist_Odistinct__1_0) ).

cnf(c_0_6,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
    cls_Public_ONonce__supply__lemma_0 ).

cnf(c_0_7,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    cls_Nat_Ole__add2_0 ).

cnf(c_0_8,plain,
    ~ c_in(c_Message_Omsg_ONonce(c_plus(X1,v_sko__urX(X2),tc_nat)),c_Event_Oused(X2),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    c_plus(c_0,X1,tc_nat) = X1,
    cls_Nat_Oop_A_L_Oadd__0_0 ).

cnf(c_0_10,plain,
    ~ c_in(c_Message_Omsg_ONonce(v_sko__urX(X1)),c_Event_Oused(X1),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,negated_conjecture,
    ( X1 = X2
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    cls_conjecture_0 ).

cnf(c_0_12,negated_conjecture,
    ( v_sko__urX(v_evs) = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    ( X1 = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    v_sko__urX(v_evs) = v_sko__urX(v_evs_H),
    inference(spm,[status(thm)],[c_0_10,c_0_12]) ).

cnf(c_0_15,axiom,
    ( X1 = X3
    | c_plus(X1,X2,tc_nat) != c_plus(X3,X2,tc_nat) ),
    cls_Nat_Onat__add__right__cancel_0 ).

cnf(c_0_16,negated_conjecture,
    c_plus(X1,v_sko__urX(v_evs_H),tc_nat) = v_sko__urX(v_evs_H),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_14]) ).

cnf(c_0_17,axiom,
    c_List_Olist_ONil != c_List_Olist_OCons(X1,X2,X3),
    cls_List_Olist_Odistinct__1_0 ).

cnf(c_0_18,negated_conjecture,
    X1 = X2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).

cnf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV281-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.15/0.33  % Computer : n014.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 05:00:51 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % 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.369s
%------------------------------------------------------------------------------