↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.38s 1.76s
% Output   : CNFRefutation 1.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   30 (  15 unt;   7 nHn;  23 RR)
%            Number of literals    :   52 (  20 equ;  20 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;   3 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_two_subsets_of_singleton_1,negated_conjecture,
    subclass(x,singleton(y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_1) ).

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

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(prove_two_subsets_of_singleton_3,negated_conjecture,
    singleton(y) != x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_3) ).

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

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(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(regularity1,axiom,
    ( X1 = null_class
    | member(regular(X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).

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

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(c_0_10,negated_conjecture,
    subclass(x,singleton(y)),
    prove_two_subsets_of_singleton_1 ).

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

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

cnf(c_0_13,negated_conjecture,
    subclass(x,unordered_pair(y,y)),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    singleton(y) != x,
    prove_two_subsets_of_singleton_3 ).

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

cnf(c_0_16,negated_conjecture,
    ( member(X1,unordered_pair(y,y))
    | ~ member(X1,x) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_18,negated_conjecture,
    unordered_pair(y,y) != x,
    inference(rw,[status(thm)],[c_0_14,c_0_11]) ).

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

cnf(c_0_20,negated_conjecture,
    ( X1 = y
    | ~ member(X1,x) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_22,negated_conjecture,
    x != null_class,
    prove_two_subsets_of_singleton_2 ).

cnf(c_0_23,negated_conjecture,
    ~ subclass(unordered_pair(y,y),x),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_18]) ).

cnf(c_0_24,plain,
    ( not_subclass_element(unordered_pair(X1,X2),X3) = X1
    | not_subclass_element(unordered_pair(X1,X2),X3) = X2
    | subclass(unordered_pair(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    regular(x) = y,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

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

cnf(c_0_27,negated_conjecture,
    not_subclass_element(unordered_pair(y,y),x) = y,
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    member(y,x),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_22]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET096-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.16/0.33  % Computer : n004.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 02:10:02 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.38/1.76  % Version  : CSE_E---1.7
% 1.38/1.76  % Problem  : theBenchmark.p
% 1.38/1.76  % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.76  % SZS output start CNFRefutation
% See solution above
% 1.38/1.76  % Total time : 1.372s
%------------------------------------------------------------------------------