TSTP Solution File: HEN013-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HEN013-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:56:05 EDT 2023
% Result : Satisfiable 1.15s 1.17s
% Output : Saturation 1.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(c_50,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(c_51,plain,
less_equal(divide(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(c_52,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_53,plain,
less_equal(zero,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(c_54,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_55,plain,
less_equal(X0,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(c_62,plain,
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
cnf(c_63,plain,
( divide(X0,X1) != zero
| less_equal(X0,X1) ),
inference(renaming,[status(thm)],[c_62]) ).
cnf(c_64,plain,
( ~ less_equal(X0,X1)
| divide(X0,X1) = zero ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
cnf(c_112,plain,
X0 = X0,
theory(equality) ).
cnf(c_113,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_114,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_115,plain,
( X0 != X1
| X2 != X3
| ~ less_equal(X1,X3)
| less_equal(X0,X2) ),
theory(equality) ).
cnf(c_116,plain,
( X0 != X1
| X2 != X3
| divide(X0,X2) = divide(X1,X3) ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HEN013-2 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.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:31:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.60 WARNING - Could not infer the problem pformat. Setting FOF as default
% 1.15/1.17 % SZS status Started for theBenchmark.p
% 1.15/1.17 % SZS status Satisfiable for theBenchmark.p
% 1.15/1.17
% 1.15/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.15/1.17
% 1.15/1.17 ------ iProver source info
% 1.15/1.17
% 1.15/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.15/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.15/1.17 git: non_committed_changes: false
% 1.15/1.17 git: last_make_outside_of_git: false
% 1.15/1.17
% 1.15/1.17 ------ Parsing...successful
% 1.15/1.17
% 1.15/1.17
% 1.15/1.17
% 1.15/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 12 0s sf_e pe_s pe_e sf_s rm: 5 0s sf_e pe_s pe_e
% 1.15/1.17
% 1.15/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.15/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.15/1.17 ------ Proving...
% 1.15/1.17 ------ Problem Properties
% 1.15/1.17
% 1.15/1.17
% 1.15/1.17 clauses 0
% 1.15/1.17 conjectures 0
% 1.15/1.17 EPR 0
% 1.15/1.17 Horn 0
% 1.15/1.17 unary 0
% 1.15/1.17 binary 0
% 1.15/1.17 lits 0
% 1.15/1.17 lits eq 0
% 1.15/1.17 fd_pure 0
% 1.15/1.17 fd_pseudo 0
% 1.15/1.17 fd_cond 0
% 1.15/1.17 fd_pseudo_cond 0
% 1.15/1.17 AC symbols 0
% 1.15/1.17
% 1.15/1.17 ------ Schedule EPR Horn non eq is on
% 1.15/1.17
% 1.15/1.17 ------ no conjectures: strip conj schedule
% 1.15/1.17
% 1.15/1.17 ------ no equalities: superposition off
% 1.15/1.17
% 1.15/1.17 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.15/1.17
% 1.15/1.17
% 1.15/1.17
% 1.15/1.17
% 1.15/1.17 % SZS status Satisfiable for theBenchmark.p
% 1.15/1.17
% 1.15/1.17 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.15/1.17
% 1.15/1.17
%------------------------------------------------------------------------------