↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET071-7 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/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:09 PM UTC 2026

% Result   : Unsatisfiable 1.90s 1.91s
% Output   : CNFRefutation 1.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  13 unt;  13 nHn;  15 RR)
%            Number of literals    :   54 (  25 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   39 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(unordered_pair_equals_singleton1,axiom,
    ( member(X1,universal_class)
    | unordered_pair(X2,X1) = singleton(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).

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

cnf(prove_null_unordered_pair_1,negated_conjecture,
    unordered_pair(x,y) != null_class,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_1) ).

cnf(prove_null_unordered_pair_3,negated_conjecture,
    ~ member(y,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_3) ).

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

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

cnf(unordered_pair_member,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ member(X1,unordered_pair(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).

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

cnf(unordered_pair_equals_singleton2,axiom,
    ( member(X1,universal_class)
    | unordered_pair(X1,X2) = singleton(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton2) ).

cnf(prove_null_unordered_pair_2,negated_conjecture,
    ~ member(x,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_2) ).

cnf(c_0_10,axiom,
    ( member(X1,universal_class)
    | unordered_pair(X2,X1) = singleton(X2) ),
    unordered_pair_equals_singleton1 ).

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

cnf(c_0_12,negated_conjecture,
    unordered_pair(x,y) != null_class,
    prove_null_unordered_pair_1 ).

cnf(c_0_13,plain,
    ( unordered_pair(X2,X1) = unordered_pair(X2,X2)
    | member(X1,universal_class) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ member(y,universal_class),
    prove_null_unordered_pair_3 ).

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

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

cnf(c_0_17,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ member(X1,unordered_pair(X2,X3)) ),
    unordered_pair_member ).

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

cnf(c_0_19,negated_conjecture,
    unordered_pair(x,x) != null_class,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_20,axiom,
    ( member(X1,universal_class)
    | unordered_pair(X1,X2) = singleton(X2) ),
    unordered_pair_equals_singleton2 ).

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

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

cnf(c_0_23,negated_conjecture,
    ( member(X1,universal_class)
    | unordered_pair(x,X1) != null_class ),
    inference(spm,[status(thm)],[c_0_19,c_0_13]) ).

cnf(c_0_24,plain,
    ( unordered_pair(X1,X2) = unordered_pair(X2,X2)
    | member(X1,universal_class) ),
    inference(rw,[status(thm)],[c_0_20,c_0_11]) ).

cnf(c_0_25,negated_conjecture,
    ~ member(x,universal_class),
    prove_null_unordered_pair_2 ).

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

cnf(c_0_27,plain,
    ( regular(unordered_pair(X1,X1)) = X1
    | unordered_pair(X1,X1) = null_class ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_22])]) ).

cnf(c_0_28,negated_conjecture,
    ( member(X1,universal_class)
    | unordered_pair(X1,X1) != null_class ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

cnf(c_0_29,plain,
    member(X1,universal_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET071-7 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.33  % Computer : n026.cluster.edu
% 0.17/0.33  % Model    : x86_64 x86_64
% 0.17/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33  % Memory   : 8042.1875MB
% 0.17/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33  % CPULimit   : 300
% 0.17/0.33  % WCLimit    : 300
% 0.17/0.33  % DateTime   : Tue May  5 02:09:08 EDT 2026
% 0.17/0.33  % CPUTime    : 
% 0.17/0.34  % start to proof: theBenchmark
% 1.90/1.91  % Version  : CSE_E---1.7
% 1.90/1.91  % Problem  : theBenchmark.p
% 1.90/1.91  % SZS status Unsatisfiable for theBenchmark.p
% 1.90/1.91  % SZS output start CNFRefutation
% See solution above
% 1.90/1.91  % Total time : 1.366s
%------------------------------------------------------------------------------