↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM094-1 : TPTP v9.2.1. Bugfixed v2.1.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 : n031.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 04:52:50 PM UTC 2026

% Result   : Unsatisfiable 35.09s 20.87s
% Output   : CNFRefutation 35.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   59 (  19 unt;  13 nHn;  42 RR)
%            Number of literals    :  112 (  12 equ;  49 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   88 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).

cnf(well_ordering3,axiom,
    ( member(least(X1,X3),X3)
    | ~ well_ordering(X1,X2)
    | ~ subclass(X3,X2)
    | ~ member(X4,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',well_ordering3) ).

cnf(prove_sections_property3_1,negated_conjecture,
    well_ordering(xr,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sections_property3_1) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).

cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(regularity1,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).

cnf(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

cnf(prove_sections_property3_3,negated_conjecture,
    ~ member(least(xr,intersection(complement(w),y)),y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sections_property3_3) ).

cnf(intersection3,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).

cnf(complement2,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

cnf(section1,axiom,
    ( subclass(X2,X3)
    | ~ section(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',section1) ).

cnf(prove_sections_property3_2,negated_conjecture,
    section(xr,w,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sections_property3_2) ).

cnf(subclass_implies_equal,axiom,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).

cnf(prove_sections_property3_4,negated_conjecture,
    y != w,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sections_property3_4) ).

cnf(c_0_16,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection2 ).

cnf(c_0_17,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    not_subclass_members1 ).

cnf(c_0_18,axiom,
    ( member(least(X1,X3),X3)
    | ~ well_ordering(X1,X2)
    | ~ subclass(X3,X2)
    | ~ member(X4,X3) ),
    well_ordering3 ).

cnf(c_0_19,negated_conjecture,
    well_ordering(xr,y),
    prove_sections_property3_1 ).

cnf(c_0_20,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    not_subclass_members2 ).

cnf(c_0_21,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X2)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( member(least(xr,X1),X1)
    | ~ member(X2,X1)
    | ~ subclass(X1,y) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    subclass(intersection(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    subclass_members ).

cnf(c_0_25,axiom,
    subclass(X1,universal_class),
    class_elements_are_sets ).

cnf(c_0_26,negated_conjecture,
    ( member(least(xr,intersection(X1,y)),intersection(X1,y))
    | ~ member(X2,intersection(X1,y)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    regularity1 ).

cnf(c_0_28,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    complement1 ).

cnf(c_0_29,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ( intersection(X1,y) = null_class
    | member(least(xr,intersection(X1,y)),intersection(X1,y)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,plain,
    ( complement(X1) = null_class
    | ~ member(regular(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,plain,
    ( X1 = null_class
    | member(regular(X1),universal_class) ),
    inference(spm,[status(thm)],[c_0_29,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ~ member(least(xr,intersection(complement(w),y)),y),
    prove_sections_property3_3 ).

cnf(c_0_34,negated_conjecture,
    ( intersection(X1,y) = null_class
    | member(least(xr,intersection(X1,y)),y) ),
    inference(spm,[status(thm)],[c_0_16,c_0_30]) ).

cnf(c_0_35,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    intersection3 ).

cnf(c_0_37,negated_conjecture,
    intersection(complement(w),y) = null_class,
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_35]),c_0_29]) ).

cnf(c_0_39,plain,
    ( subclass(complement(X1),X2)
    | ~ member(not_subclass_element(complement(X1),X2),X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_17]) ).

cnf(c_0_40,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    complement2 ).

cnf(c_0_41,plain,
    ( member(not_subclass_element(X1,X2),universal_class)
    | subclass(X1,X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_17]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ member(X1,complement(w))
    | ~ member(X1,y) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_43,plain,
    ( member(not_subclass_element(complement(complement(X1)),X2),X1)
    | subclass(complement(complement(X1)),X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_44,negated_conjecture,
    ( subclass(y,X1)
    | ~ member(not_subclass_element(y,X1),complement(w)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_17]) ).

cnf(c_0_45,plain,
    ( member(not_subclass_element(X1,complement(X2)),X2)
    | subclass(X1,complement(X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_40]),c_0_41]) ).

cnf(c_0_46,plain,
    subclass(complement(complement(X1)),X1),
    inference(spm,[status(thm)],[c_0_20,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    subclass(y,complement(complement(w))),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,plain,
    ( member(X1,X2)
    | ~ member(X1,complement(complement(X2))) ),
    inference(spm,[status(thm)],[c_0_24,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    ( member(X1,complement(complement(w)))
    | ~ member(X1,y) ),
    inference(spm,[status(thm)],[c_0_24,c_0_47]) ).

cnf(c_0_50,axiom,
    ( subclass(X2,X3)
    | ~ section(X1,X2,X3) ),
    section1 ).

cnf(c_0_51,negated_conjecture,
    section(xr,w,y),
    prove_sections_property3_2 ).

cnf(c_0_52,negated_conjecture,
    ( member(X1,w)
    | ~ member(X1,y) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_53,axiom,
    ( X1 = X2
    | ~ subclass(X1,X2)
    | ~ subclass(X2,X1) ),
    subclass_implies_equal ).

cnf(c_0_54,negated_conjecture,
    subclass(w,y),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_55,negated_conjecture,
    y != w,
    prove_sections_property3_4 ).

cnf(c_0_56,negated_conjecture,
    ( subclass(X1,w)
    | ~ member(not_subclass_element(X1,w),y) ),
    inference(spm,[status(thm)],[c_0_20,c_0_52]) ).

cnf(c_0_57,negated_conjecture,
    ~ subclass(y,w),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).

cnf(c_0_58,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_17]),c_0_57]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM094-1 : TPTP v9.2.1. Bugfixed v2.1.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.32  % Computer : n031.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 00:12:23 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 35.09/20.87  % Version  : CSE_E---1.7
% 35.09/20.87  % Problem  : theBenchmark.p
% 35.09/20.87  % SZS status Unsatisfiable for theBenchmark.p
% 35.09/20.87  % SZS output start CNFRefutation
% See solution above
% 35.19/21.00  % Total time : 15.394s
%------------------------------------------------------------------------------