TSTP Solution File: SEU162+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n027.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 : Thu Aug 31 16:22:56 EDT 2023

% Result   : Theorem 0.19s 0.58s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   32 (   4 unt;   6 typ;   0 def)
%            Number of atoms       :   52 (  11 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   48 (  22   ~;  17   |;   3   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn;  22   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    in: ( $i * $i ) > $o ).

tff(decl_23,type,
    singleton: $i > $i ).

tff(decl_24,type,
    disjoint: ( $i * $i ) > $o ).

tff(decl_25,type,
    set_difference: ( $i * $i ) > $i ).

tff(decl_26,type,
    esk1_0: $i ).

tff(decl_27,type,
    esk2_0: $i ).

fof(t65_zfmisc_1,conjecture,
    ! [X1,X2] :
      ( set_difference(X1,singleton(X2)) = X1
    <=> ~ in(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).

fof(l28_zfmisc_1,axiom,
    ! [X1,X2] :
      ( ~ in(X1,X2)
     => disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).

fof(t83_xboole_1,axiom,
    ! [X1,X2] :
      ( disjoint(X1,X2)
    <=> set_difference(X1,X2) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).

fof(symmetry_r1_xboole_0,axiom,
    ! [X1,X2] :
      ( disjoint(X1,X2)
     => disjoint(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).

fof(l25_zfmisc_1,axiom,
    ! [X1,X2] :
      ~ ( disjoint(singleton(X1),X2)
        & in(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2] :
        ( set_difference(X1,singleton(X2)) = X1
      <=> ~ in(X2,X1) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t65_zfmisc_1])]) ).

fof(c_0_6,plain,
    ! [X1,X2] :
      ( ~ in(X1,X2)
     => disjoint(singleton(X1),X2) ),
    inference(fof_simplification,[status(thm)],[l28_zfmisc_1]) ).

fof(c_0_7,negated_conjecture,
    ( ( set_difference(esk1_0,singleton(esk2_0)) != esk1_0
      | in(esk2_0,esk1_0) )
    & ( set_difference(esk1_0,singleton(esk2_0)) = esk1_0
      | ~ in(esk2_0,esk1_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X13,X14] :
      ( ( ~ disjoint(X13,X14)
        | set_difference(X13,X14) = X13 )
      & ( set_difference(X13,X14) != X13
        | disjoint(X13,X14) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])]) ).

fof(c_0_9,plain,
    ! [X9,X10] :
      ( ~ disjoint(X9,X10)
      | disjoint(X10,X9) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).

fof(c_0_10,plain,
    ! [X7,X8] :
      ( in(X7,X8)
      | disjoint(singleton(X7),X8) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

cnf(c_0_11,negated_conjecture,
    ( in(esk2_0,esk1_0)
    | set_difference(esk1_0,singleton(esk2_0)) != esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( set_difference(X1,X2) = X1
    | ~ disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( disjoint(X2,X1)
    | ~ disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( disjoint(X1,X2)
    | set_difference(X1,X2) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    ( set_difference(esk1_0,singleton(esk2_0)) = esk1_0
    | ~ in(esk2_0,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,negated_conjecture,
    ( in(esk2_0,esk1_0)
    | ~ disjoint(esk1_0,singleton(esk2_0)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ( disjoint(X1,singleton(X2))
    | in(X2,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( disjoint(esk1_0,singleton(esk2_0))
    | ~ in(esk2_0,esk1_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    in(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

fof(c_0_21,plain,
    ! [X5,X6] :
      ( ~ disjoint(singleton(X5),X6)
      | ~ in(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l25_zfmisc_1])]) ).

cnf(c_0_22,negated_conjecture,
    disjoint(esk1_0,singleton(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

cnf(c_0_23,plain,
    ( ~ disjoint(singleton(X1),X2)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    disjoint(singleton(esk2_0),esk1_0),
    inference(spm,[status(thm)],[c_0_13,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Aug 23 15:03:46 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.19/0.58  % Version  : CSE_E---1.5
% 0.19/0.58  % Problem  : theBenchmark.p
% 0.19/0.58  % Proof found
% 0.19/0.58  % SZS status Theorem for theBenchmark.p
% 0.19/0.58  % SZS output start Proof
% See solution above
% 0.19/0.59  % Total time : 0.007000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.009000 s
%------------------------------------------------------------------------------