TSTP Solution File: ARI621_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI621_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:23 EDT 2024
% Result : Theorem 1.45s 1.12s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : ARI621_1 : TPTP v8.1.2. Released v5.1.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n007.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri May 3 01:00:20 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running TFA theorem proving
% 0.17/0.43 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
% 1.45/1.12 % SZS status Started for theBenchmark.p
% 1.45/1.12 % SZS status Theorem for theBenchmark.p
% 1.45/1.12
% 1.45/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.45/1.12
% 1.45/1.12 ------ iProver source info
% 1.45/1.12
% 1.45/1.12 git: date: 2024-05-02 19:28:25 +0000
% 1.45/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.45/1.12 git: non_committed_changes: false
% 1.45/1.12
% 1.45/1.12 ------ Parsing...
% 1.45/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.45/1.12
% 1.45/1.12 ------ Preprocessing... sup_sim: 2 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
% 1.45/1.12
% 1.45/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.45/1.12
% 1.45/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.45/1.12 ------ Proving...
% 1.45/1.12 ------ Problem Properties
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12 clauses 26
% 1.45/1.12 conjectures 5
% 1.45/1.12 EPR 9
% 1.45/1.12 Horn 20
% 1.45/1.12 unary 17
% 1.45/1.12 binary 2
% 1.45/1.12 lits 42
% 1.45/1.12 lits eq 19
% 1.45/1.12 fd_pure 0
% 1.45/1.12 fd_pseudo 0
% 1.45/1.12 fd_cond 2
% 1.45/1.12 fd_pseudo_cond 2
% 1.45/1.12 AC symbols 2
% 1.45/1.12
% 1.45/1.12 ------ Input Options Time Limit: Unbounded
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12 ------
% 1.45/1.12 Current options:
% 1.45/1.12 ------
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12 ------ Proving...
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12 % SZS status Theorem for theBenchmark.p
% 1.45/1.12
% 1.45/1.12 % SZS output start CNFRefutation for theBenchmark.p
% 1.45/1.12
% 1.45/1.12 tff(f1,conjecture,(
% 1.45/1.12 ! [X0 : $int] : (pow2(X0) <=> ((? [X1 : $int] : (pow2(X1) & $product(2,X1) = X0) & $lesseq(2,X0)) | 1 = X0)) => ~pow2(12)),
% 1.45/1.12 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_pow_of_2_10)).
% 1.45/1.12
% 1.45/1.12 tff(f2,negated_conjecture,(
% 1.45/1.12 ~(! [X0 : $int] : (pow2(X0) <=> ((? [X1 : $int] : (pow2(X1) & $product(2,X1) = X0) & $lesseq(2,X0)) | 1 = X0)) => ~pow2(12))),
% 1.45/1.12 inference(negated_conjecture,[],[f1])).
% 1.45/1.12
% 1.45/1.12 tff(f3,plain,(
% 1.45/1.12 ~(! [X0 : $int] : (pow2(X0) <=> ((? [X1 : $int] : (pow2(X1) & $product(2,X1) = X0) & ~$less(X0,2)) | 1 = X0)) => ~pow2(12))),
% 1.45/1.12 inference(theory_normalization,[],[f2])).
% 1.45/1.12
% 1.45/1.12 tff(f22,plain,(
% 1.45/1.12 pow2(12) & ! [X0 : $int] : (pow2(X0) <=> ((? [X1 : $int] : (pow2(X1) & $product(2,X1) = X0) & ~$less(X0,2)) | 1 = X0))),
% 1.45/1.12 inference(ennf_transformation,[],[f3])).
% 1.45/1.12
% 1.45/1.12 tff(f23,plain,(
% 1.45/1.12 pow2(12) & ! [X0 : $int] : ((pow2(X0) | ((! [X1 : $int] : (~pow2(X1) | $product(2,X1) != X0) | $less(X0,2)) & 1 != X0)) & (((? [X1 : $int] : (pow2(X1) & $product(2,X1) = X0) & ~$less(X0,2)) | 1 = X0) | ~pow2(X0)))),
% 1.45/1.12 inference(nnf_transformation,[],[f22])).
% 1.45/1.12
% 1.45/1.12 tff(f24,plain,(
% 1.45/1.12 pow2(12) & ! [X0 : $int] : ((pow2(X0) | ((! [X1 : $int] : (~pow2(X1) | $product(2,X1) != X0) | $less(X0,2)) & 1 != X0)) & ((? [X1 : $int] : (pow2(X1) & $product(2,X1) = X0) & ~$less(X0,2)) | 1 = X0 | ~pow2(X0)))),
% 1.45/1.12 inference(flattening,[],[f23])).
% 1.45/1.12
% 1.45/1.12 tff(f25,plain,(
% 1.45/1.12 pow2(12) & ! [X0 : $int] : ((pow2(X0) | ((! [X1 : $int] : (~pow2(X1) | $product(2,X1) != X0) | $less(X0,2)) & 1 != X0)) & ((? [X2 : $int] : (pow2(X2) & $product(2,X2) = X0) & ~$less(X0,2)) | 1 = X0 | ~pow2(X0)))),
% 1.45/1.12 inference(rectify,[],[f24])).
% 1.45/1.12
% 1.45/1.12 tff(f26,plain,(
% 1.45/1.12 ! [X0 : $int] : (? [X2 : $int] : (pow2(X2) & $product(2,X2) = X0) => (pow2(sK0(X0)) & $product(2,sK0(X0)) = X0))),
% 1.45/1.12 introduced(choice_axiom,[])).
% 1.45/1.12
% 1.45/1.12 tff(f27,plain,(
% 1.45/1.12 pow2(12) & ! [X0 : $int] : ((pow2(X0) | ((! [X1 : $int] : (~pow2(X1) | $product(2,X1) != X0) | $less(X0,2)) & 1 != X0)) & (((pow2(sK0(X0)) & $product(2,sK0(X0)) = X0) & ~$less(X0,2)) | 1 = X0 | ~pow2(X0)))),
% 1.45/1.12 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26])).
% 1.45/1.12
% 1.45/1.12 tff(f29,plain,(
% 1.45/1.12 ( ! [X0 : $int] : ($product(2,sK0(X0)) = X0 | 1 = X0 | ~pow2(X0)) )),
% 1.45/1.12 inference(cnf_transformation,[],[f27])).
% 1.45/1.12
% 1.45/1.12 tff(f30,plain,(
% 1.45/1.12 ( ! [X0 : $int] : (pow2(sK0(X0)) | 1 = X0 | ~pow2(X0)) )),
% 1.45/1.12 inference(cnf_transformation,[],[f27])).
% 1.45/1.12
% 1.45/1.12 tff(f33,plain,(
% 1.45/1.12 pow2(12)),
% 1.45/1.12 inference(cnf_transformation,[],[f27])).
% 1.45/1.12
% 1.45/1.12 cnf(c_67,negated_conjecture,
% 1.45/1.12 (pow2(12)),
% 1.45/1.12 inference(cnf_transformation,[],[f33])).
% 1.45/1.12
% 1.45/1.12 cnf(c_70,negated_conjecture,
% 1.45/1.12 (~pow2(X0_3)|X0_3 = 1|pow2(sK0(X0_3))),
% 1.45/1.12 inference(cnf_transformation,[],[f30])).
% 1.45/1.12
% 1.45/1.12 cnf(c_71,negated_conjecture,
% 1.45/1.12 (~pow2(X0_3)|$product_int(2,sK0(X0_3)) = X0_3|X0_3 = 1),
% 1.45/1.12 inference(cnf_transformation,[],[f29])).
% 1.45/1.12
% 1.45/1.12 cnf(c_864,plain,
% 1.45/1.12 ($product_int(2,sK0(12)) = 12|1 = 12),
% 1.45/1.12 inference(superposition,[status(thm)],[c_67,c_71])).
% 1.45/1.12
% 1.45/1.12 cnf(c_885,plain,
% 1.45/1.12 (sK0(12) = 6),
% 1.45/1.12 inference(smt_theory_normalisation,[status(thm)],[c_864])).
% 1.45/1.12
% 1.45/1.12 cnf(c_886,plain,
% 1.45/1.12 (~pow2(12)|1 = 12|pow2(6)),
% 1.45/1.12 inference(superposition,[status(thm)],[c_885,c_70])).
% 1.45/1.12
% 1.45/1.12 cnf(c_887,plain,
% 1.45/1.12 (1 = 12|pow2(6)),
% 1.45/1.12 inference(forward_subsumption_resolution,[status(thm)],[c_886,c_67])).
% 1.45/1.12
% 1.45/1.12 cnf(c_890,plain,
% 1.45/1.12 (pow2(6)),
% 1.45/1.12 inference(smt_theory_normalisation,[status(thm)],[c_887])).
% 1.45/1.12
% 1.45/1.12 cnf(c_891,plain,
% 1.45/1.12 ($product_int(2,sK0(6)) = 6|1 = 6),
% 1.45/1.12 inference(superposition,[status(thm)],[c_890,c_71])).
% 1.45/1.12
% 1.45/1.12 cnf(c_901,plain,
% 1.45/1.12 (sK0(6) = 3),
% 1.45/1.12 inference(smt_theory_normalisation,[status(thm)],[c_891])).
% 1.45/1.12
% 1.45/1.12 cnf(c_902,plain,
% 1.45/1.12 (~pow2(6)|1 = 6|pow2(3)),
% 1.45/1.12 inference(superposition,[status(thm)],[c_901,c_70])).
% 1.45/1.12
% 1.45/1.12 cnf(c_903,plain,
% 1.45/1.12 (1 = 6|pow2(3)),
% 1.45/1.12 inference(forward_subsumption_resolution,[status(thm)],[c_902,c_890])).
% 1.45/1.12
% 1.45/1.12 cnf(c_1132,plain,
% 1.45/1.12 (pow2(3)),
% 1.45/1.12 inference(smt_theory_normalisation,[status(thm)],[c_903])).
% 1.45/1.12
% 1.45/1.12 cnf(c_1137,plain,
% 1.45/1.12 ($product_int(2,sK0(3)) = 3|1 = 3),
% 1.45/1.12 inference(superposition,[status(thm)],[c_1132,c_71])).
% 1.45/1.12
% 1.45/1.12 cnf(c_1192,plain,
% 1.45/1.12 ($false),
% 1.45/1.12 inference(smt_theory_normalisation,[status(thm)],[c_1137])).
% 1.45/1.12
% 1.45/1.12
% 1.45/1.12 % SZS output end CNFRefutation for theBenchmark.p
% 1.45/1.12
% 1.45/1.12
%------------------------------------------------------------------------------