TSTP Solution File: ARI591_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ARI591_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 17:41:25 EDT 2023
% Result : Theorem 0.50s 1.18s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI591_1 : TPTP v8.1.2. Released v5.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 17:59:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running TFA theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.50/1.18 % SZS status Started for theBenchmark.p
% 0.50/1.18 % SZS status Theorem for theBenchmark.p
% 0.50/1.18
% 0.50/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.50/1.18
% 0.50/1.18 ------ iProver source info
% 0.50/1.18
% 0.50/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.50/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.50/1.18 git: non_committed_changes: false
% 0.50/1.18 git: last_make_outside_of_git: false
% 0.50/1.18
% 0.50/1.18 ------ Parsing...
% 0.50/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.50/1.18
% 0.50/1.18 ------ 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
% 0.50/1.18
% 0.50/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.50/1.18
% 0.50/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.50/1.18 ------ Proving...
% 0.50/1.18 ------ Problem Properties
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18 clauses 14
% 0.50/1.18 conjectures 1
% 0.50/1.18 EPR 6
% 0.50/1.18 Horn 12
% 0.50/1.18 unary 9
% 0.50/1.18 binary 2
% 0.50/1.18 lits 22
% 0.50/1.18 lits eq 8
% 0.50/1.18 fd_pure 0
% 0.50/1.18 fd_pseudo 0
% 0.50/1.18 fd_cond 1
% 0.50/1.18 fd_pseudo_cond 1
% 0.50/1.18 AC symbols 1
% 0.50/1.18
% 0.50/1.18 ------ Input Options Time Limit: Unbounded
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18 ------
% 0.50/1.18 Current options:
% 0.50/1.18 ------
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18 ------ Proving...
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18 % SZS status Theorem for theBenchmark.p
% 0.50/1.18
% 0.50/1.18 % SZS output start CNFRefutation for theBenchmark.p
% 0.50/1.18
% 0.50/1.18 tff(f1,conjecture,(
% 0.50/1.18 ! [X0 : $int] : ? [X1 : $int] : (X0 != X1 & $less(X1,3) & $less(0,X1))),
% 0.50/1.18 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_0_3_noteq_Y)).
% 0.50/1.18
% 0.50/1.18 tff(f2,negated_conjecture,(
% 0.50/1.18 ~! [X0 : $int] : ? [X1 : $int] : (X0 != X1 & $less(X1,3) & $less(0,X1))),
% 0.50/1.18 inference(negated_conjecture,[],[f1])).
% 0.50/1.18
% 0.50/1.18 tff(f10,plain,(
% 0.50/1.18 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.50/1.18 introduced(theory_axiom_147,[])).
% 0.50/1.18
% 0.50/1.18 tff(f12,plain,(
% 0.50/1.18 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 0.50/1.18 introduced(theory_axiom_150,[])).
% 0.50/1.18
% 0.50/1.18 tff(f15,plain,(
% 0.50/1.18 ? [X0 : $int] : ! [X1 : $int] : (X0 = X1 | ~$less(X1,3) | ~$less(0,X1))),
% 0.50/1.18 inference(ennf_transformation,[],[f2])).
% 0.50/1.18
% 0.50/1.18 tff(f16,plain,(
% 0.50/1.18 ? [X0 : $int] : ! [X1 : $int] : (X0 = X1 | ~$less(X1,3) | ~$less(0,X1)) => ! [X1 : $int] : (sK0 = X1 | ~$less(X1,3) | ~$less(0,X1))),
% 0.50/1.18 introduced(choice_axiom,[])).
% 0.50/1.18
% 0.50/1.18 tff(f17,plain,(
% 0.50/1.18 ! [X1 : $int] : (sK0 = X1 | ~$less(X1,3) | ~$less(0,X1))),
% 0.50/1.18 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16])).
% 0.50/1.18
% 0.50/1.18 tff(f18,plain,(
% 0.50/1.18 ( ! [X1 : $int] : (sK0 = X1 | ~$less(X1,3) | ~$less(0,X1)) )),
% 0.50/1.18 inference(cnf_transformation,[],[f17])).
% 0.50/1.18
% 0.50/1.18 cnf(c_51,plain,
% 0.50/1.18 ($less_int(X0_3,$sum_int(X1_3,1))|$less_int(X1_3,X0_3)),
% 0.50/1.18 inference(cnf_transformation,[],[f12])).
% 0.50/1.18
% 0.50/1.18 cnf(c_53,plain,
% 0.50/1.18 (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 0.50/1.18 inference(cnf_transformation,[],[f10])).
% 0.50/1.18
% 0.50/1.18 cnf(c_61,negated_conjecture,
% 0.50/1.18 (~$less_int(X0_3,3)|~$less_int(0,X0_3)|X0_3 = sK0),
% 0.50/1.18 inference(cnf_transformation,[],[f18])).
% 0.50/1.18
% 0.50/1.18 cnf(c_62,plain,($less_int(0,1)),theory(arith)).
% 0.50/1.18
% 0.50/1.18 cnf(c_63,plain,($less_int(1,3)),theory(arith)).
% 0.50/1.18
% 0.50/1.18 cnf(c_521,plain,
% 0.50/1.18 (~$less_int(0,1)|sK0 = 1),
% 0.50/1.18 inference(superposition,[status(thm)],[c_63,c_61])).
% 0.50/1.18
% 0.50/1.18 cnf(c_522,plain,
% 0.50/1.18 (sK0 = 1),
% 0.50/1.18 inference(forward_subsumption_resolution,[status(thm)],[c_521,c_62])).
% 0.50/1.18
% 0.50/1.18 cnf(c_523,plain,
% 0.50/1.18 (~$less_int(X0_3,3)|~$less_int(0,X0_3)|X0_3 = 1),
% 0.50/1.18 inference(demodulation,[status(thm)],[c_61,c_522])).
% 0.50/1.18
% 0.50/1.18 cnf(c_675,plain,
% 0.50/1.18 (~$less_int(0,X0_3)|X0_3 = 1|X0_3 = 3|$less_int(3,X0_3)),
% 0.50/1.18 inference(superposition,[status(thm)],[c_53,c_523])).
% 0.50/1.18
% 0.50/1.18 cnf(c_885,plain,
% 0.50/1.18 ($sum_int(X0_3,1) = 1|$sum_int(X0_3,1) = 3|$less_int(3,$sum_int(X0_3,1))|
% 0.50/1.18 $less_int(X0_3,0)),
% 0.50/1.18 inference(superposition,[status(thm)],[c_51,c_675])).
% 0.50/1.18
% 0.50/1.18 cnf(c_1014,plain,
% 0.50/1.18 (X0_3 = 0|X0_3 = 2|$less_int(X0_3,0)|$less_int(2,X0_3)),
% 0.50/1.18 inference(smt_theory_normalisation,[status(thm)],[c_885])).
% 0.50/1.18
% 0.50/1.18 cnf(c_1026,plain,
% 0.50/1.18 (~$less_int(0,2)|1 = 2|0 = 3|3 = 2|$less_int(3,0)),
% 0.50/1.18 inference(superposition,[status(thm)],[c_1014,c_523])).
% 0.50/1.18
% 0.50/1.18 cnf(c_1069,plain,
% 0.50/1.18 ($false),
% 0.50/1.18 inference(smt_theory_normalisation,[status(thm)],[c_1026])).
% 0.50/1.18
% 0.50/1.18
% 0.50/1.18 % SZS output end CNFRefutation for theBenchmark.p
% 0.50/1.18
% 0.50/1.18
%------------------------------------------------------------------------------