TSTP Solution File: HEN005-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HEN005-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:54 EDT 2023
% Result : Unsatisfiable 3.24s 1.12s
% Output : CNFRefutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 15 unt; 0 nHn; 15 RR)
% Number of literals : 26 ( 10 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
less_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_LE_b) ).
cnf(c_50,plain,
less_equal(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_LE_c) ).
cnf(c_51,negated_conjecture,
~ less_equal(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_LE_c) ).
cnf(c_52,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(c_53,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(c_55,plain,
less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(c_56,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(c_296,plain,
divide(a,b) = zero,
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_297,plain,
divide(b,c) = zero,
inference(superposition,[status(thm)],[c_50,c_52]) ).
cnf(c_299,plain,
divide(zero,X0) = zero,
inference(superposition,[status(thm)],[c_56,c_52]) ).
cnf(c_321,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_56,c_57]) ).
cnf(c_338,plain,
less_equal(divide(divide(a,X0),divide(b,X0)),divide(zero,X0)),
inference(superposition,[status(thm)],[c_296,c_55]) ).
cnf(c_343,plain,
less_equal(divide(divide(a,X0),divide(b,X0)),zero),
inference(light_normalisation,[status(thm)],[c_338,c_299]) ).
cnf(c_354,plain,
( divide(a,c) != zero
| less_equal(a,c) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_440,plain,
less_equal(divide(divide(a,c),zero),zero),
inference(superposition,[status(thm)],[c_297,c_343]) ).
cnf(c_460,plain,
divide(divide(a,c),zero) = zero,
inference(superposition,[status(thm)],[c_440,c_321]) ).
cnf(c_465,plain,
less_equal(divide(a,c),zero),
inference(superposition,[status(thm)],[c_460,c_53]) ).
cnf(c_484,plain,
divide(a,c) = zero,
inference(superposition,[status(thm)],[c_465,c_321]) ).
cnf(c_487,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_484,c_354,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN005-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n027.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:33 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.24/1.12 % SZS status Started for theBenchmark.p
% 3.24/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.24/1.12
% 3.24/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.24/1.12
% 3.24/1.12 ------ iProver source info
% 3.24/1.12
% 3.24/1.12 git: date: 2023-05-31 18:12:56 +0000
% 3.24/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.24/1.12 git: non_committed_changes: false
% 3.24/1.12 git: last_make_outside_of_git: false
% 3.24/1.12
% 3.24/1.12 ------ Parsing...successful
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.24/1.12
% 3.24/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.24/1.12
% 3.24/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.24/1.12 ------ Proving...
% 3.24/1.12 ------ Problem Properties
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12 clauses 10
% 3.24/1.12 conjectures 1
% 3.24/1.12 EPR 6
% 3.24/1.12 Horn 10
% 3.24/1.12 unary 7
% 3.24/1.12 binary 2
% 3.24/1.12 lits 14
% 3.24/1.12 lits eq 3
% 3.24/1.12 fd_pure 0
% 3.24/1.12 fd_pseudo 0
% 3.24/1.12 fd_cond 0
% 3.24/1.12 fd_pseudo_cond 1
% 3.24/1.12 AC symbols 0
% 3.24/1.12
% 3.24/1.12 ------ Schedule dynamic 5 is on
% 3.24/1.12
% 3.24/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12 ------
% 3.24/1.12 Current options:
% 3.24/1.12 ------
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12 ------ Proving...
% 3.24/1.12
% 3.24/1.12
% 3.24/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.24/1.12
% 3.24/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.24/1.12
% 3.24/1.12
%------------------------------------------------------------------------------