TSTP Solution File: HEN010-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : HEN010-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:23 EDT 2024
% Result : Unsatisfiable 3.99s 1.19s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_53,plain,
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X2)
| less_equal(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(c_56,plain,
( ~ less_equal(X0,X1)
| less_equal(divide(X0,X2),divide(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide3) ).
cnf(c_57,plain,
divide(identity,divide(identity,divide(identity,X0))) = divide(identity,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_inversion_equals_three) ).
cnf(c_58,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,a))) != divide(identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_property_of_inversion) ).
cnf(c_59,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(c_60,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(c_61,plain,
less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(c_62,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_63,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(c_64,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_65,plain,
less_equal(X0,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(c_202,plain,
divide(identity,a) = sP0_iProver_def,
definition ).
cnf(c_203,plain,
divide(identity,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_204,plain,
divide(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_205,negated_conjecture,
sP2_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_58,c_203,c_202,c_204]) ).
cnf(c_483,plain,
less_equal(sP2_iProver_def,sP0_iProver_def),
inference(superposition,[status(thm)],[c_204,c_61]) ).
cnf(c_574,plain,
divide(identity,divide(identity,sP0_iProver_def)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_202,c_57]) ).
cnf(c_579,plain,
divide(identity,sP1_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_574,c_203]) ).
cnf(c_623,plain,
( ~ less_equal(sP0_iProver_def,sP2_iProver_def)
| ~ less_equal(sP2_iProver_def,sP0_iProver_def)
| sP2_iProver_def = sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_700,plain,
( divide(sP0_iProver_def,sP2_iProver_def) != zero
| less_equal(sP0_iProver_def,sP2_iProver_def) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_745,plain,
( ~ less_equal(X0,identity)
| less_equal(divide(X0,sP0_iProver_def),sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_203,c_56]) ).
cnf(c_756,plain,
less_equal(divide(X0,sP0_iProver_def),sP1_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_745,c_65]) ).
cnf(c_817,plain,
( ~ less_equal(X0,zero)
| X0 = zero ),
inference(superposition,[status(thm)],[c_63,c_64]) ).
cnf(c_880,plain,
divide(divide(X0,sP0_iProver_def),sP1_iProver_def) = zero,
inference(superposition,[status(thm)],[c_756,c_59]) ).
cnf(c_1183,plain,
less_equal(divide(divide(X0,sP1_iProver_def),sP2_iProver_def),divide(divide(X0,sP0_iProver_def),sP1_iProver_def)),
inference(superposition,[status(thm)],[c_204,c_62]) ).
cnf(c_1221,plain,
less_equal(divide(divide(X0,sP1_iProver_def),sP2_iProver_def),zero),
inference(light_normalisation,[status(thm)],[c_1183,c_880]) ).
cnf(c_1467,plain,
( ~ less_equal(zero,X0)
| less_equal(divide(divide(X1,sP1_iProver_def),sP2_iProver_def),X0) ),
inference(superposition,[status(thm)],[c_1221,c_53]) ).
cnf(c_1470,plain,
less_equal(divide(divide(X0,sP1_iProver_def),sP2_iProver_def),X1),
inference(forward_subsumption_resolution,[status(thm)],[c_1467,c_63]) ).
cnf(c_1478,plain,
less_equal(divide(sP0_iProver_def,sP2_iProver_def),X0),
inference(superposition,[status(thm)],[c_579,c_1470]) ).
cnf(c_1552,plain,
divide(sP0_iProver_def,sP2_iProver_def) = zero,
inference(superposition,[status(thm)],[c_1478,c_817]) ).
cnf(c_1557,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1552,c_700,c_623,c_483,c_205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HEN010-4 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 18:56:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.99/1.19 % SZS status Started for theBenchmark.p
% 3.99/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.19
% 3.99/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.99/1.19
% 3.99/1.19 ------ iProver source info
% 3.99/1.19
% 3.99/1.19 git: date: 2024-05-02 19:28:25 +0000
% 3.99/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.99/1.19 git: non_committed_changes: false
% 3.99/1.19
% 3.99/1.19 ------ Parsing...successful
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.99/1.19
% 3.99/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.19
% 3.99/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.99/1.19 ------ Proving...
% 3.99/1.19 ------ Problem Properties
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 clauses 20
% 3.99/1.19 conjectures 1
% 3.99/1.19 EPR 5
% 3.99/1.19 Horn 20
% 3.99/1.19 unary 13
% 3.99/1.19 binary 5
% 3.99/1.19 lits 29
% 3.99/1.19 lits eq 12
% 3.99/1.19 fd_pure 0
% 3.99/1.19 fd_pseudo 0
% 3.99/1.19 fd_cond 0
% 3.99/1.19 fd_pseudo_cond 1
% 3.99/1.19 AC symbols 0
% 3.99/1.19
% 3.99/1.19 ------ Schedule dynamic 5 is on
% 3.99/1.19
% 3.99/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 ------
% 3.99/1.19 Current options:
% 3.99/1.19 ------
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 ------ Proving...
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.19
% 3.99/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.19
% 3.99/1.19
%------------------------------------------------------------------------------