↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 1.52s 1.79s
% Output   : CNFRefutation 1.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   44 (  18 unt;   0 def)
%            Number of atoms       :  188 (  21 equ)
%            Maximal formula atoms :   36 (   4 avg)
%            Number of connectives :  240 (  96   ~;  96   |;  33   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   51 (   0 sgn  28   !;   5   ?)

% 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)
                          & neq(X5,nil)
                          & segmentP(X2,X5)
                          & segmentP(X1,X5) )
                      | ! [X6] :
                          ( ~ ssList(X6)
                          | ~ neq(X6,nil)
                          | ~ frontsegP(X4,X6)
                          | ~ frontsegP(X3,X6) ) )
                    & ( ~ neq(X2,nil)
                      | neq(X4,nil) ) ) ) ) ) ),
    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(ax28,axiom,
    ! [X1] :
      ( ssList(X1)
     => app(nil,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).

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

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

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

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

fof(c_0_7,negated_conjecture,
    ! [X464] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ( neq(esk49_0,nil)
        | neq(esk49_0,nil) )
      & ( ~ neq(esk51_0,nil)
        | neq(esk49_0,nil) )
      & ( neq(esk49_0,nil)
        | ~ ssList(X464)
        | ~ neq(X464,nil)
        | ~ segmentP(esk49_0,X464)
        | ~ segmentP(esk48_0,X464) )
      & ( ~ neq(esk51_0,nil)
        | ~ ssList(X464)
        | ~ neq(X464,nil)
        | ~ segmentP(esk49_0,X464)
        | ~ segmentP(esk48_0,X464) )
      & ( neq(esk49_0,nil)
        | ssList(esk52_0) )
      & ( ~ neq(esk51_0,nil)
        | ssList(esk52_0) )
      & ( neq(esk49_0,nil)
        | neq(esk52_0,nil) )
      & ( ~ neq(esk51_0,nil)
        | neq(esk52_0,nil) )
      & ( neq(esk49_0,nil)
        | frontsegP(esk51_0,esk52_0) )
      & ( ~ neq(esk51_0,nil)
        | frontsegP(esk51_0,esk52_0) )
      & ( neq(esk49_0,nil)
        | frontsegP(esk50_0,esk52_0) )
      & ( ~ neq(esk51_0,nil)
        | frontsegP(esk50_0,esk52_0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).

fof(c_0_8,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_9,negated_conjecture,
    ( neq(esk49_0,nil)
    | neq(esk49_0,nil) ),
    inference(split_conjunct,[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]) ).

fof(c_0_11,plain,
    ! [X344] :
      ( ~ ssList(X344)
      | app(nil,X344) = X344 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).

fof(c_0_12,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_13,plain,
    ! [X229,X230,X232] :
      ( ( ssList(esk6_2(X229,X230))
        | ~ frontsegP(X229,X230)
        | ~ ssList(X230)
        | ~ ssList(X229) )
      & ( app(X230,esk6_2(X229,X230)) = X229
        | ~ frontsegP(X229,X230)
        | ~ ssList(X230)
        | ~ ssList(X229) )
      & ( ~ ssList(X232)
        | app(X230,X232) != X229
        | frontsegP(X229,X230)
        | ~ ssList(X230)
        | ~ ssList(X229) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).

cnf(c_0_14,negated_conjecture,
    ( frontsegP(esk51_0,esk52_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    neq(esk49_0,nil),
    inference(cn,[status(thm)],[c_0_9]) ).

cnf(c_0_17,negated_conjecture,
    ( ssList(esk52_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_19,negated_conjecture,
    ( neq(esk52_0,nil)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,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_21,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

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

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

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

cnf(c_0_25,negated_conjecture,
    frontsegP(esk49_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_16])]) ).

cnf(c_0_26,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_27,negated_conjecture,
    ssList(esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_16])]) ).

cnf(c_0_28,plain,
    ( ssList(esk6_2(X1,X2))
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_29,negated_conjecture,
    ( frontsegP(esk50_0,esk52_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_30,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ segmentP(esk48_0,X1)
    | ~ segmentP(esk49_0,X1)
    | ~ ssList(X1)
    | ~ neq(X1,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_16])]) ).

cnf(c_0_32,negated_conjecture,
    neq(esk52_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15]),c_0_16])]) ).

cnf(c_0_33,plain,
    ( segmentP(app(X1,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).

cnf(c_0_34,negated_conjecture,
    app(esk52_0,esk6_2(esk49_0,esk52_0)) = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_35,negated_conjecture,
    ssList(esk6_2(esk49_0,esk52_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_27]),c_0_26])]) ).

cnf(c_0_36,negated_conjecture,
    frontsegP(esk48_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_15]),c_0_16])]) ).

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

cnf(c_0_38,negated_conjecture,
    ( ~ segmentP(esk48_0,esk52_0)
    | ~ segmentP(esk49_0,esk52_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27])]) ).

cnf(c_0_39,negated_conjecture,
    segmentP(esk49_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27]),c_0_35])]) ).

cnf(c_0_40,negated_conjecture,
    app(esk52_0,esk6_2(esk48_0,esk52_0)) = esk48_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_36]),c_0_37]),c_0_27])]) ).

cnf(c_0_41,negated_conjecture,
    ssList(esk6_2(esk48_0,esk52_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_27]),c_0_37])]) ).

cnf(c_0_42,negated_conjecture,
    ~ segmentP(esk48_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).

cnf(c_0_43,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_33,c_0_40]),c_0_27]),c_0_41])]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC080+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.16/0.33  % Computer : n011.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 04:24:02 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.52/1.79  % Version  : CSE_E---1.7
% 1.52/1.79  % Problem  : theBenchmark.p
% 1.52/1.79  % SZS status Theorem for theBenchmark.p
% 1.52/1.79  % SZS output start CNFRefutation
% See solution above
% 1.52/1.79  % Total time : 1.371s
%------------------------------------------------------------------------------