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

View Problem - Process Solution

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

% Computer : n020.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 : Mon Jun 24 14:36:30 EDT 2024

% Result   : Theorem 1.78s 1.18s
% Output   : CNFRefutation 1.78s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,conjecture,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => ( subset(X0,set_difference(X1,singleton(X2)))
        | in(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_zfmisc_1) ).

fof(f6,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( subset(X0,X1)
       => ( subset(X0,set_difference(X1,singleton(X2)))
          | in(X2,X0) ) ),
    inference(negated_conjecture,[],[f5]) ).

fof(f7,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => ( subset(X0,set_difference(X1,singleton(X2)))
        | in(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).

fof(f10,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,set_difference(X1,singleton(X2)))
      & ~ in(X2,X0)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f11,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,set_difference(X1,singleton(X2)))
      & ~ in(X2,X0)
      & subset(X0,X1) ),
    inference(flattening,[],[f10]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( subset(X0,set_difference(X1,singleton(X2)))
      | in(X2,X0)
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( subset(X0,set_difference(X1,singleton(X2)))
      | in(X2,X0)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f12]) ).

fof(f18,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(X0,set_difference(X1,singleton(X2)))
        & ~ in(X2,X0)
        & subset(X0,X1) )
   => ( ~ subset(sK2,set_difference(sK3,singleton(sK4)))
      & ~ in(sK4,sK2)
      & subset(sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ( ~ subset(sK2,set_difference(sK3,singleton(sK4)))
    & ~ in(sK4,sK2)
    & subset(sK2,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f11,f18]) ).

fof(f24,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f19]) ).

fof(f25,plain,
    ~ in(sK4,sK2),
    inference(cnf_transformation,[],[f19]) ).

fof(f26,plain,
    ~ subset(sK2,set_difference(sK3,singleton(sK4))),
    inference(cnf_transformation,[],[f19]) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( subset(X0,set_difference(X1,singleton(X2)))
      | in(X2,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

cnf(c_53,negated_conjecture,
    ~ subset(sK2,set_difference(sK3,singleton(sK4))),
    inference(cnf_transformation,[],[f26]) ).

cnf(c_54,negated_conjecture,
    ~ in(sK4,sK2),
    inference(cnf_transformation,[],[f25]) ).

cnf(c_55,negated_conjecture,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f24]) ).

cnf(c_56,plain,
    ( ~ subset(X0,X1)
    | subset(X0,set_difference(X1,singleton(X2)))
    | in(X2,X0) ),
    inference(cnf_transformation,[],[f27]) ).

cnf(c_100,plain,
    singleton(sK4) = sP0_iProver_def,
    definition ).

cnf(c_101,plain,
    set_difference(sK3,sP0_iProver_def) = sP1_iProver_def,
    definition ).

cnf(c_104,negated_conjecture,
    ~ subset(sK2,sP1_iProver_def),
    inference(demodulation,[status(thm)],[c_53,c_100,c_101]) ).

cnf(c_238,plain,
    ( ~ subset(X0,X1)
    | subset(X0,set_difference(X1,sP0_iProver_def))
    | in(sK4,X0) ),
    inference(superposition,[status(thm)],[c_100,c_56]) ).

cnf(c_249,plain,
    ( ~ subset(X0,sK3)
    | subset(X0,sP1_iProver_def)
    | in(sK4,X0) ),
    inference(superposition,[status(thm)],[c_101,c_238]) ).

cnf(c_253,plain,
    ( ~ subset(sK2,sK3)
    | subset(sK2,sP1_iProver_def)
    | in(sK4,sK2) ),
    inference(instantiation,[status(thm)],[c_249]) ).

cnf(c_254,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_253,c_104,c_54,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET899+1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sun Jun 23 12:24:24 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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
% 1.78/1.18  % SZS status Started for theBenchmark.p
% 1.78/1.18  % SZS status Theorem for theBenchmark.p
% 1.78/1.18  
% 1.78/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.78/1.18  
% 1.78/1.18  ------  iProver source info
% 1.78/1.18  
% 1.78/1.18  git: date: 2024-06-12 09:56:46 +0000
% 1.78/1.18  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.78/1.18  git: non_committed_changes: false
% 1.78/1.18  
% 1.78/1.18  ------ Parsing...
% 1.78/1.18  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.78/1.18  
% 1.78/1.18  ------ Preprocessing... sf_s  rm: 2 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.78/1.18  
% 1.78/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.78/1.18  
% 1.78/1.18  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.78/1.18  ------ Proving...
% 1.78/1.18  ------ Problem Properties 
% 1.78/1.18  
% 1.78/1.18  
% 1.78/1.18  clauses                                 8
% 1.78/1.18  conjectures                             3
% 1.78/1.18  EPR                                     5
% 1.78/1.18  Horn                                    7
% 1.78/1.18  unary                                   6
% 1.78/1.18  binary                                  1
% 1.78/1.18  lits                                    11
% 1.78/1.18  lits eq                                 2
% 1.78/1.18  fd_pure                                 0
% 1.78/1.18  fd_pseudo                               0
% 1.78/1.18  fd_cond                                 0
% 1.78/1.18  fd_pseudo_cond                          0
% 1.78/1.18  AC symbols                              0
% 1.78/1.18  
% 1.78/1.18  ------ Schedule dynamic 5 is on 
% 1.78/1.18  
% 1.78/1.18  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/1.18  
% 1.78/1.18  
% 1.78/1.18  ------ 
% 1.78/1.18  Current options:
% 1.78/1.18  ------ 
% 1.78/1.18  
% 1.78/1.18  
% 1.78/1.18  
% 1.78/1.18  
% 1.78/1.18  ------ Proving...
% 1.78/1.18  
% 1.78/1.18  
% 1.78/1.18  % SZS status Theorem for theBenchmark.p
% 1.78/1.18  
% 1.78/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.18  
% 1.78/1.18  
%------------------------------------------------------------------------------