TSTP Solution File: DAT055_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT055_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:18 EDT 2024
% Result : Theorem 3.97s 1.13s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : DAT055_1 : TPTP v8.1.2. Released v5.0.0.
% 0.04/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n011.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:50:18 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running TFA theorem proving
% 0.18/0.45 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.97/1.13 % SZS status Started for theBenchmark.p
% 3.97/1.13 % SZS status Theorem for theBenchmark.p
% 3.97/1.13
% 3.97/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.97/1.13
% 3.97/1.13 ------ iProver source info
% 3.97/1.13
% 3.97/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.97/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.97/1.13 git: non_committed_changes: false
% 3.97/1.13
% 3.97/1.13 ------ Parsing...
% 3.97/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.97/1.13
% 3.97/1.13 ------ 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.97/1.13
% 3.97/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.97/1.13
% 3.97/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.97/1.13 ------ Proving...
% 3.97/1.13 ------ Problem Properties
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13 clauses 16
% 3.97/1.13 conjectures 4
% 3.97/1.13 EPR 5
% 3.97/1.13 Horn 14
% 3.97/1.13 unary 12
% 3.97/1.13 binary 2
% 3.97/1.13 lits 22
% 3.97/1.13 lits eq 7
% 3.97/1.13 fd_pure 0
% 3.97/1.13 fd_pseudo 0
% 3.97/1.13 fd_cond 0
% 3.97/1.13 fd_pseudo_cond 1
% 3.97/1.13 AC symbols 1
% 3.97/1.13
% 3.97/1.13 ------ Input Options Time Limit: Unbounded
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13 ------
% 3.97/1.13 Current options:
% 3.97/1.13 ------
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13 ------ Proving...
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13 % SZS status Theorem for theBenchmark.p
% 3.97/1.13
% 3.97/1.13 % SZS output start CNFRefutation for theBenchmark.p
% 3.97/1.13
% 3.97/1.13 tff(f1,conjecture,(
% 3.97/1.13 ($less(0,k) & $lesseq(l,min(a)) & ! [X0 : list] : $lesseq(min(X0),max(X0))) => $less(l,$sum(max(a),k))),
% 3.97/1.13 file('/export/starexec/sandbox/benchmark/theBenchmark.p',boyer_moore_max_min)).
% 3.97/1.13
% 3.97/1.13 tff(f2,negated_conjecture,(
% 3.97/1.13 ~(($less(0,k) & $lesseq(l,min(a)) & ! [X0 : list] : $lesseq(min(X0),max(X0))) => $less(l,$sum(max(a),k)))),
% 3.97/1.13 inference(negated_conjecture,[],[f1])).
% 3.97/1.13
% 3.97/1.13 tff(f3,plain,(
% 3.97/1.13 ~(($less(0,k) & ~$less(min(a),l) & ! [X0 : list] : ~$less(max(X0),min(X0))) => $less(l,$sum(max(a),k)))),
% 3.97/1.13 inference(theory_normalization,[],[f2])).
% 3.97/1.13
% 3.97/1.13 tff(f4,plain,(
% 3.97/1.13 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 3.97/1.13 introduced(theory_axiom_138,[])).
% 3.97/1.13
% 3.97/1.13 tff(f5,plain,(
% 3.97/1.13 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 3.97/1.13 introduced(theory_axiom_139,[])).
% 3.97/1.13
% 3.97/1.13 tff(f9,plain,(
% 3.97/1.13 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 3.97/1.13 introduced(theory_axiom_145,[])).
% 3.97/1.13
% 3.97/1.13 tff(f10,plain,(
% 3.97/1.13 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 3.97/1.13 introduced(theory_axiom_146,[])).
% 3.97/1.13
% 3.97/1.13 tff(f11,plain,(
% 3.97/1.13 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 3.97/1.13 introduced(theory_axiom_147,[])).
% 3.97/1.13
% 3.97/1.13 tff(f13,plain,(
% 3.97/1.13 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 3.97/1.13 introduced(theory_axiom_150,[])).
% 3.97/1.13
% 3.97/1.13 tff(f15,plain,(
% 3.97/1.13 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,$sum(X0,1))) )),
% 3.97/1.13 introduced(theory_axiom_164,[])).
% 3.97/1.13
% 3.97/1.13 tff(f16,plain,(
% 3.97/1.13 ~$less(l,$sum(max(a),k)) & ($less(0,k) & ~$less(min(a),l) & ! [X0 : list] : ~$less(max(X0),min(X0)))),
% 3.97/1.13 inference(ennf_transformation,[],[f3])).
% 3.97/1.13
% 3.97/1.13 tff(f17,plain,(
% 3.97/1.13 ~$less(l,$sum(max(a),k)) & $less(0,k) & ~$less(min(a),l) & ! [X0 : list] : ~$less(max(X0),min(X0))),
% 3.97/1.13 inference(flattening,[],[f16])).
% 3.97/1.13
% 3.97/1.13 tff(f18,plain,(
% 3.97/1.13 ( ! [X0 : list] : (~$less(max(X0),min(X0))) )),
% 3.97/1.13 inference(cnf_transformation,[],[f17])).
% 3.97/1.13
% 3.97/1.13 tff(f19,plain,(
% 3.97/1.13 ~$less(min(a),l)),
% 3.97/1.13 inference(cnf_transformation,[],[f17])).
% 3.97/1.13
% 3.97/1.13 tff(f20,plain,(
% 3.97/1.13 $less(0,k)),
% 3.97/1.13 inference(cnf_transformation,[],[f17])).
% 3.97/1.13
% 3.97/1.13 tff(f21,plain,(
% 3.97/1.13 ~$less(l,$sum(max(a),k))),
% 3.97/1.13 inference(cnf_transformation,[],[f17])).
% 3.97/1.13
% 3.97/1.13 cnf(c_49,plain,
% 3.97/1.13 (~$less_int(X0_3,$sum_int(X1_3,1))|~$less_int(X1_3,X0_3)),
% 3.97/1.13 inference(cnf_transformation,[],[f15])).
% 3.97/1.13
% 3.97/1.13 cnf(c_51,plain,
% 3.97/1.13 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 3.97/1.13 inference(cnf_transformation,[],[f13])).
% 3.97/1.13
% 3.97/1.13 cnf(c_53,plain,
% 3.97/1.13 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 3.97/1.13 inference(cnf_transformation,[],[f11])).
% 3.97/1.13
% 3.97/1.13 cnf(c_54,plain,
% 3.97/1.13 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 3.97/1.13 inference(cnf_transformation,[],[f10])).
% 3.97/1.13
% 3.97/1.13 cnf(c_55,plain,
% 3.97/1.13 (~$less_int(X0_3,X0_3)),
% 3.97/1.13 inference(cnf_transformation,[],[f9])).
% 3.97/1.13
% 3.97/1.13 cnf(c_59,plain,
% 3.97/1.13 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 3.97/1.13 inference(cnf_transformation,[],[f5])).
% 3.97/1.13
% 3.97/1.13 cnf(c_60,plain,
% 3.97/1.13 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 3.97/1.13 inference(cnf_transformation,[],[f4])).
% 3.97/1.13
% 3.97/1.13 cnf(c_61,negated_conjecture,
% 3.97/1.13 (~$less_int(l,$sum_int(max(a),k))),
% 3.97/1.13 inference(cnf_transformation,[],[f21])).
% 3.97/1.13
% 3.97/1.13 cnf(c_62,negated_conjecture,
% 3.97/1.13 ($less_int(0,k)),
% 3.97/1.13 inference(cnf_transformation,[],[f20])).
% 3.97/1.13
% 3.97/1.13 cnf(c_63,negated_conjecture,
% 3.97/1.13 (~$less_int(min(a),l)),
% 3.97/1.13 inference(cnf_transformation,[],[f19])).
% 3.97/1.13
% 3.97/1.13 cnf(c_64,negated_conjecture,
% 3.97/1.13 (~$less_int(max(X0_13),min(X0_13))),
% 3.97/1.13 inference(cnf_transformation,[],[f18])).
% 3.97/1.13
% 3.97/1.13 cnf(c_76,negated_conjecture,
% 3.97/1.13 (~$less_int(l,$sum_int(k,max(a)))),
% 3.97/1.13 inference(theory_normalisation,[status(thm)],[c_61,c_59,c_60])).
% 3.97/1.13
% 3.97/1.13 cnf(c_514,plain,
% 3.97/1.13 ($less_int(X0_3,$sum_int(X0_3,1))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_51,c_55])).
% 3.97/1.13
% 3.97/1.13 cnf(c_530,plain,
% 3.97/1.13 (~$less_int(X0_3,$sum_int(1,X1_3))|~$less_int(X1_3,X0_3)),
% 3.97/1.13 inference(superposition,[status(thm)],[c_60,c_49])).
% 3.97/1.13
% 3.97/1.13 cnf(c_547,plain,
% 3.97/1.13 (min(a) = l|$less_int(l,min(a))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_53,c_63])).
% 3.97/1.13
% 3.97/1.13 cnf(c_548,plain,
% 3.97/1.13 (min(X0_13) = max(X0_13)|$less_int(min(X0_13),max(X0_13))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_53,c_64])).
% 3.97/1.13
% 3.97/1.13 cnf(c_562,plain,
% 3.97/1.13 ($less_int(X0_3,$sum_int(1,X0_3))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_60,c_514])).
% 3.97/1.13
% 3.97/1.13 cnf(c_669,plain,
% 3.97/1.13 (~$less_int(min(a),X0_3)|min(a) = l|$less_int(l,X0_3)),
% 3.97/1.13 inference(superposition,[status(thm)],[c_547,c_54])).
% 3.97/1.13
% 3.97/1.13 cnf(c_670,plain,
% 3.97/1.13 (~$less_int(max(X0_13),X0_3)|min(X0_13) = max(X0_13)|$less_int(min(X0_13),X0_3)),
% 3.97/1.13 inference(superposition,[status(thm)],[c_548,c_54])).
% 3.97/1.13
% 3.97/1.13 cnf(c_1019,plain,
% 3.97/1.13 (min(X0_13) = max(X0_13)|max(X0_13) = X0_3|$less_int(min(X0_13),X0_3)|
% 3.97/1.13 $less_int(X0_3,max(X0_13))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_53,c_670])).
% 3.97/1.13
% 3.97/1.13 cnf(c_1022,plain,
% 3.97/1.13 (min(X0_13) = max(X0_13)|$less_int(min(X0_13),$sum_int(1,max(X0_13)))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_562,c_670])).
% 3.97/1.13
% 3.97/1.13 cnf(c_1322,plain,
% 3.97/1.13 (min(a) = max(a)|min(a) = l|$less_int(l,$sum_int(1,max(a)))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_1022,c_669])).
% 3.97/1.13
% 3.97/1.13 cnf(c_2817,plain,
% 3.97/1.13 (~$less_int(max(a),l)|min(a) = max(a)|min(a) = l),
% 3.97/1.13 inference(superposition,[status(thm)],[c_1322,c_530])).
% 3.97/1.13
% 3.97/1.13 cnf(c_3793,plain,
% 3.97/1.13 (min(a) = max(a)|max(a) = l|$less_int(l,max(a))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_1019,c_63])).
% 3.97/1.13
% 3.97/1.13 cnf(c_4009,plain,
% 3.97/1.13 (~$less_int(max(a),X0_3)|min(a) = max(a)|max(a) = l|$less_int(l,X0_3)),
% 3.97/1.13 inference(superposition,[status(thm)],[c_3793,c_54])).
% 3.97/1.13
% 3.97/1.13 cnf(c_4058,plain,
% 3.97/1.13 (min(a) = max(a)|max(a) = l|$less_int(l,$sum_int(1,max(a)))),
% 3.97/1.13 inference(superposition,[status(thm)],[c_562,c_4009])).
% 3.97/1.13
% 3.97/1.13 cnf(c_4670,plain,
% 3.97/1.13 (~$less_int(max(a),l)|min(a) = max(a)|max(a) = l),
% 3.97/1.13 inference(superposition,[status(thm)],[c_4058,c_530])).
% 3.97/1.13
% 3.97/1.13 cnf(c_5278,plain,
% 3.97/1.13 ($false),
% 3.97/1.13 inference(smt_impl_just,[status(thm)],[c_4670,c_2817,c_76,c_63,c_62])).
% 3.97/1.13
% 3.97/1.13
% 3.97/1.13 % SZS output end CNFRefutation for theBenchmark.p
% 3.97/1.13
% 3.97/1.13
%------------------------------------------------------------------------------