↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET200+3 : TPTP v9.2.1. Released v2.2.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:07:35 PM UTC 2026

% Result   : Theorem 2.22s 2.01s
% Output   : CNFRefutation 2.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (   4 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   60 (  21   ~;  26   |;   8   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   55 (   2 sgn  22   !;   0   ?)

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

fof(subset_defn,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).

fof(union_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X1)
        | member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ( subset(X1,X2)
          & subset(X3,X4) )
       => subset(union(X1,X3),union(X2,X4)) ),
    inference(assume_negation,[status(cth)],[prove_th34]) ).

fof(c_0_4,plain,
    ! [X24,X25,X26,X27,X28] :
      ( ( ~ subset(X24,X25)
        | ~ member(X26,X24)
        | member(X26,X25) )
      & ( member(esk1_2(X27,X28),X27)
        | subset(X27,X28) )
      & ( ~ member(esk1_2(X27,X28),X28)
        | subset(X27,X28) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_defn])])])])])]) ).

fof(c_0_5,plain,
    ! [X21,X22,X23] :
      ( ( ~ member(X23,union(X21,X22))
        | member(X23,X21)
        | member(X23,X22) )
      & ( ~ member(X23,X21)
        | member(X23,union(X21,X22)) )
      & ( ~ member(X23,X22)
        | member(X23,union(X21,X22)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).

fof(c_0_6,negated_conjecture,
    ( subset(esk3_0,esk4_0)
    & subset(esk5_0,esk6_0)
    & ~ subset(union(esk3_0,esk5_0),union(esk4_0,esk6_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_7,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( member(X1,union(X3,X2))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( member(X3,X2)
    | ~ subset(X1,X2)
    | ~ member(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    subset(esk5_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    subset(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk1_2(X1,union(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( member(X1,esk6_0)
    | ~ member(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,plain,
    ( member(esk1_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_17,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk1_2(X1,union(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_7,c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    ( member(X1,esk4_0)
    | ~ member(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ( subset(X1,union(X2,esk6_0))
    | ~ member(esk1_2(X1,union(X2,esk6_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    ( subset(union(X1,X2),X3)
    | member(esk1_2(union(X1,X2),X3),X1)
    | member(esk1_2(union(X1,X2),X3),X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( subset(X1,union(esk4_0,X2))
    | ~ member(esk1_2(X1,union(esk4_0,X2)),esk3_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( subset(union(X1,esk5_0),union(X2,esk6_0))
    | member(esk1_2(union(X1,esk5_0),union(X2,esk6_0)),X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    ~ subset(union(esk3_0,esk5_0),union(esk4_0,esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET200+3 : TPTP v9.2.1. Released v2.2.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 : n025.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:15:13 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 2.22/2.01  % Version  : CSE_E---1.7
% 2.22/2.01  % Problem  : theBenchmark.p
% 2.22/2.01  % SZS status Theorem for theBenchmark.p
% 2.22/2.01  % SZS output start CNFRefutation
% See solution above
% 2.22/2.02  % Total time : 1.367s
%------------------------------------------------------------------------------