TSTP Solution File: ARI585_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ARI585_1 : TPTP v8.1.2. Released v5.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:07:19 EDT 2024
% Result : Theorem 3.99s 1.09s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : ARI585_1 : TPTP v8.1.2. Released v5.1.0.
% 0.05/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 01:12:58 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running TFA theorem proving
% 0.16/0.41 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
% 3.99/1.09 % SZS status Started for theBenchmark.p
% 3.99/1.09 % SZS status Theorem for theBenchmark.p
% 3.99/1.09
% 3.99/1.09 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.99/1.09
% 3.99/1.09 ------ iProver source info
% 3.99/1.09
% 3.99/1.09 git: date: 2024-05-02 19:28:25 +0000
% 3.99/1.09 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.99/1.09 git: non_committed_changes: false
% 3.99/1.09
% 3.99/1.09 ------ Parsing...
% 3.99/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.99/1.09
% 3.99/1.09 ------ 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.99/1.09
% 3.99/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.09
% 3.99/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.99/1.09 ------ Proving...
% 3.99/1.09 ------ Problem Properties
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09 clauses 18
% 3.99/1.09 conjectures 3
% 3.99/1.09 EPR 7
% 3.99/1.09 Horn 16
% 3.99/1.09 unary 13
% 3.99/1.09 binary 3
% 3.99/1.09 lits 25
% 3.99/1.09 lits eq 7
% 3.99/1.09 fd_pure 0
% 3.99/1.09 fd_pseudo 0
% 3.99/1.09 fd_cond 0
% 3.99/1.09 fd_pseudo_cond 1
% 3.99/1.09 AC symbols 1
% 3.99/1.09
% 3.99/1.09 ------ Input Options Time Limit: Unbounded
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09 ------
% 3.99/1.09 Current options:
% 3.99/1.09 ------
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09 ------ Proving...
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09 % SZS status Theorem for theBenchmark.p
% 3.99/1.09
% 3.99/1.09 % SZS output start CNFRefutation for theBenchmark.p
% 3.99/1.09
% 3.99/1.09 tff(f1,conjecture,(
% 3.99/1.09 ! [X0 : $int] : ? [X1 : $int] : ! [X2 : $int] : (($less(X2,$sum(X0,8)) & $less($sum(X0,5),X2)) => ($less(X2,$sum(X1,4)) & $less(X1,X2)))),
% 3.99/1.09 file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_4_can_cover_interv_3)).
% 3.99/1.09
% 3.99/1.09 tff(f2,negated_conjecture,(
% 3.99/1.09 ~! [X0 : $int] : ? [X1 : $int] : ! [X2 : $int] : (($less(X2,$sum(X0,8)) & $less($sum(X0,5),X2)) => ($less(X2,$sum(X1,4)) & $less(X1,X2)))),
% 3.99/1.09 inference(negated_conjecture,[],[f1])).
% 3.99/1.09
% 3.99/1.09 tff(f3,plain,(
% 3.99/1.09 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 3.99/1.09 introduced(theory_axiom_138,[])).
% 3.99/1.09
% 3.99/1.09 tff(f4,plain,(
% 3.99/1.09 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 3.99/1.09 introduced(theory_axiom_139,[])).
% 3.99/1.09
% 3.99/1.09 tff(f9,plain,(
% 3.99/1.09 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 3.99/1.09 introduced(theory_axiom_146,[])).
% 3.99/1.09
% 3.99/1.09 tff(f10,plain,(
% 3.99/1.09 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 3.99/1.09 introduced(theory_axiom_147,[])).
% 3.99/1.09
% 3.99/1.09 tff(f15,plain,(
% 3.99/1.09 ? [X0 : $int] : ! [X1 : $int] : ? [X2 : $int] : ((~$less(X2,$sum(X1,4)) | ~$less(X1,X2)) & ($less(X2,$sum(X0,8)) & $less($sum(X0,5),X2)))),
% 3.99/1.09 inference(ennf_transformation,[],[f2])).
% 3.99/1.09
% 3.99/1.09 tff(f16,plain,(
% 3.99/1.09 ? [X0 : $int] : ! [X1 : $int] : ? [X2 : $int] : ((~$less(X2,$sum(X1,4)) | ~$less(X1,X2)) & $less(X2,$sum(X0,8)) & $less($sum(X0,5),X2))),
% 3.99/1.09 inference(flattening,[],[f15])).
% 3.99/1.09
% 3.99/1.09 tff(f17,plain,(
% 3.99/1.09 ? [X0 : $int] : ! [X1 : $int] : ? [X2 : $int] : ((~$less(X2,$sum(X1,4)) | ~$less(X1,X2)) & $less(X2,$sum(X0,8)) & $less($sum(X0,5),X2)) => ! [X1 : $int] : ? [X2 : $int] : ((~$less(X2,$sum(X1,4)) | ~$less(X1,X2)) & $less(X2,$sum(sK0,8)) & $less($sum(sK0,5),X2))),
% 3.99/1.09 introduced(choice_axiom,[])).
% 3.99/1.09
% 3.99/1.09 tff(f18,plain,(
% 3.99/1.09 ! [X1 : $int] : (? [X2 : $int] : ((~$less(X2,$sum(X1,4)) | ~$less(X1,X2)) & $less(X2,$sum(sK0,8)) & $less($sum(sK0,5),X2)) => ((~$less(sK1(X1),$sum(X1,4)) | ~$less(X1,sK1(X1))) & $less(sK1(X1),$sum(sK0,8)) & $less($sum(sK0,5),sK1(X1))))),
% 3.99/1.09 introduced(choice_axiom,[])).
% 3.99/1.09
% 3.99/1.09 tff(f19,plain,(
% 3.99/1.09 ! [X1 : $int] : ((~$less(sK1(X1),$sum(X1,4)) | ~$less(X1,sK1(X1))) & $less(sK1(X1),$sum(sK0,8)) & $less($sum(sK0,5),sK1(X1)))),
% 3.99/1.09 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f18,f17])).
% 3.99/1.09
% 3.99/1.09 tff(f20,plain,(
% 3.99/1.09 ( ! [X1 : $int] : ($less($sum(sK0,5),sK1(X1))) )),
% 3.99/1.09 inference(cnf_transformation,[],[f19])).
% 3.99/1.09
% 3.99/1.09 tff(f21,plain,(
% 3.99/1.09 ( ! [X1 : $int] : ($less(sK1(X1),$sum(sK0,8))) )),
% 3.99/1.09 inference(cnf_transformation,[],[f19])).
% 3.99/1.09
% 3.99/1.09 tff(f22,plain,(
% 3.99/1.09 ( ! [X1 : $int] : (~$less(sK1(X1),$sum(X1,4)) | ~$less(X1,sK1(X1))) )),
% 3.99/1.09 inference(cnf_transformation,[],[f19])).
% 3.99/1.09
% 3.99/1.09 cnf(c_53,plain,
% 3.99/1.09 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 3.99/1.09 inference(cnf_transformation,[],[f10])).
% 3.99/1.09
% 3.99/1.09 cnf(c_54,plain,
% 3.99/1.09 (~$less_int(X0_3,X1_3)|~$less_int(X1_3,X2_3)|$less_int(X0_3,X2_3)),
% 3.99/1.09 inference(cnf_transformation,[],[f9])).
% 3.99/1.09
% 3.99/1.09 cnf(c_59,plain,
% 3.99/1.09 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 3.99/1.09 inference(cnf_transformation,[],[f4])).
% 3.99/1.09
% 3.99/1.09 cnf(c_60,plain,
% 3.99/1.09 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 3.99/1.09 inference(cnf_transformation,[],[f3])).
% 3.99/1.09
% 3.99/1.09 cnf(c_61,negated_conjecture,
% 3.99/1.09 (~$less_int(sK1(X0_3),$sum_int(X0_3,4))|~$less_int(X0_3,sK1(X0_3))),
% 3.99/1.09 inference(cnf_transformation,[],[f22])).
% 3.99/1.09
% 3.99/1.09 cnf(c_62,negated_conjecture,
% 3.99/1.09 ($less_int(sK1(X0_3),$sum_int(sK0,8))),
% 3.99/1.09 inference(cnf_transformation,[],[f21])).
% 3.99/1.09
% 3.99/1.09 cnf(c_63,negated_conjecture,
% 3.99/1.09 ($less_int($sum_int(sK0,5),sK1(X0_3))),
% 3.99/1.09 inference(cnf_transformation,[],[f20])).
% 3.99/1.09
% 3.99/1.09 cnf(c_763,plain,
% 3.99/1.09 (~$less_int($sum_int(sK0,8),X0_3)|$less_int(sK1(X1_3),X0_3)),
% 3.99/1.09 inference(superposition,[status(thm)],[c_62,c_54])).
% 3.99/1.09
% 3.99/1.09 cnf(c_909,plain,
% 3.99/1.09 ($sum_int(sK0,8) = X0_3|$less_int(X0_3,$sum_int(sK0,8))|$less_int(sK1(X1_3),X0_3)),
% 3.99/1.09 inference(superposition,[status(thm)],[c_53,c_763])).
% 3.99/1.09
% 3.99/1.09 cnf(c_2354,plain,
% 3.99/1.09 (~$less_int(X0_3,sK1(X0_3))|$sum_int(X0_3,4) = $sum_int(sK0,8)|$less_int($sum_int(X0_3,4),$sum_int(sK0,8))),
% 3.99/1.09 inference(superposition,[status(thm)],[c_909,c_61])).
% 3.99/1.09
% 3.99/1.09 cnf(c_2508,plain,
% 3.99/1.09 (~$less_int(X0_3,sK1(X0_3))|$sum_int(4,sK0) = X0_3|$less_int($sum_int(-4,X0_3),sK0)),
% 3.99/1.09 inference(smt_theory_normalisation,[status(thm)],[c_2354])).
% 3.99/1.09
% 3.99/1.09 cnf(c_2510,plain,
% 3.99/1.09 (~$less_int(X0_3,sK1(X0_3))|$sum_int(sK0,4) = X0_3|$less_int($sum_int(-4,X0_3),sK0)),
% 3.99/1.09 inference(theory_normalisation,[status(thm)],[c_2508,c_59,c_60])).
% 3.99/1.09
% 3.99/1.09 cnf(c_2519,plain,
% 3.99/1.09 ($sum_int(sK0,4) = $sum_int(sK0,5)|$less_int($sum_int(-4,$sum_int(sK0,5)),sK0)),
% 3.99/1.09 inference(superposition,[status(thm)],[c_63,c_2510])).
% 3.99/1.09
% 3.99/1.09 cnf(c_2547,plain,
% 3.99/1.09 ($sum_int(sK0,4) = $sum_int(sK0,5)|$less_int($sum_int(sK0,$sum_int(5,-4)),sK0)),
% 3.99/1.09 inference(theory_normalisation,[status(thm)],[c_2519,c_59,c_60])).
% 3.99/1.09
% 3.99/1.09 cnf(c_2620,plain,
% 3.99/1.09 ($false),
% 3.99/1.09 inference(smt_theory_normalisation,[status(thm)],[c_2547])).
% 3.99/1.09
% 3.99/1.09
% 3.99/1.09 % SZS output end CNFRefutation for theBenchmark.p
% 3.99/1.09
% 3.99/1.09
%------------------------------------------------------------------------------