↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.10s 1.69s
% Output   : CNFRefutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   29 (  10 unt;   5 nHn;  21 RR)
%            Number of literals    :   55 (   0 equ;  25 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   63 (   6 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/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OUnCI_0,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnCI_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/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

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

cnf(cls_conjecture_5,negated_conjecture,
    ( c_lessequals(v_X,X1,tc_set(t_a))
    | ~ c_lessequals(v_Z,X1,tc_set(t_a))
    | ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

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

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

cnf(cls_conjecture_2,negated_conjecture,
    c_in(v_x,v_X,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_in(v_x,v_Y,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(c_0_10,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_11,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUnCI_0 ).

cnf(c_0_12,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_10,c_0_11]) ).

cnf(c_0_13,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_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(v_X,X1,tc_set(t_a))
    | ~ c_lessequals(v_Z,X1,tc_set(t_a))
    | ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
    cls_conjecture_5 ).

cnf(c_0_16,plain,
    c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,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_10,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( c_lessequals(v_X,c_union(X1,v_Y,t_a),tc_set(t_a))
    | ~ c_lessequals(v_Z,c_union(X1,v_Y,t_a),tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
    inference(spm,[status(thm)],[c_0_17,c_0_13]) ).

cnf(c_0_20,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    cls_Set_OsubsetD_0 ).

cnf(c_0_21,negated_conjecture,
    c_lessequals(v_X,c_union(v_Z,v_Y,t_a),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    cls_Set_OUnE_0 ).

cnf(c_0_23,negated_conjecture,
    ( c_in(X1,c_union(v_Z,v_Y,t_a),t_a)
    | ~ c_in(X1,v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( c_in(X1,v_Z,t_a)
    | c_in(X1,v_Y,t_a)
    | ~ c_in(X1,v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    c_in(v_x,v_X,t_a),
    cls_conjecture_2 ).

cnf(c_0_26,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    cls_conjecture_3 ).

cnf(c_0_27,negated_conjecture,
    ~ c_in(v_x,v_Y,t_a),
    cls_conjecture_4 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem    : SET834-2 : TPTP v9.2.1. Released v3.2.0.
% 0.05/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.06/0.32  % Computer : n012.cluster.edu
% 0.06/0.32  % Model    : x86_64 x86_64
% 0.06/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.32  % Memory   : 8042.1875MB
% 0.06/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.32  % CPULimit   : 300
% 0.06/0.32  % WCLimit    : 300
% 0.06/0.32  % DateTime   : Tue May  5 02:37:31 EDT 2026
% 0.06/0.32  % CPUTime    : 
% 0.09/0.32  % start to proof: theBenchmark
% 1.10/1.69  % Version  : CSE_E---1.7
% 1.10/1.69  % Problem  : theBenchmark.p
% 1.10/1.69  % SZS status Unsatisfiable for theBenchmark.p
% 1.10/1.69  % SZS output start CNFRefutation
% See solution above
% 1.10/1.69  % Total time : 1.361s
%------------------------------------------------------------------------------