TSTP Solution File: DAT068_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT068_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:20 EDT 2024
% Result : Theorem 3.40s 1.15s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT068_1 : TPTP v8.1.2. Released v5.5.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n006.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 18:38:49 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running TFA theorem proving
% 0.21/0.47 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.40/1.15 % SZS status Started for theBenchmark.p
% 3.40/1.15 % SZS status Theorem for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.40/1.15
% 3.40/1.15 ------ iProver source info
% 3.40/1.15
% 3.40/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.40/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.40/1.15 git: non_committed_changes: false
% 3.40/1.15
% 3.40/1.15 ------ Parsing...
% 3.40/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.40/1.15
% 3.40/1.15 ------ 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.40/1.15
% 3.40/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.40/1.15
% 3.40/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.40/1.15 ------ Proving...
% 3.40/1.15 ------ Problem Properties
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 clauses 31
% 3.40/1.15 conjectures 2
% 3.40/1.15 EPR 7
% 3.40/1.15 Horn 26
% 3.40/1.15 unary 20
% 3.40/1.15 binary 7
% 3.40/1.15 lits 46
% 3.40/1.15 lits eq 24
% 3.40/1.15 fd_pure 0
% 3.40/1.15 fd_pseudo 0
% 3.40/1.15 fd_cond 0
% 3.40/1.15 fd_pseudo_cond 5
% 3.40/1.15 AC symbols 1
% 3.40/1.15
% 3.40/1.15 ------ Input Options Time Limit: Unbounded
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 ------
% 3.40/1.15 Current options:
% 3.40/1.15 ------
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 ------ Proving...
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 % SZS status Theorem for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 % SZS output start CNFRefutation for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 tff(f3,axiom,(
% 3.40/1.15 ! [X2 : $int,X1 : heap,X0 : $int] : ($sum(1,length(X1)) != X0 => sel(app(X1,X2),X0) = sel(X1,X0))),
% 3.40/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_3)).
% 3.40/1.15
% 3.40/1.15 tff(f15,conjecture,(
% 3.40/1.15 ! [X2 : $int,X0 : $int,X1 : heap] : (~$less(X0,length(X1)) | sel(app(X1,X2),X0) = sel(X1,X0))),
% 3.40/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_3)).
% 3.40/1.15
% 3.40/1.15 tff(f16,negated_conjecture,(
% 3.40/1.15 ~! [X2 : $int,X0 : $int,X1 : heap] : (~$less(X0,length(X1)) | sel(app(X1,X2),X0) = sel(X1,X0))),
% 3.40/1.15 inference(negated_conjecture,[],[f15])).
% 3.40/1.15
% 3.40/1.15 tff(f17,plain,(
% 3.40/1.15 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 3.40/1.15 introduced(theory_axiom_138,[])).
% 3.40/1.15
% 3.40/1.15 tff(f22,plain,(
% 3.40/1.15 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 3.40/1.15 introduced(theory_axiom_145,[])).
% 3.40/1.15
% 3.40/1.15 tff(f23,plain,(
% 3.40/1.15 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 3.40/1.15 introduced(theory_axiom_146,[])).
% 3.40/1.15
% 3.40/1.15 tff(f26,plain,(
% 3.40/1.15 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 3.40/1.15 introduced(theory_axiom_150,[])).
% 3.40/1.15
% 3.40/1.15 tff(f30,plain,(
% 3.40/1.15 ! [X0 : $int,X1 : heap,X2 : $int] : ($sum(1,length(X1)) != X2 => sel(app(X1,X0),X2) = sel(X1,X2))),
% 3.40/1.15 inference(rectify,[],[f3])).
% 3.40/1.15
% 3.40/1.15 tff(f41,plain,(
% 3.40/1.15 ~! [X0 : $int,X1 : $int,X2 : heap] : (~$less(X1,length(X2)) | sel(app(X2,X0),X1) = sel(X2,X1))),
% 3.40/1.15 inference(rectify,[],[f16])).
% 3.40/1.15
% 3.40/1.15 tff(f43,plain,(
% 3.40/1.15 ! [X0 : $int,X1 : heap,X2 : $int] : (sel(app(X1,X0),X2) = sel(X1,X2) | $sum(1,length(X1)) = X2)),
% 3.40/1.15 inference(ennf_transformation,[],[f30])).
% 3.40/1.15
% 3.40/1.15 tff(f46,plain,(
% 3.40/1.15 ? [X0 : $int,X1 : $int,X2 : heap] : ($less(X1,length(X2)) & sel(app(X2,X0),X1) != sel(X2,X1))),
% 3.40/1.15 inference(ennf_transformation,[],[f41])).
% 3.40/1.15
% 3.40/1.15 tff(f51,plain,(
% 3.40/1.15 ? [X0 : $int,X1 : $int,X2 : heap] : ($less(X1,length(X2)) & sel(app(X2,X0),X1) != sel(X2,X1)) => ($less(sK1,length(sK2)) & sel(app(sK2,sK0),sK1) != sel(sK2,sK1))),
% 3.40/1.15 introduced(choice_axiom,[])).
% 3.40/1.15
% 3.40/1.15 tff(f52,plain,(
% 3.40/1.15 $less(sK1,length(sK2)) & sel(app(sK2,sK0),sK1) != sel(sK2,sK1)),
% 3.40/1.15 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f46,f51])).
% 3.40/1.15
% 3.40/1.15 tff(f55,plain,(
% 3.40/1.15 ( ! [X2 : $int,X0 : $int,X1 : heap] : (sel(app(X1,X0),X2) = sel(X1,X2) | $sum(1,length(X1)) = X2) )),
% 3.40/1.15 inference(cnf_transformation,[],[f43])).
% 3.40/1.15
% 3.40/1.15 tff(f71,plain,(
% 3.40/1.15 sel(app(sK2,sK0),sK1) != sel(sK2,sK1)),
% 3.40/1.15 inference(cnf_transformation,[],[f52])).
% 3.40/1.15
% 3.40/1.15 tff(f72,plain,(
% 3.40/1.15 $less(sK1,length(sK2))),
% 3.40/1.15 inference(cnf_transformation,[],[f52])).
% 3.40/1.15
% 3.40/1.15 cnf(c_51,plain,
% 3.40/1.15 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 3.40/1.15 inference(cnf_transformation,[],[f26])).
% 3.40/1.15
% 3.40/1.15 cnf(c_54,plain,
% 3.40/1.15 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 3.40/1.15 inference(cnf_transformation,[],[f23])).
% 3.40/1.15
% 3.40/1.15 cnf(c_55,plain,
% 3.40/1.15 (~$less_int(X0_3,X0_3)),
% 3.40/1.15 inference(cnf_transformation,[],[f22])).
% 3.40/1.15
% 3.40/1.15 cnf(c_60,plain,
% 3.40/1.15 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 3.40/1.15 inference(cnf_transformation,[],[f17])).
% 3.40/1.15
% 3.40/1.15 cnf(c_63,plain,
% 3.40/1.15 (sel(app(X0_13,X0_3),X1_3) = sel(X0_13,X1_3)|$sum_int(1,length(X0_13)) = X1_3),
% 3.40/1.15 inference(cnf_transformation,[],[f55])).
% 3.40/1.15
% 3.40/1.15 cnf(c_78,negated_conjecture,
% 3.40/1.15 ($less_int(sK1,length(sK2))),
% 3.40/1.15 inference(cnf_transformation,[],[f72])).
% 3.40/1.15
% 3.40/1.15 cnf(c_79,negated_conjecture,
% 3.40/1.15 (sel(app(sK2,sK0),sK1) != sel(sK2,sK1)),
% 3.40/1.15 inference(cnf_transformation,[],[f71])).
% 3.40/1.15
% 3.40/1.15 cnf(c_1114,plain,
% 3.40/1.15 ($less_int(X0_3,$sum_int(X0_3,1))),
% 3.40/1.15 inference(superposition,[status(thm)],[c_51,c_55])).
% 3.40/1.15
% 3.40/1.15 cnf(c_1121,plain,
% 3.40/1.15 ($less_int(X0_3,$sum_int(1,X0_3))),
% 3.40/1.15 inference(superposition,[status(thm)],[c_60,c_1114])).
% 3.40/1.15
% 3.40/1.15 cnf(c_1345,plain,
% 3.40/1.15 (~$less_int(length(sK2),X0_3)|$less_int(sK1,X0_3)),
% 3.40/1.15 inference(superposition,[status(thm)],[c_78,c_54])).
% 3.40/1.15
% 3.40/1.15 cnf(c_1511,plain,
% 3.40/1.15 ($less_int(sK1,$sum_int(1,length(sK2)))),
% 3.40/1.15 inference(superposition,[status(thm)],[c_1121,c_1345])).
% 3.40/1.15
% 3.40/1.15 cnf(c_2115,plain,
% 3.40/1.15 ($sum_int(1,length(sK2)) = sK1),
% 3.40/1.15 inference(superposition,[status(thm)],[c_63,c_79])).
% 3.40/1.15
% 3.40/1.15 cnf(c_2120,plain,
% 3.40/1.15 ($less_int(sK1,sK1)),
% 3.40/1.15 inference(demodulation,[status(thm)],[c_1511,c_2115])).
% 3.40/1.15
% 3.40/1.15 cnf(c_2121,plain,
% 3.40/1.15 ($false),
% 3.40/1.15 inference(forward_subsumption_resolution,[status(thm)],[c_2120,c_55])).
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 % SZS output end CNFRefutation for theBenchmark.p
% 3.40/1.15
% 3.40/1.15
%------------------------------------------------------------------------------