TSTP Solution File: DAT085_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : DAT085_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 0.47s 1.17s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT085_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n025.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 14:20:06 EDT 2023
% 0.14/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.47/1.17 % SZS status Started for theBenchmark.p
% 0.47/1.17 % SZS status Theorem for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.17
% 0.47/1.17 ------ iProver source info
% 0.47/1.17
% 0.47/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.17 git: non_committed_changes: false
% 0.47/1.17 git: last_make_outside_of_git: false
% 0.47/1.17
% 0.47/1.17 ------ Parsing...
% 0.47/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.17
% 0.47/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
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.17 ------ Proving...
% 0.47/1.17 ------ Problem Properties
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 clauses 38
% 0.47/1.17 conjectures 1
% 0.47/1.17 EPR 5
% 0.47/1.17 Horn 26
% 0.47/1.17 unary 19
% 0.47/1.17 binary 8
% 0.47/1.17 lits 69
% 0.47/1.17 lits eq 33
% 0.47/1.17 fd_pure 0
% 0.47/1.17 fd_pseudo 0
% 0.47/1.17 fd_cond 3
% 0.47/1.17 fd_pseudo_cond 3
% 0.47/1.17 AC symbols 1
% 0.47/1.17
% 0.47/1.17 ------ Input Options Time Limit: Unbounded
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------
% 0.47/1.17 Current options:
% 0.47/1.17 ------
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Proving...
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 % SZS status Theorem for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 % SZS output start CNFRefutation for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 tff(f1,axiom,(
% 0.47/1.17 ! [X0 : $int,X1 : list] : head(cons(X0,X1)) = X0),
% 0.47/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1)).
% 0.47/1.17
% 0.47/1.17 tff(f2,axiom,(
% 0.47/1.17 ! [X0 : $int,X1 : list] : tail(cons(X0,X1)) = X1),
% 0.47/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2)).
% 0.47/1.17
% 0.47/1.17 tff(f3,axiom,(
% 0.47/1.17 ! [X1 : list] : (cons(head(X1),tail(X1)) = X1 | nil = X1)),
% 0.47/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3)).
% 0.47/1.17
% 0.47/1.17 tff(f4,axiom,(
% 0.47/1.17 ! [X0 : $int,X1 : list] : cons(X0,X1) != nil),
% 0.47/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4)).
% 0.47/1.17
% 0.47/1.17 tff(f8,axiom,(
% 0.47/1.17 ! [X3 : $int,X4 : list] : length(cons(X3,X4)) = $sum(1,length(X4))),
% 0.47/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_1)).
% 0.47/1.17
% 0.47/1.17 tff(f15,conjecture,(
% 0.47/1.17 ~! [X7 : list,X8 : list] : (length(X7) = length(X8) => X7 = X8)),
% 0.47/1.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c)).
% 0.47/1.17
% 0.47/1.17 tff(f16,negated_conjecture,(
% 0.47/1.17 ~~! [X7 : list,X8 : list] : (length(X7) = length(X8) => X7 = X8)),
% 0.47/1.17 inference(negated_conjecture,[],[f15])).
% 0.47/1.17
% 0.47/1.17 tff(f31,plain,(
% 0.47/1.17 ! [X0 : list] : (cons(head(X0),tail(X0)) = X0 | nil = X0)),
% 0.47/1.17 inference(rectify,[],[f3])).
% 0.47/1.17
% 0.47/1.17 tff(f34,plain,(
% 0.47/1.17 ! [X0 : $int,X1 : list] : length(cons(X0,X1)) = $sum(1,length(X1))),
% 0.47/1.17 inference(rectify,[],[f8])).
% 0.47/1.17
% 0.47/1.17 tff(f40,plain,(
% 0.47/1.17 ~~! [X0 : list,X1 : list] : (length(X1) = length(X0) => X0 = X1)),
% 0.47/1.17 inference(rectify,[],[f16])).
% 0.47/1.17
% 0.47/1.17 tff(f41,plain,(
% 0.47/1.17 ! [X0 : list,X1 : list] : (length(X1) = length(X0) => X0 = X1)),
% 0.47/1.17 inference(flattening,[],[f40])).
% 0.47/1.17
% 0.47/1.17 tff(f44,plain,(
% 0.47/1.17 ! [X0 : list,X1 : list] : (X0 = X1 | length(X1) != length(X0))),
% 0.47/1.17 inference(ennf_transformation,[],[f41])).
% 0.47/1.17
% 0.47/1.17 tff(f57,plain,(
% 0.47/1.17 ( ! [X0 : $int,X1 : list] : (head(cons(X0,X1)) = X0) )),
% 0.47/1.17 inference(cnf_transformation,[],[f1])).
% 0.47/1.17
% 0.47/1.17 tff(f58,plain,(
% 0.47/1.17 ( ! [X0 : $int,X1 : list] : (tail(cons(X0,X1)) = X1) )),
% 0.47/1.17 inference(cnf_transformation,[],[f2])).
% 0.47/1.17
% 0.47/1.17 tff(f59,plain,(
% 0.47/1.17 ( ! [X0 : list] : (cons(head(X0),tail(X0)) = X0 | nil = X0) )),
% 0.47/1.17 inference(cnf_transformation,[],[f31])).
% 0.47/1.17
% 0.47/1.17 tff(f60,plain,(
% 0.47/1.17 ( ! [X0 : $int,X1 : list] : (cons(X0,X1) != nil) )),
% 0.47/1.17 inference(cnf_transformation,[],[f4])).
% 0.47/1.17
% 0.47/1.17 tff(f74,plain,(
% 0.47/1.17 ( ! [X0 : $int,X1 : list] : (length(cons(X0,X1)) = $sum(1,length(X1))) )),
% 0.47/1.17 inference(cnf_transformation,[],[f34])).
% 0.47/1.17
% 0.47/1.17 tff(f82,plain,(
% 0.47/1.17 ( ! [X0 : list,X1 : list] : (X0 = X1 | length(X1) != length(X0)) )),
% 0.47/1.17 inference(cnf_transformation,[],[f44])).
% 0.47/1.17
% 0.47/1.17 cnf(c_61,plain,
% 0.47/1.17 (head(cons(X0_3,X0_13)) = X0_3),
% 0.47/1.17 inference(cnf_transformation,[],[f57])).
% 0.47/1.17
% 0.47/1.17 cnf(c_62,plain,
% 0.47/1.17 (tail(cons(X0_3,X0_13)) = X0_13),
% 0.47/1.17 inference(cnf_transformation,[],[f58])).
% 0.47/1.17
% 0.47/1.17 cnf(c_63,plain,
% 0.47/1.17 (cons(head(X0_13),tail(X0_13)) = X0_13|X0_13 = nil),
% 0.47/1.17 inference(cnf_transformation,[],[f59])).
% 0.47/1.17
% 0.47/1.17 cnf(c_64,plain,
% 0.47/1.17 (cons(X0_3,X0_13) != nil),
% 0.47/1.17 inference(cnf_transformation,[],[f60])).
% 0.47/1.17
% 0.47/1.17 cnf(c_78,plain,
% 0.47/1.17 (length(cons(X0_3,X0_13)) = $sum_int(1,length(X0_13))),
% 0.47/1.17 inference(cnf_transformation,[],[f74])).
% 0.47/1.17
% 0.47/1.17 cnf(c_86,negated_conjecture,
% 0.47/1.17 (length(X0_13) != length(X1_13)|X0_13 = X1_13),
% 0.47/1.17 inference(cnf_transformation,[],[f82])).
% 0.47/1.17
% 0.47/1.17 cnf(c_1697,plain,
% 0.47/1.17 ($sum_int(1,length(X0_13)) != length(X1_13)|cons(X0_3,X0_13) = X1_13),
% 0.47/1.17 inference(superposition,[status(thm)],[c_78,c_86])).
% 0.47/1.17
% 0.47/1.17 cnf(c_1893,plain,
% 0.47/1.17 ($sum_int(1,length(X0_13)) != $sum_int(1,length(X1_13))|cons(X0_3,X0_13) = cons(X1_3,X1_13)),
% 0.47/1.17 inference(superposition,[status(thm)],[c_78,c_1697])).
% 0.47/1.17
% 0.47/1.17 cnf(c_1937,plain,
% 0.47/1.17 (length(X0_13) != length(X1_13)|cons(X0_3,X0_13) = cons(X1_3,X1_13)),
% 0.47/1.17 inference(smt_theory_normalisation,[status(thm)],[c_1893])).
% 0.47/1.17
% 0.47/1.17 cnf(c_1946,plain,
% 0.47/1.17 ($sum_int(1,length(X0_13)) != length(X1_13)|cons(X0_3,cons(X1_3,X0_13)) = cons(X2_3,X1_13)),
% 0.47/1.17 inference(superposition,[status(thm)],[c_78,c_1937])).
% 0.47/1.17
% 0.47/1.17 cnf(c_1947,plain,
% 0.47/1.17 (cons(X0_3,X0_13) = cons(X1_3,X0_13)),
% 0.47/1.17 inference(equality_resolution,[status(thm)],[c_1937])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2002,plain,
% 0.47/1.17 (head(cons(X0_3,X0_13)) = X1_3),
% 0.47/1.17 inference(superposition,[status(thm)],[c_1947,c_61])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2007,plain,
% 0.47/1.17 (X0_3 = iProver_smallest_$int),
% 0.47/1.17 inference(demodulation,[status(thm)],[c_2002])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2032,plain,
% 0.47/1.17 (iProver_smallest_$int != iProver_smallest_$int|cons(X0_3,cons(X1_3,X0_13)) = cons(X2_3,X1_13)),
% 0.47/1.17 inference(demodulation,[status(thm)],[c_1946,c_2007])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2033,plain,
% 0.47/1.17 (cons(X0_3,cons(X1_3,X0_13)) = cons(X2_3,X1_13)),
% 0.47/1.17 inference(equality_resolution_simp,[status(thm)],[c_2032])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2048,plain,
% 0.47/1.17 (tail(cons(X0_3,cons(X1_3,X0_13))) = X1_13),
% 0.47/1.17 inference(superposition,[status(thm)],[c_2033,c_62])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2053,plain,
% 0.47/1.17 (X0_13 = iProver_smallest_list),
% 0.47/1.17 inference(demodulation,[status(thm)],[c_2048])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2058,plain,
% 0.47/1.17 (X0_13 = iProver_smallest_list),
% 0.47/1.17 inference(demodulation,[status(thm)],[c_63,c_2053])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2062,plain,
% 0.47/1.17 (nil != iProver_smallest_list),
% 0.47/1.17 inference(demodulation,[status(thm)],[c_64,c_2058])).
% 0.47/1.17
% 0.47/1.17 cnf(c_2073,plain,
% 0.47/1.17 ($false),
% 0.47/1.17 inference(forward_subsumption_resolution,[status(thm)],[c_2062,c_2058])).
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 % SZS output end CNFRefutation for theBenchmark.p
% 0.47/1.17
% 0.47/1.17
%------------------------------------------------------------------------------