TSTP Solution File: DAT024_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT024_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:13 EDT 2024
% Result : Theorem 3.51s 0.99s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : DAT024_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.09 % Command : run_iprover %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Thu May 2 18:52:23 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.12/0.36 Running TFA theorem proving
% 0.12/0.36 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
% 3.51/0.99 % SZS status Started for theBenchmark.p
% 3.51/0.99 % SZS status Theorem for theBenchmark.p
% 3.51/0.99
% 3.51/0.99 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.51/0.99
% 3.51/0.99 ------ iProver source info
% 3.51/0.99
% 3.51/0.99 git: date: 2024-05-02 19:28:25 +0000
% 3.51/0.99 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.51/0.99 git: non_committed_changes: false
% 3.51/0.99
% 3.51/0.99 ------ Parsing...
% 3.51/0.99 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.51/0.99
% 3.51/0.99 ------ 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.51/0.99
% 3.51/0.99 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.51/0.99
% 3.51/0.99 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.51/0.99 ------ Proving...
% 3.51/0.99 ------ Problem Properties
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99 clauses 25
% 3.51/0.99 conjectures 5
% 3.51/0.99 EPR 11
% 3.51/0.99 Horn 21
% 3.51/0.99 unary 16
% 3.51/0.99 binary 5
% 3.51/0.99 lits 38
% 3.51/0.99 lits eq 9
% 3.51/0.99 fd_pure 0
% 3.51/0.99 fd_pseudo 0
% 3.51/0.99 fd_cond 0
% 3.51/0.99 fd_pseudo_cond 3
% 3.51/0.99 AC symbols 1
% 3.51/0.99
% 3.51/0.99 ------ Input Options Time Limit: Unbounded
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99 ------
% 3.51/0.99 Current options:
% 3.51/0.99 ------
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99 ------ Proving...
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99 % SZS status Theorem for theBenchmark.p
% 3.51/0.99
% 3.51/0.99 % SZS output start CNFRefutation for theBenchmark.p
% 3.51/0.99
% 3.51/0.99 tff(f6,conjecture,(
% 3.51/0.99 ! [X0 : collection] : ((~in(1,X0) & ~in(0,X0) & ! [X1 : $int] : (in(X1,X0) => $greatereq(X1,0))) => ! [X2 : $int] : (in(X2,X0) => $greatereq(X2,2)))),
% 3.51/0.99 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 3.51/0.99
% 3.51/0.99 tff(f7,negated_conjecture,(
% 3.51/0.99 ~! [X0 : collection] : ((~in(1,X0) & ~in(0,X0) & ! [X1 : $int] : (in(X1,X0) => $greatereq(X1,0))) => ! [X2 : $int] : (in(X2,X0) => $greatereq(X2,2)))),
% 3.51/0.99 inference(negated_conjecture,[],[f6])).
% 3.51/0.99
% 3.51/0.99 tff(f8,plain,(
% 3.51/0.99 ~! [X0 : collection] : ((~in(1,X0) & ~in(0,X0) & ! [X1 : $int] : (in(X1,X0) => ~$less(X1,0))) => ! [X2 : $int] : (in(X2,X0) => ~$less(X2,2)))),
% 3.51/0.99 inference(theory_normalization,[],[f7])).
% 3.51/0.99
% 3.51/0.99 tff(f9,plain,(
% 3.51/0.99 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 3.51/0.99 introduced(theory_axiom_138,[])).
% 3.51/0.99
% 3.51/0.99 tff(f13,plain,(
% 3.51/0.99 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 3.51/0.99 introduced(theory_axiom_143,[])).
% 3.51/0.99
% 3.51/0.99 tff(f14,plain,(
% 3.51/0.99 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 3.51/0.99 introduced(theory_axiom_145,[])).
% 3.51/0.99
% 3.51/0.99 tff(f15,plain,(
% 3.51/0.99 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 3.51/0.99 introduced(theory_axiom_146,[])).
% 3.51/0.99
% 3.51/0.99 tff(f16,plain,(
% 3.51/0.99 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 3.51/0.99 introduced(theory_axiom_147,[])).
% 3.51/0.99
% 3.51/0.99 tff(f18,plain,(
% 3.51/0.99 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 3.51/0.99 introduced(theory_axiom_150,[])).
% 3.51/0.99
% 3.51/0.99 tff(f25,plain,(
% 3.51/0.99 ? [X0 : collection] : (? [X2 : $int] : ($less(X2,2) & in(X2,X0)) & (~in(1,X0) & ~in(0,X0) & ! [X1 : $int] : (~$less(X1,0) | ~in(X1,X0))))),
% 3.51/0.99 inference(ennf_transformation,[],[f8])).
% 3.51/0.99
% 3.51/0.99 tff(f26,plain,(
% 3.51/0.99 ? [X0 : collection] : (? [X2 : $int] : ($less(X2,2) & in(X2,X0)) & ~in(1,X0) & ~in(0,X0) & ! [X1 : $int] : (~$less(X1,0) | ~in(X1,X0)))),
% 3.51/0.99 inference(flattening,[],[f25])).
% 3.51/0.99
% 3.51/0.99 tff(f31,plain,(
% 3.51/0.99 ? [X0 : collection] : (? [X1 : $int] : ($less(X1,2) & in(X1,X0)) & ~in(1,X0) & ~in(0,X0) & ! [X2 : $int] : (~$less(X2,0) | ~in(X2,X0)))),
% 3.51/0.99 inference(rectify,[],[f26])).
% 3.51/0.99
% 3.51/0.99 tff(f32,plain,(
% 3.51/0.99 ? [X0 : collection] : (? [X1 : $int] : ($less(X1,2) & in(X1,X0)) & ~in(1,X0) & ~in(0,X0) & ! [X2 : $int] : (~$less(X2,0) | ~in(X2,X0))) => (? [X1 : $int] : ($less(X1,2) & in(X1,sK0)) & ~in(1,sK0) & ~in(0,sK0) & ! [X2 : $int] : (~$less(X2,0) | ~in(X2,sK0)))),
% 3.51/0.99 introduced(choice_axiom,[])).
% 3.51/0.99
% 3.51/0.99 tff(f33,plain,(
% 3.51/0.99 ? [X1 : $int] : ($less(X1,2) & in(X1,sK0)) => ($less(sK1,2) & in(sK1,sK0))),
% 3.51/0.99 introduced(choice_axiom,[])).
% 3.51/0.99
% 3.51/0.99 tff(f34,plain,(
% 3.51/0.99 ($less(sK1,2) & in(sK1,sK0)) & ~in(1,sK0) & ~in(0,sK0) & ! [X2 : $int] : (~$less(X2,0) | ~in(X2,sK0))),
% 3.51/0.99 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f33,f32])).
% 3.51/0.99
% 3.51/0.99 tff(f44,plain,(
% 3.51/0.99 ( ! [X2 : $int] : (~$less(X2,0) | ~in(X2,sK0)) )),
% 3.51/0.99 inference(cnf_transformation,[],[f34])).
% 3.51/0.99
% 3.51/0.99 tff(f45,plain,(
% 3.51/0.99 ~in(0,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f34])).
% 3.51/0.99
% 3.51/0.99 tff(f46,plain,(
% 3.51/0.99 ~in(1,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f34])).
% 3.51/0.99
% 3.51/0.99 tff(f47,plain,(
% 3.51/0.99 in(sK1,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f34])).
% 3.51/0.99
% 3.51/0.99 tff(f48,plain,(
% 3.51/0.99 $less(sK1,2)),
% 3.51/0.99 inference(cnf_transformation,[],[f34])).
% 3.51/0.99
% 3.51/0.99 cnf(c_51,plain,
% 3.51/0.99 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 3.51/0.99 inference(cnf_transformation,[],[f18])).
% 3.51/0.99
% 3.51/0.99 cnf(c_53,plain,
% 3.51/0.99 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 3.51/0.99 inference(cnf_transformation,[],[f16])).
% 3.51/0.99
% 3.51/0.99 cnf(c_54,plain,
% 3.51/0.99 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 3.51/0.99 inference(cnf_transformation,[],[f15])).
% 3.51/0.99
% 3.51/0.99 cnf(c_55,plain,
% 3.51/0.99 (~$less_int(X0_3,X0_3)),
% 3.51/0.99 inference(cnf_transformation,[],[f14])).
% 3.51/0.99
% 3.51/0.99 cnf(c_56,plain,
% 3.51/0.99 ($sum_int(X0_3,$uminus_int(X0_3)) = 0),
% 3.51/0.99 inference(cnf_transformation,[],[f13])).
% 3.51/0.99
% 3.51/0.99 cnf(c_60,plain,
% 3.51/0.99 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 3.51/0.99 inference(cnf_transformation,[],[f9])).
% 3.51/0.99
% 3.51/0.99 cnf(c_70,negated_conjecture,
% 3.51/0.99 ($less_int(sK1,2)),
% 3.51/0.99 inference(cnf_transformation,[],[f48])).
% 3.51/0.99
% 3.51/0.99 cnf(c_71,negated_conjecture,
% 3.51/0.99 (in(sK1,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f47])).
% 3.51/0.99
% 3.51/0.99 cnf(c_72,negated_conjecture,
% 3.51/0.99 (~in(1,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f46])).
% 3.51/0.99
% 3.51/0.99 cnf(c_73,negated_conjecture,
% 3.51/0.99 (~in(0,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f45])).
% 3.51/0.99
% 3.51/0.99 cnf(c_74,negated_conjecture,
% 3.51/0.99 (~$less_int(X0_3,0)|~in(X0_3,sK0)),
% 3.51/0.99 inference(cnf_transformation,[],[f44])).
% 3.51/0.99
% 3.51/0.99 cnf(c_78,plain,
% 3.51/0.99 (~$less_int(0,0)),
% 3.51/0.99 inference(instantiation,[status(thm)],[c_55])).
% 3.51/0.99
% 3.51/0.99 cnf(c_86,plain,
% 3.51/0.99 (0 = 0|$less_int(0,0)),
% 3.51/0.99 inference(instantiation,[status(thm)],[c_53])).
% 3.51/0.99
% 3.51/0.99 cnf(c_456,plain,(X0_13 = X0_13),theory(equality)).
% 3.51/0.99
% 3.51/0.99 cnf(c_457,plain,(X0_3 != X1_3|X2_3 != X1_3|X2_3 = X0_3),theory(equality)).
% 3.51/0.99
% 3.51/0.99 cnf(c_461,plain,
% 3.51/0.99 (X0_3 != X1_3|X0_13 != X1_13|~in(X1_3,X1_13)|in(X0_3,X0_13)),
% 3.51/0.99 theory(equality)).
% 3.51/0.99
% 3.51/0.99 cnf(c_465,plain,(sK0 = sK0),inference(instantiation,[status(thm)],[c_456])).
% 3.51/0.99
% 3.51/0.99 cnf(c_844,plain,
% 3.51/0.99 ($less_int(X0_3,$sum_int(1,X1_3))|$less_int(X1_3,X0_3)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_60,c_51])).
% 3.51/0.99
% 3.51/0.99 cnf(c_878,plain,
% 3.51/0.99 ($less_int($uminus_int(1),X0_3)|$less_int(X0_3,0)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_56,c_844])).
% 3.51/0.99
% 3.51/0.99 cnf(c_884,plain,
% 3.51/0.99 ($less_int(X0_3,0)|$less_int(-1,X0_3)),
% 3.51/0.99 inference(smt_theory_normalisation,[status(thm)],[c_878])).
% 3.51/0.99
% 3.51/0.99 cnf(c_893,plain,
% 3.51/0.99 (~in(X0_3,sK0)|$less_int(-1,X0_3)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_884,c_74])).
% 3.51/0.99
% 3.51/0.99 cnf(c_938,plain,
% 3.51/0.99 (~in(X0_3,sK0)|X0_3 = 0|$less_int(0,X0_3)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_53,c_74])).
% 3.51/0.99
% 3.51/0.99 cnf(c_951,plain,
% 3.51/0.99 ($less_int(-1,sK1)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_71,c_893])).
% 3.51/0.99
% 3.51/0.99 cnf(c_977,plain,
% 3.51/0.99 (sK1 = 0|$less_int(0,sK1)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_71,c_938])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1050,plain,
% 3.51/0.99 (~$less_int(sK1,X0_3)|$less_int(-1,X0_3)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_951,c_54])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1168,plain,
% 3.51/0.99 (X0_3 != sK1|X0_13 != sK0|~in(sK1,sK0)|in(X0_3,X0_13)),
% 3.51/0.99 inference(instantiation,[status(thm)],[c_461])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1169,plain,
% 3.51/0.99 (sK0 != sK0|0 != sK1|~in(sK1,sK0)|in(0,sK0)),
% 3.51/0.99 inference(instantiation,[status(thm)],[c_1168])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1251,plain,
% 3.51/0.99 ($less_int(-1,$sum_int(X0_3,1))|$less_int(X0_3,sK1)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_51,c_1050])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1283,plain,
% 3.51/0.99 (X0_3 != X1_3|sK1 != X1_3|X0_3 = sK1),
% 3.51/0.99 inference(instantiation,[status(thm)],[c_457])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1284,plain,
% 3.51/0.99 (sK1 != 0|0 != 0|0 = sK1),
% 3.51/0.99 inference(instantiation,[status(thm)],[c_1283])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1791,plain,
% 3.51/0.99 ($less_int(X0_3,sK1)|$less_int(-2,X0_3)),
% 3.51/0.99 inference(smt_theory_normalisation,[status(thm)],[c_1251])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1801,plain,
% 3.51/0.99 (~in(-2,sK0)|$less_int(0,sK1)),
% 3.51/0.99 inference(superposition,[status(thm)],[c_1791,c_74])).
% 3.51/0.99
% 3.51/0.99 cnf(c_1881,plain,
% 3.51/0.99 ($less_int(0,sK1)),
% 3.51/0.99 inference(global_subsumption_just,
% 3.51/0.99 [status(thm)],
% 3.51/0.99 [c_1801,c_71,c_73,c_78,c_86,c_465,c_977,c_1169,c_1284])).
% 3.51/0.99
% 3.51/0.99 cnf(c_5835,plain,
% 3.51/0.99 ($false),
% 3.51/0.99 inference(smt_impl_just,[status(thm)],[c_1881,c_72,c_71,c_70])).
% 3.51/0.99
% 3.51/0.99
% 3.51/0.99 % SZS output end CNFRefutation for theBenchmark.p
% 3.51/0.99
% 3.51/1.00
%------------------------------------------------------------------------------