↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 4.82s 3.48s
% Output   : CNFRefutation 4.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   57 (  22 unt;  11 nHn;  33 RR)
%            Number of literals    :  101 (  11 equ;  38 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   93 (  11 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(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_property3_1,negated_conjecture,
    subclass(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_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(complement2,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

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

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

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

cnf(prove_subclass_property3_2,negated_conjecture,
    union(x,y) != y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property3_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,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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_property3_1 ).

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

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

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

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

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

cnf(c_0_23,plain,
    ( member(not_subclass_element(X1,complement(X2)),X2)
    | subclass(X1,complement(X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

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

cnf(c_0_25,negated_conjecture,
    ( member(not_subclass_element(X1,complement(x)),y)
    | subclass(X1,complement(x)) ),
    inference(spm,[status(thm)],[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,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection1 ).

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

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

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

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

cnf(c_0_33,plain,
    ( subclass(X1,intersection(X2,X3))
    | ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
    | ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_31]) ).

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

cnf(c_0_35,plain,
    ( subclass(X1,intersection(X2,X1))
    | ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_16]) ).

cnf(c_0_36,negated_conjecture,
    ( member(not_subclass_element(intersection(complement(y),X1),X2),complement(x))
    | subclass(intersection(complement(y),X1),X2) ),
    inference(spm,[status(thm)],[c_0_34,c_0_16]) ).

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

cnf(c_0_38,plain,
    subclass(X1,intersection(X1,X1)),
    inference(spm,[status(thm)],[c_0_35,c_0_16]) ).

cnf(c_0_39,plain,
    subclass(intersection(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_18,c_0_30]) ).

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

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

cnf(c_0_42,negated_conjecture,
    subclass(intersection(complement(y),X1),intersection(complement(x),intersection(complement(y),X1))),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_43,plain,
    intersection(X1,X1) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).

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

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

cnf(c_0_46,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_24,c_0_19]),c_0_20]) ).

cnf(c_0_47,negated_conjecture,
    union(x,y) != y,
    prove_subclass_property3_2 ).

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

cnf(c_0_49,negated_conjecture,
    subclass(complement(y),intersection(complement(x),complement(y))),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_50,plain,
    subclass(intersection(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_18,c_0_44]) ).

cnf(c_0_51,plain,
    ( complement(complement(X1)) = X1
    | ~ subclass(complement(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_45]) ).

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

cnf(c_0_53,negated_conjecture,
    complement(intersection(complement(x),complement(y))) != y,
    inference(rw,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_54,negated_conjecture,
    intersection(complement(x),complement(y)) = complement(y),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_49]),c_0_50])]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET185-6 : 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.33  % Computer : n003.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 02:14:26 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 4.82/3.48  % Version  : CSE_E---1.7
% 4.82/3.48  % Problem  : theBenchmark.p
% 4.82/3.48  % SZS status Unsatisfiable for theBenchmark.p
% 4.82/3.48  % SZS output start CNFRefutation
% See solution above
% 4.92/3.50  % Total time : 2.370s
%------------------------------------------------------------------------------