TSTP Solution File: HEN007-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : HEN007-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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.45s 1.03s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
less_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).
cnf(c_50,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_51,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(c_52,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(c_53,plain,
less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(c_54,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_55,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(c_56,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_125,plain,
divide(c,b) = sP0_iProver_def,
definition ).
cnf(c_126,plain,
divide(c,a) = sP1_iProver_def,
definition ).
cnf(c_127,negated_conjecture,
~ less_equal(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_50,c_126,c_125]) ).
cnf(c_300,plain,
less_equal(sP1_iProver_def,c),
inference(superposition,[status(thm)],[c_126,c_53]) ).
cnf(c_303,plain,
divide(a,b) = zero,
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_304,plain,
divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_305,plain,
divide(zero,X0) = zero,
inference(superposition,[status(thm)],[c_55,c_51]) ).
cnf(c_308,plain,
divide(sP1_iProver_def,c) = zero,
inference(superposition,[status(thm)],[c_300,c_51]) ).
cnf(c_329,plain,
( ~ less_equal(X0,divide(X0,X1))
| divide(X0,X1) = X0 ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_330,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_350,plain,
less_equal(divide(sP0_iProver_def,divide(X0,b)),divide(divide(c,X0),b)),
inference(superposition,[status(thm)],[c_125,c_54]) ).
cnf(c_393,plain,
less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
inference(superposition,[status(thm)],[c_305,c_54]) ).
cnf(c_432,plain,
less_equal(divide(divide(sP1_iProver_def,X0),divide(c,X0)),divide(zero,X0)),
inference(superposition,[status(thm)],[c_308,c_54]) ).
cnf(c_434,plain,
less_equal(divide(divide(sP1_iProver_def,X0),divide(c,X0)),zero),
inference(light_normalisation,[status(thm)],[c_432,c_305]) ).
cnf(c_454,plain,
less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_304,c_54]) ).
cnf(c_500,plain,
less_equal(divide(sP0_iProver_def,divide(a,b)),divide(sP1_iProver_def,b)),
inference(superposition,[status(thm)],[c_126,c_350]) ).
cnf(c_504,plain,
less_equal(divide(sP0_iProver_def,zero),divide(sP1_iProver_def,b)),
inference(light_normalisation,[status(thm)],[c_500,c_303]) ).
cnf(c_591,plain,
less_equal(divide(divide(sP1_iProver_def,b),sP0_iProver_def),zero),
inference(superposition,[status(thm)],[c_125,c_434]) ).
cnf(c_605,plain,
divide(divide(sP1_iProver_def,b),sP0_iProver_def) = zero,
inference(superposition,[status(thm)],[c_591,c_330]) ).
cnf(c_647,plain,
less_equal(divide(divide(X0,X0),zero),zero),
inference(superposition,[status(thm)],[c_304,c_454]) ).
cnf(c_712,plain,
divide(divide(X0,X0),zero) = zero,
inference(superposition,[status(thm)],[c_647,c_330]) ).
cnf(c_724,plain,
less_equal(divide(sP1_iProver_def,b),sP0_iProver_def),
inference(superposition,[status(thm)],[c_605,c_52]) ).
cnf(c_813,plain,
less_equal(divide(X0,X0),zero),
inference(superposition,[status(thm)],[c_712,c_52]) ).
cnf(c_828,plain,
divide(X0,X0) = zero,
inference(superposition,[status(thm)],[c_813,c_330]) ).
cnf(c_1530,plain,
less_equal(divide(divide(X0,divide(X0,zero)),zero),zero),
inference(superposition,[status(thm)],[c_828,c_393]) ).
cnf(c_1802,plain,
divide(divide(X0,divide(X0,zero)),zero) = zero,
inference(superposition,[status(thm)],[c_1530,c_330]) ).
cnf(c_3062,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_1802,c_329]) ).
cnf(c_3070,plain,
less_equal(divide(X0,divide(X0,zero)),zero),
inference(superposition,[status(thm)],[c_1802,c_52]) ).
cnf(c_3082,plain,
divide(divide(X0,divide(X0,zero)),zero) = divide(X0,divide(X0,zero)),
inference(forward_subsumption_resolution,[status(thm)],[c_3062,c_3070]) ).
cnf(c_3083,plain,
divide(X0,divide(X0,zero)) = zero,
inference(light_normalisation,[status(thm)],[c_3082,c_1802]) ).
cnf(c_3102,plain,
less_equal(X0,divide(X0,zero)),
inference(superposition,[status(thm)],[c_3083,c_52]) ).
cnf(c_3187,plain,
divide(X0,zero) = X0,
inference(superposition,[status(thm)],[c_3102,c_329]) ).
cnf(c_3207,plain,
less_equal(sP0_iProver_def,divide(sP1_iProver_def,b)),
inference(demodulation,[status(thm)],[c_504,c_3187]) ).
cnf(c_3223,plain,
( ~ less_equal(divide(sP1_iProver_def,b),sP0_iProver_def)
| divide(sP1_iProver_def,b) = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_3207,c_56]) ).
cnf(c_3225,plain,
divide(sP1_iProver_def,b) = sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_3223,c_724]) ).
cnf(c_3320,plain,
less_equal(sP0_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_3225,c_53]) ).
cnf(c_3328,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3320,c_127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : HEN007-3 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.09 % Command : run_iprover %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Thu May 2 18:46:53 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.13/0.37 Running first-order theorem proving
% 0.13/0.37 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.45/1.03 % SZS status Started for theBenchmark.p
% 3.45/1.03 % SZS status Unsatisfiable for theBenchmark.p
% 3.45/1.03
% 3.45/1.03 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.45/1.03
% 3.45/1.03 ------ iProver source info
% 3.45/1.03
% 3.45/1.03 git: date: 2024-05-02 19:28:25 +0000
% 3.45/1.03 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.45/1.03 git: non_committed_changes: false
% 3.45/1.03
% 3.45/1.03 ------ Parsing...successful
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.45/1.03
% 3.45/1.03 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.45/1.03
% 3.45/1.03 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.45/1.03 ------ Proving...
% 3.45/1.03 ------ Problem Properties
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03 clauses 11
% 3.45/1.03 conjectures 1
% 3.45/1.03 EPR 5
% 3.45/1.03 Horn 11
% 3.45/1.03 unary 8
% 3.45/1.03 binary 2
% 3.45/1.03 lits 15
% 3.45/1.03 lits eq 5
% 3.45/1.03 fd_pure 0
% 3.45/1.03 fd_pseudo 0
% 3.45/1.03 fd_cond 0
% 3.45/1.03 fd_pseudo_cond 1
% 3.45/1.03 AC symbols 0
% 3.45/1.03
% 3.45/1.03 ------ Schedule dynamic 5 is on
% 3.45/1.03
% 3.45/1.03 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03 ------
% 3.45/1.03 Current options:
% 3.45/1.03 ------
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03 ------ Proving...
% 3.45/1.03
% 3.45/1.03
% 3.45/1.03 % SZS status Unsatisfiable for theBenchmark.p
% 3.45/1.03
% 3.45/1.03 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.45/1.03
% 3.45/1.03
%------------------------------------------------------------------------------