↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWW951+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n010.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:30:34 PM UTC 2026

% Result   : Theorem 1.90s 1.28s
% Output   : CNFRefutation 1.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  12 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   52 (  26   ~;  21   |;   1   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,axiom,
    pred_attacker(constr_ZERO),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax44) ).

fof(f47,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_out_4(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).

fof(f50,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_T_in_3(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).

fof(f52,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_T_in_1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).

fof(f65,axiom,
    ! [X0,X1] :
      ( ( pred_attacker(tuple_T_in_1(X1))
        & pred_attacker(tuple_T_in_3(X0)) )
     => pred_attacker(tuple_T_out_4(name_objective)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax64) ).

fof(f66,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).

fof(f67,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(negated_conjecture,[status(cth)],[f66]) ).

fof(f68,plain,
    ~ pred_attacker(name_objective),
    inference(flattening,[],[f67]) ).

fof(f74,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_out_4(X0))
      | pred_attacker(X0) ),
    inference(ennf_transformation,[],[f47]) ).

fof(f77,plain,
    ! [X0] :
      ( ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_3(X0)) ),
    inference(ennf_transformation,[],[f50]) ).

fof(f79,plain,
    ! [X0] :
      ( ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_1(X0)) ),
    inference(ennf_transformation,[],[f52]) ).

fof(f86,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(ennf_transformation,[],[f65]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(flattening,[],[f86]) ).

fof(f132,plain,
    pred_attacker(constr_ZERO),
    inference(cnf_transformation,[],[f45]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_out_4(X0))
      | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f137,plain,
    ! [X0] :
      ( ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_3(X0)) ),
    inference(cnf_transformation,[],[f77]) ).

fof(f139,plain,
    ! [X0] :
      ( ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_1(X0)) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f151,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f152,plain,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f68]) ).

tcf(c_93,plain,
    pred_attacker(constr_ZERO),
    inference(cnf_transformation,[],[f132]) ).

tcf(c_95,plain,
    ! [X0: $i] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_T_out_4(X0)) ),
    inference(cnf_transformation,[],[f134]) ).

tcf(c_98,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_T_in_3(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f137]) ).

tcf(c_100,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_T_in_1(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f139]) ).

tcf(c_112,plain,
    ! [X0: $i,X1: $i] :
      ( pred_attacker(tuple_T_out_4(name_objective))
      | ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0)) ),
    inference(cnf_transformation,[],[f151]) ).

tcf(c_113,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f152]) ).

tcf(c_115,plain,
    ( pred_attacker(tuple_T_in_1(constr_ZERO))
    | ~ pred_attacker(constr_ZERO) ),
    inference(instantiation,[status(thm)],[c_100]) ).

tcf(c_116,plain,
    ( pred_attacker(tuple_T_in_3(constr_ZERO))
    | ~ pred_attacker(constr_ZERO) ),
    inference(instantiation,[status(thm)],[c_98]) ).

tcf(c_125,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(tuple_T_in_1(constr_ZERO))
    | ~ pred_attacker(tuple_T_in_3(constr_ZERO)) ),
    inference(instantiation,[status(thm)],[c_112]) ).

tcf(c_127,plain,
    pred_attacker(tuple_T_out_4(name_objective)),
    inference(global_subsumption_just,[status(thm)],[c_112,c_93,c_115,c_116,c_125]) ).

tcf(c_759,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(demodulation,[status(thm)],[c_113]) ).

tcf(c_1401,plain,
    pred_attacker(name_objective),
    inference(superposition,[status(thm)],[c_127,c_95]) ).

tcf(c_1402,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1401,c_759]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW951+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37  % Computer : n010.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Thu Sep 24 23:15:28 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.12/0.43  
% 0.12/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43  
% 0.12/0.43  % Detected problem language: tptp
% 0.12/0.44  % Proving...
% 1.90/1.28  % SZS status Started for theBenchmark.p
% 1.90/1.28  % SZS status Theorem for theBenchmark.p
% 1.90/1.28  
% 1.90/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.90/1.28  
% 1.90/1.28  % ------  iProver source info
% 1.90/1.28  
% 1.90/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.90/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.90/1.28  % git: non_committed_changes: false
% 1.90/1.28  
% 1.90/1.28  % ------ Parsing...
% 1.90/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.90/1.28  
% 1.90/1.28  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.90/1.28  
% 1.90/1.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.90/1.28  
% 1.90/1.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.90/1.28  % ------ Proving...
% 1.90/1.28  % ------ Problem Properties 
% 1.90/1.28  
% 1.90/1.28  % 
% 1.90/1.28  % clauses                               63
% 1.90/1.28  % conjectures                           1
% 1.90/1.28  % EPR                                   46
% 1.90/1.28  % Horn                                  63
% 1.90/1.28  % unary                                 52
% 1.90/1.28  % binary                                10
% 1.90/1.28  % lits                                  75
% 1.90/1.29  % lits eq                               40
% 1.90/1.29  % fd_pure                               0
% 1.90/1.29  % fd_pseudo                             0
% 1.90/1.29  % fd_cond                               0
% 1.90/1.29  % fd_pseudo_cond                        0
% 1.90/1.29  % AC symbols                            1
% 1.90/1.29  
% 1.90/1.29  % ------ Schedule dynamic 5 is on 
% 1.90/1.29  
% 1.90/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.90/1.29  
% 1.90/1.29  
% 1.90/1.29  % ------ 
% 1.90/1.29  % Current options:
% 1.90/1.29  % ------ 
% 1.90/1.29  
% 1.90/1.29  
% 1.90/1.29  % 
% 1.90/1.29  
% 1.90/1.29  % ------ Proving...
% 1.90/1.29  % 
% 1.90/1.29  
% 1.90/1.29  % SZS status Theorem for theBenchmark.p
% 1.90/1.29  
% 1.90/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.90/1.29  
% 1.90/1.29  
%------------------------------------------------------------------------------