↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 1.05s 1.36s
% Output   : CNFRefutation 1.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   38 (  21 unt;   0 def)
%            Number of atoms       :  121 (  23 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  133 (  50   ~;  39   |;  32   &)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   28 (   0 sgn  20   !;   8   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

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

fof(f39,axiom,
    ~ singletonP(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).

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

fof(f118,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f221,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ssList(X3)
                  & ( ~ segmentP(X1,X0)
                    | ~ neq(X0,nil) )
                  & ( ~ neq(X3,nil)
                    | singletonP(X2) )
                  & segmentP(X3,X2)
                  & 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)
                  & ( ~ segmentP(X1,X0)
                    | ~ neq(X0,nil) )
                  & ( ~ neq(X3,nil)
                    | singletonP(X2) )
                  & segmentP(X3,X2)
                  & neq(X1,nil)
                  & X0 = X2
                  & X1 = X3 ) ) ) ),
    inference(flattening,[],[f221]) ).

fof(f273,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ( ( ~ neq(X0,X1)
              | X0 != X1 )
            & ( X0 = X1
              | neq(X0,X1) ) ) ) ),
    inference(nnf_transformation,[],[f118]) ).

fof(f296,plain,
    ( ssList(sK53)
    & ssList(sK54)
    & ssList(sK55)
    & ssList(sK56)
    & ( ~ segmentP(sK54,sK53)
      | ~ neq(sK53,nil) )
    & ( ~ neq(sK56,nil)
      | singletonP(sK55) )
    & segmentP(sK56,sK55)
    & 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(f387,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 = X1
      | neq(X0,X1) ),
    inference(cnf_transformation,[],[f273]) ).

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

fof(f420,plain,
    ~ singletonP(nil),
    inference(cnf_transformation,[],[f39]) ).

fof(f496,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f296]) ).

fof(f500,plain,
    ( ~ segmentP(sK54,sK53)
    | ~ neq(sK53,nil) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f501,plain,
    ( ~ neq(sK56,nil)
    | singletonP(sK55) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    segmentP(sK56,sK55),
    inference(cnf_transformation,[],[f296]) ).

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

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

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

fof(f506,plain,
    neq(sK56,nil),
    inference(definition_unfolding,[],[f503,f505]) ).

fof(f507,plain,
    ( ~ segmentP(sK56,sK55)
    | ~ neq(sK55,nil) ),
    inference(definition_unfolding,[],[f500,f504,f505,f504]) ).

fof(f509,plain,
    ssList(sK55),
    inference(definition_unfolding,[],[f496,f504]) ).

tcf(c_138,plain,
    ! [X0: $i,X1: $i] :
      ( neq(X0,X1)
      | ( X0 = X1 )
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f387]) ).

tcf(c_141,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f389]) ).

tcf(c_172,plain,
    ~ singletonP(nil),
    inference(cnf_transformation,[],[f420]) ).

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

tcf(c_247,negated_conjecture,
    segmentP(sK56,sK55),
    inference(cnf_transformation,[],[f502]) ).

tcf(c_248,negated_conjecture,
    ( singletonP(sK55)
    | ~ neq(sK56,nil) ),
    inference(cnf_transformation,[],[f501]) ).

tcf(c_249,negated_conjecture,
    ( ~ segmentP(sK56,sK55)
    | ~ neq(sK55,nil) ),
    inference(cnf_transformation,[],[f507]) ).

tcf(c_253,negated_conjecture,
    ssList(sK55),
    inference(cnf_transformation,[],[f509]) ).

tcf(c_360,negated_conjecture,
    singletonP(sK55),
    inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248]) ).

tcf(c_368,negated_conjecture,
    ~ neq(sK55,nil),
    inference(global_subsumption_just,[status(thm)],[c_249,c_247,c_249]) ).

tcf(c_3226,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( X1 != nil )
      | ( X0 != sK55 ) ),
    inference(resolution_lifted,[status(thm)],[c_138,c_368]) ).

tcf(c_3227,plain,
    ( ( sK55 = nil )
    | ~ ssList(sK55)
    | ~ ssList(nil) ),
    inference(unflattening,[status(thm)],[c_3226]) ).

tcf(c_3228,plain,
    sK55 = nil,
    inference(global_subsumption_just,[status(thm)],[c_3227,c_253,c_141,c_3227]) ).

tcf(c_6058,plain,
    singletonP(nil),
    inference(demodulation,[status(thm)],[c_360,c_3228]) ).

tcf(c_6059,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_6058,c_172]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWC127+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.40  % Computer : n020.cluster.edu
% 0.16/0.40  % Model    : x86_64 x86_64
% 0.16/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40  % Memory   : 8046.5625MB
% 0.16/0.40  % OS       : Linux 6.8.0-71-generic
% 0.16/0.40  % CPULimit : 300
% 0.16/0.40  % WCLimit  : 300
% 0.16/0.40  % DateTime : Thu Sep 24 16:33:19 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.46  Running first-order theorem proving
% 0.16/0.46  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.16/0.48  
% 0.16/0.48  % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.48  
% 0.16/0.48  % Detected problem language: tptp
% 0.22/0.50  % Proving...
% 1.05/1.36  % SZS status Started for theBenchmark.p
% 1.05/1.36  % SZS status Theorem for theBenchmark.p
% 1.05/1.36  
% 1.05/1.36  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.05/1.36  
% 1.05/1.36  % ------  iProver source info
% 1.05/1.36  
% 1.05/1.36  % git: date: 2026-07-19 20:42:38 +0200
% 1.05/1.36  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.05/1.36  % git: non_committed_changes: false
% 1.05/1.36  
% 1.05/1.36  % ------ Parsing...
% 1.05/1.36  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.05/1.36  
% 1.05/1.36  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e % 
% 1.05/1.36  
% 1.05/1.36  % SZS status Theorem for theBenchmark.p
% 1.05/1.36  
% 1.05/1.36  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.05/1.36  
% 1.05/1.36  
%------------------------------------------------------------------------------