%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : ALG436-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 : n015.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:11 AM UTC 2026
% Result : Unsatisfiable 2.43s 0.79s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_CHAINED_0,axiom,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('theBenchmark.p',cls_CHAINED_0) ).
cnf(c_741,plain,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
inference(clausify,[status(thm)],[cls_CHAINED_0]) ).
fof(cls_CHAINED_0_01,axiom,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('theBenchmark.p',cls_CHAINED_0_01) ).
cnf(c_742,plain,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
inference(clausify,[status(thm)],[cls_CHAINED_0_01]) ).
fof(cls_conjecture_0,axiom,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_743,plain,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| ~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_1,axiom,
( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_744,plain,
( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
cnf(c_2050,plain,
( c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
inference(resolve,[status(thm)],[c_744,c_741]) ).
cnf(c_2047,plain,
c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(copy,[status(thm)],[c_2050]) ).
cnf(c_2048,plain,
~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(resolve,[status(thm)],[c_2047,c_743]) ).
cnf(c_2051,plain,
~ c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(resolve,[status(thm)],[c_2048,c_742]) ).
cnf(c_2049,plain,
$false,
inference(resolve,[status(thm)],[c_2047,c_2051]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG436-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.07/0.35 % Computer : n015.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 26 22:03:59 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.36 % Process 840160 was started by sandbox on n015,
% 0.07/0.36 % Sat Sep 26 22:03:59 2026
% 0.07/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.38
% 0.12/0.38 % From the command line: assign(max_seconds, 300).
% 2.43/0.79
% 2.43/0.79 % SZS status Unsatisfiable for theBenchmark
% 2.43/0.79
% 2.43/0.79 % Proof 1 at 0.32 (+ 0.03) seconds.
% 2.43/0.79 % Length of proof is 7.
% 2.43/0.79 % Level of proof is 3.
% 2.43/0.79 % Maximum clause weight is 20.000.
% 2.43/0.79 % Given clauses 227.
% 2.43/0.79
% 2.43/0.79 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------