TSTP Solution File: HEN004-6 by iProver---3.9

View Problem - Process Solution

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

% Computer : n018.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:17 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_50,plain,
    divide(zero,X0) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).

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

cnf(c_52,plain,
    ( ~ less_equal(X0,X1)
    | divide(X0,X1) = zero ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).

cnf(c_53,plain,
    ( divide(X0,X1) != zero
    | less_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).

cnf(c_54,plain,
    less_equal(divide(X0,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).

cnf(c_55,plain,
    less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).

cnf(c_56,plain,
    less_equal(zero,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).

cnf(c_57,plain,
    ( ~ less_equal(X0,X1)
    | ~ less_equal(X1,X0)
    | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).

cnf(c_130,plain,
    divide(a,zero) = sP0_iProver_def,
    definition ).

cnf(c_131,negated_conjecture,
    sP0_iProver_def != a,
    inference(demodulation,[status(thm)],[c_51,c_130]) ).

cnf(c_305,plain,
    less_equal(sP0_iProver_def,a),
    inference(superposition,[status(thm)],[c_130,c_54]) ).

cnf(c_311,plain,
    divide(sP0_iProver_def,a) = zero,
    inference(superposition,[status(thm)],[c_305,c_52]) ).

cnf(c_329,plain,
    ( ~ less_equal(X0,zero)
    | X0 = zero ),
    inference(superposition,[status(thm)],[c_56,c_57]) ).

cnf(c_350,plain,
    less_equal(divide(divide(a,X0),divide(zero,X0)),divide(sP0_iProver_def,X0)),
    inference(superposition,[status(thm)],[c_130,c_55]) ).

cnf(c_355,plain,
    less_equal(divide(divide(a,X0),zero),divide(sP0_iProver_def,X0)),
    inference(light_normalisation,[status(thm)],[c_350,c_50]) ).

cnf(c_371,plain,
    ( ~ less_equal(a,sP0_iProver_def)
    | ~ less_equal(sP0_iProver_def,a)
    | sP0_iProver_def = a ),
    inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_383,plain,
    ( divide(a,sP0_iProver_def) != zero
    | less_equal(a,sP0_iProver_def) ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_432,plain,
    less_equal(divide(divide(a,a),zero),zero),
    inference(superposition,[status(thm)],[c_311,c_355]) ).

cnf(c_451,plain,
    divide(divide(a,a),zero) = zero,
    inference(superposition,[status(thm)],[c_432,c_329]) ).

cnf(c_459,plain,
    less_equal(divide(divide(a,zero),divide(a,zero)),zero),
    inference(superposition,[status(thm)],[c_451,c_55]) ).

cnf(c_462,plain,
    less_equal(divide(sP0_iProver_def,sP0_iProver_def),zero),
    inference(light_normalisation,[status(thm)],[c_459,c_130]) ).

cnf(c_611,plain,
    divide(sP0_iProver_def,sP0_iProver_def) = zero,
    inference(superposition,[status(thm)],[c_462,c_329]) ).

cnf(c_651,plain,
    less_equal(divide(divide(a,sP0_iProver_def),zero),zero),
    inference(superposition,[status(thm)],[c_611,c_355]) ).

cnf(c_699,plain,
    divide(divide(a,sP0_iProver_def),zero) = zero,
    inference(superposition,[status(thm)],[c_651,c_329]) ).

cnf(c_704,plain,
    less_equal(divide(a,sP0_iProver_def),zero),
    inference(superposition,[status(thm)],[c_699,c_53]) ).

cnf(c_732,plain,
    divide(a,sP0_iProver_def) = zero,
    inference(superposition,[status(thm)],[c_704,c_329]) ).

cnf(c_735,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_732,c_383,c_371,c_305,c_131]) ).


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