TSTP Solution File: DAT028_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT028_1 : TPTP v8.1.2. Released v5.0.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:14:14 EDT 2024
% Result : Theorem 3.53s 1.14s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT028_1 : TPTP v8.1.2. Released v5.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 18:38:05 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running TFA theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.53/1.14 % SZS status Started for theBenchmark.p
% 3.53/1.14 % SZS status Theorem for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.53/1.14
% 3.53/1.14 ------ iProver source info
% 3.53/1.14
% 3.53/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.53/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.53/1.14 git: non_committed_changes: false
% 3.53/1.14
% 3.53/1.14 ------ Parsing...
% 3.53/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.53/1.14
% 3.53/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
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.53/1.14 ------ Proving...
% 3.53/1.14 ------ Problem Properties
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 clauses 24
% 3.53/1.14 conjectures 5
% 3.53/1.14 EPR 8
% 3.53/1.14 Horn 20
% 3.53/1.14 unary 13
% 3.53/1.14 binary 7
% 3.53/1.14 lits 39
% 3.53/1.14 lits eq 9
% 3.53/1.14 fd_pure 0
% 3.53/1.14 fd_pseudo 0
% 3.53/1.14 fd_cond 0
% 3.53/1.14 fd_pseudo_cond 3
% 3.53/1.14 AC symbols 1
% 3.53/1.14
% 3.53/1.14 ------ Input Options Time Limit: Unbounded
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------
% 3.53/1.14 Current options:
% 3.53/1.14 ------
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------ Proving...
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 % SZS status Theorem for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 % SZS output start CNFRefutation for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 tff(f6,conjecture,(
% 3.53/1.14 ! [X0 : collection,X1 : collection] : ((! [X3 : $int] : (in(X3,X0) => ? [X4 : $int] : ($greater(X3,X4) & in(X4,X1))) & ! [X2 : $int] : (in(X2,X1) => $greater(X2,0))) => ! [X5 : $int] : (in(X5,X0) => $greater(X5,1)))),
% 3.53/1.14 file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)).
% 3.53/1.14
% 3.53/1.14 tff(f7,negated_conjecture,(
% 3.53/1.14 ~! [X0 : collection,X1 : collection] : ((! [X3 : $int] : (in(X3,X0) => ? [X4 : $int] : ($greater(X3,X4) & in(X4,X1))) & ! [X2 : $int] : (in(X2,X1) => $greater(X2,0))) => ! [X5 : $int] : (in(X5,X0) => $greater(X5,1)))),
% 3.53/1.14 inference(negated_conjecture,[],[f6])).
% 3.53/1.14
% 3.53/1.14 tff(f8,plain,(
% 3.53/1.14 ~! [X0 : collection,X1 : collection] : ((! [X3 : $int] : (in(X3,X0) => ? [X4 : $int] : ($less(X4,X3) & in(X4,X1))) & ! [X2 : $int] : (in(X2,X1) => $less(0,X2))) => ! [X5 : $int] : (in(X5,X0) => $less(1,X5)))),
% 3.53/1.14 inference(theory_normalization,[],[f7])).
% 3.53/1.14
% 3.53/1.14 tff(f9,plain,(
% 3.53/1.14 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 3.53/1.14 introduced(theory_axiom_138,[])).
% 3.53/1.14
% 3.53/1.14 tff(f11,plain,(
% 3.53/1.14 ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 3.53/1.14 introduced(theory_axiom_140,[])).
% 3.53/1.14
% 3.53/1.14 tff(f15,plain,(
% 3.53/1.14 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 3.53/1.14 introduced(theory_axiom_146,[])).
% 3.53/1.14
% 3.53/1.14 tff(f16,plain,(
% 3.53/1.14 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 3.53/1.14 introduced(theory_axiom_147,[])).
% 3.53/1.14
% 3.53/1.14 tff(f20,plain,(
% 3.53/1.14 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,$sum(X0,1))) )),
% 3.53/1.14 introduced(theory_axiom_164,[])).
% 3.53/1.14
% 3.53/1.14 tff(f25,plain,(
% 3.53/1.14 ~! [X0 : collection,X1 : collection] : ((! [X2 : $int] : (in(X2,X0) => ? [X3 : $int] : ($less(X3,X2) & in(X3,X1))) & ! [X4 : $int] : (in(X4,X1) => $less(0,X4))) => ! [X5 : $int] : (in(X5,X0) => $less(1,X5)))),
% 3.53/1.14 inference(rectify,[],[f8])).
% 3.53/1.14
% 3.53/1.14 tff(f26,plain,(
% 3.53/1.14 ? [X0 : collection,X1 : collection] : (? [X5 : $int] : (~$less(1,X5) & in(X5,X0)) & (! [X2 : $int] : (? [X3 : $int] : ($less(X3,X2) & in(X3,X1)) | ~in(X2,X0)) & ! [X4 : $int] : ($less(0,X4) | ~in(X4,X1))))),
% 3.53/1.14 inference(ennf_transformation,[],[f25])).
% 3.53/1.14
% 3.53/1.14 tff(f27,plain,(
% 3.53/1.14 ? [X0 : collection,X1 : collection] : (? [X5 : $int] : (~$less(1,X5) & in(X5,X0)) & ! [X2 : $int] : (? [X3 : $int] : ($less(X3,X2) & in(X3,X1)) | ~in(X2,X0)) & ! [X4 : $int] : ($less(0,X4) | ~in(X4,X1)))),
% 3.53/1.14 inference(flattening,[],[f26])).
% 3.53/1.14
% 3.53/1.14 tff(f32,plain,(
% 3.53/1.14 ? [X0 : collection,X1 : collection] : (? [X2 : $int] : (~$less(1,X2) & in(X2,X0)) & ! [X3 : $int] : (? [X4 : $int] : ($less(X4,X3) & in(X4,X1)) | ~in(X3,X0)) & ! [X5 : $int] : ($less(0,X5) | ~in(X5,X1)))),
% 3.53/1.14 inference(rectify,[],[f27])).
% 3.53/1.14
% 3.53/1.14 tff(f33,plain,(
% 3.53/1.14 ? [X0 : collection,X1 : collection] : (? [X2 : $int] : (~$less(1,X2) & in(X2,X0)) & ! [X3 : $int] : (? [X4 : $int] : ($less(X4,X3) & in(X4,X1)) | ~in(X3,X0)) & ! [X5 : $int] : ($less(0,X5) | ~in(X5,X1))) => (? [X2 : $int] : (~$less(1,X2) & in(X2,sK0)) & ! [X3 : $int] : (? [X4 : $int] : ($less(X4,X3) & in(X4,sK1)) | ~in(X3,sK0)) & ! [X5 : $int] : ($less(0,X5) | ~in(X5,sK1)))),
% 3.53/1.14 introduced(choice_axiom,[])).
% 3.53/1.14
% 3.53/1.14 tff(f34,plain,(
% 3.53/1.14 ? [X2 : $int] : (~$less(1,X2) & in(X2,sK0)) => (~$less(1,sK2) & in(sK2,sK0))),
% 3.53/1.14 introduced(choice_axiom,[])).
% 3.53/1.14
% 3.53/1.14 tff(f35,plain,(
% 3.53/1.14 ! [X3 : $int] : (? [X4 : $int] : ($less(X4,X3) & in(X4,sK1)) => ($less(sK3(X3),X3) & in(sK3(X3),sK1)))),
% 3.53/1.14 introduced(choice_axiom,[])).
% 3.53/1.14
% 3.53/1.14 tff(f36,plain,(
% 3.53/1.14 (~$less(1,sK2) & in(sK2,sK0)) & ! [X3 : $int] : (($less(sK3(X3),X3) & in(sK3(X3),sK1)) | ~in(X3,sK0)) & ! [X5 : $int] : ($less(0,X5) | ~in(X5,sK1))),
% 3.53/1.14 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f32,f35,f34,f33])).
% 3.53/1.14
% 3.53/1.14 tff(f46,plain,(
% 3.53/1.14 ( ! [X5 : $int] : ($less(0,X5) | ~in(X5,sK1)) )),
% 3.53/1.14 inference(cnf_transformation,[],[f36])).
% 3.53/1.14
% 3.53/1.14 tff(f47,plain,(
% 3.53/1.14 ( ! [X3 : $int] : (in(sK3(X3),sK1) | ~in(X3,sK0)) )),
% 3.53/1.14 inference(cnf_transformation,[],[f36])).
% 3.53/1.14
% 3.53/1.14 tff(f48,plain,(
% 3.53/1.14 ( ! [X3 : $int] : ($less(sK3(X3),X3) | ~in(X3,sK0)) )),
% 3.53/1.14 inference(cnf_transformation,[],[f36])).
% 3.53/1.14
% 3.53/1.14 tff(f49,plain,(
% 3.53/1.14 in(sK2,sK0)),
% 3.53/1.14 inference(cnf_transformation,[],[f36])).
% 3.53/1.14
% 3.53/1.14 tff(f50,plain,(
% 3.53/1.14 ~$less(1,sK2)),
% 3.53/1.14 inference(cnf_transformation,[],[f36])).
% 3.53/1.14
% 3.53/1.14 cnf(c_49,plain,
% 3.53/1.14 (~$less_int(X0_3,$sum_int(X1_3,1))|~$less_int(X1_3,X0_3)),
% 3.53/1.14 inference(cnf_transformation,[],[f20])).
% 3.53/1.14
% 3.53/1.14 cnf(c_53,plain,
% 3.53/1.14 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 3.53/1.14 inference(cnf_transformation,[],[f16])).
% 3.53/1.14
% 3.53/1.14 cnf(c_54,plain,
% 3.53/1.14 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 3.53/1.14 inference(cnf_transformation,[],[f15])).
% 3.53/1.14
% 3.53/1.14 cnf(c_58,plain,
% 3.53/1.14 ($sum_int(X0_3,0) = X0_3),
% 3.53/1.14 inference(cnf_transformation,[],[f11])).
% 3.53/1.14
% 3.53/1.14 cnf(c_60,plain,
% 3.53/1.14 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 3.53/1.14 inference(cnf_transformation,[],[f9])).
% 3.53/1.14
% 3.53/1.14 cnf(c_70,negated_conjecture,
% 3.53/1.14 (~$less_int(1,sK2)),
% 3.53/1.14 inference(cnf_transformation,[],[f50])).
% 3.53/1.14
% 3.53/1.14 cnf(c_71,negated_conjecture,
% 3.53/1.14 (in(sK2,sK0)),
% 3.53/1.14 inference(cnf_transformation,[],[f49])).
% 3.53/1.14
% 3.53/1.14 cnf(c_72,negated_conjecture,
% 3.53/1.14 (~in(X0_3,sK0)|$less_int(sK3(X0_3),X0_3)),
% 3.53/1.14 inference(cnf_transformation,[],[f48])).
% 3.53/1.14
% 3.53/1.14 cnf(c_73,negated_conjecture,
% 3.53/1.14 (~in(X0_3,sK0)|in(sK3(X0_3),sK1)),
% 3.53/1.14 inference(cnf_transformation,[],[f47])).
% 3.53/1.14
% 3.53/1.14 cnf(c_74,negated_conjecture,
% 3.53/1.14 (~in(X0_3,sK1)|$less_int(0,X0_3)),
% 3.53/1.14 inference(cnf_transformation,[],[f46])).
% 3.53/1.14
% 3.53/1.14 cnf(c_897,plain,
% 3.53/1.14 (~in(X0_3,sK0)|$less_int(0,sK3(X0_3))),
% 3.53/1.14 inference(superposition,[status(thm)],[c_73,c_74])).
% 3.53/1.14
% 3.53/1.14 cnf(c_920,plain,
% 3.53/1.14 ($sum_int(0,X0_3) = X0_3),
% 3.53/1.14 inference(superposition,[status(thm)],[c_60,c_58])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1004,plain,
% 3.53/1.14 (~$less_int(X0_3,1)|~$less_int(0,X0_3)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_920,c_49])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1028,plain,
% 3.53/1.14 (sK2 = 1|$less_int(sK2,1)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_53,c_70])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1049,plain,
% 3.53/1.14 (~$less_int(sK3(X0_3),1)|~in(X0_3,sK0)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_897,c_1004])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1100,plain,
% 3.53/1.14 (~in(1,sK0)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_72,c_1049])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1174,plain,
% 3.53/1.14 (~$less_int(X0_3,X1_3)|~in(X0_3,sK0)|$less_int(sK3(X0_3),X1_3)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_72,c_54])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1377,plain,
% 3.53/1.14 (~$less_int(X0_3,1)|~in(X0_3,sK0)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_1174,c_1049])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1425,plain,
% 3.53/1.14 (~$less_int(sK2,1)),
% 3.53/1.14 inference(superposition,[status(thm)],[c_71,c_1377])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1426,plain,
% 3.53/1.14 (sK2 = 1),
% 3.53/1.14 inference(backward_subsumption_resolution,[status(thm)],[c_1028,c_1425])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1428,plain,
% 3.53/1.14 (in(1,sK0)),
% 3.53/1.14 inference(demodulation,[status(thm)],[c_71,c_1426])).
% 3.53/1.14
% 3.53/1.14 cnf(c_1429,plain,
% 3.53/1.14 ($false),
% 3.53/1.14 inference(forward_subsumption_resolution,[status(thm)],[c_1428,c_1100])).
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 % SZS output end CNFRefutation for theBenchmark.p
% 3.53/1.14
% 3.53/1.14
%------------------------------------------------------------------------------