%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : ALG396-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 : n012.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 8.41s 2.64s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 6 ( 6 unt; 0 def)
% Number of atoms : 6 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 2 ( 0 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_836,plain,
c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
cnf(c_837,plain,
c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex),
inference(copy,[status(thm)],[c_836]) ).
fof(cls_CHAINED_0,axiom,
! [VAR_0] : c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(VAR_0,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_pa____,VAR_0,tc_Complex_Ocomplex),
file('theBenchmark.p',cls_CHAINED_0) ).
cnf(c_838,plain,
c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(A,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_pa____,A,tc_Complex_Ocomplex),
inference(clausify,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_839,plain,
$false,
inference(resolve,[status(thm)],[c_838,c_837]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG396-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.05/0.34 % Computer : n012.cluster.edu
% 0.05/0.34 % Model : x86_64 x86_64
% 0.05/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.34 % Memory : 8046.5625MB
% 0.05/0.34 % OS : Linux 6.8.0-71-generic
% 0.05/0.34 % CPULimit : 300
% 0.05/0.34 % WCLimit : 300
% 0.05/0.34 % DateTime : Sat Sep 26 21:56:34 UTC 2026
% 0.05/0.35 % CPUTime :
% 0.05/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.05/0.35 % Process 1575999 was started by sandbox on n012,
% 0.05/0.35 % Sat Sep 26 21:56:34 2026
% 0.05/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.05/0.37
% 0.05/0.37 % From the command line: assign(max_seconds, 300).
% 8.41/2.64
% 8.41/2.64 % SZS status Unsatisfiable for theBenchmark
% 8.41/2.64
% 8.41/2.64 % Proof 1 at 1.09 (+ 0.00) seconds.
% 8.41/2.64 % Length of proof is 4.
% 8.41/2.64 % Level of proof is 2.
% 8.41/2.64 % Maximum clause weight is 27.000.
% 8.41/2.64 % Given clauses 0.
% 8.41/2.64
% 8.41/2.64 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------