TSTP Solution File: DAT022_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT022_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 22:15:23 EDT 2023
% Result : Theorem 0.43s 1.14s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT022_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 14:39:10 EDT 2023
% 0.12/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 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.43/1.14 % SZS status Started for theBenchmark.p
% 0.43/1.14 % SZS status Theorem for theBenchmark.p
% 0.43/1.14
% 0.43/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.43/1.14
% 0.43/1.14 ------ iProver source info
% 0.43/1.14
% 0.43/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.43/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.43/1.14 git: non_committed_changes: false
% 0.43/1.14 git: last_make_outside_of_git: false
% 0.43/1.14
% 0.43/1.14 ------ Parsing...
% 0.43/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.14
% 0.43/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.43/1.14
% 0.43/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.14
% 0.43/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/1.14 ------ Proving...
% 0.43/1.14 ------ Problem Properties
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14 clauses 25
% 0.43/1.14 conjectures 4
% 0.43/1.14 EPR 10
% 0.43/1.14 Horn 21
% 0.43/1.14 unary 16
% 0.43/1.14 binary 5
% 0.43/1.14 lits 38
% 0.43/1.14 lits eq 10
% 0.43/1.14 fd_pure 0
% 0.43/1.14 fd_pseudo 0
% 0.43/1.14 fd_cond 0
% 0.43/1.14 fd_pseudo_cond 3
% 0.43/1.14 AC symbols 1
% 0.43/1.14
% 0.43/1.14 ------ Input Options Time Limit: Unbounded
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14 ------
% 0.43/1.14 Current options:
% 0.43/1.14 ------
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14 ------ Proving...
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14 % SZS status Theorem for theBenchmark.p
% 0.43/1.14
% 0.43/1.14 % SZS output start CNFRefutation for theBenchmark.p
% 0.43/1.14
% 0.43/1.14 tff(f4,axiom,(
% 0.43/1.14 ! [X5 : $int,X6 : collection,X7 : $int] : ((X5 = X7 | in(X5,X6)) <=> in(X5,add(X7,X6)))),
% 0.43/1.14 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4)).
% 0.43/1.14
% 0.43/1.14 tff(f5,axiom,(
% 0.43/1.14 ! [X8 : $int,X9 : collection,X10 : $int] : ((X8 != X10 & in(X8,X9)) <=> in(X8,remove(X10,X9)))),
% 0.43/1.14 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5)).
% 0.43/1.14
% 0.43/1.14 tff(f6,conjecture,(
% 0.43/1.14 ! [X0 : collection,X1 : collection] : ((add(2,remove(7,X1)) = X0 & ! [X2 : $int] : (in(X2,X1) => $greater(X2,0))) => ! [X3 : $int] : (in(X3,X0) => $greater(X3,0)))),
% 0.43/1.14 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 0.43/1.14
% 0.43/1.14 tff(f7,negated_conjecture,(
% 0.43/1.14 ~! [X0 : collection,X1 : collection] : ((add(2,remove(7,X1)) = X0 & ! [X2 : $int] : (in(X2,X1) => $greater(X2,0))) => ! [X3 : $int] : (in(X3,X0) => $greater(X3,0)))),
% 0.43/1.14 inference(negated_conjecture,[],[f6])).
% 0.43/1.14
% 0.43/1.14 tff(f8,plain,(
% 0.43/1.14 ~! [X0 : collection,X1 : collection] : ((add(2,remove(7,X1)) = X0 & ! [X2 : $int] : (in(X2,X1) => $less(0,X2))) => ! [X3 : $int] : (in(X3,X0) => $less(0,X3)))),
% 0.43/1.14 inference(theory_normalization,[],[f7])).
% 0.43/1.14
% 0.43/1.14 tff(f15,plain,(
% 0.43/1.14 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.43/1.14 introduced(theory_axiom_146,[])).
% 0.43/1.14
% 0.43/1.14 tff(f23,plain,(
% 0.43/1.14 ! [X0 : $int,X1 : collection,X2 : $int] : ((X0 = X2 | in(X0,X1)) <=> in(X0,add(X2,X1)))),
% 0.43/1.14 inference(rectify,[],[f4])).
% 0.43/1.14
% 0.43/1.14 tff(f24,plain,(
% 0.43/1.14 ! [X0 : $int,X1 : collection,X2 : $int] : ((X0 != X2 & in(X0,X1)) <=> in(X0,remove(X2,X1)))),
% 0.43/1.14 inference(rectify,[],[f5])).
% 0.43/1.14
% 0.43/1.14 tff(f25,plain,(
% 0.43/1.14 ? [X0 : collection,X1 : collection] : (? [X3 : $int] : (~$less(0,X3) & in(X3,X0)) & (add(2,remove(7,X1)) = X0 & ! [X2 : $int] : ($less(0,X2) | ~in(X2,X1))))),
% 0.43/1.14 inference(ennf_transformation,[],[f8])).
% 0.43/1.14
% 0.43/1.14 tff(f26,plain,(
% 0.43/1.14 ? [X0 : collection,X1 : collection] : (? [X3 : $int] : (~$less(0,X3) & in(X3,X0)) & add(2,remove(7,X1)) = X0 & ! [X2 : $int] : ($less(0,X2) | ~in(X2,X1)))),
% 0.43/1.14 inference(flattening,[],[f25])).
% 0.43/1.14
% 0.43/1.14 tff(f27,plain,(
% 0.43/1.14 ! [X0 : $int,X1 : collection,X2 : $int] : (((X0 = X2 | in(X0,X1)) | ~in(X0,add(X2,X1))) & (in(X0,add(X2,X1)) | (X0 != X2 & ~in(X0,X1))))),
% 0.43/1.14 inference(nnf_transformation,[],[f23])).
% 0.43/1.14
% 0.43/1.14 tff(f28,plain,(
% 0.43/1.14 ! [X0 : $int,X1 : collection,X2 : $int] : ((X0 = X2 | in(X0,X1) | ~in(X0,add(X2,X1))) & (in(X0,add(X2,X1)) | (X0 != X2 & ~in(X0,X1))))),
% 0.43/1.14 inference(flattening,[],[f27])).
% 0.43/1.14
% 0.43/1.14 tff(f29,plain,(
% 0.43/1.14 ! [X0 : $int,X1 : collection,X2 : $int] : (((X0 != X2 & in(X0,X1)) | ~in(X0,remove(X2,X1))) & (in(X0,remove(X2,X1)) | (X0 = X2 | ~in(X0,X1))))),
% 0.43/1.14 inference(nnf_transformation,[],[f24])).
% 0.43/1.14
% 0.43/1.14 tff(f30,plain,(
% 0.43/1.14 ! [X0 : $int,X1 : collection,X2 : $int] : (((X0 != X2 & in(X0,X1)) | ~in(X0,remove(X2,X1))) & (in(X0,remove(X2,X1)) | X0 = X2 | ~in(X0,X1)))),
% 0.43/1.14 inference(flattening,[],[f29])).
% 0.43/1.14
% 0.43/1.14 tff(f31,plain,(
% 0.43/1.14 ? [X0 : collection,X1 : collection] : (? [X2 : $int] : (~$less(0,X2) & in(X2,X0)) & add(2,remove(7,X1)) = X0 & ! [X3 : $int] : ($less(0,X3) | ~in(X3,X1)))),
% 0.43/1.14 inference(rectify,[],[f26])).
% 0.43/1.14
% 0.43/1.14 tff(f32,plain,(
% 0.43/1.14 ? [X0 : collection,X1 : collection] : (? [X2 : $int] : (~$less(0,X2) & in(X2,X0)) & add(2,remove(7,X1)) = X0 & ! [X3 : $int] : ($less(0,X3) | ~in(X3,X1))) => (? [X2 : $int] : (~$less(0,X2) & in(X2,sK0)) & sK0 = add(2,remove(7,sK1)) & ! [X3 : $int] : ($less(0,X3) | ~in(X3,sK1)))),
% 0.43/1.14 introduced(choice_axiom,[])).
% 0.43/1.14
% 0.43/1.14 tff(f33,plain,(
% 0.43/1.14 ? [X2 : $int] : (~$less(0,X2) & in(X2,sK0)) => (~$less(0,sK2) & in(sK2,sK0))),
% 0.43/1.14 introduced(choice_axiom,[])).
% 0.43/1.14
% 0.43/1.14 tff(f34,plain,(
% 0.43/1.14 (~$less(0,sK2) & in(sK2,sK0)) & sK0 = add(2,remove(7,sK1)) & ! [X3 : $int] : ($less(0,X3) | ~in(X3,sK1))),
% 0.43/1.14 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f31,f33,f32])).
% 0.43/1.14
% 0.43/1.14 tff(f40,plain,(
% 0.43/1.14 ( ! [X2 : $int,X0 : $int,X1 : collection] : (X0 = X2 | in(X0,X1) | ~in(X0,add(X2,X1))) )),
% 0.43/1.14 inference(cnf_transformation,[],[f28])).
% 0.43/1.14
% 0.43/1.14 tff(f42,plain,(
% 0.43/1.14 ( ! [X2 : $int,X0 : $int,X1 : collection] : (in(X0,X1) | ~in(X0,remove(X2,X1))) )),
% 0.43/1.14 inference(cnf_transformation,[],[f30])).
% 0.43/1.14
% 0.43/1.14 tff(f44,plain,(
% 0.43/1.14 ( ! [X3 : $int] : ($less(0,X3) | ~in(X3,sK1)) )),
% 0.43/1.14 inference(cnf_transformation,[],[f34])).
% 0.43/1.14
% 0.43/1.14 tff(f45,plain,(
% 0.43/1.14 sK0 = add(2,remove(7,sK1))),
% 0.43/1.14 inference(cnf_transformation,[],[f34])).
% 0.43/1.14
% 0.43/1.14 tff(f46,plain,(
% 0.43/1.14 in(sK2,sK0)),
% 0.43/1.14 inference(cnf_transformation,[],[f34])).
% 0.43/1.14
% 0.43/1.14 tff(f47,plain,(
% 0.43/1.14 ~$less(0,sK2)),
% 0.43/1.14 inference(cnf_transformation,[],[f34])).
% 0.43/1.14
% 0.43/1.14 cnf(c_54,plain,
% 0.43/1.14 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 0.43/1.14 inference(cnf_transformation,[],[f15])).
% 0.43/1.14
% 0.43/1.14 cnf(c_64,plain,
% 0.43/1.14 (~in(X0_3,add(X1_3,X0_13))|X0_3 = X1_3|in(X0_3,X0_13)),
% 0.43/1.14 inference(cnf_transformation,[],[f40])).
% 0.43/1.14
% 0.43/1.14 cnf(c_68,plain,
% 0.43/1.14 (~in(X0_3,remove(X1_3,X0_13))|in(X0_3,X0_13)),
% 0.43/1.14 inference(cnf_transformation,[],[f42])).
% 0.43/1.14
% 0.43/1.14 cnf(c_70,negated_conjecture,
% 0.43/1.14 (~$less_int(0,sK2)),
% 0.43/1.14 inference(cnf_transformation,[],[f47])).
% 0.43/1.14
% 0.43/1.14 cnf(c_71,negated_conjecture,
% 0.43/1.14 (in(sK2,sK0)),
% 0.43/1.14 inference(cnf_transformation,[],[f46])).
% 0.43/1.14
% 0.43/1.14 cnf(c_72,negated_conjecture,
% 0.43/1.14 (add(2,remove(7,sK1)) = sK0),
% 0.43/1.14 inference(cnf_transformation,[],[f45])).
% 0.43/1.14
% 0.43/1.14 cnf(c_73,negated_conjecture,
% 0.43/1.14 (~in(X0_3,sK1)|$less_int(0,X0_3)),
% 0.43/1.14 inference(cnf_transformation,[],[f44])).
% 0.43/1.14
% 0.43/1.14 cnf(c_74,plain,($less_int(0,1)),theory(arith)).
% 0.43/1.14
% 0.43/1.14 cnf(c_75,plain,($less_int(1,2)),theory(arith)).
% 0.43/1.14
% 0.43/1.14 cnf(c_1157,plain,
% 0.43/1.14 (~$less_int(1,X0_3)|$less_int(0,X0_3)),
% 0.43/1.14 inference(superposition,[status(thm)],[c_74,c_54])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1344,plain,
% 0.43/1.14 (~in(X0_3,sK0)|X0_3 = 2|in(X0_3,remove(7,sK1))),
% 0.43/1.14 inference(superposition,[status(thm)],[c_72,c_64])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1358,plain,
% 0.43/1.14 ($less_int(0,2)),
% 0.43/1.14 inference(superposition,[status(thm)],[c_75,c_1157])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1381,plain,
% 0.43/1.14 (~in(X0_3,sK0)|X0_3 = 2|in(X0_3,sK1)),
% 0.43/1.14 inference(superposition,[status(thm)],[c_1344,c_68])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1470,plain,
% 0.43/1.14 (sK2 = 2|in(sK2,sK1)),
% 0.43/1.14 inference(superposition,[status(thm)],[c_71,c_1381])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1478,plain,
% 0.43/1.14 (sK2 = 2|$less_int(0,sK2)),
% 0.43/1.14 inference(superposition,[status(thm)],[c_1470,c_73])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1479,plain,
% 0.43/1.14 (sK2 = 2),
% 0.43/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_1478,c_70])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1482,plain,
% 0.43/1.14 ($less_int(0,sK2)),
% 0.43/1.14 inference(demodulation,[status(thm)],[c_1358,c_1479])).
% 0.43/1.14
% 0.43/1.14 cnf(c_1487,plain,
% 0.43/1.14 ($false),
% 0.43/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_1482,c_70])).
% 0.43/1.14
% 0.43/1.14
% 0.43/1.14 % SZS output end CNFRefutation for theBenchmark.p
% 0.43/1.14
% 0.43/1.14
%------------------------------------------------------------------------------