↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC286+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 : n010.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:09:09 PM UTC 2026

% Result   : Theorem 3.78s 1.26s
% Output   : CNFRefutation 3.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   32 (  15 unt;   1 def)
%            Number of atoms       :  114 (  39 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  111 (  38   ~;  36   |;  30   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn  16   !;   7   ?;   1   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f68,axiom,
    ! [X0] :
      ( ssItem(X0)
     => strictorderedP(cons(X0,nil)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).

fof(f69,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax69) ).

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

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

fof(f182,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | strictorderedP(cons(X0,nil)) ),
    inference(ennf_transformation,[],[f68]) ).

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

fof(f295,plain,
    ( ssList(sK53)
    & ssList(sK54)
    & ssList(sK55)
    & ( ( nil = sK55
        & nil = sK56 )
      | ( ! [X5] :
            ( ~ leq(sK57,X5)
            | ~ memberP(sK56,X5)
            | sK57 = X5
            | ~ ssItem(X5) )
        & memberP(sK56,sK57)
        & sK55 = cons(sK57,nil)
        & ssItem(sK57) ) )
    & ~ strictorderedP(sK53)
    & sK53 = sK55
    & sK54 = sK56
    & ssList(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(X4,sK57)],[f221]) ).

fof(f457,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | strictorderedP(cons(X0,nil)) ),
    inference(cnf_transformation,[],[f182]) ).

fof(f458,plain,
    strictorderedP(nil),
    inference(cnf_transformation,[],[f69]) ).

fof(f502,plain,
    ( nil = sK55
    | sK55 = cons(sK57,nil) ),
    inference(cnf_transformation,[],[f295]) ).

fof(f504,plain,
    ( nil = sK55
    | ssItem(sK57) ),
    inference(cnf_transformation,[],[f295]) ).

fof(f506,plain,
    ~ strictorderedP(sK53),
    inference(cnf_transformation,[],[f295]) ).

fof(f507,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f295]) ).

fof(f510,plain,
    ~ strictorderedP(sK55),
    inference(definition_unfolding,[],[f506,f507]) ).

tcf(c_209,plain,
    ! [X0: $i] :
      ( strictorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f457]) ).

tcf(c_210,plain,
    strictorderedP(nil),
    inference(cnf_transformation,[],[f458]) ).

tcf(c_247,negated_conjecture,
    ~ strictorderedP(sK55),
    inference(cnf_transformation,[],[f510]) ).

tcf(c_249,negated_conjecture,
    ( ssItem(sK57)
    | ( nil = sK55 ) ),
    inference(cnf_transformation,[],[f504]) ).

tcf(c_251,negated_conjecture,
    ( ( nil = sK55 )
    | ( cons(sK57,nil) = sK55 ) ),
    inference(cnf_transformation,[],[f502]) ).

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

tcf(c_8960,negated_conjecture,
    ( ( iPr_def_10 = sK55 )
    | ( nil = sK55 ) ),
    inference(demodulation,[status(thm)],[c_251,c_8954]) ).

tcf(c_8962,negated_conjecture,
    ( ssItem(sK57)
    | ( nil = sK55 ) ),
    inference(demodulation,[status(thm)],[c_249]) ).

tcf(c_8964,negated_conjecture,
    ~ strictorderedP(sK55),
    inference(demodulation,[status(thm)],[c_247]) ).

tcf(c_11863,plain,
    ( ( sK55 = iPr_def_10 )
    | ~ strictorderedP(nil) ),
    inference(superposition,[status(thm)],[c_8960,c_8964]) ).

tcf(c_11910,plain,
    sK55 = iPr_def_10,
    inference(global_subsumption_just,[status(thm)],[c_11863,c_210,c_11863]) ).

tcf(c_11916,plain,
    ( ssItem(sK57)
    | ( nil = iPr_def_10 ) ),
    inference(demodulation,[status(thm)],[c_8962,c_11910]) ).

tcf(c_11917,plain,
    ~ strictorderedP(iPr_def_10),
    inference(demodulation,[status(thm)],[c_8964,c_11910]) ).

tcf(c_12111,plain,
    ( strictorderedP(iPr_def_10)
    | ~ ssItem(sK57) ),
    inference(superposition,[status(thm)],[c_8954,c_209]) ).

tcf(c_12112,plain,
    ~ ssItem(sK57),
    inference(forward_subsumption_resolution,[status(thm)],[c_12111,c_11917]) ).

tcf(c_12113,plain,
    nil = iPr_def_10,
    inference(backward_subsumption_resolution,[status(thm)],[c_11916,c_12112]) ).

tcf(c_12133,plain,
    strictorderedP(iPr_def_10),
    inference(demodulation,[status(thm)],[c_210,c_12113]) ).

tcf(c_12140,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_12133,c_11917]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC286+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.35  % Computer : n010.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 17:25:43 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.12/0.40  
% 0.12/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40  
% 0.12/0.40  % Detected problem language: tptp
% 0.12/0.41  % Proving...
% 3.78/1.26  % SZS status Started for theBenchmark.p
% 3.78/1.26  % SZS status Theorem for theBenchmark.p
% 3.78/1.26  
% 3.78/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.78/1.26  
% 3.78/1.26  % ------  iProver source info
% 3.78/1.26  
% 3.78/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 3.78/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.78/1.26  % git: non_committed_changes: false
% 3.78/1.26  
% 3.78/1.26  % ------ Parsing...
% 3.78/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.78/1.26  
% 3.78/1.26  % ------ 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: 4 0s  sf_e  pe_s  pe_e % 
% 3.78/1.26  
% 3.78/1.26  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.78/1.26  
% 3.78/1.26  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.78/1.26  % ------ Proving...
% 3.78/1.26  % ------ Problem Properties 
% 3.78/1.26  
% 3.78/1.26  % 
% 3.78/1.26  % clauses                               192
% 3.78/1.26  % conjectures                           11
% 3.78/1.26  % EPR                                   60
% 3.78/1.26  % Horn                                  116
% 3.78/1.26  % unary                                 20
% 3.78/1.26  % binary                                46
% 3.78/1.26  % lits                                  644
% 3.78/1.26  % lits eq                               91
% 3.78/1.26  % fd_pure                               0
% 3.78/1.26  % fd_pseudo                             0
% 3.78/1.26  % fd_cond                               23
% 3.78/1.26  % fd_pseudo_cond                        14
% 3.78/1.26  % AC symbols                            0
% 3.78/1.26  
% 3.78/1.26  % ------ Schedule dynamic 5 is on 
% 3.78/1.26  
% 3.78/1.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.78/1.26  
% 3.78/1.26  
% 3.78/1.26  % ------ 
% 3.78/1.26  % Current options:
% 3.78/1.26  % ------ 
% 3.78/1.26  
% 3.78/1.26  
% 3.78/1.26  % 
% 3.78/1.26  
% 3.78/1.26  % ------ Proving...
% 3.78/1.26  % 
% 3.78/1.26  
% 3.78/1.26  % SZS status Theorem for theBenchmark.p
% 3.78/1.26  
% 3.78/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.27  
% 3.78/1.27  
%------------------------------------------------------------------------------