TSTP Solution File: DAT095_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT095_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:39 EDT 2023
% Result : Theorem 3.20s 1.17s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT095_1 : TPTP v8.1.2. Released v6.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n024.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 14:23:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running TFA theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.20/1.17 % SZS status Started for theBenchmark.p
% 3.20/1.17 % SZS status Theorem for theBenchmark.p
% 3.20/1.17
% 3.20/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.20/1.17
% 3.20/1.17 ------ iProver source info
% 3.20/1.17
% 3.20/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.20/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.20/1.17 git: non_committed_changes: false
% 3.20/1.17 git: last_make_outside_of_git: false
% 3.20/1.17
% 3.20/1.17 ------ Parsing...
% 3.20/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.20/1.17
% 3.20/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
% 3.20/1.17
% 3.20/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.20/1.17
% 3.20/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.20/1.17 ------ Proving...
% 3.20/1.17 ------ Problem Properties
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 clauses 38
% 3.20/1.17 conjectures 1
% 3.20/1.17 EPR 5
% 3.20/1.17 Horn 26
% 3.20/1.17 unary 19
% 3.20/1.17 binary 8
% 3.20/1.17 lits 69
% 3.20/1.17 lits eq 32
% 3.20/1.17 fd_pure 0
% 3.20/1.17 fd_pseudo 0
% 3.20/1.17 fd_cond 3
% 3.20/1.17 fd_pseudo_cond 2
% 3.20/1.17 AC symbols 1
% 3.20/1.17
% 3.20/1.17 ------ Input Options Time Limit: Unbounded
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 ------
% 3.20/1.17 Current options:
% 3.20/1.17 ------
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 ------ Proving...
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 % SZS status Theorem for theBenchmark.p
% 3.20/1.17
% 3.20/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 3.20/1.17
% 3.20/1.17 tff(f5,axiom,(
% 3.20/1.17 ! [X2 : $int,X1 : list] : (in(X2,X1) <=> (? [X3 : $int,X4 : list] : (in(X2,X4) & cons(X3,X4) = X1) | ? [X3 : $int,X4 : list] : (X2 = X3 & cons(X3,X4) = X1)))),
% 3.20/1.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv)).
% 3.20/1.17
% 3.20/1.17 tff(f11,axiom,(
% 3.20/1.17 ! [X0 : $int,X3 : $int,X4 : list,X5 : $int] : (X0 = X3 => count(X0,cons(X3,X4)) = $sum(count(X0,X4),1))),
% 3.20/1.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_4)).
% 3.20/1.17
% 3.20/1.17 tff(f15,conjecture,(
% 3.20/1.17 ~! [X7 : $int,X5 : $int,X1 : list,X8 : list] : ((cons(X7,X1) = X8 & in(X5,X1)) => count(X5,X1) = count(X5,X8))),
% 3.20/1.17 file('/export/starexec/sandbox/benchmark/theBenchmark.p',c)).
% 3.20/1.17
% 3.20/1.17 tff(f16,negated_conjecture,(
% 3.20/1.17 ~~! [X7 : $int,X5 : $int,X1 : list,X8 : list] : ((cons(X7,X1) = X8 & in(X5,X1)) => count(X5,X1) = count(X5,X8))),
% 3.20/1.17 inference(negated_conjecture,[],[f15])).
% 3.20/1.17
% 3.20/1.17 tff(f19,plain,(
% 3.20/1.17 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 3.20/1.17 introduced(theory_axiom_138,[])).
% 3.20/1.17
% 3.20/1.17 tff(f20,plain,(
% 3.20/1.17 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 3.20/1.17 introduced(theory_axiom_139,[])).
% 3.20/1.17
% 3.20/1.17 tff(f32,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : (in(X0,X1) <=> (? [X2 : $int,X3 : list] : (in(X0,X3) & cons(X2,X3) = X1) | ? [X4 : $int,X5 : list] : (X0 = X4 & cons(X4,X5) = X1)))),
% 3.20/1.17 inference(rectify,[],[f5])).
% 3.20/1.17
% 3.20/1.17 tff(f36,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : $int,X2 : list] : (X0 = X1 => count(X0,cons(X1,X2)) = $sum(count(X0,X2),1))),
% 3.20/1.17 inference(rectify,[],[f11])).
% 3.20/1.17
% 3.20/1.17 tff(f40,plain,(
% 3.20/1.17 ~~! [X0 : $int,X1 : $int,X2 : list,X3 : list] : ((cons(X0,X2) = X3 & in(X1,X2)) => count(X1,X2) = count(X1,X3))),
% 3.20/1.17 inference(rectify,[],[f16])).
% 3.20/1.17
% 3.20/1.17 tff(f41,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : $int,X2 : list,X3 : list] : ((cons(X0,X2) = X3 & in(X1,X2)) => count(X1,X2) = count(X1,X3))),
% 3.20/1.17 inference(flattening,[],[f40])).
% 3.20/1.17
% 3.20/1.17 tff(f43,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : $int,X2 : list] : (count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) | X0 != X1)),
% 3.20/1.17 inference(ennf_transformation,[],[f36])).
% 3.20/1.17
% 3.20/1.17 tff(f44,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : $int,X2 : list,X3 : list] : (count(X1,X2) = count(X1,X3) | (cons(X0,X2) != X3 | ~in(X1,X2)))),
% 3.20/1.17 inference(ennf_transformation,[],[f41])).
% 3.20/1.17
% 3.20/1.17 tff(f45,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : $int,X2 : list,X3 : list] : (count(X1,X2) = count(X1,X3) | cons(X0,X2) != X3 | ~in(X1,X2))),
% 3.20/1.17 inference(flattening,[],[f44])).
% 3.20/1.17
% 3.20/1.17 tff(f46,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : ((in(X0,X1) | (! [X2 : $int,X3 : list] : (~in(X0,X3) | cons(X2,X3) != X1) & ! [X4 : $int,X5 : list] : (X0 != X4 | cons(X4,X5) != X1))) & ((? [X2 : $int,X3 : list] : (in(X0,X3) & cons(X2,X3) = X1) | ? [X4 : $int,X5 : list] : (X0 = X4 & cons(X4,X5) = X1)) | ~in(X0,X1)))),
% 3.20/1.17 inference(nnf_transformation,[],[f32])).
% 3.20/1.17
% 3.20/1.17 tff(f47,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : ((in(X0,X1) | (! [X2 : $int,X3 : list] : (~in(X0,X3) | cons(X2,X3) != X1) & ! [X4 : $int,X5 : list] : (X0 != X4 | cons(X4,X5) != X1))) & (? [X2 : $int,X3 : list] : (in(X0,X3) & cons(X2,X3) = X1) | ? [X4 : $int,X5 : list] : (X0 = X4 & cons(X4,X5) = X1) | ~in(X0,X1)))),
% 3.20/1.17 inference(flattening,[],[f46])).
% 3.20/1.17
% 3.20/1.17 tff(f48,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : ((in(X0,X1) | (! [X2 : $int,X3 : list] : (~in(X0,X3) | cons(X2,X3) != X1) & ! [X4 : $int,X5 : list] : (X0 != X4 | cons(X4,X5) != X1))) & (? [X6 : $int,X7 : list] : (in(X0,X7) & cons(X6,X7) = X1) | ? [X8 : $int,X9 : list] : (X0 = X8 & cons(X8,X9) = X1) | ~in(X0,X1)))),
% 3.20/1.17 inference(rectify,[],[f47])).
% 3.20/1.17
% 3.20/1.17 tff(f49,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : (? [X6 : $int,X7 : list] : (in(X0,X7) & cons(X6,X7) = X1) => (in(X0,sK1(X0,X1)) & cons(sK0(X0,X1),sK1(X0,X1)) = X1))),
% 3.20/1.17 introduced(choice_axiom,[])).
% 3.20/1.17
% 3.20/1.17 tff(f50,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : (? [X8 : $int,X9 : list] : (X0 = X8 & cons(X8,X9) = X1) => (sK2(X0,X1) = X0 & cons(sK2(X0,X1),sK3(X0,X1)) = X1))),
% 3.20/1.17 introduced(choice_axiom,[])).
% 3.20/1.17
% 3.20/1.17 tff(f51,plain,(
% 3.20/1.17 ! [X0 : $int,X1 : list] : ((in(X0,X1) | (! [X2 : $int,X3 : list] : (~in(X0,X3) | cons(X2,X3) != X1) & ! [X4 : $int,X5 : list] : (X0 != X4 | cons(X4,X5) != X1))) & ((in(X0,sK1(X0,X1)) & cons(sK0(X0,X1),sK1(X0,X1)) = X1) | (sK2(X0,X1) = X0 & cons(sK2(X0,X1),sK3(X0,X1)) = X1) | ~in(X0,X1)))),
% 3.20/1.17 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f48,f50,f49])).
% 3.20/1.17
% 3.20/1.17 tff(f66,plain,(
% 3.20/1.17 ( ! [X0 : $int,X1 : list,X4 : $int,X5 : list] : (in(X0,X1) | X0 != X4 | cons(X4,X5) != X1) )),
% 3.20/1.17 inference(cnf_transformation,[],[f51])).
% 3.20/1.17
% 3.20/1.17 tff(f78,plain,(
% 3.20/1.17 ( ! [X2 : list,X0 : $int,X1 : $int] : (count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) | X0 != X1) )),
% 3.20/1.17 inference(cnf_transformation,[],[f43])).
% 3.20/1.17
% 3.20/1.17 tff(f83,plain,(
% 3.20/1.17 ( ! [X2 : list,X3 : list,X0 : $int,X1 : $int] : (count(X1,X2) = count(X1,X3) | cons(X0,X2) != X3 | ~in(X1,X2)) )),
% 3.20/1.17 inference(cnf_transformation,[],[f45])).
% 3.20/1.17
% 3.20/1.17 tff(f85,plain,(
% 3.20/1.17 ( ! [X1 : list,X4 : $int,X5 : list] : (in(X4,X1) | cons(X4,X5) != X1) )),
% 3.20/1.17 inference(equality_resolution,[],[f66])).
% 3.20/1.17
% 3.20/1.17 tff(f86,plain,(
% 3.20/1.17 ( ! [X4 : $int,X5 : list] : (in(X4,cons(X4,X5))) )),
% 3.20/1.17 inference(equality_resolution,[],[f85])).
% 3.20/1.17
% 3.20/1.17 tff(f89,plain,(
% 3.20/1.17 ( ! [X2 : list,X1 : $int] : (count(X1,cons(X1,X2)) = $sum(count(X1,X2),1)) )),
% 3.20/1.17 inference(equality_resolution,[],[f78])).
% 3.20/1.17
% 3.20/1.17 tff(f90,plain,(
% 3.20/1.17 ( ! [X2 : list,X0 : $int,X1 : $int] : (count(X1,X2) = count(X1,cons(X0,X2)) | ~in(X1,X2)) )),
% 3.20/1.17 inference(equality_resolution,[],[f83])).
% 3.20/1.17
% 3.20/1.17 cnf(c_59,plain,
% 3.20/1.17 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 3.20/1.17 inference(cnf_transformation,[],[f20])).
% 3.20/1.17
% 3.20/1.17 cnf(c_60,plain,
% 3.20/1.17 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 3.20/1.17 inference(cnf_transformation,[],[f19])).
% 3.20/1.17
% 3.20/1.17 cnf(c_66,plain,
% 3.20/1.17 (in(X0_3,cons(X0_3,X0_13))),
% 3.20/1.17 inference(cnf_transformation,[],[f86])).
% 3.20/1.17
% 3.20/1.17 cnf(c_81,plain,
% 3.20/1.17 (count(X0_3,cons(X0_3,X0_13)) = $sum_int(count(X0_3,X0_13),1)),
% 3.20/1.17 inference(cnf_transformation,[],[f89])).
% 3.20/1.17
% 3.20/1.17 cnf(c_86,negated_conjecture,
% 3.20/1.17 (~in(X0_3,X0_13)|count(X0_3,cons(X1_3,X0_13)) = count(X0_3,X0_13)),
% 3.20/1.17 inference(cnf_transformation,[],[f90])).
% 3.20/1.17
% 3.20/1.17 cnf(c_120,plain,
% 3.20/1.17 (count(X0_3,cons(X0_3,X0_13)) = $sum_int(1,count(X0_3,X0_13))),
% 3.20/1.17 inference(theory_normalisation,[status(thm)],[c_81,c_59,c_60])).
% 3.20/1.17
% 3.20/1.17 cnf(c_1484,plain,
% 3.20/1.17 (count(X0_3,cons(X1_3,cons(X0_3,X0_13))) = count(X0_3,cons(X0_3,X0_13))),
% 3.20/1.17 inference(superposition,[status(thm)],[c_66,c_86])).
% 3.20/1.17
% 3.20/1.17 cnf(c_1485,plain,
% 3.20/1.17 (count(X0_3,cons(X1_3,cons(X0_3,X0_13))) = $sum_int(1,count(X0_3,X0_13))),
% 3.20/1.17 inference(light_normalisation,[status(thm)],[c_1484,c_120])).
% 3.20/1.17
% 3.20/1.17 cnf(c_1487,plain,
% 3.20/1.17 ($sum_int(1,count(X0_3,cons(X0_3,X0_13))) = $sum_int(1,count(X0_3,X0_13))),
% 3.20/1.17 inference(superposition,[status(thm)],[c_1485,c_120])).
% 3.20/1.17
% 3.20/1.17 cnf(c_1489,plain,
% 3.20/1.17 ($sum_int(1,$sum_int(1,count(X0_3,X0_13))) = $sum_int(1,count(X0_3,X0_13))),
% 3.20/1.17 inference(light_normalisation,[status(thm)],[c_1487,c_120])).
% 3.20/1.17
% 3.20/1.17 cnf(c_1499,plain,
% 3.20/1.17 ($false),
% 3.20/1.17 inference(smt_theory_normalisation,[status(thm)],[c_1489])).
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 3.20/1.17
% 3.20/1.17
%------------------------------------------------------------------------------