TSTP Solution File: DAT006_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT006_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Fri May 3 02:14:10 EDT 2024
% Result : Theorem 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT006_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n028.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 May 2 19:06:18 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running TFA theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 4
% 0.48/1.16 conjectures 2
% 0.48/1.16 EPR 0
% 0.48/1.16 Horn 3
% 0.48/1.16 unary 3
% 0.48/1.16 binary 1
% 0.48/1.16 lits 5
% 0.48/1.16 lits eq 5
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 0
% 0.48/1.16 fd_pseudo_cond 1
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Input Options Time Limit: Unbounded
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 tff(f1,axiom,(
% 0.48/1.16 ! [X0 : array,X1 : $int,X2 : $int] : read(write(X0,X1,X2),X1) = X2),
% 0.48/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1)).
% 0.48/1.16
% 0.48/1.16 tff(f2,axiom,(
% 0.48/1.16 ! [X3 : array,X4 : $int,X5 : $int,X6 : $int] : (read(write(X3,X4,X6),X5) = read(X3,X5) | X4 = X5)),
% 0.48/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2)).
% 0.48/1.16
% 0.48/1.16 tff(f3,conjecture,(
% 0.48/1.16 ! [X0 : array,X1 : array] : (write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 => ? [X2 : $int] : 33 = read(X0,X2))),
% 0.48/1.16 file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)).
% 0.48/1.16
% 0.48/1.16 tff(f4,negated_conjecture,(
% 0.48/1.16 ~! [X0 : array,X1 : array] : (write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 => ? [X2 : $int] : 33 = read(X0,X2))),
% 0.48/1.16 inference(negated_conjecture,[],[f3])).
% 0.48/1.16
% 0.48/1.16 tff(f5,plain,(
% 0.48/1.16 ! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (read(X0,X2) = read(write(X0,X1,X3),X2) | X1 = X2)),
% 0.48/1.16 inference(rectify,[],[f2])).
% 0.48/1.16
% 0.48/1.16 tff(f6,plain,(
% 0.48/1.16 ? [X0 : array,X1 : array] : (! [X2 : $int] : 33 != read(X0,X2) & write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0)),
% 0.48/1.16 inference(ennf_transformation,[],[f4])).
% 0.48/1.16
% 0.48/1.16 tff(f7,plain,(
% 0.48/1.16 ? [X0 : array,X1 : array] : (! [X2 : $int] : 33 != read(X0,X2) & write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0) => (! [X2 : $int] : 33 != read(sK0,X2) & sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44))),
% 0.48/1.16 introduced(choice_axiom,[])).
% 0.48/1.16
% 0.48/1.16 tff(f8,plain,(
% 0.48/1.16 ! [X2 : $int] : 33 != read(sK0,X2) & sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44)),
% 0.48/1.16 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 0.48/1.16
% 0.48/1.16 tff(f9,plain,(
% 0.48/1.16 ( ! [X2 : $int,X0 : array,X1 : $int] : (read(write(X0,X1,X2),X1) = X2) )),
% 0.48/1.16 inference(cnf_transformation,[],[f1])).
% 0.48/1.16
% 0.48/1.16 tff(f10,plain,(
% 0.48/1.16 ( ! [X2 : $int,X3 : $int,X0 : array,X1 : $int] : (read(X0,X2) = read(write(X0,X1,X3),X2) | X1 = X2) )),
% 0.48/1.16 inference(cnf_transformation,[],[f5])).
% 0.48/1.16
% 0.48/1.16 tff(f11,plain,(
% 0.48/1.16 sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44)),
% 0.48/1.16 inference(cnf_transformation,[],[f8])).
% 0.48/1.16
% 0.48/1.16 tff(f12,plain,(
% 0.48/1.16 ( ! [X2 : $int] : (33 != read(sK0,X2)) )),
% 0.48/1.16 inference(cnf_transformation,[],[f8])).
% 0.48/1.16
% 0.48/1.16 cnf(c_49,plain,
% 0.48/1.16 (read(write(X0_13,X0_3,X1_3),X0_3) = X1_3),
% 0.48/1.16 inference(cnf_transformation,[],[f9])).
% 0.48/1.16
% 0.48/1.16 cnf(c_50,plain,
% 0.48/1.16 (read(write(X0_13,X0_3,X1_3),X2_3) = read(X0_13,X2_3)|X0_3 = X2_3),
% 0.48/1.16 inference(cnf_transformation,[],[f10])).
% 0.48/1.16
% 0.48/1.16 cnf(c_51,negated_conjecture,
% 0.48/1.16 (read(sK0,X0_3) != 33),
% 0.48/1.16 inference(cnf_transformation,[],[f12])).
% 0.48/1.16
% 0.48/1.16 cnf(c_52,negated_conjecture,
% 0.48/1.16 (write(write(write(write(sK1,3,33),4,444),5,55),4,44) = sK0),
% 0.48/1.16 inference(cnf_transformation,[],[f11])).
% 0.48/1.16
% 0.48/1.16 cnf(c_165,plain,
% 0.48/1.16 (read(write(write(write(sK1,3,33),4,444),5,55),X0_3) = read(sK0,X0_3)|
% 0.48/1.16 X0_3 = 4),
% 0.48/1.16 inference(superposition,[status(thm)],[c_52,c_50])).
% 0.48/1.16
% 0.48/1.16 cnf(c_177,plain,
% 0.48/1.16 (read(write(write(sK1,3,33),4,444),X0_3) = read(sK0,X0_3)|X0_3 = 4|
% 0.48/1.16 X0_3 = 5),
% 0.48/1.16 inference(superposition,[status(thm)],[c_165,c_50])).
% 0.48/1.16
% 0.48/1.16 cnf(c_195,plain,
% 0.48/1.16 (read(write(sK1,3,33),X0_3) = read(sK0,X0_3)|X0_3 = 4|X0_3 = 5),
% 0.48/1.16 inference(superposition,[status(thm)],[c_177,c_50])).
% 0.48/1.16
% 0.48/1.16 cnf(c_208,plain,
% 0.48/1.16 (read(sK0,3) = 33|3 = 4|3 = 5),
% 0.48/1.16 inference(superposition,[status(thm)],[c_195,c_49])).
% 0.48/1.16
% 0.48/1.16 cnf(c_210,plain,
% 0.48/1.16 (3 = 4|3 = 5),
% 0.48/1.16 inference(forward_subsumption_resolution,[status(thm)],[c_208,c_51])).
% 0.48/1.16
% 0.48/1.16 cnf(c_218,plain,
% 0.48/1.16 ($false),
% 0.48/1.16 inference(smt_theory_normalisation,[status(thm)],[c_210])).
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS output end CNFRefutation for theBenchmark.p
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------