↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET062-6 : 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 : n010.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:05 PM UTC 2026

% Result   : Unsatisfiable 1.38s 1.76s
% Output   : CNFRefutation 1.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   35 (  10 unt;  17 nHn;  18 RR)
%            Number of literals    :   65 (  27 equ;  14 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    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   52 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).

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

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

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

cnf(prove_null_class_is_subclass_1,negated_conjecture,
    ~ subclass(null_class,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_class_is_subclass_1) ).

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

cnf(equal_implies_subclass2,axiom,
    ( subclass(X2,X1)
    | X1 != X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass2) ).

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

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

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

cnf(c_0_12,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X2)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

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

cnf(c_0_15,plain,
    subclass(intersection(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,axiom,
    ( X1 = null_class
    | intersection(X1,regular(X1)) = null_class ),
    regularity2 ).

cnf(c_0_17,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_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( X1 = null_class
    | subclass(null_class,regular(X1)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_20,negated_conjecture,
    ~ subclass(null_class,x),
    prove_null_class_is_subclass_1 ).

cnf(c_0_21,plain,
    ( unordered_pair(X1,X1) = null_class
    | subclass(null_class,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,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_13,c_0_10]) ).

cnf(c_0_23,negated_conjecture,
    unordered_pair(x,x) = null_class,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( not_subclass_element(null_class,X1) = x
    | subclass(null_class,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

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

cnf(c_0_26,negated_conjecture,
    not_subclass_element(null_class,x) = x,
    inference(spm,[status(thm)],[c_0_20,c_0_24]) ).

cnf(c_0_27,plain,
    ( X1 = null_class
    | member(X2,X1)
    | ~ member(X2,null_class) ),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    member(x,null_class),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    ~ member(x,x),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_20]) ).

cnf(c_0_30,negated_conjecture,
    ( X1 = null_class
    | member(x,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,axiom,
    ( subclass(X2,X1)
    | X1 != X2 ),
    equal_implies_subclass2 ).

cnf(c_0_32,negated_conjecture,
    x = null_class,
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    subclass(X1,X1),
    inference(er,[status(thm)],[c_0_31]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET062-6 : 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.15/0.32  % Computer : n010.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 02:07:51 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/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
%------------------------------------------------------------------------------