↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n020.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 02:26:04 PM UTC 2026

% Result   : Theorem 0.93s 1.28s
% Output   : CNFRefutation 0.93s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f221ERROR: Could not build tree for root c_2212ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f75,axiom,
    ( isCountable0(xS)
    & aSubsetOf0(xS,szNzAzT0)
    & ! [X0] :
        ( aElementOf0(X0,xS)
       => aElementOf0(X0,szNzAzT0) )
    & aSet0(xS) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).

fof(f84,axiom,
    ( xi != sz00
   => ( isCountable0(sdtlpdtrp0(xN,xi))
      & aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ! [X0] :
          ( aElementOf0(X0,sdtlpdtrp0(xN,xi))
         => aElementOf0(X0,szNzAzT0) )
      & aSet0(sdtlpdtrp0(xN,xi))
      & ? [X0] :
          ( szszuzczcdt0(X0) = xi
          & aElementOf0(X0,szNzAzT0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3702_02) ).

fof(f85,conjecture,
    ( isCountable0(sdtlpdtrp0(xN,xi))
    & ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      | ( ! [X0] :
            ( aElementOf0(X0,sdtlpdtrp0(xN,xi))
           => aElementOf0(X0,szNzAzT0) )
        & aSet0(sdtlpdtrp0(xN,xi)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f86,negated_conjecture,
    ~ ( isCountable0(sdtlpdtrp0(xN,xi))
      & ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
        | ( ! [X0] :
              ( aElementOf0(X0,sdtlpdtrp0(xN,xi))
             => aElementOf0(X0,szNzAzT0) )
          & aSet0(sdtlpdtrp0(xN,xi)) ) ) ),
    inference(negated_conjecture,[status(cth)],[f85]) ).

fof(f97,plain,
    ( xi != sz00
   => ( isCountable0(sdtlpdtrp0(xN,xi))
      & aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ! [X1] :
          ( aElementOf0(X1,sdtlpdtrp0(xN,xi))
         => aElementOf0(X1,szNzAzT0) )
      & aSet0(sdtlpdtrp0(xN,xi))
      & ? [X0] :
          ( szszuzczcdt0(X0) = xi
          & aElementOf0(X0,szNzAzT0) ) ) ),
    inference(rectify,[],[f84]) ).

fof(f197,plain,
    ( isCountable0(xS)
    & aSubsetOf0(xS,szNzAzT0)
    & ! [X0] :
        ( ~ aElementOf0(X0,xS)
        | aElementOf0(X0,szNzAzT0) )
    & aSet0(xS) ),
    inference(ennf_transformation,[],[f75]) ).

fof(f206,plain,
    ( sz00 = xi
    | ( isCountable0(sdtlpdtrp0(xN,xi))
      & aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ! [X1] :
          ( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
          | aElementOf0(X1,szNzAzT0) )
      & aSet0(sdtlpdtrp0(xN,xi))
      & ? [X0] :
          ( szszuzczcdt0(X0) = xi
          & aElementOf0(X0,szNzAzT0) ) ) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f207,plain,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ( ? [X0] :
            ( aElementOf0(X0,sdtlpdtrp0(xN,xi))
            & ~ aElementOf0(X0,szNzAzT0) )
        | ~ aSet0(sdtlpdtrp0(xN,xi)) ) ) ),
    inference(ennf_transformation,[],[f86]) ).

fof(f302,plain,
    ( ! [X0] :
        ( ~ aElementOf0(X0,szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X0))
        | ( ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
          & ( ( aElementOf0(sK39(X0),sdtlpdtrp0(xN,X0))
              & ~ aElementOf0(sK39(X0),szNzAzT0) )
            | ~ aSet0(sdtlpdtrp0(xN,X0)) ) )
        | sP9(X0) )
    & sdtlpdtrp0(xN,sz00) = xS
    & szDzozmdt0(xN) = szNzAzT0
    & aFunction0(xN) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK39]),skolemize(X1,sK39(X0))],[f221]) ).

fof(f303,plain,
    ( sz00 = xi
    | ( isCountable0(sdtlpdtrp0(xN,xi))
      & aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ! [X1] :
          ( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
          | aElementOf0(X1,szNzAzT0) )
      & aSet0(sdtlpdtrp0(xN,xi))
      & xi = szszuzczcdt0(sK40)
      & aElementOf0(sK40,szNzAzT0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK40]),skolemize(X0,sK40)],[f206]) ).

fof(f304,plain,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ( ( aElementOf0(sK41,sdtlpdtrp0(xN,xi))
          & ~ aElementOf0(sK41,szNzAzT0) )
        | ~ aSet0(sdtlpdtrp0(xN,xi)) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK41]),skolemize(X0,sK41)],[f207]) ).

fof(f451,plain,
    isCountable0(xS),
    inference(cnf_transformation,[],[f197]) ).

fof(f452,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(cnf_transformation,[],[f197]) ).

fof(f520,plain,
    xS = sdtlpdtrp0(xN,sz00),
    inference(cnf_transformation,[],[f302]) ).

fof(f528,plain,
    ( sz00 = xi
    | isCountable0(sdtlpdtrp0(xN,xi)) ),
    inference(cnf_transformation,[],[f303]) ).

fof(f529,plain,
    ( sz00 = xi
    | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    inference(cnf_transformation,[],[f303]) ).

fof(f530,plain,
    ! [X1] :
      ( sz00 = xi
      | ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
      | aElementOf0(X1,szNzAzT0) ),
    inference(cnf_transformation,[],[f303]) ).

fof(f533,plain,
    ( sz00 = xi
    | aElementOf0(sK40,szNzAzT0) ),
    inference(cnf_transformation,[],[f303]) ).

fof(f534,plain,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    inference(cnf_transformation,[],[f304]) ).

tcf(c_197,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(cnf_transformation,[],[f452]) ).

tcf(c_198,plain,
    isCountable0(xS),
    inference(cnf_transformation,[],[f451]) ).

tcf(c_263,plain,
    sdtlpdtrp0(xN,sz00) = xS,
    inference(cnf_transformation,[],[f520]) ).

tcf(c_272,plain,
    ( aElementOf0(sK40,szNzAzT0)
    | ( sz00 = xi ) ),
    inference(cnf_transformation,[],[f533]) ).

tcf(c_275,plain,
    ! [X0: $i] :
      ( aElementOf0(X0,szNzAzT0)
      | ( sz00 = xi )
      | ~ aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
    inference(cnf_transformation,[],[f530]) ).

tcf(c_276,plain,
    ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
    | ( sz00 = xi ) ),
    inference(cnf_transformation,[],[f529]) ).

tcf(c_277,plain,
    ( isCountable0(sdtlpdtrp0(xN,xi))
    | ( sz00 = xi ) ),
    inference(cnf_transformation,[],[f528]) ).

tcf(c_280,negated_conjecture,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    inference(cnf_transformation,[],[f534]) ).

tcf(c_453,plain,
    sz00 = xi,
    inference(global_subsumption_just,[status(thm)],[c_272,c_277,c_276,c_280]) ).

tcf(c_465,plain,
    sz00 = xi,
    inference(global_subsumption_just,[status(thm)],[c_275,c_453]) ).

tcf(c_2021,plain,
    sdtlpdtrp0(xN,xi) = xS,
    inference(light_normalisation,[status(thm)],[c_263,c_465]) ).

tcf(c_2211,plain,
    ( ~ isCountable0(xS)
    | ~ aSubsetOf0(xS,szNzAzT0) ),
    inference(light_normalisation,[status(thm)],[c_280,c_2021]) ).

tcf(c_2212,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2211,c_198,c_197]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 04:42:19 UTC 2026
% 0.03/0.36  % CPUTime  : 
% 0.03/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.40  Running first-order theorem proving
% 0.03/0.40  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.03/0.41  
% 0.03/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41  
% 0.03/0.41  % Detected problem language: tptp
% 0.03/0.42  % Proving...
% 0.93/1.28  % SZS status Started for theBenchmark.p
% 0.93/1.28  % SZS status Theorem for theBenchmark.p
% 0.93/1.28  
% 0.93/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.93/1.28  
% 0.93/1.28  % ------  iProver source info
% 0.93/1.28  
% 0.93/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 0.93/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.93/1.28  % git: non_committed_changes: false
% 0.93/1.28  
% 0.93/1.28  % ------ Parsing...
% 0.93/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.93/1.28  
% 0.93/1.28  % ------ Preprocessing...% 
% 0.93/1.28  
% 0.93/1.28  % SZS status Theorem for theBenchmark.p
% 0.93/1.28  
% 0.93/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.93/1.28  
% 0.93/1.28  
%------------------------------------------------------------------------------