↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : DAT019_1 : TPTP v9.3.1. Released v5.0.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 01:13:53 PM UTC 2026

% Result   : Theorem 0.53s 11.21s
% Output   : CNFRefutation 0.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   6 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   29 (  14   ~;  10   |;   4   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   27 (  27 fml;   0 var)
%            Number arithmetic     :   37 (   0 atm;   0 fun;  23 num;  14 var)
%            Number of types       :    3 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   2 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    empty: collection ).

tff(pred_def_1,type,
    in: ( collection * $int ) > $o ).

tff(func_def_2,type,
    remove: ( collection * $int ) > collection ).

tff(type_def_5,type,
    collection: $tType ).

tff(f4,axiom,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( X0 = X2 )
        | in(X0,X1) )
    <=> in(X0,add(X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4) ).

tff(f6,conjecture,
    in(3,add(1,add(3,add(5,empty)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(f7,negated_conjecture,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(negated_conjecture,[status(cth)],[f6]) ).

tff(f8,plain,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(flattening,[],[f7]) ).

tff(f9,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( ( X0 != X2 )
          & ~ in(X0,X1) )
        | in(X0,add(X2,X1)) )
      & ( ~ in(X0,add(X2,X1))
        | ( X0 = X2 )
        | in(X0,X1) ) ),
    inference(nnf_transformation,[],[f4]) ).

tff(f10,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( ( X0 != X2 )
          & ~ in(X0,X1) )
        | in(X0,add(X2,X1)) )
      & ( ~ in(X0,add(X2,X1))
        | ( X0 = X2 )
        | in(X0,X1) ) ),
    inference(flattening,[],[f9]) ).

tff(f16,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ( X0 != X2 )
      | in(X0,add(X2,X1)) ),
    inference(cnf_transformation,[],[f10]) ).

tff(f17,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ~ in(X0,X1)
      | in(X0,add(X2,X1)) ),
    inference(cnf_transformation,[],[f10]) ).

tff(f22,plain,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(cnf_transformation,[],[f8]) ).

tff(f23,plain,
    ! [X2: $int,X1: collection] : in(X2,add(X2,X1)),
    inference(equality_resolution,[],[f16]) ).

tcf(c_53,plain,
    ! [X0_int: $int,X0_collection: collection,X1_int: $int] :
      ( in(X0_int,add(X1_int,X0_collection))
      | ~ in(X0_int,X0_collection) ),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_54,plain,
    ! [X0_int: $int,X0_collection: collection] : in(X0_int,add(X0_int,X0_collection)),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_58,negated_conjecture,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_292,plain,
    ~ in(3,add(3,add(5,empty))),
    inference(superposition,[status(thm)],[c_53,c_58]) ).

tcf(c_293,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_292,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : DAT019_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.41  % Computer : n009.cluster.edu
% 0.14/10.41  % Model    : x86_64 x86_64
% 0.14/10.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.41  % Memory   : 8046.5625MB
% 0.14/10.41  % OS       : Linux 6.8.0-71-generic
% 0.14/10.41  % CPULimit : 300
% 0.14/10.41  % WCLimit  : 300
% 0.14/10.41  % DateTime : Fri Sep 25 10:20:40 UTC 2026
% 0.14/10.41  % CPUTime  : 
% 0.14/10.41  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.44  Running TFA theorem proving
% 0.14/10.44  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/10.45  
% 0.14/10.45  % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.45  
% 0.14/10.45  % Detected problem language: tptp
% 0.14/10.46  % Proving...
% 0.53/11.21  % SZS status Started for theBenchmark.p
% 0.53/11.21  % SZS status Theorem for theBenchmark.p
% 0.53/11.21  
% 0.53/11.21  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.53/11.21  
% 0.53/11.21  % ------  iProver source info
% 0.53/11.21  
% 0.53/11.21  % git: date: 2026-07-19 20:42:38 +0200
% 0.53/11.21  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.53/11.21  % git: non_committed_changes: false
% 0.53/11.21  
% 0.53/11.21  % ------ Parsing...
% 0.53/11.21  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.53/11.21  
% 0.53/11.21  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 0.53/11.21  
% 0.53/11.21  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 0.53/11.21  
% 0.53/11.21  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.53/11.21  % ------ Proving...
% 0.53/11.21  % ------ Problem Properties 
% 0.53/11.21  
% 0.53/11.21  % 
% 0.53/11.21  % clauses                               8
% 0.53/11.21  % conjectures                           1
% 0.53/11.21  % EPR                                   1
% 0.53/11.21  % Horn                                  6
% 0.53/11.21  % unary                                 4
% 0.53/11.21  % binary                                2
% 0.53/11.21  % lits                                  14
% 0.53/11.21  % lits eq                               2
% 0.53/11.21  % fd_pure                               0
% 0.53/11.21  % fd_pseudo                             0
% 0.53/11.21  % fd_cond                               0
% 0.53/11.21  % fd_pseudo_cond                        2
% 0.53/11.21  % AC symbols                            0
% 0.53/11.21  
% 0.53/11.21  % ------ Input Options Time Limit: Unbounded
% 0.53/11.21  
% 0.53/11.21  
% 0.53/11.21  % ------ 
% 0.53/11.21  % Current options:
% 0.53/11.21  % ------ 
% 0.53/11.21  
% 0.53/11.21  
% 0.53/11.21  % 
% 0.53/11.21  
% 0.53/11.21  % ------ Proving...
% 0.53/11.21  % 
% 0.53/11.21  
% 0.53/11.21  % SZS status Theorem for theBenchmark.p
% 0.53/11.21  
% 0.53/11.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.53/11.21  
% 0.53/11.21  
%------------------------------------------------------------------------------