↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 1.74s 1.27s
% Output   : CNFRefutation 1.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   22 (  13 unt;   0 def)
%            Number of atoms       :   81 (  28 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   81 (  22   ~;  19   |;  32   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   16 (   0 sgn   8   !;   8   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( ~ frontsegP(X3,X2)
                        | ~ neq(X2,nil) )
                      & ( nil != X2
                        | nil != X3 ) )
                    | neq(X0,nil)
                    | ~ neq(X1,nil)
                    | 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)
                   => ( ( ( ~ frontsegP(X3,X2)
                          | ~ neq(X2,nil) )
                        & ( nil != X2
                          | nil != X3 ) )
                      | neq(X0,nil)
                      | ~ neq(X1,nil)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

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

fof(f296,plain,
    ( ssList(sK53)
    & ssList(sK54)
    & ssList(sK55)
    & ssList(sK56)
    & ( ( frontsegP(sK56,sK55)
        & neq(sK55,nil) )
      | ( nil = sK55
        & nil = sK56 ) )
    & ~ neq(sK53,nil)
    & neq(sK54,nil)
    & sK53 = sK55
    & sK54 = sK56 ),
    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,
    ( neq(sK55,nil)
    | nil = sK55 ),
    inference(cnf_transformation,[],[f296]) ).

fof(f503,plain,
    ( neq(sK55,nil)
    | nil = sK56 ),
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    ~ neq(sK53,nil),
    inference(cnf_transformation,[],[f296]) ).

fof(f505,plain,
    neq(sK54,nil),
    inference(cnf_transformation,[],[f296]) ).

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

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

fof(f508,plain,
    neq(sK56,nil),
    inference(definition_unfolding,[],[f505,f507]) ).

fof(f509,plain,
    ~ neq(sK55,nil),
    inference(definition_unfolding,[],[f504,f506]) ).

tcf(c_246,negated_conjecture,
    neq(sK56,nil),
    inference(cnf_transformation,[],[f508]) ).

tcf(c_247,negated_conjecture,
    ~ neq(sK55,nil),
    inference(cnf_transformation,[],[f509]) ).

tcf(c_248,negated_conjecture,
    ( neq(sK55,nil)
    | ( nil = sK56 ) ),
    inference(cnf_transformation,[],[f503]) ).

tcf(c_250,negated_conjecture,
    ( neq(sK55,nil)
    | ( nil = sK55 ) ),
    inference(cnf_transformation,[],[f501]) ).

tcf(c_370,negated_conjecture,
    nil = sK55,
    inference(global_subsumption_just,[status(thm)],[c_250,c_247,c_250]) ).

tcf(c_374,negated_conjecture,
    nil = sK56,
    inference(global_subsumption_just,[status(thm)],[c_248,c_247,c_248]) ).

tcf(c_1702,plain,
    neq(nil,nil),
    inference(demodulation,[status(thm)],[c_246,c_374]) ).

tcf(c_1705,plain,
    ~ neq(nil,nil),
    inference(light_normalisation,[status(thm)],[c_247,c_370]) ).

tcf(c_1706,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1705,c_1702]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC208+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.09/0.36  % Computer : n009.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 16:58:58 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.13/0.41  
% 0.13/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 1.74/1.27  % SZS status Started for theBenchmark.p
% 1.74/1.27  % SZS status Theorem for theBenchmark.p
% 1.74/1.27  
% 1.74/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.74/1.27  
% 1.74/1.27  % ------  iProver source info
% 1.74/1.27  
% 1.74/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 1.74/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.74/1.27  % git: non_committed_changes: false
% 1.74/1.27  
% 1.74/1.27  % ------ Parsing...
% 1.74/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.74/1.27  
% 1.74/1.27  % ------ Preprocessing...% 
% 1.74/1.27  
% 1.74/1.27  % SZS status Theorem for theBenchmark.p
% 1.74/1.27  
% 1.74/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.74/1.27  
% 1.74/1.27  
%------------------------------------------------------------------------------