TSTP Solution File: HEN010-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HEN010-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:56:01 EDT 2023
% Result : Unsatisfiable 3.45s 1.18s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 18 unt; 0 nHn; 33 RR)
% Number of literals : 74 ( 34 equ; 36 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 60 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_51,plain,
quotient(X0,X0,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(c_57,plain,
( ~ quotient(identity,X0,X1)
| ~ quotient(identity,X1,X2)
| ~ quotient(identity,X2,X3)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_inversion_equals_three) ).
cnf(c_58,plain,
quotient(identity,a,idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_a) ).
cnf(c_59,plain,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQa) ).
cnf(c_60,plain,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).
cnf(c_61,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).
cnf(c_63,plain,
( ~ quotient(X0,X1,zero)
| less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(c_64,plain,
( ~ quotient(X0,X1,X2)
| less_equal(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(c_65,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_66,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(c_67,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_81,plain,
divide(X0,X0) = zero,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_89,plain,
( divide(identity,X0) != X1
| divide(identity,X1) != X2
| divide(identity,X2) != X3
| X1 = X3 ),
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_91,plain,
divide(identity,a) = idQa,
inference(well_definedness,[status(thm)],[c_58]) ).
cnf(c_92,plain,
divide(identity,idQa) = idQ_idQa,
inference(well_definedness,[status(thm)],[c_59]) ).
cnf(c_93,plain,
divide(idQa,idQ_idQa) = idQa_Q__idQ_idQa,
inference(well_definedness,[status(thm)],[c_60]) ).
cnf(c_95,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(well_definedness,[status(thm)],[c_63]) ).
cnf(c_96,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(well_definedness,[status(thm)],[c_64]) ).
cnf(c_98,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_65]) ).
cnf(c_108,plain,
( less_equal(X2,X0)
| divide(X0,X1) != X2 ),
inference(prop_impl_just,[status(thm)],[c_96]) ).
cnf(c_109,plain,
( divide(X0,X1) != X2
| less_equal(X2,X0) ),
inference(renaming,[status(thm)],[c_108]) ).
cnf(c_260,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(unflattening,[status(thm)],[c_98]) ).
cnf(c_262,plain,
less_equal(divide(X0,X1),X0),
inference(unflattening,[status(thm)],[c_109]) ).
cnf(c_264,plain,
divide(identity,X0) = divide(identity,divide(identity,divide(identity,X0))),
inference(unflattening,[status(thm)],[c_89]) ).
cnf(c_376,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(prop_impl_just,[status(thm)],[c_95]) ).
cnf(c_377,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(renaming,[status(thm)],[c_376]) ).
cnf(c_775,plain,
( ~ less_equal(idQa,idQa_Q__idQ_idQa)
| ~ less_equal(idQa_Q__idQ_idQa,idQa)
| idQa = idQa_Q__idQ_idQa ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_812,plain,
( ~ less_equal(divide(divide(X0,X1),X2),divide(divide(X0,X2),divide(X1,X2)))
| divide(divide(X0,X2),divide(X1,X2)) = divide(divide(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_260,c_67]) ).
cnf(c_949,plain,
( ~ less_equal(divide(divide(X0,idQa),idQ_idQa),divide(divide(X0,idQ_idQa),idQa_Q__idQ_idQa))
| divide(divide(X0,idQ_idQa),divide(idQa,idQ_idQa)) = divide(divide(X0,idQa),idQ_idQa) ),
inference(superposition,[status(thm)],[c_93,c_812]) ).
cnf(c_963,plain,
( ~ less_equal(divide(divide(X0,idQa),idQ_idQa),divide(divide(X0,idQ_idQa),idQa_Q__idQ_idQa))
| divide(divide(X0,idQa),idQ_idQa) = divide(divide(X0,idQ_idQa),idQa_Q__idQ_idQa) ),
inference(light_normalisation,[status(thm)],[c_949,c_93]) ).
cnf(c_1363,plain,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(superposition,[status(thm)],[c_93,c_262]) ).
cnf(c_1572,plain,
( divide(idQa,idQa_Q__idQ_idQa) != zero
| less_equal(idQa,idQa_Q__idQ_idQa) ),
inference(instantiation,[status(thm)],[c_377]) ).
cnf(c_1723,plain,
divide(identity,divide(identity,idQa)) = idQa,
inference(superposition,[status(thm)],[c_91,c_264]) ).
cnf(c_1741,plain,
divide(identity,idQ_idQa) = idQa,
inference(light_normalisation,[status(thm)],[c_1723,c_92]) ).
cnf(c_1926,plain,
( ~ less_equal(divide(idQ_idQa,idQ_idQa),divide(divide(identity,idQ_idQa),idQa_Q__idQ_idQa))
| divide(divide(identity,idQa),idQ_idQa) = divide(divide(identity,idQ_idQa),idQa_Q__idQ_idQa) ),
inference(superposition,[status(thm)],[c_92,c_963]) ).
cnf(c_1940,plain,
( ~ less_equal(divide(idQ_idQa,idQ_idQa),divide(divide(identity,idQ_idQa),idQa_Q__idQ_idQa))
| divide(divide(identity,idQ_idQa),idQa_Q__idQ_idQa) = divide(idQ_idQa,idQ_idQa) ),
inference(light_normalisation,[status(thm)],[c_1926,c_92]) ).
cnf(c_1941,plain,
( ~ less_equal(zero,divide(idQa,idQa_Q__idQ_idQa))
| divide(idQa,idQa_Q__idQ_idQa) = zero ),
inference(demodulation,[status(thm)],[c_1940,c_81,c_1741]) ).
cnf(c_1965,plain,
divide(idQa,idQa_Q__idQ_idQa) = zero,
inference(superposition,[status(thm)],[c_66,c_1941]) ).
cnf(c_1968,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1965,c_1572,c_1363,c_775,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HEN010-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.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:50:17 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.45/1.18 % SZS status Started for theBenchmark.p
% 3.45/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.45/1.18
% 3.45/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.45/1.18
% 3.45/1.18 ------ iProver source info
% 3.45/1.18
% 3.45/1.18 git: date: 2023-05-31 18:12:56 +0000
% 3.45/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.45/1.18 git: non_committed_changes: false
% 3.45/1.18 git: last_make_outside_of_git: false
% 3.45/1.18
% 3.45/1.18 ------ Parsing...successful
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18 ------ Preprocessing... sup_sim: 1 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 sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.45/1.18
% 3.45/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.45/1.18
% 3.45/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.45/1.18 ------ Proving...
% 3.45/1.18 ------ Problem Properties
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18 clauses 20
% 3.45/1.18 conjectures 1
% 3.45/1.18 EPR 5
% 3.45/1.18 Horn 20
% 3.45/1.18 unary 13
% 3.45/1.18 binary 5
% 3.45/1.18 lits 29
% 3.45/1.18 lits eq 12
% 3.45/1.18 fd_pure 0
% 3.45/1.18 fd_pseudo 0
% 3.45/1.18 fd_cond 0
% 3.45/1.18 fd_pseudo_cond 1
% 3.45/1.18 AC symbols 0
% 3.45/1.18
% 3.45/1.18 ------ Input Options Time Limit: Unbounded
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18 ------
% 3.45/1.18 Current options:
% 3.45/1.18 ------
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18 ------ Proving...
% 3.45/1.18
% 3.45/1.18
% 3.45/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.45/1.18
% 3.45/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.45/1.18
% 3.45/1.18
%------------------------------------------------------------------------------