TSTP Solution File: NUM304+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : NUM304+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n008.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:48:37 EDT 2024

% Result   : Theorem 3.01s 1.04s
% Output   : CNFRefutation 3.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem  : NUM304+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n008.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 19:22:57 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.16/0.41  Running first-order theorem proving
% 0.16/0.41  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.01/1.04  % SZS status Started for theBenchmark.p
% 3.01/1.04  % SZS status Theorem for theBenchmark.p
% 3.01/1.04  
% 3.01/1.04  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.01/1.04  
% 3.01/1.04  ------  iProver source info
% 3.01/1.04  
% 3.01/1.04  git: date: 2024-05-02 19:28:25 +0000
% 3.01/1.04  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.01/1.04  git: non_committed_changes: false
% 3.01/1.04  
% 3.01/1.04  ------ Parsing...
% 3.01/1.04  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.01/1.04  
% 3.01/1.04  ------ Preprocessing... sup_sim: 404  sf_s  rm: 9 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 6 0s  sf_e  pe_s  pe_e 
% 3.01/1.04  
% 3.01/1.04  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_eq
% 3.01/1.04   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e ------  preprocesses with Option_epr_non_horn_eq
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.01/1.04  ------ Proving...
% 3.01/1.04  ------ Problem Properties 
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  clauses                                 13
% 3.01/1.04  conjectures                             1
% 3.01/1.04  EPR                                     13
% 3.01/1.04  Horn                                    11
% 3.01/1.04  unary                                   3
% 3.01/1.04  binary                                  1
% 3.01/1.04  lits                                    35
% 3.01/1.04  lits eq                                 6
% 3.01/1.04  fd_pure                                 1
% 3.01/1.04  fd_pseudo                               0
% 3.01/1.04  fd_cond                                 0
% 3.01/1.04  fd_pseudo_cond                          5
% 3.01/1.04  AC symbols                              0
% 3.01/1.04  
% 3.01/1.04  ------ Schedule EPR non Horn eq is on
% 3.01/1.04  
% 3.01/1.04  ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  ------ 
% 3.01/1.04  Current options:
% 3.01/1.04  ------ 
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  ------ Proving...
% 3.01/1.04  
% 3.01/1.04  
% 3.01/1.04  % SZS status Theorem for theBenchmark.p
% 3.01/1.04  
% 3.01/1.04  % SZS output start CNFRefutation for theBenchmark.p
% 3.01/1.04  
% 3.01/1.04  fof(f137,axiom,(
% 3.01/1.04    rdn_translate(nn9,rdn_neg(rdnn(n9)))),
% 3.01/1.04    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn9)).
% 3.01/1.04  
% 3.01/1.04  fof(f282,axiom,(
% 3.01/1.04    ! [X0,X1,X9,X10] : ((rdn_translate(X1,rdn_pos(X10)) & rdn_translate(X0,rdn_neg(X9))) => less(X0,X1))),
% 3.01/1.04    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_neg_pos)).
% 3.01/1.04  
% 3.01/1.04  fof(f284,axiom,(
% 3.01/1.04    ! [X0,X1] : (less(X0,X1) <=> (X0 != X1 & ~less(X1,X0)))),
% 3.01/1.04    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property)).
% 3.01/1.04  
% 3.01/1.04  fof(f402,conjecture,(
% 3.01/1.04    ? [X0] : n12 != X0),
% 3.01/1.04    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_not_n12)).
% 3.01/1.04  
% 3.01/1.04  fof(f403,negated_conjecture,(
% 3.01/1.04    ~? [X0] : n12 != X0),
% 3.01/1.04    inference(negated_conjecture,[],[f402])).
% 3.01/1.04  
% 3.01/1.04  fof(f409,plain,(
% 3.01/1.04    ! [X0,X1,X2,X3] : ((rdn_translate(X1,rdn_pos(X3)) & rdn_translate(X0,rdn_neg(X2))) => less(X0,X1))),
% 3.01/1.04    inference(rectify,[],[f282])).
% 3.01/1.04  
% 3.01/1.04  fof(f436,plain,(
% 3.01/1.04    ! [X0,X1,X2,X3] : (less(X0,X1) | (~rdn_translate(X1,rdn_pos(X3)) | ~rdn_translate(X0,rdn_neg(X2))))),
% 3.01/1.04    inference(ennf_transformation,[],[f409])).
% 3.01/1.04  
% 3.01/1.04  fof(f437,plain,(
% 3.01/1.04    ! [X0,X1,X2,X3] : (less(X0,X1) | ~rdn_translate(X1,rdn_pos(X3)) | ~rdn_translate(X0,rdn_neg(X2)))),
% 3.01/1.04    inference(flattening,[],[f436])).
% 3.01/1.04  
% 3.01/1.04  fof(f471,plain,(
% 3.01/1.04    ! [X0] : n12 = X0),
% 3.01/1.04    inference(ennf_transformation,[],[f403])).
% 3.01/1.04  
% 3.01/1.04  fof(f472,plain,(
% 3.01/1.04    ! [X0,X1] : ((less(X0,X1) | (X0 = X1 | less(X1,X0))) & ((X0 != X1 & ~less(X1,X0)) | ~less(X0,X1)))),
% 3.01/1.04    inference(nnf_transformation,[],[f284])).
% 3.01/1.04  
% 3.01/1.04  fof(f473,plain,(
% 3.01/1.05    ! [X0,X1] : ((less(X0,X1) | X0 = X1 | less(X1,X0)) & ((X0 != X1 & ~less(X1,X0)) | ~less(X0,X1)))),
% 3.01/1.05    inference(flattening,[],[f472])).
% 3.01/1.05  
% 3.01/1.05  fof(f611,plain,(
% 3.01/1.05    rdn_translate(nn9,rdn_neg(rdnn(n9)))),
% 3.01/1.05    inference(cnf_transformation,[],[f137])).
% 3.01/1.05  
% 3.01/1.05  fof(f756,plain,(
% 3.01/1.05    ( ! [X2,X3,X0,X1] : (less(X0,X1) | ~rdn_translate(X1,rdn_pos(X3)) | ~rdn_translate(X0,rdn_neg(X2))) )),
% 3.01/1.05    inference(cnf_transformation,[],[f437])).
% 3.01/1.05  
% 3.01/1.05  fof(f759,plain,(
% 3.01/1.05    ( ! [X0,X1] : (X0 != X1 | ~less(X0,X1)) )),
% 3.01/1.05    inference(cnf_transformation,[],[f473])).
% 3.01/1.05  
% 3.01/1.05  fof(f879,plain,(
% 3.01/1.05    ( ! [X0] : (n12 = X0) )),
% 3.01/1.05    inference(cnf_transformation,[],[f471])).
% 3.01/1.05  
% 3.01/1.05  fof(f880,plain,(
% 3.01/1.05    ( ! [X1] : (~less(X1,X1)) )),
% 3.01/1.05    inference(equality_resolution,[],[f759])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_185,plain,
% 3.01/1.05      (rdn_translate(nn9,rdn_neg(rdnn(n9)))),
% 3.01/1.05      inference(cnf_transformation,[],[f611])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_330,plain,
% 3.01/1.05      (~rdn_translate(X0,rdn_neg(X1))|~rdn_translate(X2,rdn_pos(X3))|less(X0,X2)),
% 3.01/1.05      inference(cnf_transformation,[],[f756])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_333,plain,(~less(X0,X0)),inference(cnf_transformation,[],[f880])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_453,negated_conjecture,
% 3.01/1.05      (X0 = n12),
% 3.01/1.05      inference(cnf_transformation,[],[f879])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_1433,plain,
% 3.01/1.05      (X0 = iProver_smallest_$i),
% 3.01/1.05      inference(demodulation,[status(thm)],[c_453])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_1461,plain,
% 3.01/1.05      (rdn_translate(iProver_smallest_$i,iProver_smallest_$i)),
% 3.01/1.05      inference(demodulation,[status(thm)],[c_185,c_1433])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_1850,plain,
% 3.01/1.05      (~rdn_translate(X0,iProver_smallest_$i)|~rdn_translate(X1,iProver_smallest_$i)|
% 3.01/1.05      less(X0,X1)),
% 3.01/1.05      inference(demodulation,[status(thm)],[c_330,c_1433])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_2114,plain,
% 3.01/1.05      (~rdn_translate(X0,iProver_smallest_$i)|~rdn_translate(iProver_smallest_$i,iProver_smallest_$i)|
% 3.01/1.05      less(X0,iProver_smallest_$i)),
% 3.01/1.05      inference(instantiation,[status(thm)],[c_1850])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_2124,plain,
% 3.01/1.05      (~rdn_translate(iProver_smallest_$i,iProver_smallest_$i)|less(iProver_smallest_$i,iProver_smallest_$i)),
% 3.01/1.05      inference(instantiation,[status(thm)],[c_2114])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_2143,plain,
% 3.01/1.05      (~less(iProver_smallest_$i,iProver_smallest_$i)),
% 3.01/1.05      inference(instantiation,[status(thm)],[c_333])).
% 3.01/1.05  
% 3.01/1.05  cnf(c_2144,plain,
% 3.01/1.05      ($false),
% 3.01/1.05      inference(prop_impl_just,[status(thm)],[c_2143,c_2124,c_1461])).
% 3.01/1.05  
% 3.01/1.05  
% 3.01/1.05  % SZS output end CNFRefutation for theBenchmark.p
% 3.01/1.05  
% 3.01/1.05  
%------------------------------------------------------------------------------