TSTP Solution File: DAT066_1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : DAT066_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.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:20 EDT 2024

% Result   : Theorem 2.87s 1.12s
% Output   : CNFRefutation 2.87s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : DAT066_1 : TPTP v8.1.2. Released v5.5.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.32  % Computer : n022.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Thu May  2 18:41:12 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.17/0.44  Running TFA theorem proving
% 0.17/0.44  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
% 2.87/1.12  % SZS status Started for theBenchmark.p
% 2.87/1.12  % SZS status Theorem for theBenchmark.p
% 2.87/1.12  
% 2.87/1.12  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.87/1.12  
% 2.87/1.12  ------  iProver source info
% 2.87/1.12  
% 2.87/1.12  git: date: 2024-05-02 19:28:25 +0000
% 2.87/1.12  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.87/1.12  git: non_committed_changes: false
% 2.87/1.12  
% 2.87/1.12  ------ Parsing...
% 2.87/1.12  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.87/1.12  
% 2.87/1.12  ------ 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.87/1.12  
% 2.87/1.12  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.87/1.12  
% 2.87/1.12  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.87/1.12  ------ Proving...
% 2.87/1.12  ------ Problem Properties 
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  clauses                                 31
% 2.87/1.12  conjectures                             2
% 2.87/1.12  EPR                                     7
% 2.87/1.12  Horn                                    26
% 2.87/1.12  unary                                   20
% 2.87/1.12  binary                                  7
% 2.87/1.12  lits                                    46
% 2.87/1.12  lits eq                                 25
% 2.87/1.12  fd_pure                                 0
% 2.87/1.12  fd_pseudo                               0
% 2.87/1.12  fd_cond                                 0
% 2.87/1.12  fd_pseudo_cond                          5
% 2.87/1.12  AC symbols                              1
% 2.87/1.12  
% 2.87/1.12  ------ Input Options Time Limit: Unbounded
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  ------ 
% 2.87/1.12  Current options:
% 2.87/1.12  ------ 
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  ------ Proving...
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  % SZS status Theorem for theBenchmark.p
% 2.87/1.12  
% 2.87/1.12  % SZS output start CNFRefutation for theBenchmark.p
% 2.87/1.12  
% 2.87/1.12  tff(f2,axiom,(
% 2.87/1.12    ! [X1 : heap,X0 : $int,X2 : $int] : ($sum(1,length(X1)) = X0 => sel(app(X1,X2),X0) = X2)),
% 2.87/1.12    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_2)).
% 2.87/1.12  
% 2.87/1.12  tff(f15,conjecture,(
% 2.87/1.12    ! [X2 : $int,X0 : $int,X1 : heap] : ($sum(1,length(X1)) != X0 | sel(app(X1,X2),X0) = X2)),
% 2.87/1.12    file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_1)).
% 2.87/1.12  
% 2.87/1.12  tff(f16,negated_conjecture,(
% 2.87/1.12    ~! [X2 : $int,X0 : $int,X1 : heap] : ($sum(1,length(X1)) != X0 | sel(app(X1,X2),X0) = X2)),
% 2.87/1.12    inference(negated_conjecture,[],[f15])).
% 2.87/1.12  
% 2.87/1.12  tff(f29,plain,(
% 2.87/1.12    ! [X0 : heap,X1 : $int,X2 : $int] : ($sum(1,length(X0)) = X1 => sel(app(X0,X2),X1) = X2)),
% 2.87/1.12    inference(rectify,[],[f2])).
% 2.87/1.12  
% 2.87/1.12  tff(f41,plain,(
% 2.87/1.12    ~! [X0 : $int,X1 : $int,X2 : heap] : ($sum(1,length(X2)) != X1 | sel(app(X2,X0),X1) = X0)),
% 2.87/1.12    inference(rectify,[],[f16])).
% 2.87/1.12  
% 2.87/1.12  tff(f42,plain,(
% 2.87/1.12    ! [X0 : heap,X1 : $int,X2 : $int] : (sel(app(X0,X2),X1) = X2 | $sum(1,length(X0)) != X1)),
% 2.87/1.12    inference(ennf_transformation,[],[f29])).
% 2.87/1.12  
% 2.87/1.12  tff(f46,plain,(
% 2.87/1.12    ? [X0 : $int,X1 : $int,X2 : heap] : ($sum(1,length(X2)) = X1 & sel(app(X2,X0),X1) != X0)),
% 2.87/1.12    inference(ennf_transformation,[],[f41])).
% 2.87/1.12  
% 2.87/1.12  tff(f51,plain,(
% 2.87/1.12    ? [X0 : $int,X1 : $int,X2 : heap] : ($sum(1,length(X2)) = X1 & sel(app(X2,X0),X1) != X0) => (sK1 = $sum(1,length(sK2)) & sK0 != sel(app(sK2,sK0),sK1))),
% 2.87/1.12    introduced(choice_axiom,[])).
% 2.87/1.12  
% 2.87/1.12  tff(f52,plain,(
% 2.87/1.12    sK1 = $sum(1,length(sK2)) & sK0 != sel(app(sK2,sK0),sK1)),
% 2.87/1.12    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f46,f51])).
% 2.87/1.12  
% 2.87/1.12  tff(f54,plain,(
% 2.87/1.12    ( ! [X2 : $int,X0 : heap,X1 : $int] : (sel(app(X0,X2),X1) = X2 | $sum(1,length(X0)) != X1) )),
% 2.87/1.12    inference(cnf_transformation,[],[f42])).
% 2.87/1.12  
% 2.87/1.12  tff(f71,plain,(
% 2.87/1.12    sK0 != sel(app(sK2,sK0),sK1)),
% 2.87/1.12    inference(cnf_transformation,[],[f52])).
% 2.87/1.12  
% 2.87/1.12  tff(f72,plain,(
% 2.87/1.12    sK1 = $sum(1,length(sK2))),
% 2.87/1.12    inference(cnf_transformation,[],[f52])).
% 2.87/1.12  
% 2.87/1.12  tff(f73,plain,(
% 2.87/1.12    ( ! [X2 : $int,X0 : heap] : (sel(app(X0,X2),$sum(1,length(X0))) = X2) )),
% 2.87/1.12    inference(equality_resolution,[],[f54])).
% 2.87/1.12  
% 2.87/1.12  cnf(c_62,plain,
% 2.87/1.12      (sel(app(X0_13,X0_3),$sum_int(1,length(X0_13))) = X0_3),
% 2.87/1.12      inference(cnf_transformation,[],[f73])).
% 2.87/1.12  
% 2.87/1.12  cnf(c_78,negated_conjecture,
% 2.87/1.12      ($sum_int(1,length(sK2)) = sK1),
% 2.87/1.12      inference(cnf_transformation,[],[f72])).
% 2.87/1.12  
% 2.87/1.12  cnf(c_79,negated_conjecture,
% 2.87/1.12      (sel(app(sK2,sK0),sK1) != sK0),
% 2.87/1.12      inference(cnf_transformation,[],[f71])).
% 2.87/1.12  
% 2.87/1.12  cnf(c_1474,plain,
% 2.87/1.12      (sel(app(sK2,X0_3),sK1) = X0_3),
% 2.87/1.12      inference(superposition,[status(thm)],[c_78,c_62])).
% 2.87/1.12  
% 2.87/1.12  cnf(c_1477,plain,
% 2.87/1.12      ($false),
% 2.87/1.12      inference(backward_subsumption_resolution,[status(thm)],[c_79,c_1474])).
% 2.87/1.12  
% 2.87/1.12  
% 2.87/1.12  % SZS output end CNFRefutation for theBenchmark.p
% 2.87/1.12  
% 2.87/1.12  
%------------------------------------------------------------------------------