↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC104+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 : n024.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:17 PM UTC 2026

% Result   : Theorem 1.16s 1.62s
% Output   : CNFRefutation 1.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (  16 unt;   0 def)
%            Number of atoms       :  136 (  36 equ)
%            Maximal formula atoms :   21 (   4 avg)
%            Number of connectives :  163 (  59   ~;  54   |;  32   &)
%                                         (   2 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn  27   !;   9   ?)

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

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

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

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

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/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] :
                          ( ssList(X5)
                         => ( app(X3,X5) != X4
                            | ~ totalorderedP(X3)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ssList(X7)
                                    & app(cons(X6,nil),X7) = X5
                                    & ? [X8] :
                                        ( ssItem(X8)
                                        & ? [X9] :
                                            ( ssList(X9)
                                            & app(X9,cons(X8,nil)) = X3
                                            & leq(X8,X6) ) ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 )
                      | ( neq(X1,nil)
                        & frontsegP(X2,X1) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_6,plain,
    ! [X235,X236,X238] :
      ( ( ssList(esk6_2(X235,X236))
        | ~ frontsegP(X235,X236)
        | ~ ssList(X236)
        | ~ ssList(X235) )
      & ( app(X236,esk6_2(X235,X236)) = X235
        | ~ frontsegP(X235,X236)
        | ~ ssList(X236)
        | ~ ssList(X235) )
      & ( ~ ssList(X238)
        | app(X236,X238) != X235
        | frontsegP(X235,X236)
        | ~ ssList(X236)
        | ~ ssList(X235) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).

fof(c_0_7,plain,
    ! [X345,X346] :
      ( ~ ssList(X345)
      | ~ ssList(X346)
      | ssList(app(X345,X346)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X471,X472,X473,X474] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & neq(esk49_0,nil)
      & ssList(esk52_0)
      & app(esk50_0,esk52_0) = esk51_0
      & totalorderedP(esk50_0)
      & ( ~ ssItem(X471)
        | ~ ssList(X472)
        | app(cons(X471,nil),X472) != esk52_0
        | ~ ssItem(X473)
        | ~ ssList(X474)
        | app(X474,cons(X473,nil)) != esk50_0
        | ~ leq(X473,X471) )
      & ( nil = esk51_0
        | nil != esk50_0 )
      & ( ~ neq(esk48_0,nil)
        | ~ frontsegP(esk49_0,esk48_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_9,plain,
    ( frontsegP(X3,X2)
    | ~ ssList(X1)
    | app(X2,X1) != X3
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_11,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_13,negated_conjecture,
    ( ~ neq(esk48_0,nil)
    | ~ frontsegP(esk49_0,esk48_0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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

cnf(c_0_16,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    ssList(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ frontsegP(esk51_0,esk50_0)
    | ~ neq(esk50_0,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_14]),c_0_12]) ).

cnf(c_0_20,negated_conjecture,
    frontsegP(esk51_0,esk50_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).

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

cnf(c_0_22,negated_conjecture,
    ~ neq(esk50_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

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

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

cnf(c_0_25,negated_conjecture,
    neq(esk49_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_26,negated_conjecture,
    ( nil = esk51_0
    | nil != esk50_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_27,negated_conjecture,
    esk50_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_17])]) ).

cnf(c_0_28,negated_conjecture,
    neq(esk51_0,nil),
    inference(rw,[status(thm)],[c_0_25,c_0_14]) ).

cnf(c_0_29,negated_conjecture,
    esk51_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SWC104+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n024.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 23:26:11 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.24  % start to proof: theBenchmark
% 1.16/1.62  % Version  : CSE_E---1.7
% 1.16/1.62  % Problem  : theBenchmark.p
% 1.16/1.62  % SZS status Theorem for theBenchmark.p
% 1.16/1.62  % SZS output start CNFRefutation
% See solution above
% 1.16/1.62  % Total time : 1.361s
%------------------------------------------------------------------------------