↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET190-6 : 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 : n021.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:07:33 PM UTC 2026

% Result   : Unsatisfiable 3.58s 3.17s
% Output   : CNFRefutation 3.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   59 (  20 unt;  13 nHn;  38 RR)
%            Number of literals    :  104 (  20 equ;  40 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   81 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

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(prove_subclass_property7_1,negated_conjecture,
    subclass(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property7_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(complement2,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

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

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

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(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).

cnf(prove_subclass_property7_2,negated_conjecture,
    union(complement(x),y) != universal_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property7_2) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).

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

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

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

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

cnf(c_0_17,negated_conjecture,
    subclass(x,y),
    prove_subclass_property7_1 ).

cnf(c_0_18,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    ( subclass(complement(X1),X2)
    | ~ member(not_subclass_element(complement(X1),X2),X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( member(X1,y)
    | ~ member(X1,x) ),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

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

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

cnf(c_0_23,plain,
    ( member(not_subclass_element(X1,X2),universal_class)
    | subclass(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_16]) ).

cnf(c_0_24,negated_conjecture,
    ( subclass(complement(y),X1)
    | ~ member(not_subclass_element(complement(y),X1),x) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    ( member(not_subclass_element(X1,complement(X2)),X2)
    | subclass(X1,complement(X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    subclass(complement(y),complement(x)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,negated_conjecture,
    ( member(X1,complement(x))
    | ~ member(X1,complement(y)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_26]) ).

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

cnf(c_0_29,negated_conjecture,
    ( member(not_subclass_element(complement(y),X1),complement(x))
    | subclass(complement(y),X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_30,negated_conjecture,
    subclass(complement(y),complement(complement(complement(x)))),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

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

cnf(c_0_32,negated_conjecture,
    ( member(X1,complement(complement(complement(x))))
    | ~ member(X1,complement(y)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_30]) ).

cnf(c_0_33,plain,
    subclass(X1,complement(complement(X1))),
    inference(spm,[status(thm)],[c_0_28,c_0_16]) ).

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

cnf(c_0_35,plain,
    ( X1 = null_class
    | member(regular(X1),universal_class) ),
    inference(spm,[status(thm)],[c_0_18,c_0_31]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ member(X1,complement(complement(x)))
    | ~ member(X1,complement(y)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_32]) ).

cnf(c_0_37,plain,
    ( member(X1,complement(complement(X2)))
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_33]) ).

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

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

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

cnf(c_0_41,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_19,c_0_22]),c_0_23]) ).

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

cnf(c_0_43,plain,
    ( intersection(X1,X2) = null_class
    | member(regular(intersection(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_38,c_0_31]) ).

cnf(c_0_44,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection1 ).

cnf(c_0_45,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_39]),c_0_18]) ).

cnf(c_0_46,negated_conjecture,
    union(complement(x),y) != universal_class,
    prove_subclass_property7_2 ).

cnf(c_0_47,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    union ).

cnf(c_0_48,plain,
    ( complement(complement(X1)) = X1
    | ~ subclass(complement(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_33]) ).

cnf(c_0_49,plain,
    subclass(complement(complement(X1)),X1),
    inference(spm,[status(thm)],[c_0_21,c_0_41]) ).

cnf(c_0_50,negated_conjecture,
    ( intersection(X1,complement(y)) = null_class
    | ~ member(regular(intersection(X1,complement(y))),x) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_51,plain,
    ( intersection(X1,X2) = null_class
    | member(regular(intersection(X1,X2)),X1) ),
    inference(spm,[status(thm)],[c_0_44,c_0_31]) ).

cnf(c_0_52,plain,
    ( universal_class = X1
    | ~ subclass(universal_class,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_14]) ).

cnf(c_0_53,plain,
    subclass(X1,complement(null_class)),
    inference(spm,[status(thm)],[c_0_45,c_0_25]) ).

cnf(c_0_54,negated_conjecture,
    complement(intersection(complement(complement(x)),complement(y))) != universal_class,
    inference(rw,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_55,plain,
    complement(complement(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).

cnf(c_0_56,negated_conjecture,
    intersection(x,complement(y)) = null_class,
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_57,plain,
    complement(null_class) = universal_class,
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_58,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SET190-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.11  % 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.14/0.32  % Computer : n021.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 02:15:25 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 3.58/3.17  % Version  : CSE_E---1.7
% 3.58/3.17  % Problem  : theBenchmark.p
% 3.58/3.17  % SZS status Unsatisfiable for theBenchmark.p
% 3.58/3.17  % SZS output start CNFRefutation
% See solution above
% 3.58/3.18  % Total time : 2.371s
%------------------------------------------------------------------------------