TSTP Solution File: ALG348-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : ALG348-1 : TPTP v8.1.2. Released v4.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:04:34 EDT 2024

% Result   : Unsatisfiable 18.07s 3.16s
% Output   : CNFRefutation 18.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   3 unt;   0 nHn;   4 RR)
%            Number of literals    :    7 (   3 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_840,plain,
    ( ~ class_Ring__and__Field_Ocomm__semiring__0(X0)
    | c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,X0),X3,X0) = c_Polynomial_Opoly(X1,c_HOL_Oplus__class_Oplus(X2,X3,X0),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_poly__offset__poly_0) ).

cnf(c_850,negated_conjecture,
    c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_a,tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_a,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_958,plain,
    class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0) ).

cnf(c_3835,plain,
    ( ~ class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex)
    | c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_a,tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_a,v_x,tc_Complex_Ocomplex),tc_Complex_Ocomplex) ),
    inference(instantiation,[status(thm)],[c_840]) ).

cnf(c_3836,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3835,c_850,c_958]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : ALG348-1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.33  % Computer : n008.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Thu May  2 22:50:42 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 18.07/3.16  % SZS status Started for theBenchmark.p
% 18.07/3.16  % SZS status Unsatisfiable for theBenchmark.p
% 18.07/3.16  
% 18.07/3.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 18.07/3.16  
% 18.07/3.16  ------  iProver source info
% 18.07/3.16  
% 18.07/3.16  git: date: 2024-05-02 19:28:25 +0000
% 18.07/3.16  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 18.07/3.16  git: non_committed_changes: false
% 18.07/3.16  
% 18.07/3.16  ------ Parsing...successful
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 10 0s  sf_e  sup_sim: 0  sf_s  rm: 3 0s  sf_e 
% 18.07/3.16  
% 18.07/3.16  ------ Preprocessing...
% 18.07/3.16  
% 18.07/3.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 18.07/3.16  ------ Proving...
% 18.07/3.16  ------ Problem Properties 
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  clauses                                 866
% 18.07/3.16  conjectures                             14
% 18.07/3.16  EPR                                     165
% 18.07/3.16  Horn                                    770
% 18.07/3.16  unary                                   137
% 18.07/3.16  binary                                  301
% 18.07/3.16  lits                                    2380
% 18.07/3.16  lits eq                                 397
% 18.07/3.16  fd_pure                                 0
% 18.07/3.16  fd_pseudo                               0
% 18.07/3.16  fd_cond                                 0
% 18.07/3.16  fd_pseudo_cond                          64
% 18.07/3.16  AC symbols                              0
% 18.07/3.16  
% 18.07/3.16  ------ Input Options Time Limit: Unbounded
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  ------ 
% 18.07/3.16  Current options:
% 18.07/3.16  ------ 
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  ------ Proving...
% 18.07/3.16  
% 18.07/3.16  
% 18.07/3.16  % SZS status Unsatisfiable for theBenchmark.p
% 18.07/3.16  
% 18.07/3.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.07/3.16  
% 18.07/3.16  
%------------------------------------------------------------------------------