↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.26s 1.90s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   35 (  18 unt;   5 nHn;  19 RR)
%            Number of literals    :   56 (  15 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-2 aty)
%            Number of variables   :   48 (   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(regularity1,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).

cnf(definition_of_set_builder,axiom,
    union(singleton(X1),X2) = set_builder(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).

cnf(singleton_set,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).

cnf(prove_corollary_2_to_member_of_triple_2,negated_conjecture,
    set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_member_of_triple_2) ).

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

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

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

cnf(prove_corollary_2_to_member_of_triple_1,negated_conjecture,
    member(u,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_member_of_triple_1) ).

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

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

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

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

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

cnf(c_0_17,axiom,
    union(singleton(X1),X2) = set_builder(X1,X2),
    definition_of_set_builder ).

cnf(c_0_18,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    singleton_set ).

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

cnf(c_0_20,plain,
    ( X1 = null_class
    | member(regular(X1),universal_class) ),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
    prove_corollary_2_to_member_of_triple_2 ).

cnf(c_0_22,plain,
    union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

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

cnf(c_0_24,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

cnf(c_0_26,negated_conjecture,
    complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))) = null_class,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]),c_0_23]),c_0_23]),c_0_23]) ).

cnf(c_0_27,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_16]) ).

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

cnf(c_0_29,negated_conjecture,
    ( member(X1,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))
    | ~ member(X1,universal_class) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( member(X1,complement(unordered_pair(u,u)))
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,negated_conjecture,
    ~ member(X1,unordered_pair(u,u)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_16]) ).

cnf(c_0_32,axiom,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    unordered_pair2 ).

cnf(c_0_33,negated_conjecture,
    member(u,universal_class),
    prove_corollary_2_to_member_of_triple_1 ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.25  % Problem    : SET134-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.02/0.25  % 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.11/0.45  % Computer : n026.cluster.edu
% 0.11/0.45  % Model    : x86_64 x86_64
% 0.11/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.45  % Memory   : 8042.1875MB
% 0.11/0.45  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.45  % CPULimit   : 300
% 0.11/0.45  % WCLimit    : 300
% 0.11/0.45  % DateTime   : Tue May  5 02:13:08 EDT 2026
% 0.11/0.45  % CPUTime    : 
% 0.11/0.46  % start to proof: theBenchmark
% 1.26/1.90  % Version  : CSE_E---1.7
% 1.26/1.90  % Problem  : theBenchmark.p
% 1.26/1.90  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.90  % SZS output start CNFRefutation
% See solution above
% 1.26/1.90  % Total time : 1.379s
%------------------------------------------------------------------------------