↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n014.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:12 PM UTC 2026

% Result   : Unsatisfiable 8.01s 1.95s
% Output   : CNFRefutation 8.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (  12 unt;   0 def)
%            Number of atoms       :   18 (  12 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    8 (   5   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   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    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :    3 (   0 sgn   3   !;   0   ?;   1   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f305,axiom,
    ! [X0] :
      ( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X0),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)),X0) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0))
      | ~ class_HOL_Ozero(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_pCons__0__0_0) ).

fof(f306,plain,
    ! [X0] :
      ( c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)) = c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X0),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)),X0)
      | ~ class_HOL_Ozero(X0) ),
    inference(reorient_equations,[],[f305]) ).

fof(f407,axiom,
    v_s____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_sne_0) ).

fof(f501,axiom,
    v_s____ = c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_kpn_0) ).

fof(f597,negated_conjecture,
    v_k____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f598,plain,
    c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) = v_k____,
    inference(reorient_equations,[],[f597]) ).

fof(f692,axiom,
    class_HOL_Ozero(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__HOL_Ozero) ).

tcf(c_588,negated_conjecture,
    c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) = v_k____,
    inference(cnf_transformation,[],[f598]) ).

tcf(c_593,plain,
    c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex) = v_s____,
    inference(cnf_transformation,[],[f501]) ).

tcf(c_687,plain,
    ! [X0: $i] :
      ( ( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X0),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)),X0) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)) )
      | ~ class_HOL_Ozero(X0) ),
    inference(cnf_transformation,[],[f306]) ).

tcf(c_691,plain,
    c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != v_s____,
    inference(cnf_transformation,[],[f407]) ).

tcf(c_733,plain,
    class_HOL_Ozero(tc_Complex_Ocomplex),
    inference(cnf_transformation,[],[f692]) ).

tcf(c_6608,plain,
    c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    inference(superposition,[status(thm)],[c_733,c_687]) ).

tcf(c_6610,plain,
    c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = v_s____,
    inference(light_normalisation,[status(thm)],[c_6608,c_593,c_588]) ).

tcf(c_6611,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_6610,c_691]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG417-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.57  % Computer : n014.cluster.edu
% 0.08/0.57  % Model    : x86_64 x86_64
% 0.08/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.57  % Memory   : 8046.5625MB
% 0.08/0.57  % OS       : Linux 6.8.0-71-generic
% 0.08/0.57  % CPULimit : 300
% 0.08/0.57  % WCLimit  : 300
% 0.08/0.57  % DateTime : Fri Sep 25 05:36:33 UTC 2026
% 0.08/0.57  % CPUTime  : 
% 0.08/0.57  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.61  Running first-order theorem proving
% 0.08/0.61  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.62  
% 0.08/0.62  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.62  
% 0.08/0.62  % Detected problem language: tptp
% 0.13/0.63  % Proving...
% 8.01/1.95  % SZS status Started for theBenchmark.p
% 8.01/1.95  % SZS status Unsatisfiable for theBenchmark.p
% 8.01/1.95  
% 8.01/1.95  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.01/1.95  
% 8.01/1.95  % ------  iProver source info
% 8.01/1.95  
% 8.01/1.95  % git: date: 2026-07-19 20:42:38 +0200
% 8.01/1.95  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.01/1.95  % git: non_committed_changes: false
% 8.01/1.95  
% 8.01/1.95  % ------ Parsing...% successful
% 8.01/1.95  
% 8.01/1.95  
% 8.01/1.95  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 8.01/1.95  
% 8.01/1.95  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e % 
% 8.01/1.95  
% 8.01/1.95  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 8.01/1.95  
% 8.01/1.95  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 8.01/1.95  % ------ Proving...
% 8.01/1.95  % ------ Problem Properties 
% 8.01/1.95  
% 8.01/1.95  % 
% 8.01/1.95  % clauses                               216
% 8.01/1.95  % conjectures                           1
% 8.01/1.95  % EPR                                   6
% 8.01/1.95  % Horn                                  170
% 8.01/1.95  % unary                                 99
% 8.01/1.95  % binary                                77
% 8.01/1.95  % lits                                  384
% 8.01/1.95  % lits eq                               266
% 8.01/1.95  % fd_pure                               0
% 8.01/1.95  % fd_pseudo                             0
% 8.01/1.95  % fd_cond                               38
% 8.01/1.95  % fd_pseudo_cond                        7
% 8.01/1.95  % AC symbols                            0
% 8.01/1.95  
% 8.01/1.95  % ------ Schedule dynamic 5 is on 
% 8.01/1.95  
% 8.01/1.95  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.01/1.95  
% 8.01/1.95  
% 8.01/1.95  % ------ 
% 8.01/1.95  % Current options:
% 8.01/1.95  % ------ 
% 8.01/1.95  
% 8.01/1.95  
% 8.01/1.95  % 
% 8.01/1.95  
% 8.01/1.95  % ------ Proving...
% 8.01/1.95  % 
% 8.01/1.95  
% 8.01/1.95  % SZS status Unsatisfiable for theBenchmark.p
% 8.01/1.95  
% 8.01/1.95  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.01/1.95  
% 8.01/1.95  
%------------------------------------------------------------------------------