TSTP Solution File: DAT071_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:21 EDT 2024
% Result : Theorem 2.55s 1.17s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 19:01:43 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running TFA theorem proving
% 0.20/0.48 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
% 2.55/1.17 % SZS status Started for theBenchmark.p
% 2.55/1.17 % SZS status Theorem for theBenchmark.p
% 2.55/1.17
% 2.55/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.55/1.17
% 2.55/1.17 ------ iProver source info
% 2.55/1.17
% 2.55/1.17 git: date: 2024-05-02 19:28:25 +0000
% 2.55/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.55/1.17 git: non_committed_changes: false
% 2.55/1.17
% 2.55/1.17 ------ Parsing...
% 2.55/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.55/1.17
% 2.55/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.55/1.17
% 2.55/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.55/1.17
% 2.55/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.55/1.17 ------ Proving...
% 2.55/1.17 ------ Problem Properties
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17 clauses 31
% 2.55/1.17 conjectures 9
% 2.55/1.17 EPR 9
% 2.55/1.17 Horn 23
% 2.55/1.17 unary 17
% 2.55/1.17 binary 4
% 2.55/1.17 lits 59
% 2.55/1.17 lits eq 25
% 2.55/1.17 fd_pure 0
% 2.55/1.17 fd_pseudo 0
% 2.55/1.17 fd_cond 0
% 2.55/1.17 fd_pseudo_cond 6
% 2.55/1.17 AC symbols 1
% 2.55/1.17
% 2.55/1.17 ------ Input Options Time Limit: Unbounded
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17 ------
% 2.55/1.17 Current options:
% 2.55/1.17 ------
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17 ------ Proving...
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17 % SZS status Theorem for theBenchmark.p
% 2.55/1.17
% 2.55/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 2.55/1.17
% 2.55/1.17 tff(f10,conjecture,(
% 2.55/1.17 ! [X0 : array,X5 : $int,X8 : $int,X9 : $int] : ((? [X1 : $int] : (read(X0,X1) = X9 & $greatereq(X1,0) & $greater(X5,X1)) & ! [X1 : $int] : (($greatereq(X1,0) & $greater(X5,X1)) => $lesseq(read(X0,X1),X9)) & ? [X1 : $int] : (read(X0,X1) = X8 & $greatereq(X1,0) & $greater(X5,X1)) & ! [X1 : $int] : (($greatereq(X1,0) & $greater(X5,X1)) => $lesseq(read(X0,X1),X8))) => X8 = X9)),
% 2.55/1.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',c)).
% 2.55/1.17
% 2.55/1.17 tff(f11,negated_conjecture,(
% 2.55/1.17 ~! [X0 : array,X5 : $int,X8 : $int,X9 : $int] : ((? [X1 : $int] : (read(X0,X1) = X9 & $greatereq(X1,0) & $greater(X5,X1)) & ! [X1 : $int] : (($greatereq(X1,0) & $greater(X5,X1)) => $lesseq(read(X0,X1),X9)) & ? [X1 : $int] : (read(X0,X1) = X8 & $greatereq(X1,0) & $greater(X5,X1)) & ! [X1 : $int] : (($greatereq(X1,0) & $greater(X5,X1)) => $lesseq(read(X0,X1),X8))) => X8 = X9)),
% 2.55/1.17 inference(negated_conjecture,[],[f10])).
% 2.55/1.17
% 2.55/1.17 tff(f17,plain,(
% 2.55/1.17 ~! [X0 : array,X5 : $int,X8 : $int,X9 : $int] : ((? [X1 : $int] : (read(X0,X1) = X9 & ~$less(X1,0) & $less(X1,X5)) & ! [X1 : $int] : ((~$less(X1,0) & $less(X1,X5)) => ~$less(X9,read(X0,X1))) & ? [X1 : $int] : (read(X0,X1) = X8 & ~$less(X1,0) & $less(X1,X5)) & ! [X1 : $int] : ((~$less(X1,0) & $less(X1,X5)) => ~$less(X8,read(X0,X1)))) => X8 = X9)),
% 2.55/1.17 inference(theory_normalization,[],[f11])).
% 2.55/1.17
% 2.55/1.17 tff(f25,plain,(
% 2.55/1.17 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 2.55/1.17 introduced(theory_axiom_147,[])).
% 2.55/1.17
% 2.55/1.17 tff(f38,plain,(
% 2.55/1.17 ~! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : ((? [X4 : $int] : (read(X0,X4) = X3 & ~$less(X4,0) & $less(X4,X1)) & ! [X5 : $int] : ((~$less(X5,0) & $less(X5,X1)) => ~$less(X3,read(X0,X5))) & ? [X6 : $int] : (read(X0,X6) = X2 & ~$less(X6,0) & $less(X6,X1)) & ! [X7 : $int] : ((~$less(X7,0) & $less(X7,X1)) => ~$less(X2,read(X0,X7)))) => X2 = X3)),
% 2.55/1.17 inference(rectify,[],[f17])).
% 2.55/1.17
% 2.55/1.17 tff(f43,plain,(
% 2.55/1.17 ? [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (X2 != X3 & (? [X4 : $int] : (read(X0,X4) = X3 & ~$less(X4,0) & $less(X4,X1)) & ! [X5 : $int] : (~$less(X3,read(X0,X5)) | ($less(X5,0) | ~$less(X5,X1))) & ? [X6 : $int] : (read(X0,X6) = X2 & ~$less(X6,0) & $less(X6,X1)) & ! [X7 : $int] : (~$less(X2,read(X0,X7)) | ($less(X7,0) | ~$less(X7,X1)))))),
% 2.55/1.17 inference(ennf_transformation,[],[f38])).
% 2.55/1.17
% 2.55/1.17 tff(f44,plain,(
% 2.55/1.17 ? [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (X2 != X3 & ? [X4 : $int] : (read(X0,X4) = X3 & ~$less(X4,0) & $less(X4,X1)) & ! [X5 : $int] : (~$less(X3,read(X0,X5)) | $less(X5,0) | ~$less(X5,X1)) & ? [X6 : $int] : (read(X0,X6) = X2 & ~$less(X6,0) & $less(X6,X1)) & ! [X7 : $int] : (~$less(X2,read(X0,X7)) | $less(X7,0) | ~$less(X7,X1)))),
% 2.55/1.17 inference(flattening,[],[f43])).
% 2.55/1.17
% 2.55/1.17 tff(f51,plain,(
% 2.55/1.17 ? [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (X2 != X3 & ? [X4 : $int] : (read(X0,X4) = X3 & ~$less(X4,0) & $less(X4,X1)) & ! [X5 : $int] : (~$less(X3,read(X0,X5)) | $less(X5,0) | ~$less(X5,X1)) & ? [X6 : $int] : (read(X0,X6) = X2 & ~$less(X6,0) & $less(X6,X1)) & ! [X7 : $int] : (~$less(X2,read(X0,X7)) | $less(X7,0) | ~$less(X7,X1))) => (sK5 != sK6 & ? [X4 : $int] : (sK6 = read(sK3,X4) & ~$less(X4,0) & $less(X4,sK4)) & ! [X5 : $int] : (~$less(sK6,read(sK3,X5)) | $less(X5,0) | ~$less(X5,sK4)) & ? [X6 : $int] : (sK5 = read(sK3,X6) & ~$less(X6,0) & $less(X6,sK4)) & ! [X7 : $int] : (~$less(sK5,read(sK3,X7)) | $less(X7,0) | ~$less(X7,sK4)))),
% 2.55/1.17 introduced(choice_axiom,[])).
% 2.55/1.17
% 2.55/1.17 tff(f52,plain,(
% 2.55/1.17 ? [X4 : $int] : (sK6 = read(sK3,X4) & ~$less(X4,0) & $less(X4,sK4)) => (sK6 = read(sK3,sK7) & ~$less(sK7,0) & $less(sK7,sK4))),
% 2.55/1.17 introduced(choice_axiom,[])).
% 2.55/1.17
% 2.55/1.17 tff(f53,plain,(
% 2.55/1.17 ? [X6 : $int] : (sK5 = read(sK3,X6) & ~$less(X6,0) & $less(X6,sK4)) => (sK5 = read(sK3,sK8) & ~$less(sK8,0) & $less(sK8,sK4))),
% 2.55/1.17 introduced(choice_axiom,[])).
% 2.55/1.17
% 2.55/1.17 tff(f54,plain,(
% 2.55/1.17 sK5 != sK6 & (sK6 = read(sK3,sK7) & ~$less(sK7,0) & $less(sK7,sK4)) & ! [X5 : $int] : (~$less(sK6,read(sK3,X5)) | $less(X5,0) | ~$less(X5,sK4)) & (sK5 = read(sK3,sK8) & ~$less(sK8,0) & $less(sK8,sK4)) & ! [X7 : $int] : (~$less(sK5,read(sK3,X7)) | $less(X7,0) | ~$less(X7,sK4))),
% 2.55/1.17 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8])],[f44,f53,f52,f51])).
% 2.55/1.17
% 2.55/1.17 tff(f65,plain,(
% 2.55/1.17 ( ! [X7 : $int] : (~$less(sK5,read(sK3,X7)) | $less(X7,0) | ~$less(X7,sK4)) )),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f66,plain,(
% 2.55/1.17 $less(sK8,sK4)),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f67,plain,(
% 2.55/1.17 ~$less(sK8,0)),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f68,plain,(
% 2.55/1.17 sK5 = read(sK3,sK8)),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f69,plain,(
% 2.55/1.17 ( ! [X5 : $int] : (~$less(sK6,read(sK3,X5)) | $less(X5,0) | ~$less(X5,sK4)) )),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f70,plain,(
% 2.55/1.17 $less(sK7,sK4)),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f71,plain,(
% 2.55/1.17 ~$less(sK7,0)),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f72,plain,(
% 2.55/1.17 sK6 = read(sK3,sK7)),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 tff(f73,plain,(
% 2.55/1.17 sK5 != sK6),
% 2.55/1.17 inference(cnf_transformation,[],[f54])).
% 2.55/1.17
% 2.55/1.17 cnf(c_53,plain,
% 2.55/1.17 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 2.55/1.17 inference(cnf_transformation,[],[f25])).
% 2.55/1.17
% 2.55/1.17 cnf(c_71,negated_conjecture,
% 2.55/1.17 (sK5 != sK6),
% 2.55/1.17 inference(cnf_transformation,[],[f73])).
% 2.55/1.17
% 2.55/1.17 cnf(c_72,negated_conjecture,
% 2.55/1.17 (read(sK3,sK7) = sK6),
% 2.55/1.17 inference(cnf_transformation,[],[f72])).
% 2.55/1.17
% 2.55/1.17 cnf(c_73,negated_conjecture,
% 2.55/1.17 (~$less_int(sK7,0)),
% 2.55/1.17 inference(cnf_transformation,[],[f71])).
% 2.55/1.17
% 2.55/1.17 cnf(c_74,negated_conjecture,
% 2.55/1.17 ($less_int(sK7,sK4)),
% 2.55/1.17 inference(cnf_transformation,[],[f70])).
% 2.55/1.17
% 2.55/1.17 cnf(c_75,negated_conjecture,
% 2.55/1.17 (~$less_int(sK6,read(sK3,X0_3))|~$less_int(X0_3,sK4)|$less_int(X0_3,0)),
% 2.55/1.17 inference(cnf_transformation,[],[f69])).
% 2.55/1.17
% 2.55/1.17 cnf(c_76,negated_conjecture,
% 2.55/1.17 (read(sK3,sK8) = sK5),
% 2.55/1.17 inference(cnf_transformation,[],[f68])).
% 2.55/1.17
% 2.55/1.17 cnf(c_77,negated_conjecture,
% 2.55/1.17 (~$less_int(sK8,0)),
% 2.55/1.17 inference(cnf_transformation,[],[f67])).
% 2.55/1.17
% 2.55/1.17 cnf(c_78,negated_conjecture,
% 2.55/1.17 ($less_int(sK8,sK4)),
% 2.55/1.17 inference(cnf_transformation,[],[f66])).
% 2.55/1.17
% 2.55/1.17 cnf(c_79,negated_conjecture,
% 2.55/1.17 (~$less_int(sK5,read(sK3,X0_3))|~$less_int(X0_3,sK4)|$less_int(X0_3,0)),
% 2.55/1.17 inference(cnf_transformation,[],[f65])).
% 2.55/1.17
% 2.55/1.17 cnf(c_1167,plain,
% 2.55/1.17 (~$less_int(sK6,sK5)|~$less_int(sK8,sK4)|$less_int(sK8,0)),
% 2.55/1.17 inference(superposition,[status(thm)],[c_76,c_75])).
% 2.55/1.17
% 2.55/1.17 cnf(c_1168,plain,
% 2.55/1.17 (~$less_int(sK6,sK5)),
% 2.55/1.17 inference(forward_subsumption_resolution,
% 2.55/1.17 [status(thm)],
% 2.55/1.17 [c_1167,c_77,c_78])).
% 2.55/1.17
% 2.55/1.17 cnf(c_1184,plain,
% 2.55/1.17 (~$less_int(sK5,sK6)|~$less_int(sK7,sK4)|$less_int(sK7,0)),
% 2.55/1.17 inference(superposition,[status(thm)],[c_72,c_79])).
% 2.55/1.17
% 2.55/1.17 cnf(c_1186,plain,
% 2.55/1.17 (~$less_int(sK5,sK6)),
% 2.55/1.17 inference(forward_subsumption_resolution,
% 2.55/1.17 [status(thm)],
% 2.55/1.17 [c_1184,c_73,c_74])).
% 2.55/1.17
% 2.55/1.17 cnf(c_1263,plain,
% 2.55/1.17 (sK5 = sK6|$less_int(sK6,sK5)),
% 2.55/1.17 inference(superposition,[status(thm)],[c_53,c_1186])).
% 2.55/1.17
% 2.55/1.17 cnf(c_1266,plain,
% 2.55/1.17 ($false),
% 2.55/1.17 inference(forward_subsumption_resolution,
% 2.55/1.17 [status(thm)],
% 2.55/1.17 [c_1263,c_1168,c_71])).
% 2.55/1.17
% 2.55/1.17
% 2.55/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 2.55/1.17
% 2.55/1.17
%------------------------------------------------------------------------------