↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : ALG397-1 : TPTP v9.0.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %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 : Sat Jun 21 04:59:02 AM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
tff(c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant_type,type,
    c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant: ( $i * $i * $i ) > $o ).

tff(tc_Complex_Ocomplex_type,type,
    tc_Complex_Ocomplex: $i ).

tff(c_Polynomial_Opoly_type,type,
    c_Polynomial_Opoly: ( $i * $i ) > $i ).

tff(v_q_____type,type,
    v_q____: $i ).

tff(1,axiom,
    c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____,tc_Complex_Ocomplex),tc_Complex_Ocomplex,tc_Complex_Ocomplex),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

tff(2,axiom,
    ~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____,tc_Complex_Ocomplex),tc_Complex_Ocomplex,tc_Complex_Ocomplex),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).

tff(3,plain,
    $false,
    inference(unit_resolution,[status(thm)],[2,1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ALG397-1 : TPTP v9.0.0. Released v4.1.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Thu Jun 19 11:13:18 EDT 2025
% 0.13/0.33  % CPUTime    : 
% 0.19/0.51  % SZS status Unsatisfiable
% 0.19/0.51  % SZS output start Proof
% See solution above
% 0.19/0.51  % E exiting
%------------------------------------------------------------------------------