↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 3.56s 1.20s
% Output   : CNFRefutation 3.56s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f209ERROR: Could not build tree for root c_3969ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f20,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( ? [X1] :
            ( ? [X2] :
                ( cons(X2,X1) = X0
                & ssItem(X2) )
            & ssList(X1) )
        | nil = X0 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( nil = X1
                        | nil != X0 )
                      & ( nil = X0
                        | nil != X1 ) )
                    | ? [X4] :
                        ( ( ( memberP(X3,X4)
                            & ~ memberP(X2,X4) )
                          | ( memberP(X2,X4)
                            & ~ memberP(X3,X4) ) )
                        & ssItem(X4) )
                    | ~ duplicatefreeP(X2)
                    | 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)
                   => ( ( ( nil = X1
                          | nil != X0 )
                        & ( nil = X0
                          | nil != X1 ) )
                      | ? [X4] :
                          ( ( ( memberP(X3,X4)
                              & ~ memberP(X2,X4) )
                            | ( memberP(X2,X4)
                              & ~ memberP(X3,X4) ) )
                          & ssItem(X4) )
                      | ~ duplicatefreeP(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)
                  & ( ( nil != X1
                      & nil = X0 )
                    | ( nil != X0
                      & nil = X1 ) )
                  & ! [X4] :
                      ( ( ( ~ memberP(X3,X4)
                          | memberP(X2,X4) )
                        & ( ~ memberP(X2,X4)
                          | memberP(X3,X4) ) )
                      | ~ ssItem(X4) )
                  & duplicatefreeP(X2)
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f99,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ( ( nil != X1
                      & nil = X0 )
                    | ( nil != X0
                      & nil = X1 ) )
                  & ! [X4] :
                      ( ( ( ~ memberP(X3,X4)
                          | memberP(X2,X4) )
                        & ( ~ memberP(X2,X4)
                          | memberP(X3,X4) ) )
                      | ~ ssItem(X4) )
                  & duplicatefreeP(X2)
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(flattening,[],[f98]) ).

fof(f101,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ? [X1] :
          ( ? [X2] :
              ( cons(X2,X1) = X0
              & ssItem(X2) )
          & ssList(X1) )
      | nil = X0 ),
    inference(ennf_transformation,[],[f20]) ).

fof(f102,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ? [X1] :
          ( ? [X2] :
              ( cons(X2,X1) = X0
              & ssItem(X2) )
          & ssList(X1) )
      | nil = X0 ),
    inference(flattening,[],[f101]) ).

fof(f103,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f125,plain,
    ( ssList(sK0)
    & ssList(sK1)
    & ssList(sK2)
    & ssList(sK3)
    & ( ( nil != sK1
        & nil = sK0 )
      | ( nil != sK0
        & nil = sK1 ) )
    & ! [X4] :
        ( ( ( ~ memberP(sK3,X4)
            | memberP(sK2,X4) )
          & ( ~ memberP(sK2,X4)
            | memberP(sK3,X4) ) )
        | ~ ssItem(X4) )
    & duplicatefreeP(sK2)
    & 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(f127,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( cons(sK7(X0),sK6(X0)) = X0
        & ssItem(sK7(X0))
        & ssList(sK6(X0)) )
      | nil = X0 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f102]) ).

fof(f140,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f125]) ).

fof(f141,plain,
    ssList(sK1),
    inference(cnf_transformation,[],[f125]) ).

fof(f144,plain,
    ( nil != sK1
    | nil != sK0 ),
    inference(cnf_transformation,[],[f125]) ).

fof(f147,plain,
    ( nil = sK0
    | nil = sK1 ),
    inference(cnf_transformation,[],[f125]) ).

fof(f148,plain,
    ! [X4] :
      ( ~ memberP(sK3,X4)
      | memberP(sK2,X4)
      | ~ ssItem(X4) ),
    inference(cnf_transformation,[],[f125]) ).

fof(f149,plain,
    ! [X4] :
      ( ~ memberP(sK2,X4)
      | memberP(sK3,X4)
      | ~ ssItem(X4) ),
    inference(cnf_transformation,[],[f125]) ).

fof(f151,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f125]) ).

fof(f152,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f125]) ).

fof(f157,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(sK7(X0),sK6(X0)) = X0
      | nil = X0 ),
    inference(cnf_transformation,[],[f127]) ).

fof(f158,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssItem(sK7(X0))
      | nil = X0 ),
    inference(cnf_transformation,[],[f127]) ).

fof(f159,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssList(sK6(X0))
      | nil = X0 ),
    inference(cnf_transformation,[],[f127]) ).

fof(f161,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f197,plain,
    ( nil = sK2
    | nil = sK3 ),
    inference(definition_unfolding,[],[f147,f152,f151]) ).

fof(f200,plain,
    ( nil != sK3
    | nil != sK2 ),
    inference(definition_unfolding,[],[f144,f151,f152]) ).

fof(f201,plain,
    ssList(sK3),
    inference(definition_unfolding,[],[f141,f152]) ).

fof(f202,plain,
    ssList(sK2),
    inference(definition_unfolding,[],[f140,f151]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i] :
      ( memberP(sK3,X0)
      | ~ ssItem(X0)
      | ~ memberP(sK2,X0) ),
    inference(cnf_transformation,[],[f149]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i] :
      ( memberP(sK2,X0)
      | ~ ssItem(X0)
      | ~ memberP(sK3,X0) ),
    inference(cnf_transformation,[],[f148]) ).

tcf(c_52,negated_conjecture,
    ( ( sK3 = nil )
    | ( sK2 = nil ) ),
    inference(cnf_transformation,[],[f197]) ).

tcf(c_53,negated_conjecture,
    ( ( sK3 != nil )
    | ( sK2 != nil ) ),
    inference(cnf_transformation,[],[f200]) ).

tcf(c_56,negated_conjecture,
    ssList(sK3),
    inference(cnf_transformation,[],[f201]) ).

tcf(c_57,negated_conjecture,
    ssList(sK2),
    inference(cnf_transformation,[],[f202]) ).

tcf(c_62,plain,
    ! [X0: $i] :
      ( ssList(sK6(X0))
      | ( X0 = nil )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f159]) ).

tcf(c_63,plain,
    ! [X0: $i] :
      ( ssItem(sK7(X0))
      | ( X0 = nil )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f158]) ).

tcf(c_64,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ( cons(sK7(X0),sK6(X0)) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f157]) ).

tcf(c_66,plain,
    ! [X0: $i] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(cnf_transformation,[],[f161]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i] :
      ( memberP(cons(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f209]) ).

tcf(c_3601,plain,
    ( ssList(sK6(sK3))
    | ( sK3 = nil )
    | ~ ssList(sK3) ),
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_3602,plain,
    ( ssItem(sK7(sK3))
    | ( sK3 = nil )
    | ~ ssList(sK3) ),
    inference(instantiation,[status(thm)],[c_63]) ).

tcf(c_3609,plain,
    ( ( sK3 = nil )
    | ( cons(sK7(sK3),sK6(sK3)) = sK3 ) ),
    inference(superposition,[status(thm)],[c_56,c_64]) ).

tcf(c_3610,plain,
    ( ( sK2 = nil )
    | ( cons(sK7(sK2),sK6(sK2)) = sK2 ) ),
    inference(superposition,[status(thm)],[c_57,c_64]) ).

tcf(c_3715,plain,
    ( memberP(sK3,sK7(sK3))
    | ( sK3 = nil )
    | ~ ssList(sK6(sK3))
    | ~ ssItem(sK7(sK3)) ),
    inference(superposition,[status(thm)],[c_3609,c_67]) ).

tcf(c_3733,plain,
    ( memberP(sK2,sK7(sK2))
    | ( sK2 = nil )
    | ~ ssList(sK6(sK2))
    | ~ ssItem(sK7(sK2)) ),
    inference(superposition,[status(thm)],[c_3610,c_67]) ).

tcf(c_3817,plain,
    ( memberP(sK3,sK7(sK3))
    | ( sK3 = nil ) ),
    inference(global_subsumption_just,[status(thm)],[c_3715,c_56,c_3601,c_3602,c_3715]) ).

tcf(c_3825,plain,
    ( memberP(sK2,sK7(sK3))
    | ( sK3 = nil )
    | ~ ssItem(sK7(sK3)) ),
    inference(superposition,[status(thm)],[c_3817,c_51]) ).

tcf(c_3829,plain,
    ( memberP(sK2,sK7(sK3))
    | ( sK3 = nil ) ),
    inference(global_subsumption_just,[status(thm)],[c_3825,c_56,c_3602,c_3825]) ).

tcf(c_3845,plain,
    ( memberP(sK3,sK7(sK2))
    | ( sK2 = nil )
    | ~ ssList(sK6(sK2))
    | ~ ssItem(sK7(sK2)) ),
    inference(superposition,[status(thm)],[c_3733,c_50]) ).

tcf(c_3858,plain,
    ( memberP(nil,sK7(sK2))
    | ( sK2 = nil )
    | ~ ssList(sK6(sK2))
    | ~ ssItem(sK7(sK2)) ),
    inference(superposition,[status(thm)],[c_52,c_3845]) ).

tcf(c_3872,plain,
    ( ( sK2 = nil )
    | ~ ssList(sK6(sK2))
    | ~ ssItem(sK7(sK2)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3858,c_66]) ).

tcf(c_3882,plain,
    ( ( sK2 = nil )
    | ~ ssList(sK2)
    | ~ ssList(sK6(sK2)) ),
    inference(superposition,[status(thm)],[c_63,c_3872]) ).

tcf(c_3883,plain,
    ( ( sK2 = nil )
    | ~ ssList(sK6(sK2)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3882,c_57]) ).

tcf(c_3892,plain,
    ( ( sK2 = nil )
    | ~ ssList(sK2) ),
    inference(superposition,[status(thm)],[c_62,c_3883]) ).

tcf(c_3893,plain,
    sK2 = nil,
    inference(forward_subsumption_resolution,[status(thm)],[c_3892,c_57]) ).

tcf(c_3894,plain,
    sK3 != nil,
    inference(backward_subsumption_resolution,[status(thm)],[c_53,c_3893]) ).

tcf(c_3895,plain,
    ( memberP(nil,sK7(sK3))
    | ( sK3 = nil ) ),
    inference(demodulation,[status(thm)],[c_3829,c_3893]) ).

tcf(c_3907,plain,
    memberP(nil,sK7(sK3)),
    inference(forward_subsumption_resolution,[status(thm)],[c_3895,c_3894]) ).

tcf(c_3968,plain,
    ~ ssItem(sK7(sK3)),
    inference(superposition,[status(thm)],[c_3907,c_66]) ).

tcf(c_3969,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3968,c_3893,c_3602,c_53,c_56]) ).


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