↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 0.26s 1.62s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   30
% Syntax   : Number of clauses     :   43 (  10 unt;   0 nHn;  37 RR)
%            Number of literals    :   94 (  42 equ;  55 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   93 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
    ( c_Union(X4,X3) = X1
    | ~ c_in(X1,X2,tc_set(X3))
    | ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( c_lessequals(X1,v_x(X1),tc_set(t_a))
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

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

cnf(cls_conjecture_5,negated_conjecture,
    ( X1 != v_x(X1)
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(i_0_6,axiom,
    ( c_Union(X4,X3) = X1
    | ~ c_in(X1,X2,tc_set(X3))
    | ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
    cls_Zorn_Omaxchain__Zorn_0,
    [final] ).

cnf(i_0_7,negated_conjecture,
    ( c_lessequals(X1,v_x(X1),tc_set(t_a))
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    cls_conjecture_4,
    [final] ).

cnf(i_0_8,negated_conjecture,
    ( c_in(v_x(X1),v_S,tc_set(t_a))
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    cls_conjecture_3,
    [final] ).

cnf(i_0_9,negated_conjecture,
    ( X1 != v_x(X1)
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    cls_conjecture_5,
    [final] ).

cnf(i_0_10,negated_conjecture,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_0,
    [final] ).

cnf(i_0_11,negated_conjecture,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    cls_conjecture_2,
    [final] ).

cnf(i_0_12,axiom,
    X1 = X1 ).

cnf(i_0_13,axiom,
    ( X1 = X2
    | X2 != X1 ) ).

cnf(i_0_14,axiom,
    ( X1 = X2
    | X1 != X3
    | X3 != X2 ) ).

cnf(i_0_15,axiom,
    ( X1 != X2
    | c_Union(X1,X3) = c_Union(X2,X3) ) ).

cnf(i_0_16,axiom,
    ( X1 != X2
    | c_Union(X3,X1) = c_Union(X3,X2) ) ).

cnf(i_0_17,axiom,
    ( X1 != X2
    | v_x(X1) = v_x(X2) ) ).

cnf(i_0_18,axiom,
    ( X1 != X2
    | ~ c_in(X1,X3,X4)
    | c_in(X2,X3,X4) ) ).

cnf(i_0_19,axiom,
    ( X1 != X2
    | ~ c_in(X3,X1,X4)
    | c_in(X3,X2,X4) ) ).

cnf(i_0_20,axiom,
    ( X1 != X2
    | ~ c_in(X3,X4,X1)
    | c_in(X3,X4,X2) ) ).

cnf(i_0_21,axiom,
    ( X1 != X2
    | ~ c_lessequals(X1,X3,X4)
    | c_lessequals(X2,X3,X4) ) ).

cnf(i_0_22,axiom,
    ( X1 != X2
    | ~ c_lessequals(X3,X1,X4)
    | c_lessequals(X3,X2,X4) ) ).

cnf(i_0_23,axiom,
    ( X1 != X2
    | ~ c_lessequals(X3,X4,X1)
    | c_lessequals(X3,X4,X2) ) ).

cnf(i_0_12_001,axiom,
    X1 = X1 ).

cnf(i_0_13_002,axiom,
    ( X1 = X2
    | X2 != X1 ) ).

cnf(i_0_14_003,axiom,
    ( X1 = X2
    | X1 != X3
    | X3 != X2 ) ).

cnf(i_0_15_004,axiom,
    ( X1 != X2
    | c_Union(X1,X3) = c_Union(X2,X3) ) ).

cnf(i_0_16_005,axiom,
    ( X1 != X2
    | c_Union(X3,X1) = c_Union(X3,X2) ) ).

cnf(i_0_17_006,axiom,
    ( X1 != X2
    | v_x(X1) = v_x(X2) ) ).

cnf(i_0_18_007,axiom,
    ( X1 != X2
    | ~ c_in(X1,X3,X4)
    | c_in(X2,X3,X4) ) ).

cnf(i_0_19_008,axiom,
    ( X1 != X2
    | ~ c_in(X3,X1,X4)
    | c_in(X3,X2,X4) ) ).

cnf(i_0_20_009,axiom,
    ( X1 != X2
    | ~ c_in(X3,X4,X1)
    | c_in(X3,X4,X2) ) ).

cnf(i_0_21_010,axiom,
    ( X1 != X2
    | ~ c_lessequals(X1,X3,X4)
    | c_lessequals(X2,X3,X4) ) ).

cnf(i_0_22_011,axiom,
    ( X1 != X2
    | ~ c_lessequals(X3,X1,X4)
    | c_lessequals(X3,X2,X4) ) ).

cnf(i_0_23_012,axiom,
    ( X1 != X2
    | ~ c_lessequals(X3,X4,X1)
    | c_lessequals(X3,X4,X2) ) ).

cnf(i_0_24,plain,
    c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a)),
    inference(scs_inference,[],[i_0_11,i_0_7]) ).

cnf(i_0_25,plain,
    ( ~ c_in(X1,v_S,tc_set(t_a))
    | c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
    inference(rename_variables,[],[i_0_7]) ).

cnf(i_0_26,plain,
    c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)),
    inference(scs_inference,[],[i_0_11,i_0_7,i_0_8]) ).

cnf(i_0_27,plain,
    ( ~ c_in(X1,v_S,tc_set(t_a))
    | c_in(v_x(X1),v_S,tc_set(t_a)) ),
    inference(rename_variables,[],[i_0_8]) ).

cnf(i_0_28,plain,
    c_Union(v_c,t_a) != v_x(c_Union(v_c,t_a)),
    inference(scs_inference,[],[i_0_11,i_0_7,i_0_8,i_0_9]) ).

cnf(i_0_29,plain,
    ( ~ c_in(X1,v_S,tc_set(t_a))
    | X1 != v_x(X1) ),
    inference(rename_variables,[],[i_0_9]) ).

cnf(i_0_30,plain,
    $false,
    inference(scs_inference,[],[i_0_10,i_0_11,i_0_7,i_0_8,i_0_9,i_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET864-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 : n029.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:38:15 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 0.26/1.62  % Version  : CSE_E---1.7
% 0.26/1.62  % Problem  : theBenchmark.p
% 0.26/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.62  % SZS output start CNFRefutation
% See solution above
% 0.26/1.64  % Total time : 1.272s
%------------------------------------------------------------------------------