TSTP Solution File: DAT070_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT070_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Wed Aug 30 22:15:33 EDT 2023
% Result : Theorem 2.12s 1.19s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT070_1 : TPTP v8.1.2. Released v5.5.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.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 Aug 24 14:40:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running TFA theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.12/1.19 % SZS status Started for theBenchmark.p
% 2.12/1.19 % SZS status Theorem for theBenchmark.p
% 2.12/1.19
% 2.12/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.12/1.19
% 2.12/1.19 ------ iProver source info
% 2.12/1.19
% 2.12/1.19 git: date: 2023-05-31 18:12:56 +0000
% 2.12/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.12/1.19 git: non_committed_changes: false
% 2.12/1.19 git: last_make_outside_of_git: false
% 2.12/1.19
% 2.12/1.19 ------ Parsing...
% 2.12/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.12/1.19
% 2.12/1.19 ------ 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.12/1.19
% 2.12/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.12/1.19
% 2.12/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.12/1.19 ------ Proving...
% 2.12/1.19 ------ Problem Properties
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19 clauses 31
% 2.12/1.19 conjectures 2
% 2.12/1.19 EPR 7
% 2.12/1.19 Horn 26
% 2.12/1.19 unary 20
% 2.12/1.19 binary 7
% 2.12/1.19 lits 46
% 2.12/1.19 lits eq 24
% 2.12/1.19 fd_pure 0
% 2.12/1.19 fd_pseudo 0
% 2.12/1.19 fd_cond 0
% 2.12/1.19 fd_pseudo_cond 5
% 2.12/1.19 AC symbols 1
% 2.12/1.19
% 2.12/1.19 ------ Input Options Time Limit: Unbounded
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19 ------
% 2.12/1.19 Current options:
% 2.12/1.19 ------
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19 ------ Proving...
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19 % SZS status Theorem for theBenchmark.p
% 2.12/1.19
% 2.12/1.19 % SZS output start CNFRefutation for theBenchmark.p
% 2.12/1.19
% 2.12/1.19 tff(f3,axiom,(
% 2.12/1.19 ! [X2 : $int,X1 : heap,X0 : $int] : ($sum(1,length(X1)) != X0 => sel(app(X1,X2),X0) = sel(X1,X0))),
% 2.12/1.19 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_3)).
% 2.12/1.19
% 2.12/1.19 tff(f15,conjecture,(
% 2.12/1.19 ! [X2 : $int,X0 : $int,X1 : heap] : (~$less(X0,$sum(1,length(X1))) | sel(app(X1,X2),X0) = sel(X1,X0))),
% 2.12/1.19 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_5)).
% 2.12/1.19
% 2.12/1.19 tff(f16,negated_conjecture,(
% 2.12/1.19 ~! [X2 : $int,X0 : $int,X1 : heap] : (~$less(X0,$sum(1,length(X1))) | sel(app(X1,X2),X0) = sel(X1,X0))),
% 2.12/1.19 inference(negated_conjecture,[],[f15])).
% 2.12/1.19
% 2.12/1.19 tff(f22,plain,(
% 2.12/1.19 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 2.12/1.19 introduced(theory_axiom_145,[])).
% 2.12/1.19
% 2.12/1.19 tff(f30,plain,(
% 2.12/1.19 ! [X0 : $int,X1 : heap,X2 : $int] : ($sum(1,length(X1)) != X2 => sel(app(X1,X0),X2) = sel(X1,X2))),
% 2.12/1.19 inference(rectify,[],[f3])).
% 2.12/1.19
% 2.12/1.19 tff(f41,plain,(
% 2.12/1.19 ~! [X0 : $int,X1 : $int,X2 : heap] : (~$less(X1,$sum(1,length(X2))) | sel(app(X2,X0),X1) = sel(X2,X1))),
% 2.12/1.19 inference(rectify,[],[f16])).
% 2.12/1.19
% 2.12/1.19 tff(f43,plain,(
% 2.12/1.19 ! [X0 : $int,X1 : heap,X2 : $int] : (sel(app(X1,X0),X2) = sel(X1,X2) | $sum(1,length(X1)) = X2)),
% 2.12/1.19 inference(ennf_transformation,[],[f30])).
% 2.12/1.19
% 2.12/1.19 tff(f46,plain,(
% 2.12/1.19 ? [X0 : $int,X1 : $int,X2 : heap] : ($less(X1,$sum(1,length(X2))) & sel(app(X2,X0),X1) != sel(X2,X1))),
% 2.12/1.19 inference(ennf_transformation,[],[f41])).
% 2.12/1.19
% 2.12/1.19 tff(f51,plain,(
% 2.12/1.19 ? [X0 : $int,X1 : $int,X2 : heap] : ($less(X1,$sum(1,length(X2))) & sel(app(X2,X0),X1) != sel(X2,X1)) => ($less(sK1,$sum(1,length(sK2))) & sel(app(sK2,sK0),sK1) != sel(sK2,sK1))),
% 2.12/1.19 introduced(choice_axiom,[])).
% 2.12/1.19
% 2.12/1.19 tff(f52,plain,(
% 2.12/1.19 $less(sK1,$sum(1,length(sK2))) & sel(app(sK2,sK0),sK1) != sel(sK2,sK1)),
% 2.12/1.19 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f46,f51])).
% 2.12/1.19
% 2.12/1.19 tff(f55,plain,(
% 2.12/1.19 ( ! [X2 : $int,X0 : $int,X1 : heap] : (sel(app(X1,X0),X2) = sel(X1,X2) | $sum(1,length(X1)) = X2) )),
% 2.12/1.19 inference(cnf_transformation,[],[f43])).
% 2.12/1.19
% 2.12/1.19 tff(f71,plain,(
% 2.12/1.19 sel(app(sK2,sK0),sK1) != sel(sK2,sK1)),
% 2.12/1.19 inference(cnf_transformation,[],[f52])).
% 2.12/1.19
% 2.12/1.19 tff(f72,plain,(
% 2.12/1.19 $less(sK1,$sum(1,length(sK2)))),
% 2.12/1.19 inference(cnf_transformation,[],[f52])).
% 2.12/1.19
% 2.12/1.19 cnf(c_55,plain,
% 2.12/1.19 (~$less_int(X0_3,X0_3)),
% 2.12/1.19 inference(cnf_transformation,[],[f22])).
% 2.12/1.19
% 2.12/1.19 cnf(c_63,plain,
% 2.12/1.19 (sel(app(X0_13,X0_3),X1_3) = sel(X0_13,X1_3)|$sum_int(1,length(X0_13)) = X1_3),
% 2.12/1.19 inference(cnf_transformation,[],[f55])).
% 2.12/1.19
% 2.12/1.19 cnf(c_78,negated_conjecture,
% 2.12/1.19 ($less_int(sK1,$sum_int(1,length(sK2)))),
% 2.12/1.19 inference(cnf_transformation,[],[f72])).
% 2.12/1.19
% 2.12/1.19 cnf(c_79,negated_conjecture,
% 2.12/1.19 (sel(app(sK2,sK0),sK1) != sel(sK2,sK1)),
% 2.12/1.19 inference(cnf_transformation,[],[f71])).
% 2.12/1.19
% 2.12/1.19 cnf(c_2168,plain,
% 2.12/1.19 ($sum_int(1,length(sK2)) = sK1),
% 2.12/1.19 inference(superposition,[status(thm)],[c_63,c_79])).
% 2.12/1.19
% 2.12/1.19 cnf(c_2179,plain,
% 2.12/1.19 ($less_int(sK1,sK1)),
% 2.12/1.19 inference(demodulation,[status(thm)],[c_78,c_2168])).
% 2.12/1.19
% 2.12/1.19 cnf(c_2180,plain,
% 2.12/1.19 ($false),
% 2.12/1.19 inference(forward_subsumption_resolution,[status(thm)],[c_2179,c_55])).
% 2.12/1.19
% 2.12/1.19
% 2.12/1.19 % SZS output end CNFRefutation for theBenchmark.p
% 2.12/1.19
% 2.12/1.19
%------------------------------------------------------------------------------