↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.32s 1.72s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   8 unt;   4 nHn;  13 RR)
%            Number of literals    :   31 (  10 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   21 (   5 sgn)

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

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

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

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

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

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

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

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

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

cnf(c_0_9,negated_conjecture,
    unordered_pair(x,y) = null_class,
    prove_corollary_to_unordered_pair_axiom1_2 ).

cnf(c_0_10,negated_conjecture,
    member(x,universal_class),
    prove_corollary_to_unordered_pair_axiom1_1 ).

cnf(c_0_11,plain,
    ( X1 = null_class
    | member(X2,X1)
    | ~ member(X2,null_class) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    member(x,null_class),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

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

cnf(c_0_14,negated_conjecture,
    ( X1 = null_class
    | member(x,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( complement(X1) = null_class
    | ~ member(x,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    complement(null_class) = null_class,
    inference(spm,[status(thm)],[c_0_15,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ~ member(X1,null_class),
    inference(spm,[status(thm)],[c_0_13,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_12,c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SET073-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.11  % 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 : n007.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:54 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.32/1.72  % Version  : CSE_E---1.7
% 1.32/1.72  % Problem  : theBenchmark.p
% 1.32/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.72  % SZS output start CNFRefutation
% See solution above
% 1.32/1.72  % Total time : 1.368s
%------------------------------------------------------------------------------