TSTP Solution File: DAT069_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT069_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 2.94s 1.17s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT069_1 : TPTP v8.1.2. Released v5.5.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 19:18:16 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running TFA theorem proving
% 0.20/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
% 2.94/1.17 % SZS status Started for theBenchmark.p
% 2.94/1.17 % SZS status Theorem for theBenchmark.p
% 2.94/1.17
% 2.94/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.94/1.17
% 2.94/1.17 ------ iProver source info
% 2.94/1.17
% 2.94/1.17 git: date: 2024-05-02 19:28:25 +0000
% 2.94/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.94/1.17 git: non_committed_changes: false
% 2.94/1.17
% 2.94/1.17 ------ Parsing...
% 2.94/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.94/1.17
% 2.94/1.17 ------ 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
% 2.94/1.17
% 2.94/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.94/1.17
% 2.94/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.94/1.17 ------ Proving...
% 2.94/1.17 ------ Problem Properties
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17 clauses 31
% 2.94/1.17 conjectures 2
% 2.94/1.17 EPR 7
% 2.94/1.17 Horn 26
% 2.94/1.17 unary 20
% 2.94/1.17 binary 7
% 2.94/1.17 lits 46
% 2.94/1.17 lits eq 24
% 2.94/1.17 fd_pure 0
% 2.94/1.17 fd_pseudo 0
% 2.94/1.17 fd_cond 0
% 2.94/1.17 fd_pseudo_cond 5
% 2.94/1.17 AC symbols 1
% 2.94/1.17
% 2.94/1.17 ------ Input Options Time Limit: Unbounded
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17 ------
% 2.94/1.17 Current options:
% 2.94/1.17 ------
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17 ------ Proving...
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17 % SZS status Theorem for theBenchmark.p
% 2.94/1.17
% 2.94/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 2.94/1.17
% 2.94/1.17 tff(f3,axiom,(
% 2.94/1.17 ! [X2 : $int,X1 : heap,X0 : $int] : ($sum(1,length(X1)) != X0 => sel(app(X1,X2),X0) = sel(X1,X0))),
% 2.94/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_3)).
% 2.94/1.17
% 2.94/1.17 tff(f15,conjecture,(
% 2.94/1.17 ! [X2 : $int,X1 : heap,X0 : $int] : ($less(length(X1),X0) | sel(app(X1,X2),X0) = sel(X1,X0))),
% 2.94/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_4)).
% 2.94/1.17
% 2.94/1.17 tff(f16,negated_conjecture,(
% 2.94/1.17 ~! [X2 : $int,X1 : heap,X0 : $int] : ($less(length(X1),X0) | sel(app(X1,X2),X0) = sel(X1,X0))),
% 2.94/1.17 inference(negated_conjecture,[],[f15])).
% 2.94/1.17
% 2.94/1.17 tff(f17,plain,(
% 2.94/1.17 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 2.94/1.17 introduced(theory_axiom_138,[])).
% 2.94/1.17
% 2.94/1.17 tff(f22,plain,(
% 2.94/1.17 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 2.94/1.17 introduced(theory_axiom_145,[])).
% 2.94/1.17
% 2.94/1.17 tff(f23,plain,(
% 2.94/1.17 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 2.94/1.17 introduced(theory_axiom_146,[])).
% 2.94/1.17
% 2.94/1.17 tff(f24,plain,(
% 2.94/1.17 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 2.94/1.17 introduced(theory_axiom_147,[])).
% 2.94/1.17
% 2.94/1.17 tff(f26,plain,(
% 2.94/1.17 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 2.94/1.17 introduced(theory_axiom_150,[])).
% 2.94/1.17
% 2.94/1.17 tff(f30,plain,(
% 2.94/1.17 ! [X0 : $int,X1 : heap,X2 : $int] : ($sum(1,length(X1)) != X2 => sel(app(X1,X0),X2) = sel(X1,X2))),
% 2.94/1.17 inference(rectify,[],[f3])).
% 2.94/1.17
% 2.94/1.17 tff(f41,plain,(
% 2.94/1.17 ~! [X0 : $int,X1 : heap,X2 : $int] : ($less(length(X1),X2) | sel(app(X1,X0),X2) = sel(X1,X2))),
% 2.94/1.17 inference(rectify,[],[f16])).
% 2.94/1.17
% 2.94/1.17 tff(f43,plain,(
% 2.94/1.17 ! [X0 : $int,X1 : heap,X2 : $int] : (sel(app(X1,X0),X2) = sel(X1,X2) | $sum(1,length(X1)) = X2)),
% 2.94/1.17 inference(ennf_transformation,[],[f30])).
% 2.94/1.17
% 2.94/1.17 tff(f46,plain,(
% 2.94/1.17 ? [X0 : $int,X1 : heap,X2 : $int] : (~$less(length(X1),X2) & sel(app(X1,X0),X2) != sel(X1,X2))),
% 2.94/1.17 inference(ennf_transformation,[],[f41])).
% 2.94/1.17
% 2.94/1.17 tff(f51,plain,(
% 2.94/1.17 ? [X0 : $int,X1 : heap,X2 : $int] : (~$less(length(X1),X2) & sel(app(X1,X0),X2) != sel(X1,X2)) => (~$less(length(sK1),sK2) & sel(app(sK1,sK0),sK2) != sel(sK1,sK2))),
% 2.94/1.17 introduced(choice_axiom,[])).
% 2.94/1.17
% 2.94/1.17 tff(f52,plain,(
% 2.94/1.17 ~$less(length(sK1),sK2) & sel(app(sK1,sK0),sK2) != sel(sK1,sK2)),
% 2.94/1.17 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f46,f51])).
% 2.94/1.17
% 2.94/1.17 tff(f55,plain,(
% 2.94/1.17 ( ! [X2 : $int,X0 : $int,X1 : heap] : (sel(app(X1,X0),X2) = sel(X1,X2) | $sum(1,length(X1)) = X2) )),
% 2.94/1.17 inference(cnf_transformation,[],[f43])).
% 2.94/1.17
% 2.94/1.17 tff(f71,plain,(
% 2.94/1.17 sel(app(sK1,sK0),sK2) != sel(sK1,sK2)),
% 2.94/1.17 inference(cnf_transformation,[],[f52])).
% 2.94/1.17
% 2.94/1.17 tff(f72,plain,(
% 2.94/1.17 ~$less(length(sK1),sK2)),
% 2.94/1.17 inference(cnf_transformation,[],[f52])).
% 2.94/1.17
% 2.94/1.17 cnf(c_51,plain,
% 2.94/1.17 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 2.94/1.17 inference(cnf_transformation,[],[f26])).
% 2.94/1.17
% 2.94/1.17 cnf(c_53,plain,
% 2.94/1.17 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 2.94/1.17 inference(cnf_transformation,[],[f24])).
% 2.94/1.17
% 2.94/1.17 cnf(c_54,plain,
% 2.94/1.17 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 2.94/1.17 inference(cnf_transformation,[],[f23])).
% 2.94/1.17
% 2.94/1.17 cnf(c_55,plain,
% 2.94/1.17 (~$less_int(X0_3,X0_3)),
% 2.94/1.17 inference(cnf_transformation,[],[f22])).
% 2.94/1.17
% 2.94/1.17 cnf(c_60,plain,
% 2.94/1.17 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 2.94/1.17 inference(cnf_transformation,[],[f17])).
% 2.94/1.17
% 2.94/1.17 cnf(c_63,plain,
% 2.94/1.17 (sel(app(X0_13,X0_3),X1_3) = sel(X0_13,X1_3)|$sum_int(1,length(X0_13)) = X1_3),
% 2.94/1.17 inference(cnf_transformation,[],[f55])).
% 2.94/1.17
% 2.94/1.17 cnf(c_78,negated_conjecture,
% 2.94/1.17 (~$less_int(length(sK1),sK2)),
% 2.94/1.17 inference(cnf_transformation,[],[f72])).
% 2.94/1.17
% 2.94/1.17 cnf(c_79,negated_conjecture,
% 2.94/1.17 (sel(app(sK1,sK0),sK2) != sel(sK1,sK2)),
% 2.94/1.17 inference(cnf_transformation,[],[f71])).
% 2.94/1.17
% 2.94/1.17 cnf(c_1114,plain,
% 2.94/1.17 ($less_int(X0_3,$sum_int(X0_3,1))),
% 2.94/1.17 inference(superposition,[status(thm)],[c_51,c_55])).
% 2.94/1.17
% 2.94/1.17 cnf(c_1121,plain,
% 2.94/1.17 ($less_int(X0_3,$sum_int(1,X0_3))),
% 2.94/1.17 inference(superposition,[status(thm)],[c_60,c_1114])).
% 2.94/1.17
% 2.94/1.17 cnf(c_1212,plain,
% 2.94/1.17 (length(sK1) = sK2|$less_int(sK2,length(sK1))),
% 2.94/1.17 inference(superposition,[status(thm)],[c_53,c_78])).
% 2.94/1.17
% 2.94/1.17 cnf(c_1361,plain,
% 2.94/1.17 (~$less_int(length(sK1),X0_3)|length(sK1) = sK2|$less_int(sK2,X0_3)),
% 2.94/1.17 inference(superposition,[status(thm)],[c_1212,c_54])).
% 2.94/1.17
% 2.94/1.17 cnf(c_1516,plain,
% 2.94/1.17 (length(sK1) = sK2|$less_int(sK2,$sum_int(1,length(sK1)))),
% 2.94/1.17 inference(superposition,[status(thm)],[c_1121,c_1361])).
% 2.94/1.17
% 2.94/1.17 cnf(c_2119,plain,
% 2.94/1.17 ($sum_int(1,length(sK1)) = sK2),
% 2.94/1.17 inference(superposition,[status(thm)],[c_63,c_79])).
% 2.94/1.17
% 2.94/1.17 cnf(c_2124,plain,
% 2.94/1.17 (length(sK1) = sK2|$less_int(sK2,sK2)),
% 2.94/1.17 inference(demodulation,[status(thm)],[c_1516,c_2119])).
% 2.94/1.17
% 2.94/1.17 cnf(c_2125,plain,
% 2.94/1.17 (length(sK1) = sK2),
% 2.94/1.17 inference(forward_subsumption_resolution,[status(thm)],[c_2124,c_55])).
% 2.94/1.17
% 2.94/1.17 cnf(c_2196,plain,
% 2.94/1.17 ($sum_int(1,sK2) = sK2),
% 2.94/1.17 inference(light_normalisation,[status(thm)],[c_2119,c_2125])).
% 2.94/1.17
% 2.94/1.17 cnf(c_2202,plain,
% 2.94/1.17 ($less_int(sK2,sK2)),
% 2.94/1.17 inference(superposition,[status(thm)],[c_2196,c_1121])).
% 2.94/1.17
% 2.94/1.17 cnf(c_2205,plain,
% 2.94/1.17 ($false),
% 2.94/1.17 inference(forward_subsumption_resolution,[status(thm)],[c_2202,c_55])).
% 2.94/1.17
% 2.94/1.17
% 2.94/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 2.94/1.17
% 2.94/1.17
%------------------------------------------------------------------------------