TSTP Solution File: ARI612_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ARI612_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:41:29 EDT 2023
% Result : Theorem 1.64s 1.16s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI612_1 : TPTP v8.1.2. Released v5.1.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 29 18:08:05 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running TFA theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.64/1.16 % SZS status Started for theBenchmark.p
% 1.64/1.16 % SZS status Theorem for theBenchmark.p
% 1.64/1.16
% 1.64/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.64/1.16
% 1.64/1.16 ------ iProver source info
% 1.64/1.16
% 1.64/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.64/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.64/1.16 git: non_committed_changes: false
% 1.64/1.16 git: last_make_outside_of_git: false
% 1.64/1.16
% 1.64/1.16 ------ Parsing...
% 1.64/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.64/1.16
% 1.64/1.16 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 1.64/1.16
% 1.64/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.64/1.16
% 1.64/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.64/1.16 ------ Proving...
% 1.64/1.16 ------ Problem Properties
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16 clauses 19
% 1.64/1.16 conjectures 0
% 1.64/1.16 EPR 11
% 1.64/1.16 Horn 17
% 1.64/1.16 unary 14
% 1.64/1.16 binary 3
% 1.64/1.16 lits 26
% 1.64/1.16 lits eq 7
% 1.64/1.16 fd_pure 0
% 1.64/1.16 fd_pseudo 0
% 1.64/1.16 fd_cond 0
% 1.64/1.16 fd_pseudo_cond 1
% 1.64/1.16 AC symbols 1
% 1.64/1.16
% 1.64/1.16 ------ Input Options Time Limit: Unbounded
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16 ------
% 1.64/1.16 Current options:
% 1.64/1.16 ------
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16 ------ Proving...
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16 % SZS status Theorem for theBenchmark.p
% 1.64/1.16
% 1.64/1.16 % SZS output start CNFRefutation for theBenchmark.p
% 1.64/1.16
% 1.64/1.16 tff(f1,conjecture,(
% 1.64/1.16 (! [X0 : $int] : (($less(X0,12) & $less(8,X0)) <=> q(X0)) & ! [X0 : $int] : (($less(X0,15) & $less(5,X0)) <=> p(X0))) => ! [X0 : $int] : (q(X0) => p(X0))),
% 1.64/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_8_12_subset_5_15)).
% 1.64/1.16
% 1.64/1.16 tff(f2,negated_conjecture,(
% 1.64/1.16 ~((! [X0 : $int] : (($less(X0,12) & $less(8,X0)) <=> q(X0)) & ! [X0 : $int] : (($less(X0,15) & $less(5,X0)) <=> p(X0))) => ! [X0 : $int] : (q(X0) => p(X0)))),
% 1.64/1.16 inference(negated_conjecture,[],[f1])).
% 1.64/1.16
% 1.64/1.16 tff(f9,plain,(
% 1.64/1.16 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 1.64/1.16 introduced(theory_axiom_146,[])).
% 1.64/1.16
% 1.64/1.16 tff(f15,plain,(
% 1.64/1.16 ~((! [X0 : $int] : (($less(X0,12) & $less(8,X0)) <=> q(X0)) & ! [X1 : $int] : (($less(X1,15) & $less(5,X1)) <=> p(X1))) => ! [X2 : $int] : (q(X2) => p(X2)))),
% 1.64/1.16 inference(rectify,[],[f2])).
% 1.64/1.16
% 1.64/1.16 tff(f16,plain,(
% 1.64/1.16 ? [X2 : $int] : (~p(X2) & q(X2)) & (! [X0 : $int] : (($less(X0,12) & $less(8,X0)) <=> q(X0)) & ! [X1 : $int] : (($less(X1,15) & $less(5,X1)) <=> p(X1)))),
% 1.64/1.16 inference(ennf_transformation,[],[f15])).
% 1.64/1.16
% 1.64/1.16 tff(f17,plain,(
% 1.64/1.16 ? [X2 : $int] : (~p(X2) & q(X2)) & ! [X0 : $int] : (($less(X0,12) & $less(8,X0)) <=> q(X0)) & ! [X1 : $int] : (($less(X1,15) & $less(5,X1)) <=> p(X1))),
% 1.64/1.16 inference(flattening,[],[f16])).
% 1.64/1.16
% 1.64/1.16 tff(f18,plain,(
% 1.64/1.16 ? [X2 : $int] : (~p(X2) & q(X2)) & ! [X0 : $int] : ((($less(X0,12) & $less(8,X0)) | ~q(X0)) & (q(X0) | (~$less(X0,12) | ~$less(8,X0)))) & ! [X1 : $int] : ((($less(X1,15) & $less(5,X1)) | ~p(X1)) & (p(X1) | (~$less(X1,15) | ~$less(5,X1))))),
% 1.64/1.16 inference(nnf_transformation,[],[f17])).
% 1.64/1.16
% 1.64/1.16 tff(f19,plain,(
% 1.64/1.16 ? [X2 : $int] : (~p(X2) & q(X2)) & ! [X0 : $int] : ((($less(X0,12) & $less(8,X0)) | ~q(X0)) & (q(X0) | ~$less(X0,12) | ~$less(8,X0))) & ! [X1 : $int] : ((($less(X1,15) & $less(5,X1)) | ~p(X1)) & (p(X1) | ~$less(X1,15) | ~$less(5,X1)))),
% 1.64/1.16 inference(flattening,[],[f18])).
% 1.64/1.16
% 1.64/1.16 tff(f20,plain,(
% 1.64/1.16 ? [X0 : $int] : (~p(X0) & q(X0)) & ! [X1 : $int] : ((($less(X1,12) & $less(8,X1)) | ~q(X1)) & (q(X1) | ~$less(X1,12) | ~$less(8,X1))) & ! [X2 : $int] : ((($less(X2,15) & $less(5,X2)) | ~p(X2)) & (p(X2) | ~$less(X2,15) | ~$less(5,X2)))),
% 1.64/1.16 inference(rectify,[],[f19])).
% 1.64/1.16
% 1.64/1.16 tff(f21,plain,(
% 1.64/1.16 ? [X0 : $int] : (~p(X0) & q(X0)) => (~p(sK0) & q(sK0))),
% 1.64/1.16 introduced(choice_axiom,[])).
% 1.64/1.16
% 1.64/1.16 tff(f22,plain,(
% 1.64/1.16 (~p(sK0) & q(sK0)) & ! [X1 : $int] : ((($less(X1,12) & $less(8,X1)) | ~q(X1)) & (q(X1) | ~$less(X1,12) | ~$less(8,X1))) & ! [X2 : $int] : ((($less(X2,15) & $less(5,X2)) | ~p(X2)) & (p(X2) | ~$less(X2,15) | ~$less(5,X2)))),
% 1.64/1.16 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21])).
% 1.64/1.16
% 1.64/1.16 tff(f23,plain,(
% 1.64/1.16 ( ! [X2 : $int] : (p(X2) | ~$less(X2,15) | ~$less(5,X2)) )),
% 1.64/1.16 inference(cnf_transformation,[],[f22])).
% 1.64/1.16
% 1.64/1.16 tff(f27,plain,(
% 1.64/1.16 ( ! [X1 : $int] : ($less(8,X1) | ~q(X1)) )),
% 1.64/1.16 inference(cnf_transformation,[],[f22])).
% 1.64/1.16
% 1.64/1.16 tff(f28,plain,(
% 1.64/1.16 ( ! [X1 : $int] : ($less(X1,12) | ~q(X1)) )),
% 1.64/1.16 inference(cnf_transformation,[],[f22])).
% 1.64/1.16
% 1.64/1.16 tff(f29,plain,(
% 1.64/1.16 q(sK0)),
% 1.64/1.16 inference(cnf_transformation,[],[f22])).
% 1.64/1.16
% 1.64/1.16 tff(f30,plain,(
% 1.64/1.16 ~p(sK0)),
% 1.64/1.16 inference(cnf_transformation,[],[f22])).
% 1.64/1.16
% 1.64/1.16 cnf(c_54,plain,
% 1.64/1.16 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 1.64/1.16 inference(cnf_transformation,[],[f9])).
% 1.64/1.16
% 1.64/1.16 cnf(c_61,negated_conjecture,
% 1.64/1.16 (~p(sK0)),
% 1.64/1.16 inference(cnf_transformation,[],[f30])).
% 1.64/1.16
% 1.64/1.16 cnf(c_62,negated_conjecture,(q(sK0)),inference(cnf_transformation,[],[f29])).
% 1.64/1.16
% 1.64/1.16 cnf(c_63,negated_conjecture,
% 1.64/1.16 (~q(X0_3)|$less_int(X0_3,12)),
% 1.64/1.16 inference(cnf_transformation,[],[f28])).
% 1.64/1.16
% 1.64/1.16 cnf(c_64,negated_conjecture,
% 1.64/1.16 (~q(X0_3)|$less_int(8,X0_3)),
% 1.64/1.16 inference(cnf_transformation,[],[f27])).
% 1.64/1.16
% 1.64/1.16 cnf(c_68,negated_conjecture,
% 1.64/1.16 (~$less_int(X0_3,15)|~$less_int(5,X0_3)|p(X0_3)),
% 1.64/1.16 inference(cnf_transformation,[],[f23])).
% 1.64/1.16
% 1.64/1.16 cnf(c_71,plain,($less_int(5,8)),theory(arith)).
% 1.64/1.16
% 1.64/1.16 cnf(c_73,plain,($less_int(12,15)),theory(arith)).
% 1.64/1.16
% 1.64/1.16 cnf(c_95,plain,
% 1.64/1.16 (~q(X0_3)|$less_int(X0_3,12)),
% 1.64/1.16 inference(prop_impl_just,[status(thm)],[c_63])).
% 1.64/1.16
% 1.64/1.16 cnf(c_97,plain,
% 1.64/1.16 (~q(X0_3)|$less_int(8,X0_3)),
% 1.64/1.16 inference(prop_impl_just,[status(thm)],[c_64])).
% 1.64/1.16
% 1.64/1.16 cnf(c_290,plain,
% 1.64/1.16 (X0_3 != sK0|~$less_int(X0_3,15)|~$less_int(5,X0_3)),
% 1.64/1.16 inference(resolution_lifted,[status(thm)],[c_61,c_68])).
% 1.64/1.16
% 1.64/1.16 cnf(c_291,plain,
% 1.64/1.16 (~$less_int(sK0,15)|~$less_int(5,sK0)),
% 1.64/1.16 inference(unflattening,[status(thm)],[c_290])).
% 1.64/1.16
% 1.64/1.16 cnf(c_304,plain,
% 1.64/1.16 (X0_3 != sK0|$less_int(8,X0_3)),
% 1.64/1.16 inference(resolution_lifted,[status(thm)],[c_62,c_97])).
% 1.64/1.16
% 1.64/1.16 cnf(c_305,plain,
% 1.64/1.16 ($less_int(8,sK0)),
% 1.64/1.16 inference(unflattening,[status(thm)],[c_304])).
% 1.64/1.16
% 1.64/1.16 cnf(c_309,plain,
% 1.64/1.16 (X0_3 != sK0|$less_int(X0_3,12)),
% 1.64/1.16 inference(resolution_lifted,[status(thm)],[c_62,c_95])).
% 1.64/1.16
% 1.64/1.16 cnf(c_310,plain,
% 1.64/1.16 ($less_int(sK0,12)),
% 1.64/1.16 inference(unflattening,[status(thm)],[c_309])).
% 1.64/1.16
% 1.64/1.16 cnf(c_830,plain,
% 1.64/1.16 (~$less_int(12,X0_3)|$less_int(sK0,X0_3)),
% 1.64/1.16 inference(superposition,[status(thm)],[c_310,c_54])).
% 1.64/1.16
% 1.64/1.16 cnf(c_956,plain,
% 1.64/1.16 (~$less_int(X0_3,8)|~$less_int(8,sK0)|$less_int(X0_3,sK0)),
% 1.64/1.16 inference(instantiation,[status(thm)],[c_54])).
% 1.64/1.16
% 1.64/1.16 cnf(c_1040,plain,
% 1.64/1.16 ($less_int(sK0,15)),
% 1.64/1.16 inference(superposition,[status(thm)],[c_73,c_830])).
% 1.64/1.16
% 1.64/1.16 cnf(c_1073,plain,
% 1.64/1.16 (~$less_int(8,sK0)|~$less_int(5,8)|$less_int(5,sK0)),
% 1.64/1.16 inference(instantiation,[status(thm)],[c_956])).
% 1.64/1.16
% 1.64/1.16 cnf(c_1074,plain,
% 1.64/1.16 ($false),
% 1.64/1.16 inference(prop_impl_just,[status(thm)],[c_1073,c_1040,c_305,c_291,c_71])).
% 1.64/1.16
% 1.64/1.16
% 1.64/1.16 % SZS output end CNFRefutation for theBenchmark.p
% 1.64/1.16
% 1.64/1.16
%------------------------------------------------------------------------------