↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC019+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:07:32 PM UTC 2026

% Result   : Theorem 2.38s 1.29s
% Output   : CNFRefutation 2.38s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f545ERROR: Could not build tree for root c_11685ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

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

fof(f42,axiom,
    ! [X0] :
      ( ssList(X0)
     => frontsegP(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( nil = X0
                      & nil = X1 )
                    | ? [X4] :
                        ( frontsegP(X0,X4)
                        & frontsegP(X1,X4)
                        & neq(X4,nil)
                        & ssList(X4) )
                    | X3 != X2
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( nil = X0
                        & nil = X1 )
                      | ? [X4] :
                          ( frontsegP(X0,X4)
                          & frontsegP(X1,X4)
                          & neq(X4,nil)
                          & ssList(X4) )
                      | X3 != X2
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f118,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f153,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | frontsegP(X0,X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f221,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ( nil != X0
                    | nil != X1 )
                  & ! [X4] :
                      ( ~ frontsegP(X0,X4)
                      | ~ frontsegP(X1,X4)
                      | ~ neq(X4,nil)
                      | ~ ssList(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ( nil != X0
                    | nil != X1 )
                  & ! [X4] :
                      ( ~ frontsegP(X0,X4)
                      | ~ frontsegP(X1,X4)
                      | ~ neq(X4,nil)
                      | ~ ssList(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(flattening,[],[f221]) ).

fof(f273,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ( ( ~ neq(X0,X1)
              | X0 != X1 )
            & ( X0 = X1
              | neq(X0,X1) ) ) ) ),
    inference(nnf_transformation,[],[f118]) ).

fof(f296,plain,
    ( ssList(sK53)
    & ssList(sK54)
    & ssList(sK55)
    & ssList(sK56)
    & ( nil != sK53
      | nil != sK54 )
    & ! [X4] :
        ( ~ frontsegP(sK53,X4)
        | ~ frontsegP(sK54,X4)
        | ~ neq(X4,nil)
        | ~ ssList(X4) )
    & sK55 = sK56
    & sK53 = sK55
    & sK54 = sK56 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).

fof(f387,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 = X1
      | neq(X0,X1) ),
    inference(cnf_transformation,[],[f273]) ).

fof(f389,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f423,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | frontsegP(X0,X0) ),
    inference(cnf_transformation,[],[f153]) ).

fof(f496,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    sK55 = sK56,
    inference(cnf_transformation,[],[f296]) ).

fof(f503,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f296]) ).

fof(f505,plain,
    sK53 = sK56,
    inference(definition_unfolding,[],[f503,f502]) ).

fof(f510,plain,
    ssList(sK56),
    inference(definition_unfolding,[],[f496,f505]) ).

tcf(c_138,plain,
    ! [X0: $i,X1: $i] :
      ( neq(X0,X1)
      | ( X0 = X1 )
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f387]) ).

tcf(c_141,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f389]) ).

tcf(c_175,plain,
    ! [X0: $i] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f423]) ).

tcf(c_246,negated_conjecture,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ~ frontsegP(sK56,X0)
      | ~ neq(X0,nil) ),
    inference(cnf_transformation,[],[f545]) ).

tcf(c_247,negated_conjecture,
    nil != sK56,
    inference(cnf_transformation,[],[f546]) ).

tcf(c_251,negated_conjecture,
    ssList(sK56),
    inference(cnf_transformation,[],[f510]) ).

tcf(c_3203,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X0 = X2 )
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ frontsegP(sK56,X1)
      | ( X2 != nil )
      | ( X0 != X1 ) ),
    inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).

tcf(c_3204,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ frontsegP(sK56,X0) ),
    inference(unflattening,[status(thm)],[c_3203]) ).

tcf(c_3206,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ frontsegP(sK56,X0)
      | ~ ssList(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_3204,c_141,c_3204]) ).

tcf(c_3207,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(X0)
      | ~ frontsegP(sK56,X0) ),
    inference(renaming,[status(thm)],[c_3206]) ).

tcf(c_8812,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(X0)
      | ~ frontsegP(sK56,X0) ),
    inference(demodulation,[status(thm)],[c_3207]) ).

tcf(c_8813,negated_conjecture,
    ssList(sK56),
    inference(demodulation,[status(thm)],[c_251]) ).

tcf(c_8814,negated_conjecture,
    nil != sK56,
    inference(demodulation,[status(thm)],[c_247]) ).

tcf(c_11684,plain,
    ( ( nil = sK56 )
    | ~ ssList(sK56) ),
    inference(superposition,[status(thm)],[c_175,c_8812]) ).

tcf(c_11685,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_11684,c_8814,c_8813]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC019+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.38  % Computer : n003.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Thu Sep 24 15:58:06 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.42  Running first-order theorem proving
% 0.09/0.42  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.43  
% 0.09/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43  
% 0.09/0.43  % Detected problem language: tptp
% 0.09/0.44  % Proving...
% 2.38/1.29  % SZS status Started for theBenchmark.p
% 2.38/1.29  % SZS status Theorem for theBenchmark.p
% 2.38/1.29  
% 2.38/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.38/1.29  
% 2.38/1.29  % ------  iProver source info
% 2.38/1.29  
% 2.38/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 2.38/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.38/1.29  % git: non_committed_changes: false
% 2.38/1.29  
% 2.38/1.29  % ------ Parsing...
% 2.38/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.38/1.29  
% 2.38/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 5 0s  sf_e  pe_s  pe_e % 
% 2.38/1.29  
% 2.38/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.38/1.29  
% 2.38/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.38/1.29  % ------ Proving...
% 2.38/1.29  % ------ Problem Properties 
% 2.38/1.29  
% 2.38/1.29  % 
% 2.38/1.29  % clauses                               183
% 2.38/1.29  % conjectures                           2
% 2.38/1.29  % EPR                                   52
% 2.38/1.29  % Horn                                  115
% 2.38/1.29  % unary                                 18
% 2.38/1.29  % binary                                40
% 2.38/1.29  % lits                                  623
% 2.38/1.29  % lits eq                               80
% 2.38/1.29  % fd_pure                               0
% 2.38/1.29  % fd_pseudo                             0
% 2.38/1.29  % fd_cond                               22
% 2.38/1.29  % fd_pseudo_cond                        14
% 2.38/1.29  % AC symbols                            0
% 2.38/1.29  
% 2.38/1.29  % ------ Schedule dynamic 5 is on 
% 2.38/1.29  
% 2.38/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.38/1.29  
% 2.38/1.29  
% 2.38/1.29  % ------ 
% 2.38/1.29  % Current options:
% 2.38/1.29  % ------ 
% 2.38/1.29  
% 2.38/1.29  
% 2.38/1.29  % 
% 2.38/1.29  
% 2.38/1.29  % ------ Proving...
% 2.38/1.29  % 
% 2.38/1.29  
% 2.38/1.29  % SZS status Theorem for theBenchmark.p
% 2.38/1.29  
% 2.38/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.38/1.29  
% 2.38/1.29  
%------------------------------------------------------------------------------