↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU264+2 : TPTP v9.2.1. Released v3.3.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 : n025.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:11:17 PM UTC 2026

% Result   : Theorem 2.38s 2.04s
% Output   : CNFRefutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   43 (  17   ~;  13   |;   5   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   40 (   2 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t16_relset_1,conjecture,
    ! [X1,X2,X3,X4] :
      ( relation_of2_as_subset(X4,X3,X1)
     => ( subset(X1,X2)
       => relation_of2_as_subset(X4,X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_relset_1) ).

fof(t14_relset_1,lemma,
    ! [X1,X2,X3,X4] :
      ( relation_of2_as_subset(X4,X3,X1)
     => ( subset(relation_rng(X4),X2)
       => relation_of2_as_subset(X4,X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_relset_1) ).

fof(t1_xboole_1,lemma,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X2,X3) )
     => subset(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

fof(t12_relset_1,lemma,
    ! [X1,X2,X3] :
      ( relation_of2_as_subset(X3,X1,X2)
     => ( subset(relation_dom(X3),X1)
        & subset(relation_rng(X3),X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_relset_1) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( relation_of2_as_subset(X4,X3,X1)
       => ( subset(X1,X2)
         => relation_of2_as_subset(X4,X3,X2) ) ),
    inference(assume_negation,[status(cth)],[t16_relset_1]) ).

fof(c_0_5,lemma,
    ! [X1334,X1335,X1336,X1337] :
      ( ~ relation_of2_as_subset(X1337,X1336,X1334)
      | ~ subset(relation_rng(X1337),X1335)
      | relation_of2_as_subset(X1337,X1336,X1335) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t14_relset_1])]) ).

fof(c_0_6,negated_conjecture,
    ( relation_of2_as_subset(esk112_0,esk111_0,esk109_0)
    & subset(esk109_0,esk110_0)
    & ~ relation_of2_as_subset(esk112_0,esk111_0,esk110_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_7,lemma,
    ( relation_of2_as_subset(X1,X2,X4)
    | ~ relation_of2_as_subset(X1,X2,X3)
    | ~ subset(relation_rng(X1),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    relation_of2_as_subset(esk112_0,esk111_0,esk109_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,lemma,
    ! [X1374,X1375,X1376] :
      ( ~ subset(X1374,X1375)
      | ~ subset(X1375,X1376)
      | subset(X1374,X1376) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).

fof(c_0_10,lemma,
    ! [X1304,X1305,X1306] :
      ( ( subset(relation_dom(X1306),X1304)
        | ~ relation_of2_as_subset(X1306,X1304,X1305) )
      & ( subset(relation_rng(X1306),X1305)
        | ~ relation_of2_as_subset(X1306,X1304,X1305) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])]) ).

cnf(c_0_11,negated_conjecture,
    ~ relation_of2_as_subset(esk112_0,esk111_0,esk110_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ( relation_of2_as_subset(esk112_0,esk111_0,X1)
    | ~ subset(relation_rng(esk112_0),X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,lemma,
    ( subset(X1,X3)
    | ~ subset(X1,X2)
    | ~ subset(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    subset(esk109_0,esk110_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,lemma,
    ( subset(relation_rng(X1),X2)
    | ~ relation_of2_as_subset(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ~ subset(relation_rng(esk112_0),esk110_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ( subset(X1,esk110_0)
    | ~ subset(X1,esk109_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    subset(relation_rng(esk112_0),esk109_0),
    inference(spm,[status(thm)],[c_0_15,c_0_8]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU264+2 : TPTP v9.2.1. Released v3.3.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.33  % Computer : n025.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 02:53:13 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 2.38/2.04  % Version  : CSE_E---1.7
% 2.38/2.04  % Problem  : theBenchmark.p
% 2.38/2.04  % SZS status Theorem for theBenchmark.p
% 2.38/2.04  % SZS output start CNFRefutation
% See solution above
% 2.38/2.04  % Total time : 1.428s
%------------------------------------------------------------------------------