↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET821-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 : n017.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:08:33 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.72s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   30 (  11 unt;  13 nHn;  22 RR)
%            Number of literals    :   61 (  17 equ;  17 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   41 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
    ( c_in(v_c,X1,tc_IntDef_Oint)
    | c_in(v_a,X1,tc_IntDef_Oint)
    | ~ c_in(v_b,X1,tc_IntDef_Oint) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).

cnf(cls_Set_OinsertE_0,axiom,
    ( c_in(X1,X3,X4)
    | X1 = X2
    | ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).

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

cnf(cls_Set_OinsertCI_0,axiom,
    ( c_in(X1,c_insert(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_less(v_b,v_c,tc_IntDef_Oint),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Orderings_Oorder__less__irrefl__iff1_0,axiom,
    ( ~ class_Orderings_Oorder(X1)
    | ~ c_less(X2,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__irrefl__iff1_0) ).

cnf(clsarity_IntDef__Oint_31,axiom,
    class_Orderings_Oorder(tc_IntDef_Oint),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_IntDef__Oint_31) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_less(v_a,v_b,tc_IntDef_Oint),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_9,negated_conjecture,
    ( c_in(v_c,X1,tc_IntDef_Oint)
    | c_in(v_a,X1,tc_IntDef_Oint)
    | ~ c_in(v_b,X1,tc_IntDef_Oint) ),
    cls_conjecture_2 ).

cnf(c_0_10,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_OinsertCI_1 ).

cnf(c_0_11,axiom,
    ( c_in(X1,X3,X4)
    | X1 = X2
    | ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
    cls_Set_OinsertE_0 ).

cnf(c_0_12,negated_conjecture,
    ( c_in(v_c,c_insert(v_b,X1,tc_IntDef_Oint),tc_IntDef_Oint)
    | c_in(v_a,c_insert(v_b,X1,tc_IntDef_Oint),tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ( v_c = v_b
    | c_in(v_a,c_insert(v_b,X1,tc_IntDef_Oint),tc_IntDef_Oint)
    | c_in(v_c,X1,tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    ( ~ c_in(X1,X2,X3)
    | ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
    cls_Set_OComplD__dest_0 ).

cnf(c_0_15,negated_conjecture,
    ( v_c = v_b
    | v_a = v_b
    | c_in(v_c,X1,tc_IntDef_Oint)
    | c_in(v_a,X1,tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_11,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ( v_a = v_b
    | v_c = v_b
    | c_in(v_a,c_uminus(X1,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint)
    | ~ c_in(v_c,X1,tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    ( v_c = v_b
    | v_a = v_b
    | c_in(v_a,c_uminus(c_insert(v_c,X1,tc_IntDef_Oint),tc_set(tc_IntDef_Oint)),tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_16,c_0_10]) ).

cnf(c_0_18,negated_conjecture,
    ( v_a = v_b
    | v_c = v_b
    | ~ c_in(v_a,c_insert(v_c,X1,tc_IntDef_Oint),tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_19,axiom,
    ( c_in(X1,c_insert(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OinsertCI_0 ).

cnf(c_0_20,negated_conjecture,
    ( v_c = v_b
    | v_a = v_b
    | ~ c_in(v_a,X1,tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    c_less(v_b,v_c,tc_IntDef_Oint),
    cls_conjecture_1 ).

cnf(c_0_22,negated_conjecture,
    ( v_a = v_b
    | v_c = v_b ),
    inference(spm,[status(thm)],[c_0_20,c_0_10]) ).

cnf(c_0_23,axiom,
    ( ~ class_Orderings_Oorder(X1)
    | ~ c_less(X2,X2,X1) ),
    cls_Orderings_Oorder__less__irrefl__iff1_0 ).

cnf(c_0_24,negated_conjecture,
    ( v_a = v_b
    | c_less(v_b,v_b,tc_IntDef_Oint) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,axiom,
    class_Orderings_Oorder(tc_IntDef_Oint),
    clsarity_IntDef__Oint_31 ).

cnf(c_0_26,negated_conjecture,
    c_less(v_a,v_b,tc_IntDef_Oint),
    cls_conjecture_0 ).

cnf(c_0_27,negated_conjecture,
    v_a = v_b,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

cnf(c_0_28,negated_conjecture,
    c_less(v_b,v_b,tc_IntDef_Oint),
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET821-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 : n017.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 02:35:43 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.27/1.72  % Version  : CSE_E---1.7
% 1.27/1.72  % Problem  : theBenchmark.p
% 1.27/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72  % SZS output start CNFRefutation
% See solution above
% 1.27/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------