↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC068+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 : n003.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:18:08 PM UTC 2026

% Result   : Theorem 1.39s 1.75s
% Output   : CNFRefutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   41 (  15 unt;   0 def)
%            Number of atoms       :  161 (  52 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  204 (  84   ~;  76   |;  25   &)
%                                         (   3 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   49 (   0 sgn  27   !;   4   ?)

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

fof(ax7,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( segmentP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & ? [X4] :
                    ( ssList(X4)
                    & app(app(X3,X2),X4) = X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).

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

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

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

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(ax83,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil = app(X1,X2)
          <=> ( nil = X2
              & nil = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( app(X4,X4) != X3
                      | X2 != X4
                      | X1 != X3
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X5,nil)
                          & segmentP(X2,X5)
                          & segmentP(X1,X5) )
                      | ( nil = X2
                        & nil = X1 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_8,plain,
    ! [X236,X237,X240,X241] :
      ( ( ssList(esk8_2(X236,X237))
        | ~ segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) )
      & ( ssList(esk9_2(X236,X237))
        | ~ segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) )
      & ( app(app(esk8_2(X236,X237),X237),esk9_2(X236,X237)) = X236
        | ~ segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) )
      & ( ~ ssList(X240)
        | ~ ssList(X241)
        | app(app(X240,X237),X241) != X236
        | segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).

fof(c_0_9,negated_conjecture,
    ! [X463] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & app(esk51_0,esk51_0) = esk50_0
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ( ~ ssList(X463)
        | ~ neq(X463,nil)
        | ~ segmentP(esk49_0,X463)
        | ~ segmentP(esk48_0,X463) )
      & ( nil != esk49_0
        | nil != esk48_0 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_10,plain,
    ( segmentP(X4,X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(app(X1,X3),X2) != X4
    | ~ ssList(X3)
    | ~ ssList(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    app(esk51_0,esk51_0) = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_15,plain,
    ( segmentP(app(app(X1,X2),X3),X2)
    | ~ ssList(app(app(X1,X2),X3))
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    app(esk51_0,esk51_0) = esk48_0,
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

fof(c_0_18,plain,
    ! [X435] :
      ( ~ ssList(X435)
      | app(X435,nil) = X435 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ segmentP(esk49_0,X1)
    | ~ segmentP(esk48_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_20,negated_conjecture,
    ( segmentP(app(esk48_0,X1),esk51_0)
    | ~ ssList(app(esk48_0,X1))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

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

cnf(c_0_22,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_24,negated_conjecture,
    ( ~ segmentP(esk48_0,X1)
    | ~ segmentP(esk51_0,X1)
    | ~ ssList(X1)
    | ~ neq(X1,nil) ),
    inference(rw,[status(thm)],[c_0_19,c_0_14]) ).

cnf(c_0_25,negated_conjecture,
    segmentP(esk48_0,esk51_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).

fof(c_0_26,plain,
    ! [X397] :
      ( ~ ssList(X397)
      | segmentP(X397,X397) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ segmentP(esk51_0,esk51_0)
    | ~ neq(esk51_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]) ).

cnf(c_0_28,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

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

fof(c_0_30,plain,
    ! [X433,X434] :
      ( ( nil = X434
        | nil != app(X433,X434)
        | ~ ssList(X434)
        | ~ ssList(X433) )
      & ( nil = X433
        | nil != app(X433,X434)
        | ~ ssList(X434)
        | ~ ssList(X433) )
      & ( nil != X434
        | nil != X433
        | nil = app(X433,X434)
        | ~ ssList(X434)
        | ~ ssList(X433) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).

cnf(c_0_31,negated_conjecture,
    ( nil != esk49_0
    | nil != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_32,negated_conjecture,
    ~ neq(esk51_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17])]) ).

cnf(c_0_33,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_34,plain,
    ( nil = app(X2,X1)
    | nil != X1
    | nil != X2
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_35,plain,
    ( nil = X1
    | nil != app(X2,X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    ( esk48_0 != nil
    | esk51_0 != nil ),
    inference(rw,[status(thm)],[c_0_31,c_0_14]) ).

cnf(c_0_37,negated_conjecture,
    esk51_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_23]),c_0_17])]) ).

cnf(c_0_38,plain,
    app(nil,nil) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_34])]),c_0_23])]) ).

cnf(c_0_39,negated_conjecture,
    esk48_0 != nil,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_16]),c_0_17])]),c_0_36]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_37]),c_0_37]),c_0_38]),c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC068+1 : TPTP v9.2.1. Released v2.4.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.17/0.33  % Computer : n003.cluster.edu
% 0.17/0.33  % Model    : x86_64 x86_64
% 0.17/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33  % Memory   : 8042.1875MB
% 0.17/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33  % CPULimit   : 300
% 0.17/0.33  % WCLimit    : 300
% 0.17/0.33  % DateTime   : Tue May  5 04:21:41 EDT 2026
% 0.17/0.33  % CPUTime    : 
% 0.17/0.34  % start to proof: theBenchmark
% 1.39/1.75  % Version  : CSE_E---1.7
% 1.39/1.75  % Problem  : theBenchmark.p
% 1.39/1.75  % SZS status Theorem for theBenchmark.p
% 1.39/1.75  % SZS output start CNFRefutation
% See solution above
% 1.39/1.75  % Total time : 1.373s
%------------------------------------------------------------------------------