TSTP Solution File: HEN007-6 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : HEN007-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 4.09s 1.21s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 30 unt; 0 nHn; 35 RR)
% Number of literals : 76 ( 24 equ; 30 neg)
% Maximal clause size : 6 ( 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 : 66 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
quotient(zero,X0,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
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,
less_equal(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).
cnf(c_55,plain,
quotient(z,y,zQy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQy) ).
cnf(c_56,plain,
quotient(z,x,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQx) ).
cnf(c_57,negated_conjecture,
~ less_equal(zQy,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zQyLEzQx) ).
cnf(c_58,plain,
( ~ less_equal(X0,X1)
| quotient(X0,X1,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(c_59,plain,
( ~ quotient(X0,X1,zero)
| less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(c_60,plain,
( ~ quotient(X0,X1,X2)
| less_equal(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(c_61,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_62,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(c_63,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_75,plain,
divide(zero,X0) = zero,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_77,plain,
divide(X0,zero) = X0,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_78,plain,
divide(z,y) = zQy,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_79,plain,
divide(z,x) = zQx,
inference(well_definedness,[status(thm)],[c_56]) ).
cnf(c_80,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
inference(well_definedness,[status(thm)],[c_58]) ).
cnf(c_81,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(well_definedness,[status(thm)],[c_59]) ).
cnf(c_82,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(well_definedness,[status(thm)],[c_60]) ).
cnf(c_84,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_61]) ).
cnf(c_94,plain,
( less_equal(X2,X0)
| divide(X0,X1) != X2 ),
inference(prop_impl_just,[status(thm)],[c_82]) ).
cnf(c_95,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(renaming,[status(thm)],[c_94]) ).
cnf(c_196,plain,
less_equal(divide(X0,X1),X0),
inference(unflattening,[status(thm)],[c_95]) ).
cnf(c_216,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(unflattening,[status(thm)],[c_84]) ).
cnf(c_224,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(prop_impl_just,[status(thm)],[c_81]) ).
cnf(c_225,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(renaming,[status(thm)],[c_224]) ).
cnf(c_226,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
inference(prop_impl_just,[status(thm)],[c_80]) ).
cnf(c_317,negated_conjecture,
~ less_equal(zQy,zQx),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_559,plain,
divide(x,y) = zero,
inference(superposition,[status(thm)],[c_54,c_226]) ).
cnf(c_594,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_62,c_63]) ).
cnf(c_629,plain,
less_equal(divide(zQy,divide(X0,y)),divide(divide(z,X0),y)),
inference(superposition,[status(thm)],[c_78,c_216]) ).
cnf(c_656,plain,
less_equal(zQx,z),
inference(superposition,[status(thm)],[c_79,c_196]) ).
cnf(c_664,plain,
divide(zQx,z) = zero,
inference(superposition,[status(thm)],[c_656,c_226]) ).
cnf(c_699,plain,
less_equal(divide(divide(zQx,X0),divide(z,X0)),divide(zero,X0)),
inference(superposition,[status(thm)],[c_664,c_216]) ).
cnf(c_700,plain,
less_equal(divide(divide(zQx,X0),divide(z,X0)),zero),
inference(light_normalisation,[status(thm)],[c_699,c_75]) ).
cnf(c_853,plain,
( ~ less_equal(zero,X0)
| less_equal(divide(divide(zQx,X1),divide(z,X1)),X0) ),
inference(superposition,[status(thm)],[c_700,c_53]) ).
cnf(c_857,plain,
less_equal(divide(divide(zQx,X0),divide(z,X0)),X1),
inference(forward_subsumption_resolution,[status(thm)],[c_853,c_62]) ).
cnf(c_1017,plain,
less_equal(divide(divide(zQx,y),zQy),X0),
inference(superposition,[status(thm)],[c_78,c_857]) ).
cnf(c_1350,plain,
divide(divide(zQx,y),zQy) = zero,
inference(superposition,[status(thm)],[c_1017,c_594]) ).
cnf(c_1716,plain,
less_equal(divide(zQx,y),zQy),
inference(superposition,[status(thm)],[c_1350,c_225]) ).
cnf(c_2767,plain,
less_equal(divide(zQy,divide(x,y)),divide(zQx,y)),
inference(superposition,[status(thm)],[c_79,c_629]) ).
cnf(c_2772,plain,
less_equal(divide(zQy,zero),divide(zQx,y)),
inference(light_normalisation,[status(thm)],[c_2767,c_559]) ).
cnf(c_2905,plain,
less_equal(zQy,divide(zQx,y)),
inference(demodulation,[status(thm)],[c_2772,c_77]) ).
cnf(c_2907,plain,
( ~ less_equal(divide(zQx,y),zQy)
| divide(zQx,y) = zQy ),
inference(superposition,[status(thm)],[c_2905,c_63]) ).
cnf(c_2912,plain,
divide(zQx,y) = zQy,
inference(forward_subsumption_resolution,[status(thm)],[c_2907,c_1716]) ).
cnf(c_2924,plain,
less_equal(zQy,zQx),
inference(superposition,[status(thm)],[c_2912,c_196]) ).
cnf(c_2935,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2924,c_317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HEN007-6 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n002.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:58:42 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 4.09/1.21 % SZS status Started for theBenchmark.p
% 4.09/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.09/1.21
% 4.09/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.09/1.21
% 4.09/1.21 ------ iProver source info
% 4.09/1.21
% 4.09/1.21 git: date: 2024-05-02 19:28:25 +0000
% 4.09/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.09/1.21 git: non_committed_changes: false
% 4.09/1.21
% 4.09/1.21 ------ Parsing...successful
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21 ------ 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
% 4.09/1.21
% 4.09/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.09/1.21
% 4.09/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.09/1.21 ------ Proving...
% 4.09/1.21 ------ Problem Properties
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21 clauses 16
% 4.09/1.21 conjectures 1
% 4.09/1.21 EPR 6
% 4.09/1.21 Horn 16
% 4.09/1.21 unary 12
% 4.09/1.21 binary 2
% 4.09/1.21 lits 22
% 4.09/1.21 lits eq 9
% 4.09/1.21 fd_pure 0
% 4.09/1.21 fd_pseudo 0
% 4.09/1.21 fd_cond 0
% 4.09/1.21 fd_pseudo_cond 1
% 4.09/1.21 AC symbols 0
% 4.09/1.21
% 4.09/1.21 ------ Schedule dynamic 5 is on
% 4.09/1.21
% 4.09/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21 ------
% 4.09/1.21 Current options:
% 4.09/1.21 ------
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21 ------ Proving...
% 4.09/1.21
% 4.09/1.21
% 4.09/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.09/1.21
% 4.09/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.09/1.21
% 4.09/1.21
%------------------------------------------------------------------------------