TSTP Solution File: DAT045_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT045_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:17 EDT 2024
% Result : Theorem 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : DAT045_1 : TPTP v8.1.2. Released v5.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:03:33 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.48 Running TFA theorem proving
% 0.22/0.48 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
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sup_sim: 3 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.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 33
% 0.48/1.16 conjectures 9
% 0.48/1.16 EPR 6
% 0.48/1.16 Horn 27
% 0.48/1.16 unary 14
% 0.48/1.16 binary 15
% 0.48/1.16 lits 56
% 0.48/1.16 lits eq 21
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 1
% 0.48/1.16 fd_pseudo_cond 3
% 0.48/1.16 AC symbols 1
% 0.48/1.16
% 0.48/1.16 ------ Input Options Time Limit: Unbounded
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 tff(f8,axiom,(
% 0.48/1.16 ! [X13 : $int,X14 : collection] : (~in(X13,X14) <=> count(add(X13,X14)) = $sum(count(X14),1))),
% 0.48/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)).
% 0.48/1.16
% 0.48/1.16 tff(f13,conjecture,(
% 0.48/1.16 ! [X0 : collection,X1 : $int] : (! [X2 : $int] : (in(X2,X0) => $greater(X1,X2)) => $greater(count(add(X1,X0)),count(X0)))),
% 0.48/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 0.48/1.16
% 0.48/1.16 tff(f14,negated_conjecture,(
% 0.48/1.16 ~! [X0 : collection,X1 : $int] : (! [X2 : $int] : (in(X2,X0) => $greater(X1,X2)) => $greater(count(add(X1,X0)),count(X0)))),
% 0.48/1.16 inference(negated_conjecture,[],[f13])).
% 0.48/1.16
% 0.48/1.16 tff(f17,plain,(
% 0.48/1.16 ~! [X0 : collection,X1 : $int] : (! [X2 : $int] : (in(X2,X0) => $less(X2,X1)) => $less(count(X0),count(add(X1,X0))))),
% 0.48/1.16 inference(theory_normalization,[],[f14])).
% 0.48/1.16
% 0.48/1.16 tff(f23,plain,(
% 0.48/1.16 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.48/1.16 introduced(theory_axiom_145,[])).
% 0.48/1.16
% 0.48/1.16 tff(f27,plain,(
% 0.48/1.16 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 0.48/1.16 introduced(theory_axiom_150,[])).
% 0.48/1.16
% 0.48/1.16 tff(f36,plain,(
% 0.48/1.16 ! [X0 : $int,X1 : collection] : (~in(X0,X1) <=> count(add(X0,X1)) = $sum(count(X1),1))),
% 0.48/1.16 inference(rectify,[],[f8])).
% 0.48/1.16
% 0.48/1.16 tff(f42,plain,(
% 0.48/1.16 ? [X0 : collection,X1 : $int] : (~$less(count(X0),count(add(X1,X0))) & ! [X2 : $int] : ($less(X2,X1) | ~in(X2,X0)))),
% 0.48/1.16 inference(ennf_transformation,[],[f17])).
% 0.48/1.16
% 0.48/1.16 tff(f48,plain,(
% 0.48/1.16 ! [X0 : $int,X1 : collection] : ((~in(X0,X1) | count(add(X0,X1)) != $sum(count(X1),1)) & (count(add(X0,X1)) = $sum(count(X1),1) | in(X0,X1)))),
% 0.48/1.16 inference(nnf_transformation,[],[f36])).
% 0.48/1.16
% 0.48/1.16 tff(f52,plain,(
% 0.48/1.16 ? [X0 : collection,X1 : $int] : (~$less(count(X0),count(add(X1,X0))) & ! [X2 : $int] : ($less(X2,X1) | ~in(X2,X0))) => (~$less(count(sK0),count(add(sK1,sK0))) & ! [X2 : $int] : ($less(X2,sK1) | ~in(X2,sK0)))),
% 0.48/1.16 introduced(choice_axiom,[])).
% 0.48/1.16
% 0.48/1.16 tff(f53,plain,(
% 0.48/1.16 ~$less(count(sK0),count(add(sK1,sK0))) & ! [X2 : $int] : ($less(X2,sK1) | ~in(X2,sK0))),
% 0.48/1.16 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f42,f52])).
% 0.48/1.16
% 0.48/1.16 tff(f66,plain,(
% 0.48/1.16 ( ! [X0 : $int,X1 : collection] : (count(add(X0,X1)) = $sum(count(X1),1) | in(X0,X1)) )),
% 0.48/1.16 inference(cnf_transformation,[],[f48])).
% 0.48/1.16
% 0.48/1.16 tff(f75,plain,(
% 0.48/1.16 ( ! [X2 : $int] : ($less(X2,sK1) | ~in(X2,sK0)) )),
% 0.48/1.16 inference(cnf_transformation,[],[f53])).
% 0.48/1.16
% 0.48/1.16 tff(f76,plain,(
% 0.48/1.16 ~$less(count(sK0),count(add(sK1,sK0)))),
% 0.48/1.16 inference(cnf_transformation,[],[f53])).
% 0.48/1.16
% 0.48/1.16 cnf(c_51,plain,
% 0.48/1.16 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 0.48/1.16 inference(cnf_transformation,[],[f27])).
% 0.48/1.16
% 0.48/1.16 cnf(c_55,negated_conjecture,
% 0.48/1.16 (~$less_int(X0_3,X0_3)),
% 0.48/1.16 inference(cnf_transformation,[],[f23])).
% 0.48/1.16
% 0.48/1.16 cnf(c_74,plain,
% 0.48/1.16 (count(add(X0_3,X0_13)) = $sum_int(count(X0_13),1)|in(X0_3,X0_13)),
% 0.48/1.16 inference(cnf_transformation,[],[f66])).
% 0.48/1.16
% 0.48/1.16 cnf(c_82,negated_conjecture,
% 0.48/1.16 (~$less_int(count(sK0),count(add(sK1,sK0)))),
% 0.48/1.16 inference(cnf_transformation,[],[f76])).
% 0.48/1.16
% 0.48/1.16 cnf(c_83,negated_conjecture,
% 0.48/1.16 (~in(X0_3,sK0)|$less_int(X0_3,sK1)),
% 0.48/1.16 inference(cnf_transformation,[],[f75])).
% 0.48/1.16
% 0.48/1.16 cnf(c_719,plain,
% 0.48/1.16 (X0_3 != X1_3|X2_3 != X3_3|~$less_int(X1_3,X3_3)|$less_int(X0_3,X2_3)),
% 0.48/1.16 theory(equality)).
% 0.48/1.16
% 0.48/1.16 cnf(c_1352,plain,
% 0.48/1.16 ($less_int(X0_3,$sum_int(X0_3,1))),
% 0.48/1.16 inference(resolution,[status(thm)],[c_51,c_55])).
% 0.48/1.16
% 0.48/1.16 cnf(c_2029,plain,
% 0.48/1.16 (X0_3 != X1_3|~$less_int(X1_3,$sum_int(count(X0_13),1))|$less_int(X0_3,count(add(X2_3,X0_13)))|
% 0.48/1.16 in(X2_3,X0_13)),
% 0.48/1.16 inference(resolution,[status(thm)],[c_719,c_74])).
% 0.48/1.16
% 0.48/1.16 cnf(c_5877,plain,
% 0.48/1.16 (X0_3 != count(X0_13)|$less_int(X0_3,count(add(X1_3,X0_13)))|in(X1_3,X0_13)),
% 0.48/1.16 inference(resolution,[status(thm)],[c_2029,c_1352])).
% 0.48/1.16
% 0.48/1.16 cnf(c_5975,plain,
% 0.48/1.16 (count(sK0) != count(sK0)|in(sK1,sK0)),
% 0.48/1.16 inference(resolution,[status(thm)],[c_5877,c_82])).
% 0.48/1.16
% 0.48/1.16 cnf(c_5976,plain,
% 0.48/1.16 (in(sK1,sK0)),
% 0.48/1.16 inference(equality_resolution_simp,[status(thm)],[c_5975])).
% 0.48/1.16
% 0.48/1.16 cnf(c_6145,plain,
% 0.48/1.16 ($less_int(sK1,sK1)),
% 0.48/1.16 inference(resolution,[status(thm)],[c_83,c_5976])).
% 0.48/1.16
% 0.48/1.16 cnf(c_6147,plain,
% 0.48/1.16 ($false),
% 0.48/1.16 inference(forward_subsumption_resolution,[status(thm)],[c_6145,c_55])).
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS output end CNFRefutation for theBenchmark.p
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------