↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 1.34s 1.75s
% Output   : CNFRefutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   44 (  19 unt;   0 def)
%            Number of atoms       :  180 (  45 equ)
%            Maximal formula atoms :   26 (   4 avg)
%            Number of connectives :  208 (  72   ~;  75   |;  28   &)
%                                         (   1 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   9 con; 0-2 aty)
%            Number of variables   :   68 (   0 sgn  47   !;   2   ?)

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

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

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

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

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

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

fof(ax14,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( equalelemsP(X1)
      <=> ! [X2] :
            ( ssItem(X2)
           => ! [X3] :
                ( ssItem(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ! [X5] :
                        ( ssList(X5)
                       => ( app(X4,cons(X2,cons(X3,X5))) = X1
                         => X2 = X3 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax14) ).

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

fof(c_0_8,negated_conjecture,
    ! [X470] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & frontsegP(esk51_0,esk50_0)
      & equalelemsP(esk50_0)
      & ( ~ ssList(X470)
        | ~ neq(esk50_0,X470)
        | ~ frontsegP(esk51_0,X470)
        | ~ segmentP(X470,esk50_0)
        | ~ equalelemsP(X470) )
      & ssItem(esk52_0)
      & ssItem(esk53_0)
      & ssList(esk54_0)
      & ssList(esk55_0)
      & app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
      & esk52_0 != esk53_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_9,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

fof(c_0_11,plain,
    ! [X437,X438,X439] :
      ( ~ ssList(X437)
      | ~ ssList(X438)
      | ~ ssList(X439)
      | app(app(X437,X438),X439) = app(X437,app(X438,X439)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).

cnf(c_0_12,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ssList(esk54_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_15,plain,
    ! [X326,X327] :
      ( ~ ssList(X326)
      | ~ ssItem(X327)
      | ssList(cons(X327,X326)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

cnf(c_0_16,negated_conjecture,
    ( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_17,plain,
    ( ssList(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_19,negated_conjecture,
    ssItem(esk53_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,negated_conjecture,
    ( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_21,negated_conjecture,
    ssItem(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_23,negated_conjecture,
    app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]),c_0_21])]) ).

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

cnf(c_0_25,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).

cnf(c_0_26,negated_conjecture,
    app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_27,negated_conjecture,
    ssList(esk55_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_28,negated_conjecture,
    ( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
    | ~ ssList(cons(esk52_0,cons(esk53_0,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_26]),c_0_27]),c_0_14])]) ).

cnf(c_0_29,negated_conjecture,
    ( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_21])]) ).

fof(c_0_30,plain,
    ! [X347,X348,X349] :
      ( ~ ssList(X347)
      | ~ ssList(X348)
      | ~ ssItem(X349)
      | cons(X349,app(X348,X347)) = app(cons(X349,X348),X347) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).

cnf(c_0_31,negated_conjecture,
    app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_32,plain,
    ( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssItem(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_33,plain,
    ! [X315,X316,X317,X318,X319] :
      ( ( ~ equalelemsP(X315)
        | ~ ssItem(X316)
        | ~ ssItem(X317)
        | ~ ssList(X318)
        | ~ ssList(X319)
        | app(X318,cons(X316,cons(X317,X319))) != X315
        | X316 = X317
        | ~ ssList(X315) )
      & ( ssItem(esk40_1(X315))
        | equalelemsP(X315)
        | ~ ssList(X315) )
      & ( ssItem(esk41_1(X315))
        | equalelemsP(X315)
        | ~ ssList(X315) )
      & ( ssList(esk42_1(X315))
        | equalelemsP(X315)
        | ~ ssList(X315) )
      & ( ssList(esk43_1(X315))
        | equalelemsP(X315)
        | ~ ssList(X315) )
      & ( app(esk42_1(X315),cons(esk40_1(X315),cons(esk41_1(X315),esk43_1(X315)))) = X315
        | equalelemsP(X315)
        | ~ ssList(X315) )
      & ( esk40_1(X315) != esk41_1(X315)
        | equalelemsP(X315)
        | ~ ssList(X315) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])])])]) ).

cnf(c_0_34,negated_conjecture,
    ( app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_21])]) ).

cnf(c_0_35,plain,
    ( X2 = X3
    | ~ equalelemsP(X1)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X2,cons(X3,X5))) != X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_18]),c_0_19])]) ).

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

cnf(c_0_38,plain,
    ( X1 = X2
    | ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
    | ~ ssList(app(X3,cons(X1,cons(X2,X4))))
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(er,[status(thm)],[c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_27]),c_0_19])]) ).

cnf(c_0_40,negated_conjecture,
    equalelemsP(esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_41,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_37,c_0_10]) ).

cnf(c_0_42,negated_conjecture,
    esk52_0 != esk53_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_27]),c_0_14]),c_0_19]),c_0_21])]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWC191+1 : TPTP v9.2.1. Released v2.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.14/0.32  % Computer : n026.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:33:38 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.34/1.75  % Version  : CSE_E---1.7
% 1.34/1.75  % Problem  : theBenchmark.p
% 1.34/1.75  % SZS status Theorem for theBenchmark.p
% 1.34/1.75  % SZS output start CNFRefutation
% See solution above
% 1.34/1.75  % Total time : 1.372s
%------------------------------------------------------------------------------