TSTP Solution File: DAT087_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT087_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:37 EDT 2023
% Result : Theorem 2.96s 1.16s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT087_1 : TPTP v8.1.2. Released v6.1.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 13:44:40 EDT 2023
% 0.12/0.34 % 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
% 2.96/1.16 % SZS status Started for theBenchmark.p
% 2.96/1.16 % SZS status Theorem for theBenchmark.p
% 2.96/1.16
% 2.96/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.96/1.16
% 2.96/1.16 ------ iProver source info
% 2.96/1.16
% 2.96/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.96/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.96/1.16 git: non_committed_changes: false
% 2.96/1.16 git: last_make_outside_of_git: false
% 2.96/1.16
% 2.96/1.16 ------ Parsing...
% 2.96/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.96/1.16
% 2.96/1.16 ------ 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.96/1.16
% 2.96/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.96/1.16
% 2.96/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.96/1.16 ------ Proving...
% 2.96/1.16 ------ Problem Properties
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16 clauses 38
% 2.96/1.16 conjectures 1
% 2.96/1.16 EPR 5
% 2.96/1.16 Horn 26
% 2.96/1.16 unary 20
% 2.96/1.16 binary 7
% 2.96/1.16 lits 68
% 2.96/1.16 lits eq 32
% 2.96/1.16 fd_pure 0
% 2.96/1.16 fd_pseudo 0
% 2.96/1.16 fd_cond 3
% 2.96/1.16 fd_pseudo_cond 2
% 2.96/1.16 AC symbols 1
% 2.96/1.16
% 2.96/1.16 ------ Input Options Time Limit: Unbounded
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16 ------
% 2.96/1.16 Current options:
% 2.96/1.16 ------
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16 ------ Proving...
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16 % SZS status Theorem for theBenchmark.p
% 2.96/1.16
% 2.96/1.16 % SZS output start CNFRefutation for theBenchmark.p
% 2.96/1.16
% 2.96/1.16 tff(f11,axiom,(
% 2.96/1.16 ! [X0 : $int,X3 : $int,X4 : list,X5 : $int] : (X0 = X3 => count(X0,cons(X3,X4)) = $sum(count(X0,X4),1))),
% 2.96/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_4)).
% 2.96/1.16
% 2.96/1.16 tff(f15,conjecture,(
% 2.96/1.16 ~! [X5 : $int,X1 : list] : count(X5,X1) = count(X5,cons(1,X1))),
% 2.96/1.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c)).
% 2.96/1.16
% 2.96/1.16 tff(f16,negated_conjecture,(
% 2.96/1.16 ~~! [X5 : $int,X1 : list] : count(X5,X1) = count(X5,cons(1,X1))),
% 2.96/1.16 inference(negated_conjecture,[],[f15])).
% 2.96/1.16
% 2.96/1.16 tff(f19,plain,(
% 2.96/1.16 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 2.96/1.16 introduced(theory_axiom_138,[])).
% 2.96/1.16
% 2.96/1.16 tff(f20,plain,(
% 2.96/1.16 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 2.96/1.16 introduced(theory_axiom_139,[])).
% 2.96/1.16
% 2.96/1.16 tff(f36,plain,(
% 2.96/1.16 ! [X0 : $int,X1 : $int,X2 : list] : (X0 = X1 => count(X0,cons(X1,X2)) = $sum(count(X0,X2),1))),
% 2.96/1.16 inference(rectify,[],[f11])).
% 2.96/1.16
% 2.96/1.16 tff(f40,plain,(
% 2.96/1.16 ~~! [X0 : $int,X1 : list] : count(X0,X1) = count(X0,cons(1,X1))),
% 2.96/1.16 inference(rectify,[],[f16])).
% 2.96/1.16
% 2.96/1.16 tff(f41,plain,(
% 2.96/1.16 ! [X0 : $int,X1 : list] : count(X0,X1) = count(X0,cons(1,X1))),
% 2.96/1.16 inference(flattening,[],[f40])).
% 2.96/1.16
% 2.96/1.16 tff(f43,plain,(
% 2.96/1.16 ! [X0 : $int,X1 : $int,X2 : list] : (count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) | X0 != X1)),
% 2.96/1.16 inference(ennf_transformation,[],[f36])).
% 2.96/1.16
% 2.96/1.16 tff(f76,plain,(
% 2.96/1.16 ( ! [X2 : list,X0 : $int,X1 : $int] : (count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) | X0 != X1) )),
% 2.96/1.16 inference(cnf_transformation,[],[f43])).
% 2.96/1.16
% 2.96/1.16 tff(f81,plain,(
% 2.96/1.16 ( ! [X0 : $int,X1 : list] : (count(X0,X1) = count(X0,cons(1,X1))) )),
% 2.96/1.16 inference(cnf_transformation,[],[f41])).
% 2.96/1.16
% 2.96/1.16 tff(f87,plain,(
% 2.96/1.16 ( ! [X2 : list,X1 : $int] : (count(X1,cons(X1,X2)) = $sum(count(X1,X2),1)) )),
% 2.96/1.16 inference(equality_resolution,[],[f76])).
% 2.96/1.16
% 2.96/1.16 cnf(c_59,plain,
% 2.96/1.16 ($sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3))),
% 2.96/1.16 inference(cnf_transformation,[],[f20])).
% 2.96/1.16
% 2.96/1.16 cnf(c_60,plain,
% 2.96/1.16 ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 2.96/1.16 inference(cnf_transformation,[],[f19])).
% 2.96/1.16
% 2.96/1.16 cnf(c_81,plain,
% 2.96/1.16 (count(X0_3,cons(X0_3,X0_13)) = $sum_int(count(X0_3,X0_13),1)),
% 2.96/1.16 inference(cnf_transformation,[],[f87])).
% 2.96/1.16
% 2.96/1.16 cnf(c_86,negated_conjecture,
% 2.96/1.16 (count(X0_3,cons(1,X0_13)) = count(X0_3,X0_13)),
% 2.96/1.16 inference(cnf_transformation,[],[f81])).
% 2.96/1.16
% 2.96/1.16 cnf(c_120,plain,
% 2.96/1.16 (count(X0_3,cons(X0_3,X0_13)) = $sum_int(1,count(X0_3,X0_13))),
% 2.96/1.16 inference(theory_normalisation,[status(thm)],[c_81,c_59,c_60])).
% 2.96/1.16
% 2.96/1.16 cnf(c_1454,plain,
% 2.96/1.16 ($sum_int(1,count(1,X0_13)) = count(1,X0_13)),
% 2.96/1.16 inference(superposition,[status(thm)],[c_86,c_120])).
% 2.96/1.16
% 2.96/1.16 cnf(c_1463,plain,
% 2.96/1.16 ($false),
% 2.96/1.16 inference(smt_theory_normalisation,[status(thm)],[c_1454])).
% 2.96/1.16
% 2.96/1.16
% 2.96/1.16 % SZS output end CNFRefutation for theBenchmark.p
% 2.96/1.16
% 2.96/1.16
%------------------------------------------------------------------------------