TSTP Solution File: ARI011_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ARI011_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Wed Aug 30 17:39:38 EDT 2023
% Result : Theorem 0.48s 1.14s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ARI011_1 : TPTP v8.1.2. Released v5.0.0.
% 0.08/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 19:08:27 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running TFA theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.14 % SZS status Started for theBenchmark.p
% 0.48/1.14 % SZS status Theorem for theBenchmark.p
% 0.48/1.14
% 0.48/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.14
% 0.48/1.14 ------ iProver source info
% 0.48/1.14
% 0.48/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.14 git: non_committed_changes: false
% 0.48/1.14 git: last_make_outside_of_git: false
% 0.48/1.14
% 0.48/1.14 ------ Parsing...
% 0.48/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.14
% 0.48/1.14 ------ 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.48/1.14
% 0.48/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.14
% 0.48/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.14 ------ Proving...
% 0.48/1.14 ------ Problem Properties
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 clauses 13
% 0.48/1.14 conjectures 1
% 0.48/1.14 EPR 5
% 0.48/1.14 Horn 11
% 0.48/1.14 unary 9
% 0.48/1.14 binary 2
% 0.48/1.14 lits 19
% 0.48/1.14 lits eq 7
% 0.48/1.14 fd_pure 0
% 0.48/1.14 fd_pseudo 0
% 0.48/1.14 fd_cond 0
% 0.48/1.14 fd_pseudo_cond 1
% 0.48/1.14 AC symbols 1
% 0.48/1.14
% 0.48/1.14 ------ Input Options Time Limit: Unbounded
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 ------
% 0.48/1.14 Current options:
% 0.48/1.14 ------
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 ------ Proving...
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 % SZS status Theorem for theBenchmark.p
% 0.48/1.14
% 0.48/1.14 % SZS output start CNFRefutation for theBenchmark.p
% 0.48/1.14
% 0.48/1.14 tff(f1,conjecture,(
% 0.48/1.14 ? [X0 : $int] : $less(X0,0)),
% 0.48/1.14 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_0)).
% 0.48/1.14
% 0.48/1.14 tff(f2,negated_conjecture,(
% 0.48/1.14 ~? [X0 : $int] : $less(X0,0)),
% 0.48/1.14 inference(negated_conjecture,[],[f1])).
% 0.48/1.14
% 0.48/1.14 tff(f3,plain,(
% 0.48/1.14 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.48/1.14 introduced(theory_axiom_138,[])).
% 0.48/1.14
% 0.48/1.14 tff(f7,plain,(
% 0.48/1.14 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.48/1.14 introduced(theory_axiom_143,[])).
% 0.48/1.14
% 0.48/1.14 tff(f8,plain,(
% 0.48/1.14 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.48/1.14 introduced(theory_axiom_145,[])).
% 0.48/1.14
% 0.48/1.14 tff(f12,plain,(
% 0.48/1.14 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 0.48/1.14 introduced(theory_axiom_150,[])).
% 0.48/1.14
% 0.48/1.14 tff(f15,plain,(
% 0.48/1.14 ! [X0 : $int] : ~$less(X0,0)),
% 0.48/1.14 inference(ennf_transformation,[],[f2])).
% 0.48/1.14
% 0.48/1.14 tff(f16,plain,(
% 0.48/1.14 ( ! [X0 : $int] : (~$less(X0,0)) )),
% 0.48/1.14 inference(cnf_transformation,[],[f15])).
% 0.48/1.14
% 0.48/1.14 cnf(c_51,plain,
% 0.48/1.14 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 0.48/1.14 inference(cnf_transformation,[],[f12])).
% 0.48/1.14
% 0.48/1.14 cnf(c_55,plain,
% 0.48/1.14 (~$less_int(X0_3,X0_3)),
% 0.48/1.14 inference(cnf_transformation,[],[f8])).
% 0.48/1.14
% 0.48/1.14 cnf(c_56,plain,
% 0.48/1.14 ($sum_int(X0_3,$uminus_int(X0_3)) = 0),
% 0.48/1.14 inference(cnf_transformation,[],[f7])).
% 0.48/1.14
% 0.48/1.14 cnf(c_60,plain,
% 0.48/1.14 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 0.48/1.14 inference(cnf_transformation,[],[f3])).
% 0.48/1.14
% 0.48/1.14 cnf(c_61,negated_conjecture,
% 0.48/1.14 (~$less_int(X0_3,0)),
% 0.48/1.14 inference(cnf_transformation,[],[f16])).
% 0.48/1.14
% 0.48/1.14 cnf(c_473,plain,
% 0.48/1.14 ($less_int(X0_3,$sum_int(X0_3,1))),
% 0.48/1.14 inference(superposition,[status(thm)],[c_51,c_55])).
% 0.48/1.14
% 0.48/1.14 cnf(c_493,plain,
% 0.48/1.14 ($less_int(X0_3,$sum_int(1,X0_3))),
% 0.48/1.14 inference(superposition,[status(thm)],[c_60,c_473])).
% 0.48/1.14
% 0.48/1.14 cnf(c_561,plain,
% 0.48/1.14 ($less_int($uminus_int(1),0)),
% 0.48/1.14 inference(superposition,[status(thm)],[c_56,c_493])).
% 0.48/1.14
% 0.48/1.14 cnf(c_566,plain,
% 0.48/1.14 ($false),
% 0.48/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_561,c_61])).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 % SZS output end CNFRefutation for theBenchmark.p
% 0.48/1.14
% 0.48/1.14
%------------------------------------------------------------------------------