↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : ALG438-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 12:54:24 PM UTC 2026

% Result   : Unsatisfiable 3.30s 11.36s
% Output   : CNFRefutation 3.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   5 unt;   0 def)
%            Number of atoms       :   11 (   5 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    8 (   5   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f299,axiom,
    ! [X2,X3,X0,X1] :
      ( c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(X1,X2,X0),X3,tc_Polynomial_Opoly(X0)) = c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(X1,X3,X0),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X0),c_HOL_Otimes__class_Otimes(X2,X3,tc_Polynomial_Opoly(X0)),X0),tc_Polynomial_Opoly(X0))
      | ~ class_Ring__and__Field_Ocomm__semiring__0(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mult__pCons__left_0) ).

fof(f413,negated_conjecture,
    c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_a,c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f424,axiom,
    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) ).

tcf(c_441,negated_conjecture,
    c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_a,c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(cnf_transformation,[],[f413]) ).

tcf(c_443,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(X1,X2,X0),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X0),c_HOL_Otimes__class_Otimes(X3,X2,tc_Polynomial_Opoly(X0)),X0),tc_Polynomial_Opoly(X0)) = c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(X1,X3,X0),X2,tc_Polynomial_Opoly(X0)) )
      | ~ class_Ring__and__Field_Ocomm__semiring__0(X0) ),
    inference(cnf_transformation,[],[f299]) ).

tcf(c_461,plain,
    class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
    inference(cnf_transformation,[],[f424]) ).

tcf(c_3606,plain,
    ( ( c_HOL_Oplus__class_Oplus(c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(v_a,c_Polynomial_OpCons(v_b,v_p,tc_Complex_Ocomplex),tc_Complex_Ocomplex),v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) )
    | ~ class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex) ),
    inference(instantiation,[status(thm)],[c_443]) ).

tcf(c_3607,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3606,c_441,c_461]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : ALG438-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/10.47  % Computer : n004.cluster.edu
% 0.19/10.47  % Model    : x86_64 x86_64
% 0.19/10.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/10.47  % Memory   : 8046.5625MB
% 0.19/10.47  % OS       : Linux 6.8.0-71-generic
% 0.19/10.47  % CPULimit : 300
% 0.19/10.47  % WCLimit  : 300
% 0.19/10.47  % DateTime : Fri Sep 25 05:38:47 UTC 2026
% 0.19/10.48  % CPUTime  : 
% 0.19/10.48  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.24/10.53  Running first-order theorem proving
% 0.24/10.53  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/10.55  
% 0.24/10.55  % ======== iProver multi-core TPTP/SMT =========
% 0.24/10.55  
% 0.24/10.55  % Detected problem language: tptp
% 0.24/10.56  % Proving...
% 3.30/11.36  % SZS status Started for theBenchmark.p
% 3.30/11.36  % SZS status Unsatisfiable for theBenchmark.p
% 3.30/11.36  
% 3.30/11.36  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.30/11.36  
% 3.30/11.36  % ------  iProver source info
% 3.30/11.36  
% 3.30/11.36  % git: date: 2026-07-19 20:42:38 +0200
% 3.30/11.36  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.30/11.36  % git: non_committed_changes: false
% 3.30/11.36  
% 3.30/11.36  % ------ Parsing...% successful
% 3.30/11.36  
% 3.30/11.36  
% 3.30/11.36  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.30/11.36  
% 3.30/11.36  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 68 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 6 0s  sf_e  pe_s  pe_e % 
% 3.30/11.36  
% 3.30/11.36  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.30/11.36  
% 3.30/11.36  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.30/11.36  % ------ Proving...
% 3.30/11.36  % ------ Problem Properties 
% 3.30/11.36  
% 3.30/11.36  % 
% 3.30/11.36  % clauses                               58
% 3.30/11.36  % conjectures                           1
% 3.30/11.36  % EPR                                   4
% 3.30/11.36  % Horn                                  57
% 3.30/11.36  % unary                                 5
% 3.30/11.36  % binary                                49
% 3.30/11.36  % lits                                  116
% 3.30/11.36  % lits eq                               55
% 3.30/11.36  % fd_pure                               0
% 3.30/11.36  % fd_pseudo                             0
% 3.30/11.36  % fd_cond                               0
% 3.30/11.36  % fd_pseudo_cond                        4
% 3.30/11.36  % AC symbols                            0
% 3.30/11.36  
% 3.30/11.36  % ------ Schedule dynamic 5 is on 
% 3.30/11.36  
% 3.30/11.36  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.30/11.36  
% 3.30/11.36  
% 3.30/11.36  % ------ 
% 3.30/11.36  % Current options:
% 3.30/11.36  % ------ 
% 3.30/11.36  
% 3.30/11.36  
% 3.30/11.36  % 
% 3.30/11.36  
% 3.30/11.36  % ------ Proving...
% 3.30/11.36  % 
% 3.30/11.36  
% 3.30/11.36  % SZS status Unsatisfiable for theBenchmark.p
% 3.30/11.36  
% 3.30/11.36  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/11.36  
% 3.30/11.36  
%------------------------------------------------------------------------------