TSTP Solution File: HEN007-2 by iProver---3.8

View Problem - Process Solution

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

% Computer : n005.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 : Thu Aug 31 01:55:57 EDT 2023

% Result   : Unsatisfiable 0.48s 1.16s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   25 (  13 unt;   0 nHn;  20 RR)
%            Number of literals    :   42 (   8 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   40 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_52,plain,
    quotient(X0,zero,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divde_zero_is_x) ).

cnf(c_53,plain,
    ( ~ less_equal(X0,X1)
    | ~ less_equal(X1,X2)
    | less_equal(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_equal) ).

cnf(c_54,plain,
    ( ~ quotient(X0,X1,X2)
    | ~ quotient(X0,X3,X4)
    | ~ less_equal(X2,X3)
    | less_equal(X4,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xQyLEz_implies_xQzLEy) ).

cnf(c_55,plain,
    less_equal(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).

cnf(c_56,plain,
    quotient(z,y,zQy),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQy) ).

cnf(c_57,plain,
    quotient(z,x,zQx),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQx) ).

cnf(c_58,negated_conjecture,
    ~ less_equal(zQy,zQx),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zQyLEzQx) ).

cnf(c_61,plain,
    ( ~ quotient(X0,X1,X2)
    | less_equal(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).

cnf(c_78,plain,
    divide(X0,zero) = X0,
    inference(well_definedness,[status(thm)],[c_52]) ).

cnf(c_79,plain,
    ( divide(X0,X1) != X2
    | divide(X0,X3) != X4
    | ~ less_equal(X2,X3)
    | less_equal(X4,X1) ),
    inference(well_definedness,[status(thm)],[c_54]) ).

cnf(c_81,plain,
    divide(z,y) = zQy,
    inference(well_definedness,[status(thm)],[c_56]) ).

cnf(c_82,plain,
    divide(z,x) = zQx,
    inference(well_definedness,[status(thm)],[c_57]) ).

cnf(c_85,plain,
    ( divide(X0,X1) != X2
    | less_equal(X2,X0) ),
    inference(well_definedness,[status(thm)],[c_61]) ).

cnf(c_97,plain,
    ( less_equal(X2,X0)
    | divide(X0,X1) != X2 ),
    inference(prop_impl_just,[status(thm)],[c_85]) ).

cnf(c_98,plain,
    ( divide(X0,X1) != X2
    | less_equal(X2,X0) ),
    inference(renaming,[status(thm)],[c_97]) ).

cnf(c_209,plain,
    less_equal(divide(X0,X1),X0),
    inference(unflattening,[status(thm)],[c_98]) ).

cnf(c_229,plain,
    ( ~ less_equal(divide(X0,X1),X2)
    | less_equal(divide(X0,X2),X1) ),
    inference(unflattening,[status(thm)],[c_79]) ).

cnf(c_246,plain,
    ( ~ less_equal(divide(X0,X1),X2)
    | less_equal(divide(X0,X2),X1) ),
    inference(prop_impl_just,[status(thm)],[c_229]) ).

cnf(c_678,plain,
    less_equal(X0,X0),
    inference(superposition,[status(thm)],[c_78,c_209]) ).

cnf(c_697,plain,
    less_equal(divide(X0,divide(X0,X1)),X1),
    inference(superposition,[status(thm)],[c_678,c_246]) ).

cnf(c_904,plain,
    less_equal(divide(z,zQx),x),
    inference(superposition,[status(thm)],[c_82,c_697]) ).

cnf(c_959,plain,
    ( ~ less_equal(x,X0)
    | less_equal(divide(z,zQx),X0) ),
    inference(superposition,[status(thm)],[c_904,c_53]) ).

cnf(c_2064,plain,
    ( ~ less_equal(x,X0)
    | less_equal(divide(z,X0),zQx) ),
    inference(superposition,[status(thm)],[c_959,c_246]) ).

cnf(c_3235,plain,
    ( ~ less_equal(x,y)
    | less_equal(zQy,zQx) ),
    inference(superposition,[status(thm)],[c_81,c_2064]) ).

cnf(c_3241,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3235,c_58,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : HEN007-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n005.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Thu Aug 24 13:23:24 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.16  % SZS status Started for theBenchmark.p
% 0.48/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16  
% 0.48/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.16  
% 0.48/1.16  ------  iProver source info
% 0.48/1.16  
% 0.48/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.16  git: non_committed_changes: false
% 0.48/1.16  git: last_make_outside_of_git: false
% 0.48/1.16  
% 0.48/1.16  ------ Parsing...successful
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  ------ Preprocessing... sup_sim: 5  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 0.48/1.16  
% 0.48/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.48/1.16  
% 0.48/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.48/1.16  ------ Proving...
% 0.48/1.16  ------ Problem Properties 
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  clauses                                 17
% 0.48/1.16  conjectures                             1
% 0.48/1.16  EPR                                     6
% 0.48/1.16  Horn                                    17
% 0.48/1.16  unary                                   12
% 0.48/1.16  binary                                  3
% 0.48/1.16  lits                                    24
% 0.48/1.16  lits eq                                 9
% 0.48/1.16  fd_pure                                 0
% 0.48/1.16  fd_pseudo                               0
% 0.48/1.16  fd_cond                                 0
% 0.48/1.16  fd_pseudo_cond                          1
% 0.48/1.16  AC symbols                              0
% 0.48/1.16  
% 0.48/1.16  ------ Schedule dynamic 5 is on 
% 0.48/1.16  
% 0.48/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  ------ 
% 0.48/1.16  Current options:
% 0.48/1.16  ------ 
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  ------ Proving...
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16  
% 0.48/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17  
% 0.48/1.17  
%------------------------------------------------------------------------------