TSTP Solution File: ARI670_1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : ARI670_1 : TPTP v8.1.2. Released v6.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n009.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:07:30 EDT 2024

% Result   : Theorem 2.94s 1.17s
% Output   : CNFRefutation 2.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    7 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   15 (  15 fml;   0 var)
%            Number arithmetic     :   10 (   5 atm;   5 fun;   0 num;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    2 (   0 usr;   0 con; 2-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f1,conjecture,
    $lesseq(a,$product(a,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

tff(f2,negated_conjecture,
    ~ $lesseq(a,$product(a,a)),
    inference(negated_conjecture,[],[f1]) ).

tff(f3,plain,
    ~ ~ $less($product(a,a),a),
    inference(theory_normalization,[],[f2]) ).

tff(f22,plain,
    $less($product(a,a),a),
    inference(flattening,[],[f3]) ).

tff(f23,plain,
    $less($product(a,a),a),
    inference(cnf_transformation,[],[f22]) ).

cnf(c_67,negated_conjecture,
    $less_int($product_int(a,a),a),
    inference(cnf_transformation,[],[f23]) ).

cnf(c_4900,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_67]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : ARI670_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n009.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri May  3 01:02:55 EDT 2024
% 0.14/0.36  % CPUTime  : 
% 0.20/0.49  Running TFA theorem proving
% 0.20/0.49  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
% 2.94/1.17  % SZS status Started for theBenchmark.p
% 2.94/1.17  % SZS status Theorem for theBenchmark.p
% 2.94/1.17  
% 2.94/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.94/1.17  
% 2.94/1.17  ------  iProver source info
% 2.94/1.17  
% 2.94/1.17  git: date: 2024-05-02 19:28:25 +0000
% 2.94/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.94/1.17  git: non_committed_changes: false
% 2.94/1.17  
% 2.94/1.17  ------ Parsing...
% 2.94/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.94/1.17  
% 2.94/1.17  ------ 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.94/1.17  
% 2.94/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.94/1.17  
% 2.94/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.94/1.17  ------ Proving...
% 2.94/1.17  ------ Problem Properties 
% 2.94/1.17  
% 2.94/1.17  
% 2.94/1.17  clauses                                 19
% 2.94/1.17  conjectures                             1
% 2.94/1.17  EPR                                     4
% 2.94/1.17  Horn                                    16
% 2.94/1.17  unary                                   14
% 2.94/1.17  binary                                  2
% 2.94/1.17  lits                                    27
% 2.94/1.17  lits eq                                 15
% 2.94/1.17  fd_pure                                 0
% 2.94/1.17  fd_pseudo                               0
% 2.94/1.17  fd_cond                                 0
% 2.94/1.17  fd_pseudo_cond                          2
% 2.94/1.17  AC symbols                              2
% 2.94/1.17  
% 2.94/1.17  ------ Input Options Time Limit: Unbounded
% 2.94/1.17  
% 2.94/1.17  
% 2.94/1.17  ------ 
% 2.94/1.17  Current options:
% 2.94/1.17  ------ 
% 2.94/1.17  
% 2.94/1.17  
% 2.94/1.17  
% 2.94/1.17  
% 2.94/1.17  ------ Proving...
% 2.94/1.17  
% 2.94/1.17  
% 2.94/1.17  % SZS status Theorem for theBenchmark.p
% 2.94/1.17  
% 2.94/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.94/1.17  
% 2.94/1.17  
%------------------------------------------------------------------------------