TSTP Solution File: DAT076_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT076_1 : TPTP v8.1.2. Released v6.1.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 : Wed Aug 30 22:15:35 EDT 2023
% Result : Theorem 1.65s 0.98s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : DAT076_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Thu Aug 24 13:58:12 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.12/0.35 Running TFA theorem proving
% 0.12/0.35 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.65/0.98 % SZS status Started for theBenchmark.p
% 1.65/0.98 % SZS status Theorem for theBenchmark.p
% 1.65/0.98
% 1.65/0.98 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.65/0.98
% 1.65/0.98 ------ iProver source info
% 1.65/0.98
% 1.65/0.98 git: date: 2023-05-31 18:12:56 +0000
% 1.65/0.98 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.65/0.98 git: non_committed_changes: false
% 1.65/0.98 git: last_make_outside_of_git: false
% 1.65/0.98
% 1.65/0.98 ------ Parsing...
% 1.65/0.98 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.65/0.98
% 1.65/0.98 ------ 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
% 1.65/0.98
% 1.65/0.98 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.65/0.98
% 1.65/0.98 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.65/0.98 ------ Proving...
% 1.65/0.98 ------ Problem Properties
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98 clauses 28
% 1.65/0.98 conjectures 1
% 1.65/0.98 EPR 4
% 1.65/0.98 Horn 16
% 1.65/0.98 unary 10
% 1.65/0.98 binary 10
% 1.65/0.98 lits 58
% 1.65/0.98 lits eq 22
% 1.65/0.98 fd_pure 0
% 1.65/0.98 fd_pseudo 0
% 1.65/0.98 fd_cond 0
% 1.65/0.98 fd_pseudo_cond 6
% 1.65/0.98 AC symbols 1
% 1.65/0.98
% 1.65/0.98 ------ Input Options Time Limit: Unbounded
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98 ------
% 1.65/0.98 Current options:
% 1.65/0.98 ------
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98 ------ Proving...
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98 % SZS status Theorem for theBenchmark.p
% 1.65/0.98
% 1.65/0.98 % SZS output start CNFRefutation for theBenchmark.p
% 1.65/0.98
% 1.65/0.98 tff(f6,axiom,(
% 1.65/0.98 ! [X0 : array,X5 : $int] : (sorted(X0,X5) <=> ! [X1 : $int,X3 : $int] : (($less(X3,X5) & $less(X1,X3) & $less(X1,X5) & $lesseq(0,X1)) => $lesseq(read(X0,X1),read(X0,X3))))),
% 1.65/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sorted1)).
% 1.65/0.98
% 1.65/0.98 tff(f10,conjecture,(
% 1.65/0.98 ~! [X0 : array,X5 : $int] : (sorted(X0,X5) => ~sorted(rev(X0,X5),X5))),
% 1.65/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c4)).
% 1.65/0.98
% 1.65/0.98 tff(f11,negated_conjecture,(
% 1.65/0.98 ~~! [X0 : array,X5 : $int] : (sorted(X0,X5) => ~sorted(rev(X0,X5),X5))),
% 1.65/0.98 inference(negated_conjecture,[],[f10])).
% 1.65/0.98
% 1.65/0.98 tff(f13,plain,(
% 1.65/0.98 ! [X0 : array,X5 : $int] : (sorted(X0,X5) <=> ! [X1 : $int,X3 : $int] : (($less(X3,X5) & $less(X1,X3) & $less(X1,X5) & ~$less(X1,0)) => ~$less(read(X0,X3),read(X0,X1))))),
% 1.65/0.98 inference(theory_normalization,[],[f6])).
% 1.65/0.98
% 1.65/0.98 tff(f33,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (sorted(X0,X1) <=> ! [X2 : $int,X3 : $int] : (($less(X3,X1) & $less(X2,X3) & $less(X2,X1) & ~$less(X2,0)) => ~$less(read(X0,X3),read(X0,X2))))),
% 1.65/0.98 inference(rectify,[],[f13])).
% 1.65/0.98
% 1.65/0.98 tff(f37,plain,(
% 1.65/0.98 ~~! [X0 : array,X1 : $int] : (sorted(X0,X1) => ~sorted(rev(X0,X1),X1))),
% 1.65/0.98 inference(rectify,[],[f11])).
% 1.65/0.98
% 1.65/0.98 tff(f38,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (sorted(X0,X1) => ~sorted(rev(X0,X1),X1))),
% 1.65/0.98 inference(flattening,[],[f37])).
% 1.65/0.98
% 1.65/0.98 tff(f39,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (! [X2 : $int,X3 : $int] : (($less(X3,X1) & $less(X2,X3) & $less(X2,X1) & ~$less(X2,0)) => ~$less(read(X0,X3),read(X0,X2))) => sorted(X0,X1))),
% 1.65/0.98 inference(unused_predicate_definition_removal,[],[f33])).
% 1.65/0.98
% 1.65/0.98 tff(f43,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (sorted(X0,X1) | ? [X2 : $int,X3 : $int] : ($less(read(X0,X3),read(X0,X2)) & ($less(X3,X1) & $less(X2,X3) & $less(X2,X1) & ~$less(X2,0))))),
% 1.65/0.98 inference(ennf_transformation,[],[f39])).
% 1.65/0.98
% 1.65/0.98 tff(f44,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (sorted(X0,X1) | ? [X2 : $int,X3 : $int] : ($less(read(X0,X3),read(X0,X2)) & $less(X3,X1) & $less(X2,X3) & $less(X2,X1) & ~$less(X2,0)))),
% 1.65/0.98 inference(flattening,[],[f43])).
% 1.65/0.98
% 1.65/0.98 tff(f46,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (~sorted(rev(X0,X1),X1) | ~sorted(X0,X1))),
% 1.65/0.98 inference(ennf_transformation,[],[f38])).
% 1.65/0.98
% 1.65/0.98 tff(f51,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (? [X2 : $int,X3 : $int] : ($less(read(X0,X3),read(X0,X2)) & $less(X3,X1) & $less(X2,X3) & $less(X2,X1) & ~$less(X2,0)) => ($less(read(X0,sK3(X0,X1)),read(X0,sK2(X0,X1))) & $less(sK3(X0,X1),X1) & $less(sK2(X0,X1),sK3(X0,X1)) & $less(sK2(X0,X1),X1) & ~$less(sK2(X0,X1),0)))),
% 1.65/0.98 introduced(choice_axiom,[])).
% 1.65/0.98
% 1.65/0.98 tff(f52,plain,(
% 1.65/0.98 ! [X0 : array,X1 : $int] : (sorted(X0,X1) | ($less(read(X0,sK3(X0,X1)),read(X0,sK2(X0,X1))) & $less(sK3(X0,X1),X1) & $less(sK2(X0,X1),sK3(X0,X1)) & $less(sK2(X0,X1),X1) & ~$less(sK2(X0,X1),0)))),
% 1.65/0.98 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f44,f51])).
% 1.65/0.98
% 1.65/0.98 tff(f62,plain,(
% 1.65/0.98 ( ! [X0 : array,X1 : $int] : (sorted(X0,X1) | ~$less(sK2(X0,X1),0)) )),
% 1.65/0.98 inference(cnf_transformation,[],[f52])).
% 1.65/0.98
% 1.65/0.98 tff(f63,plain,(
% 1.65/0.98 ( ! [X0 : array,X1 : $int] : (sorted(X0,X1) | $less(sK2(X0,X1),X1)) )),
% 1.65/0.98 inference(cnf_transformation,[],[f52])).
% 1.65/0.98
% 1.65/0.98 tff(f70,plain,(
% 1.65/0.98 ( ! [X0 : array,X1 : $int] : (~sorted(rev(X0,X1),X1) | ~sorted(X0,X1)) )),
% 1.65/0.98 inference(cnf_transformation,[],[f46])).
% 1.65/0.98
% 1.65/0.98 cnf(c_71,plain,
% 1.65/0.98 ($less_int(sK2(X0_13,X0_3),X0_3)|sorted(X0_13,X0_3)),
% 1.65/0.98 inference(cnf_transformation,[],[f63])).
% 1.65/0.98
% 1.65/0.98 cnf(c_72,plain,
% 1.65/0.98 (~$less_int(sK2(X0_13,X0_3),0)|sorted(X0_13,X0_3)),
% 1.65/0.98 inference(cnf_transformation,[],[f62])).
% 1.65/0.98
% 1.65/0.98 cnf(c_76,negated_conjecture,
% 1.65/0.98 (~sorted(rev(X0_13,X0_3),X0_3)|~sorted(X0_13,X0_3)),
% 1.65/0.98 inference(cnf_transformation,[],[f70])).
% 1.65/0.98
% 1.65/0.98 cnf(c_1380,plain,
% 1.65/0.98 (sorted(X0_13,0)),
% 1.65/0.98 inference(superposition,[status(thm)],[c_71,c_72])).
% 1.65/0.98
% 1.65/0.98 cnf(c_1384,plain,
% 1.65/0.98 (~sorted(X0_13,0)),
% 1.65/0.98 inference(superposition,[status(thm)],[c_1380,c_76])).
% 1.65/0.98
% 1.65/0.98 cnf(c_1385,plain,
% 1.65/0.98 ($false),
% 1.65/0.98 inference(forward_subsumption_resolution,[status(thm)],[c_1384,c_1380])).
% 1.65/0.98
% 1.65/0.98
% 1.65/0.98 % SZS output end CNFRefutation for theBenchmark.p
% 1.65/0.98
% 1.65/0.98
%------------------------------------------------------------------------------