TSTP Solution File: HEN004-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : HEN004-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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.79s 1.17s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 17 RR)
% Number of literals : 55 ( 22 equ; 25 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
quotient(zero,X0,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(c_51,plain,
quotient(X0,X0,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(c_52,negated_conjecture,
~ quotient(x,zero,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_x_divde_zero_is_x) ).
cnf(c_54,plain,
( ~ quotient(X0,X1,zero)
| less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(c_55,plain,
( ~ quotient(X0,X1,X2)
| less_equal(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(c_56,plain,
( ~ quotient(X0,X1,X2)
| ~ quotient(X0,X3,X4)
| ~ quotient(X1,X3,X5)
| ~ quotient(X2,X3,X6)
| ~ quotient(X4,X5,X7)
| less_equal(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(c_57,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(c_58,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(c_70,plain,
divide(zero,X0) = zero,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_71,plain,
divide(X0,X0) = zero,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_72,plain,
divide(x,zero) != x,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_74,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(well_definedness,[status(thm)],[c_54]) ).
cnf(c_75,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_77,plain,
( divide(X0,X1) != X2
| divide(X0,X3) != X4
| divide(X1,X3) != X5
| divide(X2,X3) != X6
| divide(X4,X5) != X7
| less_equal(X7,X6) ),
inference(well_definedness,[status(thm)],[c_56]) ).
cnf(c_87,plain,
( less_equal(X2,X0)
| divide(X0,X1) != X2 ),
inference(prop_impl_just,[status(thm)],[c_75]) ).
cnf(c_88,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(renaming,[status(thm)],[c_87]) ).
cnf(c_169,plain,
less_equal(divide(X0,X1),X0),
inference(unflattening,[status(thm)],[c_88]) ).
cnf(c_183,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(unflattening,[status(thm)],[c_77]) ).
cnf(c_191,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(prop_impl_just,[status(thm)],[c_74]) ).
cnf(c_192,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(renaming,[status(thm)],[c_191]) ).
cnf(c_450,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_57,c_58]) ).
cnf(c_452,plain,
( ~ less_equal(X0,divide(X0,X1))
| divide(X0,X1) = X0 ),
inference(superposition,[status(thm)],[c_169,c_58]) ).
cnf(c_503,plain,
less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
inference(superposition,[status(thm)],[c_70,c_183]) ).
cnf(c_555,plain,
less_equal(divide(divide(X0,divide(X0,zero)),zero),zero),
inference(superposition,[status(thm)],[c_71,c_503]) ).
cnf(c_588,plain,
divide(divide(X0,divide(X0,zero)),zero) = zero,
inference(superposition,[status(thm)],[c_555,c_450]) ).
cnf(c_1063,plain,
( ~ less_equal(divide(X0,divide(X0,zero)),zero)
| divide(divide(X0,divide(X0,zero)),zero) = divide(X0,divide(X0,zero)) ),
inference(superposition,[status(thm)],[c_588,c_452]) ).
cnf(c_1065,plain,
less_equal(divide(X0,divide(X0,zero)),zero),
inference(superposition,[status(thm)],[c_588,c_192]) ).
cnf(c_1083,plain,
divide(divide(X0,divide(X0,zero)),zero) = divide(X0,divide(X0,zero)),
inference(forward_subsumption_resolution,[status(thm)],[c_1063,c_1065]) ).
cnf(c_1084,plain,
divide(X0,divide(X0,zero)) = zero,
inference(light_normalisation,[status(thm)],[c_1083,c_588]) ).
cnf(c_1153,plain,
less_equal(X0,divide(X0,zero)),
inference(superposition,[status(thm)],[c_1084,c_192]) ).
cnf(c_1260,plain,
divide(X0,zero) = X0,
inference(superposition,[status(thm)],[c_1153,c_452]) ).
cnf(c_1262,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_72,c_1260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN004-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n017.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 18:10:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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
% 3.79/1.17 % SZS status Started for theBenchmark.p
% 3.79/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.79/1.17
% 3.79/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.79/1.17
% 3.79/1.17 ------ iProver source info
% 3.79/1.17
% 3.79/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.79/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.79/1.17 git: non_committed_changes: false
% 3.79/1.17
% 3.79/1.17 ------ Parsing...successful
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 ------ Preprocessing... sup_sim: 4 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
% 3.79/1.17
% 3.79/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.79/1.17
% 3.79/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.79/1.17 ------ Proving...
% 3.79/1.17 ------ Problem Properties
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 clauses 11
% 3.79/1.17 conjectures 0
% 3.79/1.17 EPR 3
% 3.79/1.17 Horn 11
% 3.79/1.17 unary 8
% 3.79/1.17 binary 2
% 3.79/1.17 lits 15
% 3.79/1.17 lits eq 7
% 3.79/1.17 fd_pure 0
% 3.79/1.17 fd_pseudo 0
% 3.79/1.17 fd_cond 0
% 3.79/1.17 fd_pseudo_cond 1
% 3.79/1.17 AC symbols 0
% 3.79/1.17
% 3.79/1.17 ------ Schedule dynamic 5 is on
% 3.79/1.17
% 3.79/1.17 ------ no conjectures: strip conj schedule
% 3.79/1.17
% 3.79/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 ------
% 3.79/1.17 Current options:
% 3.79/1.17 ------
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 ------ Proving...
% 3.79/1.17
% 3.79/1.17
% 3.79/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.79/1.17
% 3.79/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.79/1.17
% 3.79/1.17
%------------------------------------------------------------------------------