%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG436-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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 : 600s
% DateTime : Thu Jul 14 18:03:39 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 3 unt; 1 nHn; 7 RR)
% Number of literals : 11 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 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)
% Comments :
%------------------------------------------------------------------------------
cnf(374,axiom,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('ALG436-1.p',unknown),
[] ).
cnf(375,axiom,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('ALG436-1.p',unknown),
[] ).
cnf(480,axiom,
( ~ c_Ring__and__Field_Odvd__class_Odvd(v,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| ~ c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('ALG436-1.p',unknown),
[] ).
cnf(481,axiom,
( c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Ring__and__Field_Odvd__class_Odvd(v,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) ),
file('ALG436-1.p',unknown),
[] ).
cnf(482,plain,
c_Ring__and__Field_Odvd__class_Odvd(v,v_r,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(mrr,[status(thm)],[375,481]),
[iquote('0:MRR:375.0,481.0')] ).
cnf(483,plain,
c_Ring__and__Field_Odvd__class_Odvd(v,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(mrr,[status(thm)],[374,482]),
[iquote('0:MRR:374.0,482.0')] ).
cnf(484,plain,
$false,
inference(mrr,[status(thm)],[480,482,483]),
[iquote('0:MRR:480.0,480.1,482.0,483.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : ALG436-1 : TPTP v8.1.0. Released v4.1.0.
% 0.05/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n024.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 : 600
% 0.13/0.33 % DateTime : Wed Jun 8 09:39:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 165 clauses.
% 0.19/0.48 SPASS allocated 76338 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.48 0:00:00.05 for the input.
% 0.19/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.00 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.01 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 0, length 7 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 Formulae used in the proof : cls_CHAINED_0 cls_CHAINED_0_01 cls_conjecture_0 cls_conjecture_1
% 0.19/0.48
%------------------------------------------------------------------------------