↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.34s 1.75s
% Output   : CNFRefutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   32 (  17 unt;   4 nHn;  17 RR)
%            Number of literals    :   49 (  20 equ;  22 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    :   10 (  10 usr;   2 con; 0-3 aty)
%            Number of variables   :   54 (  10 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(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).

cnf(restriction2,axiom,
    intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction2) ).

cnf(restriction1,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).

cnf(domain1,axiom,
    ( restrict(X1,singleton(X2),universal_class) != null_class
    | ~ member(X2,domain_of(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain1) ).

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

cnf(prove_domain_of_null_class_1,negated_conjecture,
    domain_of(null_class) != null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_null_class_1) ).

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

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

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

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

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

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

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

cnf(c_0_17,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_19,axiom,
    intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
    restriction2 ).

cnf(c_0_20,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    restriction1 ).

cnf(c_0_21,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_14]) ).

cnf(c_0_22,plain,
    ( intersection(X1,X2) = null_class
    | member(regular(intersection(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_13]) ).

cnf(c_0_23,axiom,
    ( restrict(X1,singleton(X2),universal_class) != null_class
    | ~ member(X2,domain_of(X1)) ),
    domain1 ).

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

cnf(c_0_25,plain,
    intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,plain,
    intersection(X1,null_class) = null_class,
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_27,plain,
    ( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
    | ~ member(X2,domain_of(X1)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_20]) ).

cnf(c_0_28,plain,
    intersection(null_class,cross_product(X1,X2)) = null_class,
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    ~ member(X1,domain_of(null_class)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,negated_conjecture,
    domain_of(null_class) != null_class,
    prove_domain_of_null_class_1 ).

cnf(c_0_31,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_13]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SET261-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 : n028.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:17:15 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.34/1.75  % Version  : CSE_E---1.7
% 1.34/1.75  % Problem  : theBenchmark.p
% 1.34/1.75  % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.75  % SZS output start CNFRefutation
% See solution above
% 1.34/1.75  % Total time : 1.371s
%------------------------------------------------------------------------------