↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : ALG226+4 : TPTP v9.2.1. Released v3.4.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 : n013.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:08:19 PM UTC 2026

% Result   : Theorem 93.33s 87.94s
% Output   : CNFRefutation 93.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (  16 unt;   0 def)
%            Number of atoms       :   78 (  23 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   75 (  25   ~;  19   |;  17   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t6_closure3,axiom,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_relat_1(X2)
            & m1_pboole(X2,X1) )
         => X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_closure3) ).

fof(t7_closure3,conjecture,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_relat_1(X2)
            & m1_pboole(X2,X1) )
         => ! [X3] :
              ( ( v2_relat_1(X3)
                & m1_pboole(X3,X1) )
             => ( ( k1_closure3(X1,X2) = k1_closure3(X1,X3)
                  & k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3)) )
               => r6_pboole(X1,X2,X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_closure3) ).

fof(d6_pboole,axiom,
    ! [X1] : k1_pboole(X1) = k2_funcop_1(X1,k1_xboole_0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+80.ax',d6_pboole) ).

fof(redefinition_r6_pboole,axiom,
    ! [X1,X2,X3] :
      ( ( m1_pboole(X2,X1)
        & m1_pboole(X3,X1) )
     => ( r6_pboole(X1,X2,X3)
      <=> X2 = X3 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+80.ax',redefinition_r6_pboole) ).

fof(c_0_4,plain,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_relat_1(X2)
            & m1_pboole(X2,X1) )
         => X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
    inference(fof_simplification,[status(thm)],[t6_closure3]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ~ v1_xboole_0(X1)
       => ! [X2] :
            ( ( v2_relat_1(X2)
              & m1_pboole(X2,X1) )
           => ! [X3] :
                ( ( v2_relat_1(X3)
                  & m1_pboole(X3,X1) )
               => ( ( k1_closure3(X1,X2) = k1_closure3(X1,X3)
                    & k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3)) )
                 => r6_pboole(X1,X2,X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t7_closure3])]) ).

fof(c_0_6,plain,
    ! [X2709,X2710] :
      ( v1_xboole_0(X2709)
      | ~ v2_relat_1(X2710)
      | ~ m1_pboole(X2710,X2709)
      | X2710 = k1_funct_4(k1_pboole(X2709),k7_relat_1(X2710,k1_closure3(X2709,X2710))) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,plain,
    ! [X4946] : k1_pboole(X4946) = k2_funcop_1(X4946,k1_xboole_0),
    inference(variable_rename,[status(thm)],[d6_pboole]) ).

fof(c_0_8,negated_conjecture,
    ( ~ v1_xboole_0(esk1_0)
    & v2_relat_1(esk2_0)
    & m1_pboole(esk2_0,esk1_0)
    & v2_relat_1(esk3_0)
    & m1_pboole(esk3_0,esk1_0)
    & k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0)
    & k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0))
    & ~ r6_pboole(esk1_0,esk2_0,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,plain,
    ( v1_xboole_0(X1)
    | X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2)))
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    k1_pboole(X1) = k2_funcop_1(X1,k1_xboole_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_13,plain,
    ! [X2530,X2531,X2532] :
      ( ( ~ r6_pboole(X2530,X2531,X2532)
        | X2531 = X2532
        | ~ m1_pboole(X2531,X2530)
        | ~ m1_pboole(X2532,X2530) )
      & ( X2531 != X2532
        | r6_pboole(X2530,X2531,X2532)
        | ~ m1_pboole(X2531,X2530)
        | ~ m1_pboole(X2532,X2530) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r6_pboole])])]) ).

cnf(c_0_14,plain,
    ( X2 = k1_funct_4(k2_funcop_1(X1,k1_xboole_0),k7_relat_1(X2,k1_closure3(X1,X2)))
    | v1_xboole_0(X1)
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    m1_pboole(esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    k7_relat_1(esk3_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    v2_relat_1(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,plain,
    ( r6_pboole(X3,X1,X2)
    | X1 != X2
    | ~ m1_pboole(X1,X3)
    | ~ m1_pboole(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    m1_pboole(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_21,negated_conjecture,
    v2_relat_1(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_22,negated_conjecture,
    k1_funct_4(k2_funcop_1(esk1_0,k1_xboole_0),k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0))) = esk3_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]),c_0_16]),c_0_17])]),c_0_18]) ).

cnf(c_0_23,plain,
    ( r6_pboole(X1,X2,X2)
    | ~ m1_pboole(X2,X1) ),
    inference(er,[status(thm)],[c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ~ r6_pboole(esk1_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_25,negated_conjecture,
    esk3_0 = esk2_0,
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_21])]),c_0_18]),c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    r6_pboole(esk1_0,esk2_0,esk2_0),
    inference(spm,[status(thm)],[c_0_23,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : ALG226+4 : TPTP v9.2.1. Released v3.4.0.
% 0.00/0.11  % 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.13/0.32  % Computer : n013.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Tue May  5 10:25:48 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 93.33/87.94  % Version  : CSE_E---1.7
% 93.33/87.94  % Problem  : theBenchmark.p
% 93.33/87.94  % SZS status Theorem for theBenchmark.p
% 93.33/87.94  % SZS output start CNFRefutation
% See solution above
% 93.33/87.98  % Total time : 86.202s
%------------------------------------------------------------------------------