TSTP Solution File: ARI735_1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : ARI735_1 : TPTP v8.1.2. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n018.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 17:41:54 EDT 2023

% Result   : Theorem 0.46s 1.17s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : ARI735_1 : TPTP v8.1.2. Released v6.4.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Aug 29 18:48:48 EDT 2023
% 0.13/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 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.17  % SZS status Started for theBenchmark.p
% 0.46/1.17  % SZS status Theorem for theBenchmark.p
% 0.46/1.17  
% 0.46/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.17  
% 0.46/1.17  ------  iProver source info
% 0.46/1.17  
% 0.46/1.17  git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.17  git: non_committed_changes: false
% 0.46/1.17  git: last_make_outside_of_git: false
% 0.46/1.17  
% 0.46/1.17  ------ Parsing...
% 0.46/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.46/1.17  
% 0.46/1.17  ------ Preprocessing... sup_sim: 2  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.46/1.17  
% 0.46/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.46/1.17  
% 0.46/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.46/1.17  ------ Proving...
% 0.46/1.17  ------ Problem Properties 
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  clauses                                 15
% 0.46/1.17  conjectures                             2
% 0.46/1.17  EPR                                     7
% 0.46/1.17  Horn                                    13
% 0.46/1.17  unary                                   11
% 0.46/1.17  binary                                  2
% 0.46/1.17  lits                                    21
% 0.46/1.17  lits eq                                 8
% 0.46/1.17  fd_pure                                 0
% 0.46/1.17  fd_pseudo                               0
% 0.46/1.17  fd_cond                                 0
% 0.46/1.17  fd_pseudo_cond                          1
% 0.46/1.17  AC symbols                              1
% 0.46/1.17  
% 0.46/1.17  ------ Input Options Time Limit: Unbounded
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  ------ 
% 0.46/1.17  Current options:
% 0.46/1.17  ------ 
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  ------ Proving...
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  % SZS status Theorem for theBenchmark.p
% 0.46/1.17  
% 0.46/1.17  % SZS output start CNFRefutation for theBenchmark.p
% 0.46/1.17  
% 0.46/1.17  tff(f1,conjecture,(
% 0.46/1.17    ! [X0 : $int] : ($greatereq(X0,0) => ((0 != X0 => ? [X1 : $int] : ($greatereq(X1,0) & $difference(X0,1) = X1)) & (0 = X0 => $true)))),
% 0.46/1.17    file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula)).
% 0.46/1.17  
% 0.46/1.17  tff(f2,negated_conjecture,(
% 0.46/1.17    ~! [X0 : $int] : ($greatereq(X0,0) => ((0 != X0 => ? [X1 : $int] : ($greatereq(X1,0) & $difference(X0,1) = X1)) & (0 = X0 => $true)))),
% 0.46/1.17    inference(negated_conjecture,[],[f1])).
% 0.46/1.17  
% 0.46/1.17  tff(f3,plain,(
% 0.46/1.17    ~! [X0 : $int] : (~$less(X0,0) => ((0 != X0 => ? [X1 : $int] : (~$less(X1,0) & $sum(X0,$uminus(1)) = X1)) & (0 = X0 => $true)))),
% 0.46/1.17    inference(theory_normalization,[],[f2])).
% 0.46/1.17  
% 0.46/1.17  tff(f4,plain,(
% 0.46/1.17    ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.46/1.17    introduced(theory_axiom_138,[])).
% 0.46/1.17  
% 0.46/1.17  tff(f6,plain,(
% 0.46/1.17    ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 0.46/1.17    introduced(theory_axiom_140,[])).
% 0.46/1.17  
% 0.46/1.17  tff(f11,plain,(
% 0.46/1.17    ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.46/1.17    introduced(theory_axiom_147,[])).
% 0.46/1.17  
% 0.46/1.17  tff(f15,plain,(
% 0.46/1.17    ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,$sum(X0,1))) )),
% 0.46/1.17    introduced(theory_axiom_164,[])).
% 0.46/1.17  
% 0.46/1.17  tff(f16,plain,(
% 0.46/1.17    ~! [X0 : $int] : (~$less(X0,0) => (0 != X0 => ? [X1 : $int] : (~$less(X1,0) & $sum(X0,$uminus(1)) = X1)))),
% 0.46/1.17    inference(true_and_false_elimination,[],[f3])).
% 0.46/1.17  
% 0.46/1.17  tff(f17,plain,(
% 0.46/1.17    ? [X0 : $int] : ((! [X1 : $int] : ($less(X1,0) | $sum(X0,$uminus(1)) != X1) & 0 != X0) & ~$less(X0,0))),
% 0.46/1.17    inference(ennf_transformation,[],[f16])).
% 0.46/1.17  
% 0.46/1.17  tff(f18,plain,(
% 0.46/1.17    ? [X0 : $int] : (! [X1 : $int] : ($less(X1,0) | $sum(X0,$uminus(1)) != X1) & 0 != X0 & ~$less(X0,0))),
% 0.46/1.17    inference(flattening,[],[f17])).
% 0.46/1.17  
% 0.46/1.17  tff(f19,plain,(
% 0.46/1.17    ? [X0 : $int] : (! [X1 : $int] : ($less(X1,0) | $sum(X0,$uminus(1)) != X1) & 0 != X0 & ~$less(X0,0)) => (! [X1 : $int] : ($less(X1,0) | $sum(sK0,$uminus(1)) != X1) & 0 != sK0 & ~$less(sK0,0))),
% 0.46/1.17    introduced(choice_axiom,[])).
% 0.46/1.17  
% 0.46/1.17  tff(f20,plain,(
% 0.46/1.17    ! [X1 : $int] : ($less(X1,0) | $sum(sK0,$uminus(1)) != X1) & 0 != sK0 & ~$less(sK0,0)),
% 0.46/1.17    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f19])).
% 0.46/1.17  
% 0.46/1.17  tff(f21,plain,(
% 0.46/1.17    ~$less(sK0,0)),
% 0.46/1.17    inference(cnf_transformation,[],[f20])).
% 0.46/1.17  
% 0.46/1.17  tff(f22,plain,(
% 0.46/1.17    0 != sK0),
% 0.46/1.17    inference(cnf_transformation,[],[f20])).
% 0.46/1.17  
% 0.46/1.17  tff(f23,plain,(
% 0.46/1.17    ( ! [X1 : $int] : ($less(X1,0) | $sum(sK0,$uminus(1)) != X1) )),
% 0.46/1.17    inference(cnf_transformation,[],[f20])).
% 0.46/1.17  
% 0.46/1.17  tff(f24,plain,(
% 0.46/1.17    $less($sum(sK0,$uminus(1)),0)),
% 0.46/1.17    inference(equality_resolution,[],[f23])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_49,plain,
% 0.46/1.17      (~$less_int(X0_3,$sum_int(X1_3,1))|~$less_int(X1_3,X0_3)),
% 0.46/1.17      inference(cnf_transformation,[],[f15])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_53,plain,
% 0.46/1.17      (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 0.46/1.17      inference(cnf_transformation,[],[f11])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_58,plain,
% 0.46/1.17      ($sum_int(X0_3,0) = X0_3),
% 0.46/1.17      inference(cnf_transformation,[],[f6])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_60,plain,
% 0.46/1.17      ($sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3)),
% 0.46/1.17      inference(cnf_transformation,[],[f4])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_61,negated_conjecture,
% 0.46/1.17      ($less_int($sum_int(sK0,$uminus_int(1)),0)),
% 0.46/1.17      inference(cnf_transformation,[],[f24])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_62,negated_conjecture,
% 0.46/1.17      (sK0 != 0),
% 0.46/1.17      inference(cnf_transformation,[],[f22])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_63,negated_conjecture,
% 0.46/1.17      (~$less_int(sK0,0)),
% 0.46/1.17      inference(cnf_transformation,[],[f21])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_151,plain,
% 0.46/1.17      ($less_int(sK0,1)),
% 0.46/1.17      inference(smt_theory_normalisation,[status(thm)],[c_61])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_513,plain,
% 0.46/1.17      ($sum_int(0,X0_3) = X0_3),
% 0.46/1.17      inference(superposition,[status(thm)],[c_60,c_58])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_537,plain,
% 0.46/1.17      (sK0 = 0|$less_int(0,sK0)),
% 0.46/1.17      inference(superposition,[status(thm)],[c_53,c_63])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_540,plain,
% 0.46/1.17      ($less_int(0,sK0)),
% 0.46/1.17      inference(forward_subsumption_resolution,[status(thm)],[c_537,c_62])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_562,plain,
% 0.46/1.17      (~$less_int(X0_3,1)|~$less_int(0,X0_3)),
% 0.46/1.17      inference(superposition,[status(thm)],[c_513,c_49])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_622,plain,
% 0.46/1.17      (~$less_int(0,sK0)),
% 0.46/1.17      inference(superposition,[status(thm)],[c_151,c_562])).
% 0.46/1.17  
% 0.46/1.17  cnf(c_626,plain,
% 0.46/1.17      ($false),
% 0.46/1.17      inference(forward_subsumption_resolution,[status(thm)],[c_622,c_540])).
% 0.46/1.17  
% 0.46/1.17  
% 0.46/1.17  % SZS output end CNFRefutation for theBenchmark.p
% 0.46/1.17  
% 0.46/1.17  
%------------------------------------------------------------------------------