TSTP Solution File: DAT081_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT081_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:36 EDT 2023
% Result : Theorem 0.48s 1.15s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT081_1 : TPTP v8.1.2. Released v6.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 Aug 24 14:46:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running TFA theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.15 % SZS status Started for theBenchmark.p
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.15
% 0.48/1.15 ------ iProver source info
% 0.48/1.15
% 0.48/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.15 git: non_committed_changes: false
% 0.48/1.15 git: last_make_outside_of_git: false
% 0.48/1.15
% 0.48/1.15 ------ Parsing...
% 0.48/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.15
% 0.48/1.15 ------ 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.48/1.15
% 0.48/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.15 ------ Proving...
% 0.48/1.15 ------ Problem Properties
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 clauses 38
% 0.48/1.15 conjectures 1
% 0.48/1.15 EPR 6
% 0.48/1.15 Horn 26
% 0.48/1.15 unary 20
% 0.48/1.15 binary 7
% 0.48/1.15 lits 68
% 0.48/1.15 lits eq 31
% 0.48/1.15 fd_pure 0
% 0.48/1.15 fd_pseudo 0
% 0.48/1.15 fd_cond 3
% 0.48/1.15 fd_pseudo_cond 2
% 0.48/1.15 AC symbols 1
% 0.48/1.15
% 0.48/1.15 ------ Input Options Time Limit: Unbounded
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------
% 0.48/1.15 Current options:
% 0.48/1.15 ------
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------ Proving...
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 % SZS status Theorem for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 % SZS output start CNFRefutation for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 tff(f9,axiom,(
% 0.48/1.15 ! [X0 : $int] : 0 = count(X0,nil)),
% 0.48/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a)).
% 0.48/1.15
% 0.48/1.15 tff(f14,axiom,(
% 0.48/1.15 ! [X5 : $int,X1 : list] : (in(X5,X1) <=> $greater(count(X5,X1),0))),
% 0.48/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_8)).
% 0.48/1.15
% 0.48/1.15 tff(f15,conjecture,(
% 0.48/1.15 ! [X7 : $int] : ~in(X7,nil)),
% 0.48/1.15 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c)).
% 0.48/1.15
% 0.48/1.15 tff(f16,negated_conjecture,(
% 0.48/1.15 ~! [X7 : $int] : ~in(X7,nil)),
% 0.48/1.15 inference(negated_conjecture,[],[f15])).
% 0.48/1.15
% 0.48/1.15 tff(f18,plain,(
% 0.48/1.15 ! [X5 : $int,X1 : list] : (in(X5,X1) <=> $less(0,count(X5,X1)))),
% 0.48/1.15 inference(theory_normalization,[],[f14])).
% 0.48/1.15
% 0.48/1.15 tff(f24,plain,(
% 0.48/1.15 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.48/1.15 introduced(theory_axiom_145,[])).
% 0.48/1.15
% 0.48/1.15 tff(f39,plain,(
% 0.48/1.15 ! [X0 : $int,X1 : list] : (in(X0,X1) <=> $less(0,count(X0,X1)))),
% 0.48/1.15 inference(rectify,[],[f18])).
% 0.48/1.15
% 0.48/1.15 tff(f40,plain,(
% 0.48/1.15 ~! [X0 : $int] : ~in(X0,nil)),
% 0.48/1.15 inference(rectify,[],[f16])).
% 0.48/1.15
% 0.48/1.15 tff(f43,plain,(
% 0.48/1.15 ? [X0 : $int] : in(X0,nil)),
% 0.48/1.15 inference(ennf_transformation,[],[f40])).
% 0.48/1.15
% 0.48/1.15 tff(f55,plain,(
% 0.48/1.15 ! [X0 : $int,X1 : list] : ((in(X0,X1) | ~$less(0,count(X0,X1))) & ($less(0,count(X0,X1)) | ~in(X0,X1)))),
% 0.48/1.15 inference(nnf_transformation,[],[f39])).
% 0.48/1.15
% 0.48/1.15 tff(f56,plain,(
% 0.48/1.15 ? [X0 : $int] : in(X0,nil) => in(sK6,nil)),
% 0.48/1.15 introduced(choice_axiom,[])).
% 0.48/1.15
% 0.48/1.15 tff(f57,plain,(
% 0.48/1.15 in(sK6,nil)),
% 0.48/1.15 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f43,f56])).
% 0.48/1.15
% 0.48/1.15 tff(f76,plain,(
% 0.48/1.15 ( ! [X0 : $int] : (0 = count(X0,nil)) )),
% 0.48/1.15 inference(cnf_transformation,[],[f9])).
% 0.48/1.15
% 0.48/1.15 tff(f81,plain,(
% 0.48/1.15 ( ! [X0 : $int,X1 : list] : ($less(0,count(X0,X1)) | ~in(X0,X1)) )),
% 0.48/1.15 inference(cnf_transformation,[],[f55])).
% 0.48/1.15
% 0.48/1.15 tff(f83,plain,(
% 0.48/1.15 in(sK6,nil)),
% 0.48/1.15 inference(cnf_transformation,[],[f57])).
% 0.48/1.15
% 0.48/1.15 cnf(c_55,plain,
% 0.48/1.15 (~$less_int(X0_3,X0_3)),
% 0.48/1.15 inference(cnf_transformation,[],[f24])).
% 0.48/1.15
% 0.48/1.15 cnf(c_79,plain,(count(X0_3,nil) = 0),inference(cnf_transformation,[],[f76])).
% 0.48/1.15
% 0.48/1.15 cnf(c_85,plain,
% 0.48/1.15 (~in(X0_3,X0_13)|$less_int(0,count(X0_3,X0_13))),
% 0.48/1.15 inference(cnf_transformation,[],[f81])).
% 0.48/1.15
% 0.48/1.15 cnf(c_86,negated_conjecture,
% 0.48/1.15 (in(sK6,nil)),
% 0.48/1.15 inference(cnf_transformation,[],[f83])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1563,plain,
% 0.48/1.15 (~in(X0_3,nil)|$less_int(0,0)),
% 0.48/1.15 inference(superposition,[status(thm)],[c_79,c_85])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1565,plain,
% 0.48/1.15 (~in(X0_3,nil)),
% 0.48/1.15 inference(forward_subsumption_resolution,[status(thm)],[c_1563,c_55])).
% 0.48/1.15
% 0.48/1.15 cnf(c_1566,plain,
% 0.48/1.15 ($false),
% 0.48/1.15 inference(backward_subsumption_resolution,[status(thm)],[c_86,c_1565])).
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 % SZS output end CNFRefutation for theBenchmark.p
% 0.48/1.15
% 0.48/1.15
%------------------------------------------------------------------------------