↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC036+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 : 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 03:07:37 PM UTC 2026

% Result   : Theorem 0.51s 6.29s
% Output   : CNFRefutation 0.51s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f602ERROR: Could not build tree for root c_252ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( nil = X3
                      & nil != X2 )
                    | nil = X0
                    | X0 != X2
                    | X1 != X3
                    | nil != X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( nil = X3
                        & nil != X2 )
                      | nil = X0
                      | X0 != X2
                      | X1 != X3
                      | nil != X1 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f221,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ( nil != X3
                    | nil = X2 )
                  & nil != X0
                  & X0 = X2
                  & X1 = X3
                  & nil = X1 ) ) ) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ( nil != X3
                    | nil = X2 )
                  & nil != X0
                  & X0 = X2
                  & X1 = X3
                  & nil = X1 ) ) ) ),
    inference(flattening,[],[f221]) ).

fof(f296,plain,
    ( ssList(sK53)
    & ssList(sK54)
    & ssList(sK55)
    & ssList(sK56)
    & ( nil != sK56
      | nil = sK55 )
    & nil != sK53
    & sK53 = sK55
    & sK54 = sK56
    & nil = sK54 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).

fof(f501,plain,
    nil != sK53,
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f296]) ).

fof(f503,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    nil = sK54,
    inference(cnf_transformation,[],[f296]) ).

fof(f505,plain,
    nil = sK56,
    inference(definition_unfolding,[],[f504,f503]) ).

fof(f564,plain,
    sK55 != sK56,
    inference(definition_unfolding,[],[f501,f505,f502]) ).

tcf(c_246,negated_conjecture,
    sK56 != sK55,
    inference(cnf_transformation,[],[f564]) ).

tcf(c_247,negated_conjecture,
    sK56 = sK55,
    inference(cnf_transformation,[],[f602]) ).

tcf(c_252,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_246,c_247]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC036+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.11/5.38  % Computer : n020.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Thu Sep 24 16:03:12 UTC 2026
% 0.11/5.39  % CPUTime  : 
% 0.11/5.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  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.15/5.44  
% 0.15/5.44  % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44  
% 0.15/5.44  % Detected problem language: tptp
% 0.15/5.45  % Proving...
% 0.51/6.29  % SZS status Started for theBenchmark.p
% 0.51/6.29  % SZS status Theorem for theBenchmark.p
% 0.51/6.29  
% 0.51/6.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.51/6.29  
% 0.51/6.29  % ------  iProver source info
% 0.51/6.29  
% 0.51/6.29  % git: date: 2026-07-19 20:42:38 +0200
% 0.51/6.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.51/6.29  % git: non_committed_changes: false
% 0.51/6.29  
% 0.51/6.29  % ------ Parsing...
% 0.51/6.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.51/6.29  
% 0.51/6.29  % ------ Preprocessing...% 
% 0.51/6.29  
% 0.51/6.29  % SZS status Theorem for theBenchmark.p
% 0.51/6.29  
% 0.51/6.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/6.29  
% 0.51/6.29  
%------------------------------------------------------------------------------