↑ Up

iProver---3.9.4.THM-CRf.s

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

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

% 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(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( nil = X3
                      & nil != X2 )
                    | ( nil = X2
                      & nil != X3 )
                    | neq(X0,nil)
                    | ~ 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)
                   => ( ( nil = X3
                        & nil != X2 )
                      | ( nil = X2
                        & nil != X3 )
                      | neq(X0,nil)
                      | ~ 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)
                  & ( nil != X3
                    | nil = X2 )
                  & ( 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)
                  & ( nil != X3
                    | nil = X2 )
                  & ( nil != X2
                    | nil = X3 )
                  & ~ neq(X0,nil)
                  & 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)
    & ( nil != sK56
      | nil = sK55 )
    & ( 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(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(f496,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f296]) ).

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

fof(f502,plain,
    ~ neq(sK53,nil),
    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,
    ~ neq(sK55,nil),
    inference(definition_unfolding,[],[f502,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_139,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ~ neq(X0,X0) ),
    inference(cnf_transformation,[],[f539]) ).

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

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

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

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

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

tcf(c_380,plain,
    ( ( nil = sK56 )
    | ( nil != sK55 ) ),
    inference(prop_impl_just,[status(thm)],[c_248]) ).

tcf(c_408,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ~ neq(X0,X0) ),
    inference(prop_impl_just,[status(thm)],[c_139]) ).

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

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

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

tcf(c_3681,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( X0 != sK56 )
      | ( X0 != nil ) ),
    inference(resolution_lifted,[status(thm)],[c_408,c_246]) ).

tcf(c_3682,plain,
    ( ~ ssList(nil)
    | ( nil != sK56 ) ),
    inference(unflattening,[status(thm)],[c_3681]) ).

tcf(c_3683,plain,
    nil != sK56,
    inference(global_subsumption_just,[status(thm)],[c_3682,c_141,c_3682]) ).

tcf(c_3698,plain,
    nil != sK55,
    inference(backward_subsumption_resolution,[status(thm)],[c_380,c_3683]) ).

tcf(c_6502,plain,
    nil != nil,
    inference(demodulation,[status(thm)],[c_3698,c_3674]) ).

tcf(c_6503,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_6502]) ).


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