TSTP Solution File: HEN007-5 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : HEN007-5 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n009.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:25:20 EDT 2024

% Result   : Unsatisfiable 0.51s 1.18s
% Output   : CNFRefutation 0.51s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( divide(X0,X1) != zero
    | divide(X1,X2) != zero
    | divide(X0,X2) = zero ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_divide_to_zero) ).

cnf(c_50,plain,
    divide(a,b) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_divide_b_is_zero) ).

cnf(c_51,negated_conjecture,
    divide(divide(c,b),divide(c,a)) != zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_property_of_divide2) ).

cnf(c_52,plain,
    divide(divide(X0,X1),X0) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',quotient_smaller_than_numerator) ).

cnf(c_53,plain,
    divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',quotient_property) ).

cnf(c_54,plain,
    divide(zero,X0) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).

cnf(c_55,plain,
    ( divide(X0,X1) != zero
    | divide(X1,X0) != zero
    | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).

cnf(c_98,plain,
    divide(c,b) = sP0_iProver_def,
    definition ).

cnf(c_99,plain,
    divide(c,a) = sP1_iProver_def,
    definition ).

cnf(c_100,plain,
    divide(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
    definition ).

cnf(c_101,negated_conjecture,
    sP2_iProver_def != zero,
    inference(demodulation,[status(thm)],[c_51,c_99,c_98,c_100]) ).

cnf(c_102,plain,
    X0 = X0,
    theory(equality) ).

cnf(c_103,plain,
    ( X0 != X1
    | X2 != X1
    | X2 = X0 ),
    theory(equality) ).

cnf(c_153,plain,
    divide(sP1_iProver_def,c) = zero,
    inference(superposition,[status(thm)],[c_99,c_52]) ).

cnf(c_157,plain,
    divide(sP2_iProver_def,sP0_iProver_def) = zero,
    inference(superposition,[status(thm)],[c_100,c_52]) ).

cnf(c_162,plain,
    divide(divide(sP0_iProver_def,divide(X0,b)),divide(divide(c,X0),b)) = zero,
    inference(superposition,[status(thm)],[c_98,c_53]) ).

cnf(c_175,plain,
    divide(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)) = zero,
    inference(superposition,[status(thm)],[c_54,c_53]) ).

cnf(c_179,plain,
    divide(divide(divide(X0,X0),divide(X1,X0)),zero) = zero,
    inference(superposition,[status(thm)],[c_52,c_53]) ).

cnf(c_234,plain,
    ( zero != X0
    | sP2_iProver_def != X0
    | sP2_iProver_def = zero ),
    inference(instantiation,[status(thm)],[c_103]) ).

cnf(c_240,plain,
    ( zero != sP2_iProver_def
    | sP2_iProver_def != sP2_iProver_def
    | sP2_iProver_def = zero ),
    inference(instantiation,[status(thm)],[c_234]) ).

cnf(c_241,plain,
    sP2_iProver_def = sP2_iProver_def,
    inference(instantiation,[status(thm)],[c_102]) ).

cnf(c_254,plain,
    ( divide(X0,zero) != zero
    | X0 = zero ),
    inference(superposition,[status(thm)],[c_54,c_55]) ).

cnf(c_349,plain,
    divide(divide(divide(sP1_iProver_def,X0),divide(c,X0)),divide(zero,X0)) = zero,
    inference(superposition,[status(thm)],[c_153,c_53]) ).

cnf(c_355,plain,
    divide(divide(divide(sP1_iProver_def,X0),divide(c,X0)),zero) = zero,
    inference(light_normalisation,[status(thm)],[c_349,c_54]) ).

cnf(c_414,plain,
    ( divide(sP0_iProver_def,X0) != zero
    | divide(sP2_iProver_def,X0) = zero ),
    inference(superposition,[status(thm)],[c_157,c_49]) ).

cnf(c_470,plain,
    ( divide(zero,X0) != zero
    | divide(divide(divide(X1,X1),divide(X2,X1)),X0) = zero ),
    inference(superposition,[status(thm)],[c_179,c_49]) ).

cnf(c_480,plain,
    divide(divide(divide(X0,X0),divide(X1,X0)),X2) = zero,
    inference(forward_subsumption_resolution,[status(thm)],[c_470,c_54]) ).

cnf(c_513,plain,
    ( divide(zero,X0) != zero
    | divide(divide(divide(sP1_iProver_def,X1),divide(c,X1)),X0) = zero ),
    inference(superposition,[status(thm)],[c_355,c_49]) ).

cnf(c_521,plain,
    divide(divide(divide(sP1_iProver_def,X0),divide(c,X0)),X1) = zero,
    inference(forward_subsumption_resolution,[status(thm)],[c_513,c_54]) ).

cnf(c_560,plain,
    divide(divide(divide(X0,X0),zero),X1) = zero,
    inference(superposition,[status(thm)],[c_480,c_480]) ).

cnf(c_725,plain,
    divide(divide(X0,X0),zero) = zero,
    inference(superposition,[status(thm)],[c_560,c_254]) ).

cnf(c_738,plain,
    ( divide(zero,X0) != zero
    | divide(divide(X1,X1),X0) = zero ),
    inference(superposition,[status(thm)],[c_725,c_49]) ).

cnf(c_746,plain,
    divide(divide(X0,X0),X1) = zero,
    inference(forward_subsumption_resolution,[status(thm)],[c_738,c_54]) ).

cnf(c_758,plain,
    divide(X0,X0) = zero,
    inference(superposition,[status(thm)],[c_746,c_254]) ).

cnf(c_790,plain,
    divide(divide(sP0_iProver_def,divide(a,b)),divide(sP1_iProver_def,b)) = zero,
    inference(superposition,[status(thm)],[c_99,c_162]) ).

cnf(c_801,plain,
    divide(divide(sP0_iProver_def,zero),divide(sP1_iProver_def,b)) = zero,
    inference(light_normalisation,[status(thm)],[c_790,c_50]) ).

cnf(c_1297,plain,
    divide(divide(divide(sP1_iProver_def,b),sP0_iProver_def),X0) = zero,
    inference(superposition,[status(thm)],[c_98,c_521]) ).

cnf(c_1377,plain,
    divide(divide(sP1_iProver_def,b),sP0_iProver_def) = zero,
    inference(superposition,[status(thm)],[c_1297,c_254]) ).

cnf(c_3096,plain,
    ( zero != sP2_iProver_def
    | divide(sP2_iProver_def,sP1_iProver_def) = zero ),
    inference(superposition,[status(thm)],[c_100,c_414]) ).

cnf(c_3102,plain,
    zero != sP2_iProver_def,
    inference(global_subsumption_just,[status(thm)],[c_3096,c_101,c_240,c_241]) ).

cnf(c_3179,plain,
    divide(divide(divide(X0,divide(X0,zero)),zero),zero) = zero,
    inference(superposition,[status(thm)],[c_758,c_175]) ).

cnf(c_4433,plain,
    ( divide(zero,X0) != zero
    | divide(divide(divide(X1,divide(X1,zero)),zero),X0) = zero ),
    inference(superposition,[status(thm)],[c_3179,c_49]) ).

cnf(c_4447,plain,
    divide(divide(divide(X0,divide(X0,zero)),zero),X1) = zero,
    inference(forward_subsumption_resolution,[status(thm)],[c_4433,c_54]) ).

cnf(c_4693,plain,
    divide(divide(X0,divide(X0,zero)),zero) = zero,
    inference(superposition,[status(thm)],[c_4447,c_254]) ).

cnf(c_5004,plain,
    ( divide(zero,X0) != zero
    | divide(divide(X1,divide(X1,zero)),X0) = zero ),
    inference(superposition,[status(thm)],[c_4693,c_49]) ).

cnf(c_5018,plain,
    divide(divide(X0,divide(X0,zero)),X1) = zero,
    inference(forward_subsumption_resolution,[status(thm)],[c_5004,c_54]) ).

cnf(c_5088,plain,
    divide(X0,divide(X0,zero)) = zero,
    inference(superposition,[status(thm)],[c_5018,c_254]) ).

cnf(c_5233,plain,
    ( divide(divide(X0,zero),X0) != zero
    | divide(X0,zero) = X0 ),
    inference(superposition,[status(thm)],[c_5088,c_55]) ).

cnf(c_5265,plain,
    divide(X0,zero) = X0,
    inference(forward_subsumption_resolution,[status(thm)],[c_5233,c_52]) ).

cnf(c_5276,plain,
    divide(sP0_iProver_def,divide(sP1_iProver_def,b)) = zero,
    inference(demodulation,[status(thm)],[c_801,c_5265]) ).

cnf(c_5465,plain,
    ( divide(divide(sP1_iProver_def,b),sP0_iProver_def) != zero
    | divide(sP1_iProver_def,b) = sP0_iProver_def ),
    inference(superposition,[status(thm)],[c_5276,c_55]) ).

cnf(c_5476,plain,
    divide(sP1_iProver_def,b) = sP0_iProver_def,
    inference(forward_subsumption_resolution,[status(thm)],[c_5465,c_1377]) ).

cnf(c_5518,plain,
    divide(sP0_iProver_def,sP1_iProver_def) = zero,
    inference(superposition,[status(thm)],[c_5476,c_52]) ).

cnf(c_5524,plain,
    zero = sP2_iProver_def,
    inference(light_normalisation,[status(thm)],[c_5518,c_100]) ).

cnf(c_5525,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5524,c_3102]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : HEN007-5 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  2 18:35:40 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  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.51/1.18  % SZS status Started for theBenchmark.p
% 0.51/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 0.51/1.18  
% 0.51/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.51/1.18  
% 0.51/1.18  ------  iProver source info
% 0.51/1.18  
% 0.51/1.18  git: date: 2024-05-02 19:28:25 +0000
% 0.51/1.18  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.51/1.18  git: non_committed_changes: false
% 0.51/1.18  
% 0.51/1.18  ------ Parsing...successful
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.51/1.18  
% 0.51/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.51/1.18  
% 0.51/1.18  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.51/1.18  ------ Proving...
% 0.51/1.18  ------ Problem Properties 
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  clauses                                 11
% 0.51/1.18  conjectures                             1
% 0.51/1.18  EPR                                     1
% 0.51/1.18  Horn                                    11
% 0.51/1.18  unary                                   9
% 0.51/1.18  binary                                  0
% 0.51/1.18  lits                                    15
% 0.51/1.18  lits eq                                 15
% 0.51/1.18  fd_pure                                 0
% 0.51/1.18  fd_pseudo                               0
% 0.51/1.18  fd_cond                                 0
% 0.51/1.18  fd_pseudo_cond                          1
% 0.51/1.18  AC symbols                              0
% 0.51/1.18  
% 0.51/1.18  ------ Schedule dynamic 5 is on 
% 0.51/1.18  
% 0.51/1.18  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  ------ 
% 0.51/1.18  Current options:
% 0.51/1.18  ------ 
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  ------ Proving...
% 0.51/1.18  
% 0.51/1.18  
% 0.51/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 0.51/1.18  
% 0.51/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/1.18  
% 0.90/1.19  
%------------------------------------------------------------------------------