%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : ALG397-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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 : Sun Sep 27 06:50:08 AM UTC 2026
% Result : Unsatisfiable 9.48s 1.73s
% Output : CNFRefutation 9.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_CHAINED_0,axiom,
~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____,tc_Complex_Ocomplex),tc_Complex_Ocomplex,tc_Complex_Ocomplex),
file('theBenchmark.p',cls_CHAINED_0) ).
cnf(c_1020,plain,
~ c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____,tc_Complex_Ocomplex),tc_Complex_Ocomplex,tc_Complex_Ocomplex),
inference(clausify,[status(thm)],[cls_CHAINED_0]) ).
fof(cls_conjecture_0,axiom,
c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____,tc_Complex_Ocomplex),tc_Complex_Ocomplex,tc_Complex_Ocomplex),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_1021,plain,
c_Fundamental__Theorem__Algebra__Mirabelle_Oconstant(c_Polynomial_Opoly(v_q____,tc_Complex_Ocomplex),tc_Complex_Ocomplex,tc_Complex_Ocomplex),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
cnf(c_1022,plain,
$false,
inference(resolve,[status(thm)],[c_1020,c_1021]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ALG397-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 % Computer : n013.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Sat Sep 26 21:56:51 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.47 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.47 % Process 3631731 was started by sandbox on n013,
% 0.18/0.47 % Sat Sep 26 21:56:51 2026
% 0.18/0.47 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.24/0.52
% 0.24/0.52 % From the command line: assign(max_seconds, 300).
% 9.48/1.73
% 9.48/1.73 % SZS status Unsatisfiable for theBenchmark
% 9.48/1.73
% 9.48/1.73 % Proof 1 at 1.18 (+ 0.01) seconds.
% 9.48/1.73 % Length of proof is 3.
% 9.48/1.73 % Level of proof is 1.
% 9.48/1.73 % Maximum clause weight is 16.000.
% 9.48/1.73 % Given clauses 0.
% 9.48/1.73
% 9.48/1.73 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------