↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC309+1 : TPTP v9.2.1. Released v2.4.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 : n010.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:19:07 PM UTC 2026

% Result   : Theorem 1.32s 1.72s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  11 unt;   0 def)
%            Number of atoms       :  135 (  54 equ)
%            Maximal formula atoms :   17 (   4 avg)
%            Number of connectives :  164 (  62   ~;  60   |;  28   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  22   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ neq(X2,nil)
                    | ? [X5] :
                        ( ssItem(X5)
                        & ? [X6] :
                            ( ssList(X6)
                            & app(cons(X5,nil),X6) = X2
                            & app(X6,cons(X5,nil)) = X1 ) )
                    | ? [X7] :
                        ( ssItem(X7)
                        & ? [X8] :
                            ( ssList(X8)
                            & app(X8,cons(X7,nil)) != X3
                            & app(cons(X7,nil),X8) = X4 ) )
                    | ( nil != X3
                      & nil = X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(ax81,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => cons(X2,X1) = app(cons(X2,nil),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).

fof(ax20,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( nil = X1
        | ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ssItem(X3)
                & cons(X3,X2) = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).

fof(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | ? [X5] :
                          ( ssItem(X5)
                          & ? [X6] :
                              ( ssList(X6)
                              & app(cons(X5,nil),X6) = X2
                              & app(X6,cons(X5,nil)) = X1 ) )
                      | ? [X7] :
                          ( ssItem(X7)
                          & ? [X8] :
                              ( ssList(X8)
                              & app(X8,cons(X7,nil)) != X3
                              & app(cons(X7,nil),X8) = X4 ) )
                      | ( nil != X3
                        & nil = X4 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_6,negated_conjecture,
    ! [X468,X469,X470,X471] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & neq(esk49_0,nil)
      & ( ~ ssItem(X468)
        | ~ ssList(X469)
        | app(cons(X468,nil),X469) != esk49_0
        | app(X469,cons(X468,nil)) != esk48_0 )
      & ( ~ ssItem(X470)
        | ~ ssList(X471)
        | app(X471,cons(X470,nil)) = esk50_0
        | app(cons(X470,nil),X471) != esk51_0 )
      & ( nil = esk50_0
        | nil != esk51_0 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | app(cons(X1,nil),X2) != esk49_0
    | app(X2,cons(X1,nil)) != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( app(X2,cons(X1,nil)) = esk50_0
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(cons(X1,nil),X2) != esk51_0 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    ( app(X1,cons(X2,nil)) != esk50_0
    | app(cons(X2,nil),X1) != esk51_0
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

fof(c_0_12,plain,
    ! [X433,X434] :
      ( ~ ssList(X433)
      | ~ ssItem(X434)
      | cons(X434,X433) = app(cons(X434,nil),X433) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).

cnf(c_0_13,negated_conjecture,
    ( app(cons(X1,nil),X2) != esk51_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( cons(X2,X1) = app(cons(X2,nil),X1)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_15,plain,
    ! [X332] :
      ( ( ssList(esk44_1(X332))
        | nil = X332
        | ~ ssList(X332) )
      & ( ssItem(esk45_1(X332))
        | nil = X332
        | ~ ssList(X332) )
      & ( cons(esk45_1(X332),esk44_1(X332)) = X332
        | nil = X332
        | ~ ssList(X332) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).

cnf(c_0_16,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_17,negated_conjecture,
    ( cons(X1,X2) != esk51_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( cons(esk45_1(X1),esk44_1(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_16,c_0_9]) ).

cnf(c_0_20,negated_conjecture,
    ( esk51_0 = nil
    | ~ ssList(esk44_1(esk51_0))
    | ~ ssItem(esk45_1(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]),c_0_19])]) ).

cnf(c_0_21,plain,
    ( ssList(esk44_1(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_22,plain,
    ! [X322,X323] :
      ( ( ~ neq(X322,X323)
        | X322 != X323
        | ~ ssList(X323)
        | ~ ssList(X322) )
      & ( X322 = X323
        | neq(X322,X323)
        | ~ ssList(X323)
        | ~ ssList(X322) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).

cnf(c_0_23,negated_conjecture,
    neq(esk49_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_24,negated_conjecture,
    ( esk51_0 = nil
    | ~ ssItem(esk45_1(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]) ).

cnf(c_0_25,plain,
    ( ssItem(esk45_1(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_26,plain,
    ( ~ neq(X1,X2)
    | X1 != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    neq(esk51_0,nil),
    inference(rw,[status(thm)],[c_0_23,c_0_9]) ).

cnf(c_0_28,negated_conjecture,
    esk51_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19])]) ).

cnf(c_0_29,plain,
    ( ~ ssList(X1)
    | ~ neq(X1,X1) ),
    inference(er,[status(thm)],[c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    neq(nil,nil),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[ax17]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWC309+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11  % 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.14/0.32  % Computer : n010.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 04:43:06 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.32/1.72  % Version  : CSE_E---1.7
% 1.32/1.72  % Problem  : theBenchmark.p
% 1.32/1.72  % SZS status Theorem for theBenchmark.p
% 1.32/1.72  % SZS output start CNFRefutation
% See solution above
% 1.32/1.72  % Total time : 1.370s
%------------------------------------------------------------------------------