TSTP Solution File: ARI729_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI729_1 : TPTP v8.1.2. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:07:38 EDT 2024
% Result : Theorem 0.47s 1.15s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ARI729_1 : TPTP v8.1.2. Released v6.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.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 : Fri May 3 01:26:33 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running TFA theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.15 % SZS status Started for theBenchmark.p
% 0.47/1.15 % SZS status Theorem for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.15
% 0.47/1.15 ------ iProver source info
% 0.47/1.15
% 0.47/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.15 git: non_committed_changes: false
% 0.47/1.15
% 0.47/1.15 ------ Parsing...
% 0.47/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.15 ------ Proving...
% 0.47/1.15 ------ Problem Properties
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 clauses 15
% 0.47/1.15 conjectures 2
% 0.47/1.15 EPR 4
% 0.47/1.15 Horn 13
% 0.47/1.15 unary 12
% 0.47/1.15 binary 1
% 0.47/1.15 lits 20
% 0.47/1.15 lits eq 8
% 0.47/1.15 fd_pure 0
% 0.47/1.15 fd_pseudo 0
% 0.47/1.15 fd_cond 0
% 0.47/1.15 fd_pseudo_cond 1
% 0.47/1.15 AC symbols 1
% 0.47/1.15
% 0.47/1.15 ------ Input Options Time Limit: Unbounded
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------
% 0.47/1.15 Current options:
% 0.47/1.15 ------
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Proving...
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 % SZS status Theorem for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 tff(f1,conjecture,(
% 0.47/1.15 ! [X0 : $real,X1 : $real] : ($floor(X0) = $floor(X1) => $less($difference(X0,X1),1.0))),
% 0.47/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.47/1.15
% 0.47/1.15 tff(f2,negated_conjecture,(
% 0.47/1.15 ~! [X0 : $real,X1 : $real] : ($floor(X0) = $floor(X1) => $less($difference(X0,X1),1.0))),
% 0.47/1.15 inference(negated_conjecture,[],[f1])).
% 0.47/1.15
% 0.47/1.15 tff(f3,plain,(
% 0.47/1.15 ~! [X0 : $real,X1 : $real] : ($floor(X0) = $floor(X1) => $less($sum(X0,$uminus(X1)),1.0))),
% 0.47/1.15 inference(theory_normalization,[],[f2])).
% 0.47/1.15
% 0.47/1.15 tff(f15,plain,(
% 0.47/1.15 ( ! [X0 : $real] : (~$less(X0,$floor(X0))) )),
% 0.47/1.15 introduced(theory_axiom_165,[])).
% 0.47/1.15
% 0.47/1.15 tff(f17,plain,(
% 0.47/1.15 ? [X0 : $real,X1 : $real] : (~$less($sum(X0,$uminus(X1)),1.0) & $floor(X0) = $floor(X1))),
% 0.47/1.15 inference(ennf_transformation,[],[f3])).
% 0.47/1.15
% 0.47/1.15 tff(f18,plain,(
% 0.47/1.15 ? [X0 : $real,X1 : $real] : (~$less($sum(X0,$uminus(X1)),1.0) & $floor(X0) = $floor(X1)) => (~$less($sum(sK0,$uminus(sK1)),1.0) & $floor(sK0) = $floor(sK1))),
% 0.47/1.15 introduced(choice_axiom,[])).
% 0.47/1.15
% 0.47/1.15 tff(f19,plain,(
% 0.47/1.15 ~$less($sum(sK0,$uminus(sK1)),1.0) & $floor(sK0) = $floor(sK1)),
% 0.47/1.15 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18])).
% 0.47/1.15
% 0.47/1.15 tff(f20,plain,(
% 0.47/1.15 $floor(sK0) = $floor(sK1)),
% 0.47/1.15 inference(cnf_transformation,[],[f19])).
% 0.47/1.15
% 0.47/1.15 tff(f21,plain,(
% 0.47/1.15 ~$less($sum(sK0,$uminus(sK1)),1.0)),
% 0.47/1.15 inference(cnf_transformation,[],[f19])).
% 0.47/1.15
% 0.47/1.15 cnf(c_50,plain,
% 0.47/1.15 (~$less_real(X0_2,$floor_real(X0_2))),
% 0.47/1.15 inference(cnf_transformation,[],[f15])).
% 0.47/1.15
% 0.47/1.15 cnf(c_62,negated_conjecture,
% 0.47/1.15 (~$less_real($sum_real(sK0,$uminus_real(sK1)),1.0)),
% 0.47/1.15 inference(cnf_transformation,[],[f21])).
% 0.47/1.15
% 0.47/1.15 cnf(c_63,negated_conjecture,
% 0.47/1.15 ($floor_real(sK0) = $floor_real(sK1)),
% 0.47/1.15 inference(cnf_transformation,[],[f20])).
% 0.47/1.15
% 0.47/1.15 cnf(c_359,plain,
% 0.47/1.15 (~$less_real(sK1,$floor_real(sK0))),
% 0.47/1.15 inference(superposition,[status(thm)],[c_63,c_50])).
% 0.47/1.15
% 0.47/1.15 cnf(c_4744,plain,
% 0.47/1.15 ($false),
% 0.47/1.15 inference(smt_impl_just,[status(thm)],[c_359,c_62])).
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 % SZS output end CNFRefutation for theBenchmark.p
% 0.47/1.15
% 0.47/1.15
%------------------------------------------------------------------------------