↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET616+3 : TPTP v9.2.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n018.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:08:08 PM UTC 2026

% Result   : Theorem 1.29s 1.73s
% Output   : CNFRefutation 1.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (   6 unt;   0 def)
%            Number of atoms       :   66 (  13 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   66 (  25   ~;  24   |;  10   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            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   :   46 (   3 sgn  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,difference(X1,X2))
    <=> ( member(X3,X1)
        & ~ member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).

fof(prove_th90,conjecture,
    ! [X1,X2] :
      ( difference(X1,X2) = difference(X2,X1)
     => X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th90) ).

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

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

fof(c_0_4,plain,
    ! [X1,X2,X3] :
      ( member(X3,difference(X1,X2))
    <=> ( member(X3,X1)
        & ~ member(X3,X2) ) ),
    inference(fof_simplification,[status(thm)],[difference_defn]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2] :
        ( difference(X1,X2) = difference(X2,X1)
       => X1 = X2 ),
    inference(assume_negation,[status(cth)],[prove_th90]) ).

fof(c_0_6,plain,
    ! [X24,X25,X26] :
      ( ( member(X26,X24)
        | ~ member(X26,difference(X24,X25)) )
      & ( ~ member(X26,X25)
        | ~ member(X26,difference(X24,X25)) )
      & ( ~ member(X26,X24)
        | member(X26,X25)
        | member(X26,difference(X24,X25)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,negated_conjecture,
    ( difference(esk4_0,esk5_0) = difference(esk5_0,esk4_0)
    & esk4_0 != esk5_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X36,X37,X38,X39,X40] :
      ( ( ~ subset(X36,X37)
        | ~ member(X38,X36)
        | member(X38,X37) )
      & ( member(esk3_2(X39,X40),X39)
        | subset(X39,X40) )
      & ( ~ member(esk3_2(X39,X40),X40)
        | subset(X39,X40) ) ),
    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])])])])])]) ).

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

cnf(c_0_10,negated_conjecture,
    difference(esk4_0,esk5_0) = difference(esk5_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_12,plain,
    ( member(X1,X3)
    | member(X1,difference(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,plain,
    ( member(esk3_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ~ member(X1,difference(esk5_0,esk4_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_15,plain,
    ( subset(X1,X2)
    | member(esk3_2(X1,X2),difference(X1,X3))
    | member(esk3_2(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_16,plain,
    ! [X27,X28] :
      ( ( subset(X27,X28)
        | X27 != X28 )
      & ( subset(X28,X27)
        | X27 != X28 )
      & ( ~ subset(X27,X28)
        | ~ subset(X28,X27)
        | X27 = X28 ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).

cnf(c_0_17,plain,
    ( subset(X1,X2)
    | ~ member(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    ( subset(esk5_0,X1)
    | member(esk3_2(esk5_0,X1),esk4_0) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    ( X1 = X2
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    subset(esk5_0,esk4_0),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    esk4_0 != esk5_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_22,negated_conjecture,
    ( subset(esk4_0,X1)
    | member(esk3_2(esk4_0,X1),esk5_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    ~ subset(esk4_0,esk5_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET616+3 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34  % Computer : n018.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Tue May  5 02:31:17 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.29/1.73  % Version  : CSE_E---1.7
% 1.29/1.73  % Problem  : theBenchmark.p
% 1.29/1.73  % SZS status Theorem for theBenchmark.p
% 1.29/1.73  % SZS output start CNFRefutation
% See solution above
% 1.29/1.73  % Total time : 1.369s
%------------------------------------------------------------------------------