↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC287+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 : n004.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 0.84s 1.29s
% Output   : CNFRefutation 0.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :  105 (  38 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  121 (  42   ~;  42   |;  30   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 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  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  18   !;   7   ?;   2   :)

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

fof(f69,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox2/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(X5,X4)
                            & 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/sandbox2/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(X5,X4)
                              & 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(f98,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ( ( nil = X2
                      & nil = X3 )
                    | ? [X4] :
                        ( ! [X5] :
                            ( ~ leq(X5,X4)
                            | ~ 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(f123,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | strictorderedP(cons(X0,nil)) ),
    inference(ennf_transformation,[],[f68]) ).

fof(f158,plain,
    ( ssList(sK0)
    & ssList(sK1)
    & ssList(sK2)
    & ( ( nil = sK2
        & nil = sK3 )
      | ( ! [X5] :
            ( ~ leq(X5,sK4)
            | ~ memberP(sK3,X5)
            | sK4 = X5
            | ~ ssItem(X5) )
        & memberP(sK3,sK4)
        & sK2 = cons(sK4,nil)
        & ssItem(sK4) ) )
    & ~ strictorderedP(sK0)
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f98]) ).

fof(f182,plain,
    ! [X5] :
      ( nil = sK2
      | ~ leq(X5,sK4)
      | ~ memberP(sK3,X5)
      | sK4 = X5
      | ~ ssItem(X5) ),
    inference(cnf_transformation,[],[f158]) ).

fof(f186,plain,
    ( nil = sK2
    | sK2 = cons(sK4,nil) ),
    inference(cnf_transformation,[],[f158]) ).

fof(f188,plain,
    ( nil = sK2
    | ssItem(sK4) ),
    inference(cnf_transformation,[],[f158]) ).

fof(f190,plain,
    ~ strictorderedP(sK0),
    inference(cnf_transformation,[],[f158]) ).

fof(f191,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f158]) ).

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

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

fof(f266,plain,
    ~ strictorderedP(sK2),
    inference(definition_unfolding,[],[f190,f191]) ).

tcf(c_50,negated_conjecture,
    ~ strictorderedP(sK2),
    inference(cnf_transformation,[],[f266]) ).

tcf(c_52,negated_conjecture,
    ( ssItem(sK4)
    | ( sK2 = nil ) ),
    inference(cnf_transformation,[],[f188]) ).

tcf(c_54,negated_conjecture,
    ( ( sK2 = nil )
    | ( cons(sK4,nil) = sK2 ) ),
    inference(cnf_transformation,[],[f186]) ).

tcf(c_58,negated_conjecture,
    ! [X0: $i] :
      ( ( sK2 = nil )
      | ( X0 = sK4 )
      | ~ ssItem(X0)
      | ~ leq(X0,sK4)
      | ~ memberP(sK3,X0) ),
    inference(cnf_transformation,[],[f182]) ).

tcf(c_99,plain,
    strictorderedP(nil),
    inference(cnf_transformation,[],[f232]) ).

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

tcf(c_3657,plain,
    ( strictorderedP(sK2)
    | ( sK2 = nil )
    | ~ ssItem(sK4) ),
    inference(superposition,[status(thm)],[c_54,c_100]) ).

tcf(c_3658,plain,
    ( ( sK2 = nil )
    | ~ ssItem(sK4) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3657,c_50]) ).

tcf(c_3668,negated_conjecture,
    sK2 = nil,
    inference(global_subsumption_just,[status(thm)],[c_58,c_52,c_3658]) ).

tcf(c_3671,plain,
    ~ strictorderedP(nil),
    inference(demodulation,[status(thm)],[c_50,c_3668]) ).

tcf(c_3673,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3671,c_99]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC287+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.37  % Computer : n004.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 17:25:35 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  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.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.44  % Proving...
% 0.84/1.29  % SZS status Started for theBenchmark.p
% 0.84/1.29  % SZS status Theorem for theBenchmark.p
% 0.84/1.29  
% 0.84/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.84/1.29  
% 0.84/1.29  % ------  iProver source info
% 0.84/1.29  
% 0.84/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 0.84/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.84/1.29  % git: non_committed_changes: false
% 0.84/1.29  
% 0.84/1.29  % ------ Parsing...
% 0.84/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.84/1.29  
% 0.84/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 0.84/1.29  
% 0.84/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 0.84/1.29  
% 0.84/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.84/1.29  % ------ Proving...
% 0.84/1.29  % ------ Problem Properties 
% 0.84/1.29  
% 0.84/1.29  % 
% 0.84/1.29  % clauses                               79
% 0.84/1.29  % conjectures                           11
% 0.84/1.29  % EPR                                   24
% 0.84/1.29  % Horn                                  46
% 0.84/1.29  % unary                                 9
% 0.84/1.29  % binary                                12
% 0.84/1.29  % lits                                  275
% 0.84/1.29  % lits eq                               66
% 0.84/1.29  % fd_pure                               0
% 0.84/1.29  % fd_pseudo                             0
% 0.84/1.29  % fd_cond                               17
% 0.84/1.29  % fd_pseudo_cond                        8
% 0.84/1.29  % AC symbols                            0
% 0.84/1.29  
% 0.84/1.29  % ------ Schedule dynamic 5 is on 
% 0.84/1.29  
% 0.84/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.84/1.29  
% 0.84/1.29  
% 0.84/1.29  % ------ 
% 0.84/1.29  % Current options:
% 0.84/1.29  % ------ 
% 0.84/1.29  
% 0.84/1.29  
% 0.84/1.29  % 
% 0.84/1.29  
% 0.84/1.29  % ------ Proving...
% 0.84/1.29  % 
% 0.84/1.29  
% 0.84/1.29  % SZS status Theorem for theBenchmark.p
% 0.84/1.29  
% 0.84/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.84/1.29  
% 0.84/1.29  
%------------------------------------------------------------------------------