TSTP Solution File: ARI617_1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : ARI617_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n024.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:30 EDT 2023

% Result   : Theorem 3.93s 1.15s
% Output   : CNFRefutation 3.93s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.13  % Problem  : ARI617_1 : TPTP v8.1.2. Released v5.1.0.
% 0.14/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n024.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Tue Aug 29 18:20:53 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running TFA theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.93/1.15  % SZS status Started for theBenchmark.p
% 3.93/1.15  % SZS status Theorem for theBenchmark.p
% 3.93/1.15  
% 3.93/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.93/1.15  
% 3.93/1.15  ------  iProver source info
% 3.93/1.15  
% 3.93/1.15  git: date: 2023-05-31 18:12:56 +0000
% 3.93/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.93/1.15  git: non_committed_changes: false
% 3.93/1.15  git: last_make_outside_of_git: false
% 3.93/1.15  
% 3.93/1.15  ------ Parsing...
% 3.93/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.93/1.15  
% 3.93/1.15  ------ 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 
% 3.93/1.15  
% 3.93/1.15  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.93/1.15  
% 3.93/1.15  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.93/1.15  ------ Proving...
% 3.93/1.15  ------ Problem Properties 
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  clauses                                 18
% 3.93/1.15  conjectures                             6
% 3.93/1.15  EPR                                     4
% 3.93/1.15  Horn                                    15
% 3.93/1.15  unary                                   12
% 3.93/1.15  binary                                  4
% 3.93/1.15  lits                                    26
% 3.93/1.15  lits eq                                 10
% 3.93/1.15  fd_pure                                 0
% 3.93/1.15  fd_pseudo                               0
% 3.93/1.15  fd_cond                                 0
% 3.93/1.15  fd_pseudo_cond                          1
% 3.93/1.15  AC symbols                              1
% 3.93/1.15  
% 3.93/1.15  ------ Input Options Time Limit: Unbounded
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  ------ 
% 3.93/1.15  Current options:
% 3.93/1.15  ------ 
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  ------ Proving...
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  % SZS status Theorem for theBenchmark.p
% 3.93/1.15  
% 3.93/1.15  % SZS output start CNFRefutation for theBenchmark.p
% 3.93/1.15  
% 3.93/1.15  tff(f1,conjecture,(
% 3.93/1.15    (! [X0 : $int] : (($uminus(X0) = g(X0) | g(X0) = X0) & $lesseq(0,g(X0))) & ! [X0 : $int] : (($lesseq(f(X0),$uminus(X0)) | $lesseq(f(X0),X0)) & $lesseq($uminus(X0),f(X0)) & $lesseq(X0,f(X0)))) => ! [X0 : $int] : f(X0) = g(X0)),
% 3.93/1.15    file('/export/starexec/sandbox/benchmark/theBenchmark.p',absolute_value_defs)).
% 3.93/1.15  
% 3.93/1.15  tff(f2,negated_conjecture,(
% 3.93/1.15    ~((! [X0 : $int] : (($uminus(X0) = g(X0) | g(X0) = X0) & $lesseq(0,g(X0))) & ! [X0 : $int] : (($lesseq(f(X0),$uminus(X0)) | $lesseq(f(X0),X0)) & $lesseq($uminus(X0),f(X0)) & $lesseq(X0,f(X0)))) => ! [X0 : $int] : f(X0) = g(X0))),
% 3.93/1.15    inference(negated_conjecture,[],[f1])).
% 3.93/1.15  
% 3.93/1.15  tff(f3,plain,(
% 3.93/1.15    ~((! [X0 : $int] : (($uminus(X0) = g(X0) | g(X0) = X0) & ~$less(g(X0),0)) & ! [X0 : $int] : ((~$less($uminus(X0),f(X0)) | ~$less(X0,f(X0))) & ~$less(f(X0),$uminus(X0)) & ~$less(f(X0),X0))) => ! [X0 : $int] : f(X0) = g(X0))),
% 3.93/1.15    inference(theory_normalization,[],[f2])).
% 3.93/1.15  
% 3.93/1.15  tff(f11,plain,(
% 3.93/1.15    ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 3.93/1.15    introduced(theory_axiom_147,[])).
% 3.93/1.15  
% 3.93/1.15  tff(f16,plain,(
% 3.93/1.15    ~((! [X0 : $int] : (($uminus(X0) = g(X0) | g(X0) = X0) & ~$less(g(X0),0)) & ! [X1 : $int] : ((~$less($uminus(X1),f(X1)) | ~$less(X1,f(X1))) & ~$less(f(X1),$uminus(X1)) & ~$less(f(X1),X1))) => ! [X2 : $int] : f(X2) = g(X2))),
% 3.93/1.15    inference(rectify,[],[f3])).
% 3.93/1.15  
% 3.93/1.15  tff(f17,plain,(
% 3.93/1.15    ? [X2 : $int] : f(X2) != g(X2) & (! [X0 : $int] : (($uminus(X0) = g(X0) | g(X0) = X0) & ~$less(g(X0),0)) & ! [X1 : $int] : ((~$less($uminus(X1),f(X1)) | ~$less(X1,f(X1))) & ~$less(f(X1),$uminus(X1)) & ~$less(f(X1),X1)))),
% 3.93/1.15    inference(ennf_transformation,[],[f16])).
% 3.93/1.15  
% 3.93/1.15  tff(f18,plain,(
% 3.93/1.15    ? [X2 : $int] : f(X2) != g(X2) & ! [X0 : $int] : (($uminus(X0) = g(X0) | g(X0) = X0) & ~$less(g(X0),0)) & ! [X1 : $int] : ((~$less($uminus(X1),f(X1)) | ~$less(X1,f(X1))) & ~$less(f(X1),$uminus(X1)) & ~$less(f(X1),X1))),
% 3.93/1.15    inference(flattening,[],[f17])).
% 3.93/1.15  
% 3.93/1.15  tff(f19,plain,(
% 3.93/1.15    ? [X0 : $int] : f(X0) != g(X0) & ! [X1 : $int] : (($uminus(X1) = g(X1) | g(X1) = X1) & ~$less(g(X1),0)) & ! [X2 : $int] : ((~$less($uminus(X2),f(X2)) | ~$less(X2,f(X2))) & ~$less(f(X2),$uminus(X2)) & ~$less(f(X2),X2))),
% 3.93/1.15    inference(rectify,[],[f18])).
% 3.93/1.15  
% 3.93/1.15  tff(f20,plain,(
% 3.93/1.15    ? [X0 : $int] : f(X0) != g(X0) => f(sK0) != g(sK0)),
% 3.93/1.15    introduced(choice_axiom,[])).
% 3.93/1.15  
% 3.93/1.15  tff(f21,plain,(
% 3.93/1.15    f(sK0) != g(sK0) & ! [X1 : $int] : (($uminus(X1) = g(X1) | g(X1) = X1) & ~$less(g(X1),0)) & ! [X2 : $int] : ((~$less($uminus(X2),f(X2)) | ~$less(X2,f(X2))) & ~$less(f(X2),$uminus(X2)) & ~$less(f(X2),X2))),
% 3.93/1.15    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20])).
% 3.93/1.15  
% 3.93/1.15  tff(f22,plain,(
% 3.93/1.15    ( ! [X2 : $int] : (~$less(f(X2),X2)) )),
% 3.93/1.15    inference(cnf_transformation,[],[f21])).
% 3.93/1.15  
% 3.93/1.15  tff(f23,plain,(
% 3.93/1.15    ( ! [X2 : $int] : (~$less(f(X2),$uminus(X2))) )),
% 3.93/1.15    inference(cnf_transformation,[],[f21])).
% 3.93/1.15  
% 3.93/1.15  tff(f24,plain,(
% 3.93/1.15    ( ! [X2 : $int] : (~$less($uminus(X2),f(X2)) | ~$less(X2,f(X2))) )),
% 3.93/1.15    inference(cnf_transformation,[],[f21])).
% 3.93/1.15  
% 3.93/1.15  tff(f25,plain,(
% 3.93/1.15    ( ! [X1 : $int] : (~$less(g(X1),0)) )),
% 3.93/1.15    inference(cnf_transformation,[],[f21])).
% 3.93/1.15  
% 3.93/1.15  tff(f26,plain,(
% 3.93/1.15    ( ! [X1 : $int] : ($uminus(X1) = g(X1) | g(X1) = X1) )),
% 3.93/1.15    inference(cnf_transformation,[],[f21])).
% 3.93/1.15  
% 3.93/1.15  tff(f27,plain,(
% 3.93/1.15    f(sK0) != g(sK0)),
% 3.93/1.15    inference(cnf_transformation,[],[f21])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_53,plain,
% 3.93/1.15      (X0_3 = X1_3|$less_int(X0_3,X1_3)|$less_int(X1_3,X0_3)),
% 3.93/1.15      inference(cnf_transformation,[],[f11])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_61,negated_conjecture,
% 3.93/1.15      (f(sK0) != g(sK0)),
% 3.93/1.15      inference(cnf_transformation,[],[f27])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_62,negated_conjecture,
% 3.93/1.15      ($uminus_int(X0_3) = g(X0_3)|g(X0_3) = X0_3),
% 3.93/1.15      inference(cnf_transformation,[],[f26])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_63,negated_conjecture,
% 3.93/1.15      (~$less_int(g(X0_3),0)),
% 3.93/1.15      inference(cnf_transformation,[],[f25])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_64,negated_conjecture,
% 3.93/1.15      (~$less_int($uminus_int(X0_3),f(X0_3))|~$less_int(X0_3,f(X0_3))),
% 3.93/1.15      inference(cnf_transformation,[],[f24])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_65,negated_conjecture,
% 3.93/1.15      (~$less_int(f(X0_3),$uminus_int(X0_3))),
% 3.93/1.15      inference(cnf_transformation,[],[f23])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_66,negated_conjecture,
% 3.93/1.15      (~$less_int(f(X0_3),X0_3)),
% 3.93/1.15      inference(cnf_transformation,[],[f22])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_657,plain,
% 3.93/1.15      ($uminus_int(sK0) != f(sK0)|g(sK0) = sK0),
% 3.93/1.15      inference(superposition,[status(thm)],[c_62,c_61])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_658,plain,
% 3.93/1.15      (~$less_int($uminus_int(X0_3),0)|g(X0_3) = X0_3),
% 3.93/1.15      inference(superposition,[status(thm)],[c_62,c_63])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_668,plain,
% 3.93/1.15      (~$less_int(0,X0_3)|g(X0_3) = X0_3),
% 3.93/1.15      inference(smt_theory_normalisation,[status(thm)],[c_658])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_796,plain,
% 3.93/1.15      (g(X0_3) = 0|$less_int(0,g(X0_3))),
% 3.93/1.15      inference(superposition,[status(thm)],[c_53,c_63])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_797,plain,
% 3.93/1.15      (~$less_int(X0_3,f(X0_3))|$uminus_int(X0_3) = f(X0_3)|$less_int(f(X0_3),$uminus_int(X0_3))),
% 3.93/1.15      inference(superposition,[status(thm)],[c_53,c_64])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_799,plain,
% 3.93/1.15      (f(X0_3) = X0_3|$less_int(X0_3,f(X0_3))),
% 3.93/1.15      inference(superposition,[status(thm)],[c_53,c_66])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_823,plain,
% 3.93/1.15      (~$less_int(X0_3,f(X0_3))|$uminus_int(X0_3) = f(X0_3)),
% 3.93/1.15      inference(forward_subsumption_resolution,[status(thm)],[c_797,c_65])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_926,plain,
% 3.93/1.15      (g(X0_3) = X0_3|g(X0_3) = 0|$less_int(0,$uminus_int(X0_3))),
% 3.93/1.15      inference(superposition,[status(thm)],[c_62,c_796])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_978,plain,
% 3.93/1.15      ($uminus_int(X0_3) = f(X0_3)|f(X0_3) = X0_3),
% 3.93/1.15      inference(superposition,[status(thm)],[c_799,c_823])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_1013,plain,
% 3.93/1.15      (g(X0_3) = X0_3|g(X0_3) = 0|$less_int(X0_3,0)),
% 3.93/1.15      inference(smt_theory_normalisation,[status(thm)],[c_926])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_3585,plain,
% 3.93/1.15      (f(sK0) = sK0|g(sK0) = sK0),
% 3.93/1.15      inference(superposition,[status(thm)],[c_978,c_657])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_3588,plain,
% 3.93/1.15      (f(X0_3) = X0_3|$less_int(X0_3,$uminus_int(X0_3))),
% 3.93/1.15      inference(superposition,[status(thm)],[c_978,c_799])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_3739,plain,
% 3.93/1.15      (f(X0_3) = X0_3|$less_int(X0_3,0)),
% 3.93/1.15      inference(smt_theory_normalisation,[status(thm)],[c_3588])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_3746,plain,
% 3.93/1.15      (f(g(X0_3)) = g(X0_3)),
% 3.93/1.15      inference(superposition,[status(thm)],[c_3739,c_63])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4494,plain,
% 3.93/1.15      (f(sK0) = sK0),
% 3.93/1.15      inference(superposition,[status(thm)],[c_3585,c_3746])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4508,plain,
% 3.93/1.15      (g(sK0) != sK0),
% 3.93/1.15      inference(demodulation,[status(thm)],[c_61,c_4494])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4528,plain,
% 3.93/1.15      (~$less_int(sK0,$uminus_int(sK0))),
% 3.93/1.15      inference(superposition,[status(thm)],[c_4494,c_65])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4535,plain,
% 3.93/1.15      (~$less_int(sK0,0)),
% 3.93/1.15      inference(smt_theory_normalisation,[status(thm)],[c_4528])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4536,plain,
% 3.93/1.15      (sK0 = 0|$less_int(0,sK0)),
% 3.93/1.15      inference(superposition,[status(thm)],[c_53,c_4535])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4541,plain,
% 3.93/1.15      (g(sK0) = sK0|g(sK0) = 0),
% 3.93/1.15      inference(superposition,[status(thm)],[c_1013,c_4535])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4545,plain,
% 3.93/1.15      (g(sK0) = 0),
% 3.93/1.15      inference(forward_subsumption_resolution,[status(thm)],[c_4541,c_4508])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4547,plain,
% 3.93/1.15      (sK0 != 0),
% 3.93/1.15      inference(demodulation,[status(thm)],[c_4508,c_4545])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4548,plain,
% 3.93/1.15      ($less_int(0,sK0)),
% 3.93/1.15      inference(backward_subsumption_resolution,[status(thm)],[c_4536,c_4547])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4796,plain,
% 3.93/1.15      (g(sK0) = sK0),
% 3.93/1.15      inference(superposition,[status(thm)],[c_4548,c_668])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4797,plain,
% 3.93/1.15      (sK0 = 0),
% 3.93/1.15      inference(light_normalisation,[status(thm)],[c_4796,c_4545])).
% 3.93/1.15  
% 3.93/1.15  cnf(c_4798,plain,
% 3.93/1.15      ($false),
% 3.93/1.15      inference(forward_subsumption_resolution,[status(thm)],[c_4797,c_4547])).
% 3.93/1.15  
% 3.93/1.15  
% 3.93/1.15  % SZS output end CNFRefutation for theBenchmark.p
% 3.93/1.15  
% 3.93/1.15  
%------------------------------------------------------------------------------