TSTP Solution File: HEN007-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HEN007-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:58 EDT 2023
% Result : Unsatisfiable 3.74s 1.16s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 8
% Syntax : Number of clauses : 49 ( 39 unt; 0 nHn; 14 RR)
% Number of literals : 60 ( 23 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 19 sgn)
% 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_286,plain,
divide(a,b) = zero,
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_287,plain,
divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_288,plain,
divide(zero,X0) = zero,
inference(superposition,[status(thm)],[c_55,c_51]) ).
cnf(c_314,plain,
( ~ less_equal(X0,divide(X0,X1))
| divide(X0,X1) = X0 ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_315,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_330,plain,
less_equal(divide(divide(X0,b),zero),divide(divide(X0,a),b)),
inference(superposition,[status(thm)],[c_286,c_54]) ).
cnf(c_331,plain,
less_equal(divide(divide(X0,X1),zero),divide(divide(X0,divide(X1,X2)),X1)),
inference(superposition,[status(thm)],[c_287,c_54]) ).
cnf(c_332,plain,
less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
inference(superposition,[status(thm)],[c_288,c_54]) ).
cnf(c_333,plain,
less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
inference(superposition,[status(thm)],[c_287,c_54]) ).
cnf(c_335,plain,
less_equal(divide(divide(divide(X0,X1),X2),divide(X0,X2)),divide(zero,X2)),
inference(superposition,[status(thm)],[c_287,c_54]) ).
cnf(c_406,plain,
less_equal(divide(divide(X0,X0),zero),zero),
inference(superposition,[status(thm)],[c_287,c_333]) ).
cnf(c_422,plain,
divide(divide(X0,X0),zero) = zero,
inference(superposition,[status(thm)],[c_406,c_315]) ).
cnf(c_427,plain,
less_equal(divide(X0,X0),zero),
inference(superposition,[status(thm)],[c_422,c_52]) ).
cnf(c_437,plain,
divide(X0,X0) = zero,
inference(superposition,[status(thm)],[c_427,c_315]) ).
cnf(c_512,plain,
less_equal(divide(divide(X0,divide(X0,zero)),zero),zero),
inference(superposition,[status(thm)],[c_437,c_332]) ).
cnf(c_587,plain,
divide(divide(X0,divide(X0,zero)),zero) = zero,
inference(superposition,[status(thm)],[c_512,c_315]) ).
cnf(c_660,plain,
less_equal(divide(X0,divide(X0,zero)),zero),
inference(superposition,[status(thm)],[c_587,c_52]) ).
cnf(c_690,plain,
divide(X0,divide(X0,zero)) = zero,
inference(superposition,[status(thm)],[c_660,c_315]) ).
cnf(c_696,plain,
less_equal(X0,divide(X0,zero)),
inference(superposition,[status(thm)],[c_690,c_52]) ).
cnf(c_719,plain,
( ~ less_equal(divide(X0,zero),X0)
| divide(X0,zero) = X0 ),
inference(superposition,[status(thm)],[c_696,c_56]) ).
cnf(c_723,plain,
divide(X0,zero) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_719,c_53]) ).
cnf(c_727,plain,
less_equal(divide(X0,b),divide(divide(X0,a),b)),
inference(demodulation,[status(thm)],[c_330,c_723]) ).
cnf(c_782,plain,
less_equal(divide(X0,X1),divide(divide(X0,divide(X1,X2)),X1)),
inference(demodulation,[status(thm)],[c_331,c_723]) ).
cnf(c_793,plain,
less_equal(divide(divide(divide(X0,X1),X2),X0),divide(zero,X0)),
inference(superposition,[status(thm)],[c_287,c_782]) ).
cnf(c_801,plain,
less_equal(divide(X0,X1),divide(divide(X0,X1),X1)),
inference(superposition,[status(thm)],[c_723,c_782]) ).
cnf(c_813,plain,
less_equal(divide(divide(divide(X0,X1),X2),X0),zero),
inference(light_normalisation,[status(thm)],[c_793,c_288]) ).
cnf(c_923,plain,
( ~ less_equal(divide(divide(X0,X1),X1),divide(X0,X1))
| divide(divide(X0,X1),X1) = divide(X0,X1) ),
inference(superposition,[status(thm)],[c_801,c_56]) ).
cnf(c_932,plain,
divide(divide(X0,X1),X1) = divide(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[c_923,c_53]) ).
cnf(c_954,plain,
divide(divide(divide(X0,X1),X2),X0) = zero,
inference(superposition,[status(thm)],[c_813,c_315]) ).
cnf(c_1042,plain,
less_equal(divide(divide(divide(X0,X1),X2),divide(X0,X2)),zero),
inference(demodulation,[status(thm)],[c_335,c_288]) ).
cnf(c_1072,plain,
divide(divide(divide(X0,X1),X2),divide(X0,X2)) = zero,
inference(superposition,[status(thm)],[c_1042,c_315]) ).
cnf(c_1130,plain,
less_equal(divide(X0,b),divide(divide(divide(X0,b),a),b)),
inference(superposition,[status(thm)],[c_932,c_727]) ).
cnf(c_1212,plain,
less_equal(divide(divide(X0,X1),X2),X0),
inference(superposition,[status(thm)],[c_954,c_52]) ).
cnf(c_1428,plain,
( ~ less_equal(divide(divide(divide(X0,b),a),b),divide(X0,b))
| divide(divide(divide(X0,b),a),b) = divide(X0,b) ),
inference(superposition,[status(thm)],[c_1130,c_56]) ).
cnf(c_1432,plain,
divide(divide(divide(X0,b),a),b) = divide(X0,b),
inference(forward_subsumption_resolution,[status(thm)],[c_1428,c_1212]) ).
cnf(c_1713,plain,
less_equal(divide(divide(X0,X1),X2),divide(X0,X2)),
inference(superposition,[status(thm)],[c_1072,c_52]) ).
cnf(c_1932,plain,
( ~ less_equal(divide(divide(X0,b),a),divide(X0,b))
| divide(divide(divide(X0,b),a),b) = divide(divide(X0,b),a) ),
inference(superposition,[status(thm)],[c_1432,c_314]) ).
cnf(c_1965,plain,
( ~ less_equal(divide(divide(X0,b),a),divide(X0,b))
| divide(divide(X0,b),a) = divide(X0,b) ),
inference(light_normalisation,[status(thm)],[c_1932,c_1432]) ).
cnf(c_1966,plain,
divide(divide(X0,b),a) = divide(X0,b),
inference(forward_subsumption_resolution,[status(thm)],[c_1965,c_53]) ).
cnf(c_2121,plain,
less_equal(divide(X0,b),divide(X0,a)),
inference(superposition,[status(thm)],[c_1966,c_1713]) ).
cnf(c_2138,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_2121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HEN007-3 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.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:33:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.74/1.16 % SZS status Started for theBenchmark.p
% 3.74/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.74/1.16
% 3.74/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.74/1.16
% 3.74/1.16 ------ iProver source info
% 3.74/1.16
% 3.74/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.74/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.74/1.16 git: non_committed_changes: false
% 3.74/1.16 git: last_make_outside_of_git: false
% 3.74/1.16
% 3.74/1.16 ------ Parsing...successful
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.74/1.16
% 3.74/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.74/1.16
% 3.74/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.74/1.16 ------ Proving...
% 3.74/1.16 ------ Problem Properties
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16 clauses 9
% 3.74/1.16 conjectures 1
% 3.74/1.16 EPR 4
% 3.74/1.16 Horn 9
% 3.74/1.16 unary 6
% 3.74/1.16 binary 2
% 3.74/1.16 lits 13
% 3.74/1.16 lits eq 3
% 3.74/1.16 fd_pure 0
% 3.74/1.16 fd_pseudo 0
% 3.74/1.16 fd_cond 0
% 3.74/1.16 fd_pseudo_cond 1
% 3.74/1.16 AC symbols 0
% 3.74/1.16
% 3.74/1.16 ------ Schedule dynamic 5 is on
% 3.74/1.16
% 3.74/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16 ------
% 3.74/1.16 Current options:
% 3.74/1.16 ------
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16 ------ Proving...
% 3.74/1.16
% 3.74/1.16
% 3.74/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.74/1.16
% 3.74/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.74/1.16
% 3.74/1.17
%------------------------------------------------------------------------------