↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM190-1 : 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 : n002.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 04:52:56 PM UTC 2026

% Result   : Unsatisfiable 1.31s 1.73s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (   9 unt;   4 nHn;  16 RR)
%            Number of literals    :   32 (  10 equ;  11 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(omega_is_inductive1,axiom,
    inductive(omega),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',omega_is_inductive1) ).

cnf(prove_omega_is_not_null_1,negated_conjecture,
    omega = null_class,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_omega_is_not_null_1) ).

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(inductive1,axiom,
    ( member(null_class,X1)
    | ~ inductive(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inductive1) ).

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,
    inductive(omega),
    omega_is_inductive1 ).

cnf(c_0_7,negated_conjecture,
    omega = null_class,
    prove_omega_is_not_null_1 ).

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

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

cnf(c_0_10,axiom,
    ( member(null_class,X1)
    | ~ inductive(X1) ),
    inductive1 ).

cnf(c_0_11,plain,
    inductive(null_class),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,plain,
    ( X1 = null_class
    | member(X2,X1)
    | ~ member(X2,null_class) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    member(null_class,null_class),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

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

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

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

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

cnf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[c_0_13,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM190-1 : 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.16/0.33  % Computer : n002.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 00:16:46 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.31/1.73  % Version  : CSE_E---1.7
% 1.31/1.73  % Problem  : theBenchmark.p
% 1.31/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.73  % SZS output start CNFRefutation
% See solution above
% 1.31/1.73  % Total time : 1.376s
%------------------------------------------------------------------------------