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

View Problem - Process Solution

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

% Computer : n016.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 3.25s 1.20s
% Output   : CNFRefutation 3.25s
% 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,plain,
    divide(X0,X0) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).

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

cnf(c_54,plain,
    ( ~ less_equal(divide(X0,X1),X2)
    | less_equal(divide(X0,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).

cnf(c_55,plain,
    less_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).

cnf(c_56,negated_conjecture,
    ~ less_equal(divide(c,b),divide(c,a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_divide_b_LE_c_divide_a) ).

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

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

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

cnf(c_60,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_61,plain,
    less_equal(zero,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).

cnf(c_62,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_172,plain,
    divide(c,b) = sP0_iProver_def,
    definition ).

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

cnf(c_174,negated_conjecture,
    ~ less_equal(sP0_iProver_def,sP1_iProver_def),
    inference(demodulation,[status(thm)],[c_56,c_173,c_172]) ).

cnf(c_409,plain,
    less_equal(sP1_iProver_def,c),
    inference(superposition,[status(thm)],[c_173,c_59]) ).

cnf(c_412,plain,
    divide(a,b) = zero,
    inference(superposition,[status(thm)],[c_55,c_57]) ).

cnf(c_423,plain,
    less_equal(X0,X0),
    inference(superposition,[status(thm)],[c_51,c_58]) ).

cnf(c_435,plain,
    divide(sP1_iProver_def,c) = zero,
    inference(superposition,[status(thm)],[c_409,c_57]) ).

cnf(c_506,plain,
    less_equal(divide(X0,divide(X0,X1)),X1),
    inference(superposition,[status(thm)],[c_423,c_54]) ).

cnf(c_551,plain,
    ( ~ less_equal(X0,zero)
    | X0 = zero ),
    inference(superposition,[status(thm)],[c_61,c_62]) ).

cnf(c_590,plain,
    less_equal(divide(sP0_iProver_def,divide(X0,b)),divide(divide(c,X0),b)),
    inference(superposition,[status(thm)],[c_172,c_60]) ).

cnf(c_618,plain,
    less_equal(divide(divide(sP1_iProver_def,X0),divide(c,X0)),divide(zero,X0)),
    inference(superposition,[status(thm)],[c_435,c_60]) ).

cnf(c_630,plain,
    less_equal(divide(divide(sP1_iProver_def,X0),divide(c,X0)),zero),
    inference(light_normalisation,[status(thm)],[c_618,c_50]) ).

cnf(c_958,plain,
    divide(X0,divide(X0,zero)) = zero,
    inference(superposition,[status(thm)],[c_506,c_551]) ).

cnf(c_1460,plain,
    less_equal(X0,divide(X0,zero)),
    inference(superposition,[status(thm)],[c_958,c_58]) ).

cnf(c_1573,plain,
    ( ~ less_equal(divide(X0,zero),X0)
    | divide(X0,zero) = X0 ),
    inference(superposition,[status(thm)],[c_1460,c_62]) ).

cnf(c_1585,plain,
    divide(X0,zero) = X0,
    inference(forward_subsumption_resolution,[status(thm)],[c_1573,c_59]) ).

cnf(c_1825,plain,
    ( ~ less_equal(zero,X0)
    | less_equal(divide(divide(sP1_iProver_def,X1),divide(c,X1)),X0) ),
    inference(superposition,[status(thm)],[c_630,c_53]) ).

cnf(c_1832,plain,
    less_equal(divide(divide(sP1_iProver_def,X0),divide(c,X0)),X1),
    inference(forward_subsumption_resolution,[status(thm)],[c_1825,c_61]) ).

cnf(c_2229,plain,
    less_equal(divide(divide(sP1_iProver_def,b),sP0_iProver_def),X0),
    inference(superposition,[status(thm)],[c_172,c_1832]) ).

cnf(c_2264,plain,
    less_equal(divide(divide(sP1_iProver_def,b),X0),sP0_iProver_def),
    inference(superposition,[status(thm)],[c_2229,c_54]) ).

cnf(c_2285,plain,
    less_equal(divide(sP0_iProver_def,divide(a,b)),divide(sP1_iProver_def,b)),
    inference(superposition,[status(thm)],[c_173,c_590]) ).

cnf(c_2292,plain,
    less_equal(divide(sP0_iProver_def,zero),divide(sP1_iProver_def,b)),
    inference(light_normalisation,[status(thm)],[c_2285,c_412]) ).

cnf(c_2342,plain,
    less_equal(divide(sP1_iProver_def,b),sP0_iProver_def),
    inference(superposition,[status(thm)],[c_1585,c_2264]) ).

cnf(c_2363,plain,
    less_equal(sP0_iProver_def,divide(sP1_iProver_def,b)),
    inference(demodulation,[status(thm)],[c_2292,c_1585]) ).

cnf(c_2428,plain,
    ( ~ less_equal(sP0_iProver_def,divide(sP1_iProver_def,b))
    | divide(sP1_iProver_def,b) = sP0_iProver_def ),
    inference(superposition,[status(thm)],[c_2342,c_62]) ).

cnf(c_2434,plain,
    divide(sP1_iProver_def,b) = sP0_iProver_def,
    inference(forward_subsumption_resolution,[status(thm)],[c_2428,c_2363]) ).

cnf(c_2455,plain,
    less_equal(sP0_iProver_def,sP1_iProver_def),
    inference(superposition,[status(thm)],[c_2434,c_59]) ).

cnf(c_2464,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2455,c_174]) ).


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