TSTP Solution File: SWV392+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV392+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 03:14:19 EDT 2024

% Result   : Theorem 0.80s 1.10s
% Output   : CNFRefutation 0.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   40 (   9 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   45 (  18   ~;   2   |;  19   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (   1 sgn   8   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X0] : ~ contains_slb(create_slb,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).

fof(f19,conjecture,
    ! [X0,X1] :
      ( pair_in_list(create_slb,X0,X1)
     => ! [X2] :
          ( contains_slb(create_slb,X2)
         => ( X0 = X2
            | pair_in_list(remove_slb(create_slb,X2),X0,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_co) ).

fof(f20,negated_conjecture,
    ~ ! [X0,X1] :
        ( pair_in_list(create_slb,X0,X1)
       => ! [X2] :
            ( contains_slb(create_slb,X2)
           => ( X0 = X2
              | pair_in_list(remove_slb(create_slb,X2),X0,X1) ) ) ),
    inference(negated_conjecture,[],[f19]) ).

fof(f32,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( X0 != X2
          & ~ pair_in_list(remove_slb(create_slb,X2),X0,X1)
          & contains_slb(create_slb,X2) )
      & pair_in_list(create_slb,X0,X1) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f33,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( X0 != X2
          & ~ pair_in_list(remove_slb(create_slb,X2),X0,X1)
          & contains_slb(create_slb,X2) )
      & pair_in_list(create_slb,X0,X1) ),
    inference(flattening,[],[f32]) ).

fof(f38,plain,
    ( ? [X0,X1] :
        ( ? [X2] :
            ( X0 != X2
            & ~ pair_in_list(remove_slb(create_slb,X2),X0,X1)
            & contains_slb(create_slb,X2) )
        & pair_in_list(create_slb,X0,X1) )
   => ( ? [X2] :
          ( sK0 != X2
          & ~ pair_in_list(remove_slb(create_slb,X2),sK0,sK1)
          & contains_slb(create_slb,X2) )
      & pair_in_list(create_slb,sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f39,plain,
    ( ? [X2] :
        ( sK0 != X2
        & ~ pair_in_list(remove_slb(create_slb,X2),sK0,sK1)
        & contains_slb(create_slb,X2) )
   => ( sK0 != sK2
      & ~ pair_in_list(remove_slb(create_slb,sK2),sK0,sK1)
      & contains_slb(create_slb,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f40,plain,
    ( sK0 != sK2
    & ~ pair_in_list(remove_slb(create_slb,sK2),sK0,sK1)
    & contains_slb(create_slb,sK2)
    & pair_in_list(create_slb,sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f33,f39,f38]) ).

fof(f48,plain,
    ! [X0] : ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f65,plain,
    contains_slb(create_slb,sK2),
    inference(cnf_transformation,[],[f40]) ).

cnf(c_56,plain,
    ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[],[f48]) ).

cnf(c_74,negated_conjecture,
    contains_slb(create_slb,sK2),
    inference(cnf_transformation,[],[f65]) ).

cnf(c_99,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_74,c_56]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : SWV392+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.10  % Command  : run_iprover %s %d THM
% 0.09/0.30  % Computer : n025.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Fri May  3 00:46:28 EDT 2024
% 0.09/0.31  % CPUTime  : 
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.80/1.10  % SZS status Started for theBenchmark.p
% 0.80/1.10  % SZS status Theorem for theBenchmark.p
% 0.80/1.10  
% 0.80/1.10  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.80/1.10  
% 0.80/1.10  ------  iProver source info
% 0.80/1.10  
% 0.80/1.10  git: date: 2024-05-02 19:28:25 +0000
% 0.80/1.10  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.80/1.10  git: non_committed_changes: false
% 0.80/1.10  
% 0.80/1.10  ------ Parsing...
% 0.80/1.10  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.80/1.10  
% 0.80/1.10  ------ Preprocessing...
% 0.80/1.10  
% 0.80/1.10  % SZS status Theorem for theBenchmark.p
% 0.80/1.10  
% 0.80/1.10  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.80/1.10  
% 0.80/1.10  
%------------------------------------------------------------------------------