TSTP Solution File: ARI004_1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n005.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:06:02 EDT 2024

% Result   : Theorem 0.42s 1.10s
% Output   : CNFRefutation 0.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : ARI004_1 : TPTP v8.1.2. Released v5.0.0.
% 0.10/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.31  % Computer : n005.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Fri May  3 01:07:11 EDT 2024
% 0.16/0.31  % CPUTime  : 
% 0.17/0.42  Running TFA theorem proving
% 0.17/0.42  Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.42/1.10  % SZS status Started for theBenchmark.p
% 0.42/1.10  % SZS status Theorem for theBenchmark.p
% 0.42/1.10  
% 0.42/1.10  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.10  
% 0.42/1.10  ------  iProver source info
% 0.42/1.10  
% 0.42/1.10  git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.10  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.10  git: non_committed_changes: false
% 0.42/1.10  
% 0.42/1.10  ------ Parsing...
% 0.42/1.10  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.42/1.10  
% 0.42/1.10  ------ Preprocessing...
% 0.42/1.10  
% 0.42/1.10  % SZS status Theorem for theBenchmark.p
% 0.42/1.10  
% 0.42/1.10  % SZS output start CNFRefutation for theBenchmark.p
% 0.42/1.10  
% 0.42/1.10  tff(f1,conjecture,(
% 0.42/1.10    ? [X0 : $int] : $less(X0,13)),
% 0.42/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_13)).
% 0.42/1.10  
% 0.42/1.10  tff(f2,negated_conjecture,(
% 0.42/1.10    ~? [X0 : $int] : $less(X0,13)),
% 0.42/1.10    inference(negated_conjecture,[],[f1])).
% 0.42/1.10  
% 0.42/1.10  tff(f15,plain,(
% 0.42/1.10    ! [X0 : $int] : ~$less(X0,13)),
% 0.42/1.10    inference(ennf_transformation,[],[f2])).
% 0.42/1.10  
% 0.42/1.10  tff(f16,plain,(
% 0.42/1.10    ( ! [X0 : $int] : (~$less(X0,13)) )),
% 0.42/1.10    inference(cnf_transformation,[],[f15])).
% 0.42/1.10  
% 0.42/1.10  cnf(c_61,negated_conjecture,
% 0.42/1.10      (~$less_int(X0_3,13)),
% 0.42/1.10      inference(cnf_transformation,[],[f16])).
% 0.42/1.10  
% 0.42/1.10  cnf(c_63,plain,($less_int(1,13)),theory(arith)).
% 0.42/1.10  
% 0.42/1.10  cnf(c_107,plain,
% 0.42/1.10      ($false),
% 0.42/1.10      inference(forward_subsumption_resolution,[status(thm)],[c_63,c_61])).
% 0.42/1.10  
% 0.42/1.10  
% 0.42/1.10  % SZS output end CNFRefutation for theBenchmark.p
% 0.42/1.10  
% 0.42/1.10  
%------------------------------------------------------------------------------