↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n016.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:52 PM UTC 2026

% Result   : Theorem 3.64s 1.47s
% Output   : CNFRefutation 3.64s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f552ERROR: Could not build tree for root c_11657ERROR: MakeTreeStats fails)

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

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

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

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

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

fof(f500,plain,
    ( ~ neq(sK56,nil)
    | ssItem(sK57) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    ( ~ neq(sK56,nil)
    | sK56 = app(sK55,cons(sK57,nil)) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    ! [X4] :
      ( ~ neq(sK56,nil)
      | sK54 != app(sK53,cons(X4,nil))
      | ~ ssItem(X4) ),
    inference(cnf_transformation,[],[f296]) ).

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

fof(f509,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f296]) ).

fof(f513,plain,
    ! [X4] :
      ( ~ neq(sK56,nil)
      | sK56 != app(sK55,cons(X4,nil))
      | ~ ssItem(X4) ),
    inference(definition_unfolding,[],[f504,f509,f508]) ).

tcf(c_246,negated_conjecture,
    neq(sK56,nil),
    inference(cnf_transformation,[],[f552]) ).

tcf(c_248,negated_conjecture,
    ! [X0: $i] :
      ( ~ ssItem(X0)
      | ~ neq(sK56,nil)
      | ( app(sK55,cons(X0,nil)) != sK56 ) ),
    inference(cnf_transformation,[],[f513]) ).

tcf(c_250,negated_conjecture,
    ( ( app(sK55,cons(sK57,nil)) = sK56 )
    | ~ neq(sK56,nil) ),
    inference(cnf_transformation,[],[f502]) ).

tcf(c_252,negated_conjecture,
    ( ssItem(sK57)
    | ~ neq(sK56,nil) ),
    inference(cnf_transformation,[],[f500]) ).

tcf(c_366,negated_conjecture,
    ssItem(sK57),
    inference(global_subsumption_just,[status(thm)],[c_252,c_246,c_252]) ).

tcf(c_382,negated_conjecture,
    app(sK55,cons(sK57,nil)) = sK56,
    inference(global_subsumption_just,[status(thm)],[c_250,c_246,c_250]) ).

tcf(c_386,negated_conjecture,
    ! [X0: $i] :
      ( ~ ssItem(X0)
      | ( app(sK55,cons(X0,nil)) != sK56 ) ),
    inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248]) ).

tcf(c_8823,definition,
    iPr_def_10 = cons(sK57,nil),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_8824,definition,
    iPr_def_11 = app(sK55,iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_8826,negated_conjecture,
    ! [X0: $i] :
      ( ~ ssItem(X0)
      | ( app(sK55,cons(X0,nil)) != sK56 ) ),
    inference(demodulation,[status(thm)],[c_386]) ).

tcf(c_8827,negated_conjecture,
    iPr_def_11 = sK56,
    inference(demodulation,[status(thm)],[c_382,c_8823,c_8824]) ).

tcf(c_8828,negated_conjecture,
    ssItem(sK57),
    inference(demodulation,[status(thm)],[c_366]) ).

tcf(c_11639,plain,
    ! [X0: $i] :
      ( ~ ssItem(X0)
      | ( app(sK55,cons(X0,nil)) != iPr_def_11 ) ),
    inference(light_normalisation,[status(thm)],[c_8826,c_8827]) ).

tcf(c_11655,plain,
    ( ~ ssItem(sK57)
    | ( app(sK55,iPr_def_10) != iPr_def_11 ) ),
    inference(superposition,[status(thm)],[c_8823,c_11639]) ).

tcf(c_11656,plain,
    ~ ssItem(sK57),
    inference(ground_joinability,[status(thm)],[c_11655,c_8824]) ).

tcf(c_11657,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_11656,c_8828]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC097+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.56  % Computer : n016.cluster.edu
% 0.09/0.56  % Model    : x86_64 x86_64
% 0.09/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56  % Memory   : 8046.5625MB
% 0.09/0.56  % OS       : Linux 6.8.0-71-generic
% 0.09/0.56  % CPULimit : 300
% 0.09/0.56  % WCLimit  : 300
% 0.09/0.56  % DateTime : Thu Sep 24 16:26:59 UTC 2026
% 0.09/0.56  % CPUTime  : 
% 0.09/0.56  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.60  Running first-order theorem proving
% 0.09/0.60  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.61  
% 0.09/0.61  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.61  
% 0.09/0.61  % Detected problem language: tptp
% 0.09/0.62  % Proving...
% 3.64/1.47  % SZS status Started for theBenchmark.p
% 3.64/1.47  % SZS status Theorem for theBenchmark.p
% 3.64/1.47  
% 3.64/1.47  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.64/1.47  
% 3.64/1.47  % ------  iProver source info
% 3.64/1.47  
% 3.64/1.47  % git: date: 2026-07-19 20:42:38 +0200
% 3.64/1.47  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.64/1.47  % git: non_committed_changes: false
% 3.64/1.47  
% 3.64/1.47  % ------ Parsing...
% 3.64/1.47  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.64/1.47  
% 3.64/1.47  % ------ 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 % 
% 3.64/1.47  
% 3.64/1.47  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.64/1.47  
% 3.64/1.47  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.64/1.47  % ------ Proving...
% 3.64/1.47  % ------ Problem Properties 
% 3.64/1.47  
% 3.64/1.47  % 
% 3.64/1.47  % clauses                               188
% 3.64/1.47  % conjectures                           5
% 3.64/1.47  % EPR                                   54
% 3.64/1.47  % Horn                                  120
% 3.64/1.47  % unary                                 23
% 3.64/1.47  % binary                                41
% 3.64/1.47  % lits                                  627
% 3.64/1.47  % lits eq                               83
% 3.64/1.47  % fd_pure                               0
% 3.64/1.47  % fd_pseudo                             0
% 3.64/1.47  % fd_cond                               21
% 3.64/1.47  % fd_pseudo_cond                        14
% 3.64/1.47  % AC symbols                            0
% 3.64/1.47  
% 3.64/1.47  % ------ Schedule dynamic 5 is on 
% 3.64/1.47  
% 3.64/1.47  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.64/1.47  
% 3.64/1.47  
% 3.64/1.47  % ------ 
% 3.64/1.47  % Current options:
% 3.64/1.47  % ------ 
% 3.64/1.47  
% 3.64/1.47  
% 3.64/1.47  % 
% 3.64/1.47  
% 3.64/1.47  % ------ Proving...
% 3.64/1.47  % 
% 3.64/1.47  
% 3.64/1.47  % SZS status Theorem for theBenchmark.p
% 3.64/1.47  
% 3.64/1.47  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.64/1.47  
% 3.64/1.47  
%------------------------------------------------------------------------------