TSTP Solution File: DAT031_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT031_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:24 EDT 2023
% Result : Theorem 2.86s 1.17s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT031_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n017.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 : Thu Aug 24 13:41:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running TFA theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.86/1.17 % SZS status Started for theBenchmark.p
% 2.86/1.17 % SZS status Theorem for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.86/1.17
% 2.86/1.17 ------ iProver source info
% 2.86/1.17
% 2.86/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.86/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.86/1.17 git: non_committed_changes: false
% 2.86/1.17 git: last_make_outside_of_git: false
% 2.86/1.17
% 2.86/1.17 ------ Parsing...
% 2.86/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.86/1.17
% 2.86/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.86/1.17
% 2.86/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.86/1.17
% 2.86/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.86/1.17 ------ Proving...
% 2.86/1.17 ------ Problem Properties
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 clauses 26
% 2.86/1.17 conjectures 2
% 2.86/1.17 EPR 11
% 2.86/1.17 Horn 21
% 2.86/1.17 unary 17
% 2.86/1.17 binary 4
% 2.86/1.17 lits 40
% 2.86/1.17 lits eq 10
% 2.86/1.17 fd_pure 0
% 2.86/1.17 fd_pseudo 0
% 2.86/1.17 fd_cond 0
% 2.86/1.17 fd_pseudo_cond 3
% 2.86/1.17 AC symbols 1
% 2.86/1.17
% 2.86/1.17 ------ Input Options Time Limit: Unbounded
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------
% 2.86/1.17 Current options:
% 2.86/1.17 ------
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------ Proving...
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 % SZS status Theorem for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 tff(f4,axiom,(
% 2.86/1.17 ! [X5 : $int,X6 : collection,X7 : $int] : ((X5 = X7 | in(X5,X6)) <=> in(X5,add(X7,X6)))),
% 2.86/1.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)).
% 2.86/1.17
% 2.86/1.17 tff(f6,conjecture,(
% 2.86/1.17 ! [X0 : collection] : (add(10,add(30,add(50,empty))) = X0 => ? [X1 : $int] : (in(X1,X0) & $lesseq(X1,40) & $lesseq(20,X1)))),
% 2.86/1.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)).
% 2.86/1.17
% 2.86/1.17 tff(f7,negated_conjecture,(
% 2.86/1.17 ~! [X0 : collection] : (add(10,add(30,add(50,empty))) = X0 => ? [X1 : $int] : (in(X1,X0) & $lesseq(X1,40) & $lesseq(20,X1)))),
% 2.86/1.17 inference(negated_conjecture,[],[f6])).
% 2.86/1.17
% 2.86/1.17 tff(f8,plain,(
% 2.86/1.17 ~! [X0 : collection] : (add(10,add(30,add(50,empty))) = X0 => ? [X1 : $int] : (in(X1,X0) & ~$less(40,X1) & ~$less(X1,20)))),
% 2.86/1.17 inference(theory_normalization,[],[f7])).
% 2.86/1.17
% 2.86/1.17 tff(f23,plain,(
% 2.86/1.17 ! [X0 : $int,X1 : collection,X2 : $int] : ((X0 = X2 | in(X0,X1)) <=> in(X0,add(X2,X1)))),
% 2.86/1.17 inference(rectify,[],[f4])).
% 2.86/1.17
% 2.86/1.17 tff(f25,plain,(
% 2.86/1.17 ? [X0 : collection] : (! [X1 : $int] : (~in(X1,X0) | $less(40,X1) | $less(X1,20)) & add(10,add(30,add(50,empty))) = X0)),
% 2.86/1.17 inference(ennf_transformation,[],[f8])).
% 2.86/1.17
% 2.86/1.17 tff(f26,plain,(
% 2.86/1.17 ! [X0 : $int,X1 : collection,X2 : $int] : (((X0 = X2 | in(X0,X1)) | ~in(X0,add(X2,X1))) & (in(X0,add(X2,X1)) | (X0 != X2 & ~in(X0,X1))))),
% 2.86/1.17 inference(nnf_transformation,[],[f23])).
% 2.86/1.17
% 2.86/1.17 tff(f27,plain,(
% 2.86/1.17 ! [X0 : $int,X1 : collection,X2 : $int] : ((X0 = X2 | in(X0,X1) | ~in(X0,add(X2,X1))) & (in(X0,add(X2,X1)) | (X0 != X2 & ~in(X0,X1))))),
% 2.86/1.17 inference(flattening,[],[f26])).
% 2.86/1.17
% 2.86/1.17 tff(f30,plain,(
% 2.86/1.17 ? [X0 : collection] : (! [X1 : $int] : (~in(X1,X0) | $less(40,X1) | $less(X1,20)) & add(10,add(30,add(50,empty))) = X0) => (! [X1 : $int] : (~in(X1,sK0) | $less(40,X1) | $less(X1,20)) & add(10,add(30,add(50,empty))) = sK0)),
% 2.86/1.17 introduced(choice_axiom,[])).
% 2.86/1.17
% 2.86/1.17 tff(f31,plain,(
% 2.86/1.17 ! [X1 : $int] : (~in(X1,sK0) | $less(40,X1) | $less(X1,20)) & add(10,add(30,add(50,empty))) = sK0),
% 2.86/1.17 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f30])).
% 2.86/1.17
% 2.86/1.17 tff(f35,plain,(
% 2.86/1.17 ( ! [X2 : $int,X0 : $int,X1 : collection] : (in(X0,add(X2,X1)) | ~in(X0,X1)) )),
% 2.86/1.17 inference(cnf_transformation,[],[f27])).
% 2.86/1.17
% 2.86/1.17 tff(f36,plain,(
% 2.86/1.17 ( ! [X2 : $int,X0 : $int,X1 : collection] : (in(X0,add(X2,X1)) | X0 != X2) )),
% 2.86/1.17 inference(cnf_transformation,[],[f27])).
% 2.86/1.17
% 2.86/1.17 tff(f41,plain,(
% 2.86/1.17 add(10,add(30,add(50,empty))) = sK0),
% 2.86/1.17 inference(cnf_transformation,[],[f31])).
% 2.86/1.17
% 2.86/1.17 tff(f42,plain,(
% 2.86/1.17 ( ! [X1 : $int] : (~in(X1,sK0) | $less(40,X1) | $less(X1,20)) )),
% 2.86/1.17 inference(cnf_transformation,[],[f31])).
% 2.86/1.17
% 2.86/1.17 tff(f43,plain,(
% 2.86/1.17 ( ! [X2 : $int,X1 : collection] : (in(X2,add(X2,X1))) )),
% 2.86/1.17 inference(equality_resolution,[],[f36])).
% 2.86/1.17
% 2.86/1.17 cnf(c_65,plain,
% 2.86/1.17 (in(X0_3,add(X0_3,X0_13))),
% 2.86/1.17 inference(cnf_transformation,[],[f43])).
% 2.86/1.17
% 2.86/1.17 cnf(c_66,plain,
% 2.86/1.17 (~in(X0_3,X0_13)|in(X0_3,add(X1_3,X0_13))),
% 2.86/1.17 inference(cnf_transformation,[],[f35])).
% 2.86/1.17
% 2.86/1.17 cnf(c_70,negated_conjecture,
% 2.86/1.17 (~in(X0_3,sK0)|$less_int(X0_3,20)|$less_int(40,X0_3)),
% 2.86/1.17 inference(cnf_transformation,[],[f42])).
% 2.86/1.17
% 2.86/1.17 cnf(c_71,negated_conjecture,
% 2.86/1.17 (add(10,add(30,add(50,empty))) = sK0),
% 2.86/1.17 inference(cnf_transformation,[],[f41])).
% 2.86/1.17
% 2.86/1.17 cnf(c_940,plain,
% 2.86/1.17 (~in(X0_3,add(30,add(50,empty)))|in(X0_3,sK0)),
% 2.86/1.17 inference(superposition,[status(thm)],[c_71,c_66])).
% 2.86/1.17
% 2.86/1.17 cnf(c_1028,plain,
% 2.86/1.17 (in(30,sK0)),
% 2.86/1.17 inference(superposition,[status(thm)],[c_65,c_940])).
% 2.86/1.17
% 2.86/1.17 cnf(c_1033,plain,
% 2.86/1.17 ($less_int(40,30)|$less_int(30,20)),
% 2.86/1.17 inference(superposition,[status(thm)],[c_1028,c_70])).
% 2.86/1.17
% 2.86/1.17 cnf(c_1036,plain,
% 2.86/1.17 ($false),
% 2.86/1.17 inference(smt_theory_normalisation,[status(thm)],[c_1033])).
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 2.86/1.17
% 2.86/1.17
%------------------------------------------------------------------------------