TSTP Solution File: HEN003-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HEN003-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:52 EDT 2023
% Result : Unsatisfiable 3.22s 1.07s
% Output : CNFRefutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 15 unt; 0 nHn; 20 RR)
% Number of literals : 58 ( 23 equ; 28 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
quotient(zero,X0,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(c_51,negated_conjecture,
~ quotient(x,x,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
cnf(c_52,plain,
( ~ less_equal(X0,X1)
| quotient(X0,X1,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(c_53,plain,
( ~ quotient(X0,X1,zero)
| less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(c_54,plain,
( ~ quotient(X0,X1,X2)
| less_equal(X2,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(c_55,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/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(c_56,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-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/HEN001-0.ax',less_equal_and_equal) ).
cnf(c_69,plain,
divide(zero,X0) = zero,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_70,plain,
divide(x,x) != zero,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_71,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_72,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_73,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(well_definedness,[status(thm)],[c_54]) ).
cnf(c_75,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_55]) ).
cnf(c_85,plain,
( less_equal(X2,X0)
| divide(X0,X1) != X2 ),
inference(prop_impl_just,[status(thm)],[c_73]) ).
cnf(c_86,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(renaming,[status(thm)],[c_85]) ).
cnf(c_164,plain,
less_equal(divide(X0,X1),X0),
inference(unflattening,[status(thm)],[c_86]) ).
cnf(c_178,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(unflattening,[status(thm)],[c_75]) ).
cnf(c_186,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(prop_impl_just,[status(thm)],[c_72]) ).
cnf(c_187,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(renaming,[status(thm)],[c_186]) ).
cnf(c_188,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
inference(prop_impl_just,[status(thm)],[c_71]) ).
cnf(c_426,plain,
divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_164,c_188]) ).
cnf(c_440,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_56,c_57]) ).
cnf(c_442,plain,
( ~ less_equal(X0,divide(X0,X1))
| divide(X0,X1) = X0 ),
inference(superposition,[status(thm)],[c_164,c_57]) ).
cnf(c_481,plain,
less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_426,c_178]) ).
cnf(c_511,plain,
less_equal(divide(divide(X0,X0),zero),zero),
inference(superposition,[status(thm)],[c_69,c_481]) ).
cnf(c_527,plain,
divide(divide(X0,X0),zero) = zero,
inference(superposition,[status(thm)],[c_511,c_440]) ).
cnf(c_533,plain,
( ~ less_equal(divide(X0,X0),zero)
| divide(divide(X0,X0),zero) = divide(X0,X0) ),
inference(superposition,[status(thm)],[c_527,c_442]) ).
cnf(c_535,plain,
less_equal(divide(X0,X0),zero),
inference(superposition,[status(thm)],[c_527,c_187]) ).
cnf(c_540,plain,
divide(divide(X0,X0),zero) = divide(X0,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_533,c_535]) ).
cnf(c_541,plain,
divide(X0,X0) = zero,
inference(light_normalisation,[status(thm)],[c_540,c_527]) ).
cnf(c_542,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_70,c_541]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN003-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 13:28:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.45 Running first-order theorem proving
% 0.20/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.22/1.07 % SZS status Started for theBenchmark.p
% 3.22/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 3.22/1.07
% 3.22/1.07 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.22/1.07
% 3.22/1.07 ------ iProver source info
% 3.22/1.07
% 3.22/1.07 git: date: 2023-05-31 18:12:56 +0000
% 3.22/1.07 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.22/1.07 git: non_committed_changes: false
% 3.22/1.07 git: last_make_outside_of_git: false
% 3.22/1.07
% 3.22/1.07 ------ Parsing...successful
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07 ------ 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.22/1.07
% 3.22/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.22/1.07
% 3.22/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.22/1.07 ------ Proving...
% 3.22/1.07 ------ Problem Properties
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07 clauses 10
% 3.22/1.07 conjectures 0
% 3.22/1.07 EPR 3
% 3.22/1.07 Horn 10
% 3.22/1.07 unary 7
% 3.22/1.07 binary 2
% 3.22/1.07 lits 14
% 3.22/1.07 lits eq 6
% 3.22/1.07 fd_pure 0
% 3.22/1.07 fd_pseudo 0
% 3.22/1.07 fd_cond 0
% 3.22/1.07 fd_pseudo_cond 1
% 3.22/1.07 AC symbols 0
% 3.22/1.07
% 3.22/1.07 ------ Schedule dynamic 5 is on
% 3.22/1.07
% 3.22/1.07 ------ no conjectures: strip conj schedule
% 3.22/1.07
% 3.22/1.07 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07 ------
% 3.22/1.07 Current options:
% 3.22/1.07 ------
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07 ------ Proving...
% 3.22/1.07
% 3.22/1.07
% 3.22/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 3.22/1.07
% 3.22/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.22/1.07
% 3.22/1.07
%------------------------------------------------------------------------------