TSTP Solution File: HWV052-1.001.001 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : HWV052-1.001.001 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n015.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 02:26:44 EDT 2024

% Result   : Unsatisfiable 2.50s 1.14s
% Output   : CNFRefutation 2.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   27 (  15 unt;  11 nHn;  20 RR)
%            Number of literals    :   40 (  39 equ;   3 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( X0 = o
    | X0 = i ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_domain) ).

cnf(c_50,plain,
    inv(X0) != X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_inverse) ).

cnf(c_51,plain,
    unpack1(X0,pack1(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1) ).

cnf(c_52,plain,
    unpack1(inv(X0),pack1(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_01) ).

cnf(c_53,plain,
    unpack1(X0,inv(pack1(X0))) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_02) ).

cnf(c_118,plain,
    ( unpack1(X0,i) = X0
    | pack1(X0) = o ),
    inference(superposition,[status(thm)],[c_49,c_51]) ).

cnf(c_119,plain,
    ( X0 != i
    | inv(X0) = o ),
    inference(superposition,[status(thm)],[c_49,c_50]) ).

cnf(c_155,plain,
    inv(i) = o,
    inference(equality_resolution,[status(thm)],[c_119]) ).

cnf(c_160,plain,
    ( inv(X0) = o
    | X0 = o ),
    inference(superposition,[status(thm)],[c_49,c_155]) ).

cnf(c_161,plain,
    unpack1(o,pack1(i)) = i,
    inference(superposition,[status(thm)],[c_155,c_52]) ).

cnf(c_162,plain,
    o != i,
    inference(superposition,[status(thm)],[c_155,c_50]) ).

cnf(c_182,plain,
    ( unpack1(o,i) = i
    | pack1(i) = o ),
    inference(superposition,[status(thm)],[c_49,c_161]) ).

cnf(c_222,plain,
    ( unpack1(X0,o) = X0
    | pack1(X0) = o ),
    inference(superposition,[status(thm)],[c_160,c_53]) ).

cnf(c_232,plain,
    ( pack1(o) = o
    | pack1(i) = o
    | o = i ),
    inference(superposition,[status(thm)],[c_182,c_118]) ).

cnf(c_233,plain,
    ( pack1(o) = o
    | pack1(i) = o ),
    inference(forward_subsumption_resolution,[status(thm)],[c_232,c_162]) ).

cnf(c_258,plain,
    ( unpack1(o,o) = i
    | pack1(o) = o ),
    inference(superposition,[status(thm)],[c_233,c_161]) ).

cnf(c_290,plain,
    ( pack1(o) = o
    | o = i ),
    inference(superposition,[status(thm)],[c_222,c_258]) ).

cnf(c_292,plain,
    pack1(o) = o,
    inference(forward_subsumption_resolution,[status(thm)],[c_290,c_162]) ).

cnf(c_295,plain,
    unpack1(o,inv(o)) = o,
    inference(superposition,[status(thm)],[c_292,c_53]) ).

cnf(c_297,plain,
    unpack1(o,o) = o,
    inference(superposition,[status(thm)],[c_292,c_51]) ).

cnf(c_311,plain,
    ( unpack1(o,i) = o
    | inv(o) = o ),
    inference(superposition,[status(thm)],[c_49,c_295]) ).

cnf(c_313,plain,
    unpack1(o,i) = o,
    inference(forward_subsumption_resolution,[status(thm)],[c_311,c_50]) ).

cnf(c_314,plain,
    ( pack1(i) = o
    | o = i ),
    inference(demodulation,[status(thm)],[c_182,c_313]) ).

cnf(c_315,plain,
    pack1(i) = o,
    inference(forward_subsumption_resolution,[status(thm)],[c_314,c_162]) ).

cnf(c_316,plain,
    unpack1(o,o) = i,
    inference(demodulation,[status(thm)],[c_161,c_315]) ).

cnf(c_317,plain,
    o = i,
    inference(light_normalisation,[status(thm)],[c_316,c_297]) ).

cnf(c_318,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_317,c_162]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem  : HWV052-1.001.001 : TPTP v8.1.2. Released v4.1.0.
% 0.05/0.13  % Command  : run_iprover %s %d THM
% 0.11/0.33  % Computer : n015.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Fri May  3 01:11:06 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.50/1.14  % SZS status Started for theBenchmark.p
% 2.50/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 2.50/1.14  
% 2.50/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.50/1.14  
% 2.50/1.14  ------  iProver source info
% 2.50/1.14  
% 2.50/1.14  git: date: 2024-05-02 19:28:25 +0000
% 2.50/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.50/1.14  git: non_committed_changes: false
% 2.50/1.14  
% 2.50/1.14  ------ Parsing...successful
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.50/1.14  
% 2.50/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.50/1.14  
% 2.50/1.14  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.50/1.14  ------ Proving...
% 2.50/1.14  ------ Problem Properties 
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  clauses                                 5
% 2.50/1.14  conjectures                             0
% 2.50/1.14  EPR                                     1
% 2.50/1.14  Horn                                    4
% 2.50/1.14  unary                                   4
% 2.50/1.14  binary                                  1
% 2.50/1.14  lits                                    6
% 2.50/1.14  lits eq                                 6
% 2.50/1.14  fd_pure                                 1
% 2.50/1.14  fd_pseudo                               0
% 2.50/1.14  fd_cond                                 0
% 2.50/1.14  fd_pseudo_cond                          0
% 2.50/1.14  AC symbols                              0
% 2.50/1.14  
% 2.50/1.14  ------ Schedule dynamic 5 is on 
% 2.50/1.14  
% 2.50/1.14  ------ no conjectures: strip conj schedule 
% 2.50/1.14  
% 2.50/1.14  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  ------ 
% 2.50/1.14  Current options:
% 2.50/1.14  ------ 
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  ------ Proving...
% 2.50/1.14  
% 2.50/1.14  
% 2.50/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 2.50/1.14  
% 2.50/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.14  
% 2.50/1.14  
%------------------------------------------------------------------------------