↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n006.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 3.09s 1.26s
% Output   : CNFRefutation 3.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   51 (  12 unt;   0 def)
%            Number of atoms       :  101 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   99 (  49   ~;  42   |;   2   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn  43   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f54,axiom,
    pred_attacker(constr_ZERO),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).

fof(f56,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_out_4(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).

fof(f58,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_out_2(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).

fof(f59,axiom,
    ! [X0,X1] :
      ( ( pred_attacker(X1)
        & pred_attacker(X0) )
     => pred_attacker(tuple_T_in_3(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).

fof(f62,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_T_in_1(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax61) ).

fof(f74,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_in_1(X0))
     => pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax73) ).

fof(f75,axiom,
    ! [X0,X1] :
      ( ( pred_attacker(tuple_T_in_1(X1))
        & pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) )
     => pred_attacker(tuple_T_out_4(name_objective)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).

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

fof(f77,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(negated_conjecture,[status(cth)],[f76]) ).

fof(f78,plain,
    ~ pred_attacker(name_objective),
    inference(flattening,[],[f77]) ).

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

fof(f86,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_out_2(X0))
      | pred_attacker(X0) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(X1)
      | ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_3(X0,X1)) ),
    inference(ennf_transformation,[],[f59]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(X1)
      | ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_3(X0,X1)) ),
    inference(flattening,[],[f87]) ).

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

fof(f97,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_in_1(X0))
      | pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    inference(ennf_transformation,[],[f74]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(ennf_transformation,[],[f75]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(flattening,[],[f98]) ).

fof(f153,plain,
    pred_attacker(constr_ZERO),
    inference(cnf_transformation,[],[f54]) ).

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

fof(f157,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_out_2(X0))
      | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f86]) ).

fof(f158,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(X1)
      | ~ pred_attacker(X0)
      | pred_attacker(tuple_T_in_3(X0,X1)) ),
    inference(cnf_transformation,[],[f88]) ).

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

fof(f172,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_in_1(X0))
      | pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f173,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(cnf_transformation,[],[f99]) ).

fof(f174,plain,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f78]) ).

tcf(c_102,plain,
    pred_attacker(constr_ZERO),
    inference(cnf_transformation,[],[f153]) ).

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

tcf(c_106,plain,
    ! [X0: $i] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_T_out_2(X0)) ),
    inference(cnf_transformation,[],[f157]) ).

tcf(c_107,plain,
    ! [X0: $i,X1: $i] :
      ( pred_attacker(tuple_T_in_3(X0,X1))
      | ~ pred_attacker(X1)
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f158]) ).

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

tcf(c_121,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(tuple_T_in_1(X0)) ),
    inference(cnf_transformation,[],[f172]) ).

tcf(c_122,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,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    inference(cnf_transformation,[],[f173]) ).

tcf(c_123,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f174]) ).

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

tcf(c_151,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(X0) ),
    inference(prop_impl_just,[status(thm)],[c_110,c_121]) ).

tcf(c_535,plain,
    ! [X0: $i] :
      ( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(X0) ),
    inference(prop_impl_just,[status(thm)],[c_151]) ).

tcf(c_876,plain,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | ~ pred_attacker(tuple_T_in_1(X0)) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_122]) ).

tcf(c_877,plain,
    ! [X0: $i] :
      ( ~ iPr_def_11
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_122]) ).

tcf(c_878,plain,
    ( iPr_def_11
    | iPr_def_10
    | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_122]) ).

tcf(c_879,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(demodulation,[status(thm)],[c_123]) ).

tcf(c_895,plain,
    ( ~ iPr_def_10
    | ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
    inference(instantiation,[status(thm)],[c_876]) ).

tcf(c_1638,plain,
    ( iPr_def_11
    | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(global_subsumption_just,[status(thm)],[c_878,c_102,c_125,c_895,c_878]) ).

tcf(c_1664,plain,
    ( iPr_def_11
    | pred_attacker(name_objective) ),
    inference(superposition,[status(thm)],[c_1638,c_104]) ).

tcf(c_1665,plain,
    iPr_def_11,
    inference(forward_subsumption_resolution,[status(thm)],[c_1664,c_879]) ).

tcf(c_1675,plain,
    ! [X0: $i] :
      ( pred_attacker(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))
      | ~ pred_attacker(X0) ),
    inference(superposition,[status(thm)],[c_535,c_106]) ).

tcf(c_1678,plain,
    ( pred_attacker(constr_h(constr_xor(constr_ZERO,constr_xor(name_k0x30,name_ki))))
    | ~ pred_attacker(constr_ZERO) ),
    inference(instantiation,[status(thm)],[c_1675]) ).

tcf(c_2170,plain,
    ! [X0: $i] : ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))),
    inference(global_subsumption_just,[status(thm)],[c_877,c_877,c_1665]) ).

tcf(c_2173,plain,
    ! [X0: $i] :
      ( ~ pred_attacker(X0)
      | ~ pred_attacker(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))) ),
    inference(superposition,[status(thm)],[c_107,c_2170]) ).

tcf(c_2184,plain,
    ( ~ pred_attacker(constr_ZERO)
    | ~ pred_attacker(constr_h(constr_xor(constr_ZERO,constr_xor(name_k0x30,name_ki)))) ),
    inference(instantiation,[status(thm)],[c_2173]) ).

tcf(c_2185,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2184,c_1678,c_102]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW950+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.34  % Computer : n006.cluster.edu
% 0.10/0.34  % Model    : x86_64 x86_64
% 0.10/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34  % Memory   : 8046.5625MB
% 0.10/0.34  % OS       : Linux 6.8.0-71-generic
% 0.10/0.34  % CPULimit : 300
% 0.10/0.34  % WCLimit  : 300
% 0.10/0.34  % DateTime : Thu Sep 24 23:14:11 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.38  Running first-order theorem proving
% 0.13/0.38  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.13/0.39  
% 0.13/0.39  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.39  
% 0.13/0.39  % Detected problem language: tptp
% 0.13/0.40  % Proving...
% 3.09/1.26  % SZS status Started for theBenchmark.p
% 3.09/1.26  % SZS status Theorem for theBenchmark.p
% 3.09/1.26  
% 3.09/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.09/1.26  
% 3.09/1.26  % ------  iProver source info
% 3.09/1.26  
% 3.09/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 3.09/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.09/1.26  % git: non_committed_changes: false
% 3.09/1.26  
% 3.09/1.26  % ------ Parsing...
% 3.09/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.09/1.26  
% 3.09/1.26  % ------ 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 % 
% 3.09/1.26  
% 3.09/1.26  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.09/1.26  
% 3.09/1.26  % ------ Preprocessing... sf_s  rm: 2 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.09/1.26  % ------ Proving...
% 3.09/1.26  % ------ Problem Properties 
% 3.09/1.26  
% 3.09/1.26  % 
% 3.09/1.26  % clauses                               75
% 3.09/1.26  % conjectures                           1
% 3.09/1.26  % EPR                                   55
% 3.09/1.26  % Horn                                  74
% 3.09/1.26  % unary                                 60
% 3.09/1.26  % binary                                12
% 3.09/1.26  % lits                                  93
% 3.09/1.26  % lits eq                               49
% 3.09/1.26  % fd_pure                               0
% 3.09/1.26  % fd_pseudo                             0
% 3.09/1.26  % fd_cond                               0
% 3.09/1.26  % fd_pseudo_cond                        0
% 3.09/1.26  % AC symbols                            1
% 3.09/1.26  
% 3.09/1.26  % ------ Schedule dynamic 5 is on 
% 3.09/1.26  
% 3.09/1.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.09/1.26  
% 3.09/1.26  
% 3.09/1.26  % ------ 
% 3.09/1.26  % Current options:
% 3.09/1.26  % ------ 
% 3.09/1.26  
% 3.09/1.26  
% 3.09/1.26  % 
% 3.09/1.26  
% 3.09/1.26  % ------ Proving...
% 3.09/1.26  % 
% 3.09/1.26  
% 3.09/1.26  % SZS status Theorem for theBenchmark.p
% 3.09/1.26  
% 3.09/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.09/1.26  
% 3.09/1.26  
%------------------------------------------------------------------------------