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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWW962+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n029.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 : Fri May  3 03:27:01 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f83,axiom,
    ! [X8,X9,X10] : tuple_assoc_pair(X8,tuple_assoc_pair(X9,X10)) = tuple_assoc_pair(tuple_assoc_pair(X8,X9),X10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).

fof(f86,axiom,
    ! [X15,X16] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X15,X16)) = X16,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax85) ).

fof(f93,axiom,
    pred_attacker(tuple_true),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax92) ).

fof(f144,axiom,
    ! [X93,X94] :
      ( pred_attacker(tuple_assoc_pair(X93,X94))
     => pred_attacker(X93) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax143) ).

fof(f177,conjecture,
    ! [X130] : pred_attacker(tuple_2(name_Nb(X130),name_objective)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).

fof(f178,negated_conjecture,
    ~ ! [X130] : pred_attacker(tuple_2(name_Nb(X130),name_objective)),
    inference(negated_conjecture,[],[f177]) ).

fof(f182,plain,
    ! [X0,X1,X2] : tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)) = tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2),
    inference(rectify,[],[f83]) ).

fof(f185,plain,
    ! [X0,X1] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,X1)) = X1,
    inference(rectify,[],[f86]) ).

fof(f241,plain,
    ! [X0,X1] :
      ( pred_attacker(tuple_assoc_pair(X0,X1))
     => pred_attacker(X0) ),
    inference(rectify,[],[f144]) ).

fof(f258,plain,
    ~ ! [X0] : pred_attacker(tuple_2(name_Nb(X0),name_objective)),
    inference(rectify,[],[f178]) ).

fof(f320,plain,
    ! [X0,X1] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_assoc_pair(X0,X1)) ),
    inference(ennf_transformation,[],[f241]) ).

fof(f346,plain,
    ? [X0] : ~ pred_attacker(tuple_2(name_Nb(X0),name_objective)),
    inference(ennf_transformation,[],[f258]) ).

fof(f347,plain,
    ( ? [X0] : ~ pred_attacker(tuple_2(name_Nb(X0),name_objective))
   => ~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)) ),
    introduced(choice_axiom,[]) ).

fof(f348,plain,
    ~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f346,f347]) ).

fof(f431,plain,
    ! [X2,X0,X1] : tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)) = tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2),
    inference(cnf_transformation,[],[f182]) ).

fof(f434,plain,
    ! [X0,X1] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,X1)) = X1,
    inference(cnf_transformation,[],[f185]) ).

fof(f441,plain,
    pred_attacker(tuple_true),
    inference(cnf_transformation,[],[f93]) ).

fof(f492,plain,
    ! [X0,X1] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_assoc_pair(X0,X1)) ),
    inference(cnf_transformation,[],[f320]) ).

fof(f524,plain,
    ~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
    inference(cnf_transformation,[],[f348]) ).

cnf(c_131,plain,
    tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2) = tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)),
    inference(cnf_transformation,[],[f431]) ).

cnf(c_134,plain,
    constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,X1)) = X1,
    inference(cnf_transformation,[],[f434]) ).

cnf(c_141,plain,
    pred_attacker(tuple_true),
    inference(cnf_transformation,[],[f441]) ).

cnf(c_192,plain,
    ( ~ pred_attacker(tuple_assoc_pair(X0,X1))
    | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f492]) ).

cnf(c_224,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
    inference(cnf_transformation,[],[f524]) ).

cnf(c_2789,plain,
    name_Nb(sK0) = sP0_iProver_def,
    definition ).

cnf(c_2790,plain,
    tuple_2(sP0_iProver_def,name_objective) = sP1_iProver_def,
    definition ).

cnf(c_2791,negated_conjecture,
    ~ pred_attacker(sP1_iProver_def),
    inference(demodulation,[status(thm)],[c_224,c_2789,c_2790]) ).

cnf(c_5538,plain,
    constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2))) = X2,
    inference(superposition,[status(thm)],[c_131,c_134]) ).

cnf(c_5567,plain,
    tuple_assoc_pair(X0,X1) = X1,
    inference(demodulation,[status(thm)],[c_5538,c_134]) ).

cnf(c_5570,plain,
    ( ~ pred_attacker(X0)
    | pred_attacker(X1) ),
    inference(demodulation,[status(thm)],[c_192,c_5567]) ).

cnf(c_5629,plain,
    pred_attacker(X0),
    inference(superposition,[status(thm)],[c_141,c_5570]) ).

cnf(c_5651,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_2791,c_5629]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SWW962+1 : TPTP v8.1.2. Released v7.4.0.
% 0.10/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n029.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 22:40:52 EDT 2024
% 0.17/0.32  % CPUTime  : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.14  % SZS status Started for theBenchmark.p
% 0.45/1.14  % SZS status Theorem for theBenchmark.p
% 0.45/1.14  
% 0.45/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.14  
% 0.45/1.14  ------  iProver source info
% 0.45/1.14  
% 0.45/1.14  git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.14  git: non_committed_changes: false
% 0.45/1.14  
% 0.45/1.14  ------ Parsing...
% 0.45/1.14  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.45/1.14  
% 0.45/1.14  ------ Preprocessing... sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 0.45/1.14  
% 0.45/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.45/1.14  
% 0.45/1.14  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.45/1.14  ------ Proving...
% 0.45/1.14  ------ Problem Properties 
% 0.45/1.14  
% 0.45/1.14  
% 0.45/1.14  clauses                                 175
% 0.45/1.14  conjectures                             1
% 0.45/1.14  EPR                                     90
% 0.45/1.14  Horn                                    174
% 0.45/1.14  unary                                   112
% 0.45/1.14  binary                                  47
% 0.45/1.14  lits                                    255
% 0.45/1.14  lits eq                                 93
% 0.45/1.14  fd_pure                                 0
% 0.45/1.14  fd_pseudo                               0
% 0.45/1.14  fd_cond                                 1
% 0.45/1.14  fd_pseudo_cond                          0
% 0.45/1.14  AC symbols                              0
% 0.45/1.14  
% 0.45/1.14  ------ Schedule dynamic 5 is on 
% 0.45/1.14  
% 0.45/1.14  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.14  
% 0.45/1.14  
% 0.45/1.14  ------ 
% 0.45/1.14  Current options:
% 0.45/1.14  ------ 
% 0.45/1.14  
% 0.45/1.14  
% 0.45/1.14  
% 0.45/1.14  
% 0.45/1.14  ------ Proving...
% 0.45/1.14  
% 0.45/1.14  
% 0.45/1.14  % SZS status Theorem for theBenchmark.p
% 0.45/1.14  
% 0.45/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.14  
% 0.45/1.14  
%------------------------------------------------------------------------------