↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC094+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 : n017.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 0.27s 1.10s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   27 (  12 unt;   0 def)
%            Number of atoms       :  103 (  43 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  124 (  48   ~;  38   |;  29   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  32   !;  14   ?;   6   :)

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

fof(f84,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(X0,nil) = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ? [X4] :
                        ( ? [X5] :
                            ( ? [X6] :
                                ( app(X4,X6) = X1
                                & app(app(X4,X5),X6) = X0
                                & ssList(X6) )
                            & ssList(X5) )
                        & 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)
                   => ( ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( app(X4,X6) = X1
                                  & app(app(X4,X5),X6) = X0
                                  & ssList(X6) )
                              & ssList(X5) )
                          & ssList(X4) )
                      | X3 != X2
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f98,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(X4,X6) != X1
                              | app(app(X4,X5),X6) != X0
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | ~ ssList(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f99,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(X4,X6) != X1
                              | app(app(X4,X5),X6) != X0
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | ~ ssList(X4) )
                  & X2 = X3
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(flattening,[],[f98]) ).

fof(f100,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(ennf_transformation,[],[f84]) ).

fof(f118,plain,
    ( ssList(sK0)
    & ssList(sK1)
    & ssList(sK2)
    & ssList(sK3)
    & ! [X4] :
        ( ! [X5] :
            ( ! [X6] :
                ( app(X4,X6) != sK1
                | app(app(X4,X5),X6) != sK0
                | ~ ssList(X6) )
            | ~ ssList(X5) )
        | ~ ssList(X4) )
    & sK2 = sK3
    & sK0 = sK2
    & sK1 = sK3 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).

fof(f123,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f118]) ).

fof(f127,plain,
    ! [X6,X4,X5] :
      ( app(X4,X6) != sK1
      | app(app(X4,X5),X6) != sK0
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f128,plain,
    sK2 = sK3,
    inference(cnf_transformation,[],[f118]) ).

fof(f129,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f118]) ).

fof(f130,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f118]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f100]) ).

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

fof(f154,plain,
    sK0 = sK3,
    inference(definition_unfolding,[],[f129,f128]) ).

fof(f155,plain,
    ! [X6,X4,X5] :
      ( app(X4,X6) != sK3
      | app(app(X4,X5),X6) != sK3
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4) ),
    inference(definition_unfolding,[],[f127,f154,f130]) ).

fof(f158,plain,
    ssList(sK3),
    inference(definition_unfolding,[],[f123,f154]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sK3 )
      | ( app(app(X0,X1),X2) != sK3 ) ),
    inference(cnf_transformation,[],[f155]) ).

tcf(c_53,negated_conjecture,
    ssList(sK3),
    inference(cnf_transformation,[],[f158]) ).

tcf(c_57,plain,
    ! [X0: $i] :
      ( ( app(X0,nil) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f134]) ).

tcf(c_72,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f149]) ).

tcf(c_1100,plain,
    app(sK3,nil) = sK3,
    inference(superposition,[status(thm)],[c_53,c_57]) ).

tcf(c_1140,plain,
    ! [X0: $i] :
      ( ~ ssList(nil)
      | ~ ssList(sK3)
      | ~ ssList(X0)
      | ( app(sK3,X0) != sK3 ) ),
    inference(superposition,[status(thm)],[c_1100,c_49]) ).

tcf(c_1141,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( app(sK3,X0) != sK3 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_1140,c_72,c_53]) ).

tcf(c_1144,plain,
    ( ~ ssList(nil)
    | ( app(sK3,nil) != sK3 ) ),
    inference(instantiation,[status(thm)],[c_1141]) ).

tcf(c_1145,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1144,c_1100,c_72]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC094+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 : n017.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 16:17:16 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.43  % Proving...
% 0.27/1.10  % SZS status Started for theBenchmark.p
% 0.27/1.10  % SZS status Theorem for theBenchmark.p
% 0.27/1.10  
% 0.27/1.10  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.27/1.10  
% 0.27/1.10  % ------  iProver source info
% 0.27/1.10  
% 0.27/1.10  % git: date: 2026-07-19 20:42:38 +0200
% 0.27/1.10  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.27/1.10  % git: non_committed_changes: false
% 0.27/1.10  
% 0.27/1.10  % ------ Parsing...
% 0.27/1.10  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.27/1.10  
% 0.27/1.10  % ------ 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.27/1.10  
% 0.27/1.10  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 0.27/1.10  
% 0.27/1.10  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.27/1.10  % ------ Proving...
% 0.27/1.10  % ------ Problem Properties 
% 0.27/1.10  
% 0.27/1.10  % 
% 0.27/1.10  % clauses                               25
% 0.27/1.10  % conjectures                           2
% 0.27/1.10  % EPR                                   5
% 0.27/1.10  % Horn                                  22
% 0.27/1.10  % unary                                 6
% 0.27/1.10  % binary                                2
% 0.27/1.10  % lits                                  77
% 0.27/1.10  % lits eq                               27
% 0.27/1.10  % fd_pure                               0
% 0.27/1.10  % fd_pseudo                             0
% 0.27/1.10  % fd_cond                               4
% 0.27/1.10  % fd_pseudo_cond                        4
% 0.27/1.10  % AC symbols                            0
% 0.27/1.10  
% 0.27/1.10  % ------ Schedule dynamic 5 is on 
% 0.27/1.10  
% 0.27/1.10  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.27/1.10  
% 0.27/1.10  
% 0.27/1.10  % ------ 
% 0.27/1.10  % Current options:
% 0.27/1.10  % ------ 
% 0.27/1.10  
% 0.27/1.10  
% 0.27/1.10  % 
% 0.27/1.10  
% 0.27/1.10  % ------ Proving...
% 0.27/1.10  % 
% 0.27/1.10  
% 0.27/1.10  % SZS status Theorem for theBenchmark.p
% 0.27/1.10  
% 0.27/1.10  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.27/1.10  
% 0.27/1.10  
%------------------------------------------------------------------------------