↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV884-1 : TPTP v9.3.1. Released v4.1.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 03:24:24 PM UTC 2026

% Result   : Unsatisfiable 17.86s 8.79s
% Output   : CNFRefutation 17.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   13 (   7 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-4 aty)
%            Number of variables   :   18 (   0 sgn  18   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1183,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_in(X0,X3,X2)
      | ~ c_lessequals(X1,X3,tc_fun(X2,tc_bool))
      | c_lessequals(c_Set_Oinsert(X0,X1,X2),X3,tc_fun(X2,tc_bool)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__subset_2) ).

fof(f1261,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ c_in(X1,X2,X3)
      | c_in(hAPP(X0,X1),c_Set_Oimage(X0,X2,X3,X4),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_imageI_0) ).

fof(f1264,negated_conjecture,
    c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f1267,negated_conjecture,
    c_in(v_pn,v_U,tc_Com_Opname),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f1269,negated_conjecture,
    ~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

tcf(c_2022,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(c_Set_Oinsert(X3,X0,X2),X1,tc_fun(X2,tc_bool))
      | ~ c_in(X3,X1,X2)
      | ~ c_lessequals(X0,X1,tc_fun(X2,tc_bool)) ),
    inference(cnf_transformation,[],[f1183]) ).

tcf(c_2088,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( c_in(hAPP(X3,X0),c_Set_Oimage(X3,X1,X2,X4),X4)
      | ~ c_in(X0,X1,X2) ),
    inference(cnf_transformation,[],[f1261]) ).

tcf(c_2091,negated_conjecture,
    c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    inference(cnf_transformation,[],[f1264]) ).

tcf(c_2094,negated_conjecture,
    c_in(v_pn,v_U,tc_Com_Opname),
    inference(cnf_transformation,[],[f1267]) ).

tcf(c_2096,negated_conjecture,
    ~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    inference(cnf_transformation,[],[f1269]) ).

tcf(c_25002,plain,
    ( c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool))
    | ~ c_in(hAPP(v_mgt__call,v_pn),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a)
    | ~ c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)) ),
    inference(instantiation,[status(thm)],[c_2022]) ).

tcf(c_25609,plain,
    ( c_in(hAPP(v_mgt__call,v_pn),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a)
    | ~ c_in(v_pn,v_U,tc_Com_Opname) ),
    inference(instantiation,[status(thm)],[c_2088]) ).

tcf(c_25610,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_25609,c_25002,c_2096,c_2091,c_2094]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV884-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.38  % Computer : n009.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Thu Sep 24 21:13:35 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.43  
% 0.14/5.43  % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43  
% 0.14/5.44  % Detected problem language: tptp
% 0.14/5.45  % Proving...
% 17.86/8.79  % SZS status Started for theBenchmark.p
% 17.86/8.79  % SZS status Unsatisfiable for theBenchmark.p
% 17.86/8.79  
% 17.86/8.79  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 17.86/8.79  
% 17.86/8.79  % ------  iProver source info
% 17.86/8.79  
% 17.86/8.79  % git: date: 2026-07-19 20:42:38 +0200
% 17.86/8.79  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 17.86/8.79  % git: non_committed_changes: false
% 17.86/8.79  
% 17.86/8.79  % ------ Parsing...% successful
% 17.86/8.79  
% 17.86/8.79  
% 17.86/8.79  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 17.86/8.79  
% 17.86/8.79  % ------ Preprocessing... sup_sim: 59  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e  sup_sim: 10  sf_s  rm: 32 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 32 0s  sf_e  pe_s  pe_e % 
% 17.86/8.79  
% 17.86/8.79  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 17.86/8.79  
% 17.86/8.79  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e 
% 17.86/8.79  % ------ Proving...
% 17.86/8.79  % ------ Problem Properties 
% 17.86/8.79  
% 17.86/8.79  % 
% 17.86/8.79  % clauses                               616
% 17.86/8.79  % conjectures                           7
% 17.86/8.79  % EPR                                   49
% 17.86/8.79  % Horn                                  530
% 17.86/8.79  % unary                                 175
% 17.86/8.79  % binary                                233
% 17.86/8.79  % lits                                  1310
% 17.86/8.79  % lits eq                               346
% 17.86/8.79  % fd_pure                               0
% 17.86/8.79  % fd_pseudo                             0
% 17.86/8.79  % fd_cond                               26
% 17.86/8.79  % fd_pseudo_cond                        47
% 17.86/8.79  % AC symbols                            0
% 17.86/8.79  
% 17.86/8.79  % ------ Input Options Time Limit: Unbounded
% 17.86/8.79  
% 17.86/8.79  
% 17.86/8.79  % ------ 
% 17.86/8.79  % Current options:
% 17.86/8.79  % ------ 
% 17.86/8.79  
% 17.86/8.79  
% 17.86/8.79  % 
% 17.86/8.79  
% 17.86/8.79  % ------ Proving...
% 17.86/8.79  % 
% 17.86/8.79  
% 17.86/8.79  % SZS status Unsatisfiable for theBenchmark.p
% 17.86/8.79  
% 17.86/8.79  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.86/8.79  
% 17.86/8.79  
%------------------------------------------------------------------------------