↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 15.82s 9.91s
% Output   : CNFRefutation 15.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (  16 unt;   0 def)
%            Number of atoms       :  150 (  13 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  188 (  72   ~;  71   |;  26   &)
%                                         (   2 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  27   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ segmentP(X4,X3)
                    | ~ strictorderedP(X3)
                    | ? [X5] :
                        ( ssList(X5)
                        & neq(X3,X5)
                        & segmentP(X4,X5)
                        & segmentP(X5,X3)
                        & strictorderedP(X5) )
                    | ! [X6] :
                        ( ssItem(X6)
                       => ( ~ memberP(X1,X6)
                          | memberP(X2,X6) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(ax36,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( memberP(app(X2,X3),X1)
              <=> ( memberP(X2,X1)
                  | memberP(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).

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

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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ segmentP(X4,X3)
                      | ~ strictorderedP(X3)
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X3,X5)
                          & segmentP(X4,X5)
                          & segmentP(X5,X3)
                          & strictorderedP(X5) )
                      | ! [X6] :
                          ( ssItem(X6)
                         => ( ~ memberP(X1,X6)
                            | memberP(X2,X6) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_5,negated_conjecture,
    ! [X464] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & segmentP(esk51_0,esk50_0)
      & strictorderedP(esk50_0)
      & ( ~ ssList(X464)
        | ~ neq(esk50_0,X464)
        | ~ segmentP(esk51_0,X464)
        | ~ segmentP(X464,esk50_0)
        | ~ strictorderedP(X464) )
      & ssItem(esk52_0)
      & memberP(esk48_0,esk52_0)
      & ~ memberP(esk49_0,esk52_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_6,plain,
    ! [X360,X361,X362] :
      ( ( ~ memberP(app(X361,X362),X360)
        | memberP(X361,X360)
        | memberP(X362,X360)
        | ~ ssList(X362)
        | ~ ssList(X361)
        | ~ ssItem(X360) )
      & ( ~ memberP(X361,X360)
        | memberP(app(X361,X362),X360)
        | ~ ssList(X362)
        | ~ ssList(X361)
        | ~ ssItem(X360) )
      & ( ~ memberP(X362,X360)
        | memberP(app(X361,X362),X360)
        | ~ ssList(X362)
        | ~ ssList(X361)
        | ~ ssItem(X360) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).

cnf(c_0_7,negated_conjecture,
    memberP(esk48_0,esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

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

cnf(c_0_10,plain,
    ( memberP(app(X3,X1),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    memberP(esk50_0,esk52_0),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ssItem(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,plain,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    ( memberP(app(X1,esk50_0),esk52_0)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).

fof(c_0_16,plain,
    ! [X339,X340] :
      ( ~ ssList(X339)
      | ~ ssList(X340)
      | ssList(app(X339,X340)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

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

cnf(c_0_18,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_19,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_20,negated_conjecture,
    ( memberP(app(app(X1,esk50_0),X2),esk52_0)
    | ~ ssList(app(X1,esk50_0))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]) ).

cnf(c_0_21,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    ( app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1
    | ~ segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    segmentP(esk51_0,esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_24,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,plain,
    ( ssList(esk9_2(X1,X2))
    | ~ segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

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

cnf(c_0_27,negated_conjecture,
    ~ memberP(esk49_0,esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_28,negated_conjecture,
    ( memberP(app(app(X1,esk50_0),X2),esk52_0)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12])]) ).

cnf(c_0_29,negated_conjecture,
    app(app(esk8_2(esk51_0,esk50_0),esk50_0),esk9_2(esk51_0,esk50_0)) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_24])]) ).

cnf(c_0_30,negated_conjecture,
    ssList(esk9_2(esk51_0,esk50_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_12]),c_0_24])]) ).

cnf(c_0_31,negated_conjecture,
    ssList(esk8_2(esk51_0,esk50_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_12]),c_0_24])]) ).

cnf(c_0_32,negated_conjecture,
    ~ memberP(esk51_0,esk52_0),
    inference(rw,[status(thm)],[c_0_27,c_0_19]) ).

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

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