TSTP Solution File: HEN003-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : HEN003-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:16 EDT 2024
% Result : Unsatisfiable 3.47s 1.18s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_51,negated_conjecture,
divide(a,a) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
cnf(c_52,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(c_53,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(c_54,plain,
less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(c_55,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_56,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-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/HEN002-0.ax',less_equal_and_equal) ).
cnf(c_130,plain,
divide(a,a) = sP0_iProver_def,
definition ).
cnf(c_131,negated_conjecture,
sP0_iProver_def != zero,
inference(demodulation,[status(thm)],[c_51,c_130]) ).
cnf(c_305,plain,
less_equal(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_130,c_54]) ).
cnf(c_308,plain,
divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_54,c_52]) ).
cnf(c_311,plain,
divide(sP0_iProver_def,a) = zero,
inference(superposition,[status(thm)],[c_305,c_52]) ).
cnf(c_329,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_56,c_57]) ).
cnf(c_370,plain,
( ~ less_equal(zero,sP0_iProver_def)
| ~ less_equal(sP0_iProver_def,zero)
| sP0_iProver_def = zero ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_382,plain,
less_equal(zero,sP0_iProver_def),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_396,plain,
less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_308,c_55]) ).
cnf(c_446,plain,
less_equal(divide(divide(a,a),zero),zero),
inference(superposition,[status(thm)],[c_311,c_396]) ).
cnf(c_450,plain,
less_equal(divide(sP0_iProver_def,zero),zero),
inference(light_normalisation,[status(thm)],[c_446,c_130]) ).
cnf(c_457,plain,
( divide(sP0_iProver_def,zero) != zero
| less_equal(sP0_iProver_def,zero) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_465,plain,
divide(sP0_iProver_def,zero) = zero,
inference(superposition,[status(thm)],[c_450,c_329]) ).
cnf(c_467,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_465,c_457,c_382,c_370,c_131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HEN003-4 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 2 19:00:20 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.47/1.18 % SZS status Started for theBenchmark.p
% 3.47/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.47/1.18
% 3.47/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.47/1.18
% 3.47/1.18 ------ iProver source info
% 3.47/1.18
% 3.47/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.47/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.47/1.18 git: non_committed_changes: false
% 3.47/1.18
% 3.47/1.18 ------ Parsing...successful
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.47/1.18 ------ Proving...
% 3.47/1.18 ------ Problem Properties
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 clauses 11
% 3.47/1.18 conjectures 1
% 3.47/1.18 EPR 4
% 3.47/1.18 Horn 11
% 3.47/1.18 unary 8
% 3.47/1.18 binary 2
% 3.47/1.18 lits 15
% 3.47/1.18 lits eq 7
% 3.47/1.18 fd_pure 0
% 3.47/1.18 fd_pseudo 0
% 3.47/1.18 fd_cond 0
% 3.47/1.18 fd_pseudo_cond 1
% 3.47/1.18 AC symbols 0
% 3.47/1.18
% 3.47/1.18 ------ Schedule dynamic 5 is on
% 3.47/1.18
% 3.47/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------
% 3.47/1.18 Current options:
% 3.47/1.18 ------
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------ Proving...
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.47/1.18
% 3.47/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.18
% 3.47/1.18
%------------------------------------------------------------------------------