%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG424-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:37 EDT 2022
% Result : Unsatisfiable 0.50s 0.66s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 1 nHn; 11 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(900,axiom,
~ equal(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_pa____),
file('ALG424-1.p',unknown),
[] ).
cnf(903,axiom,
( ~ class_Ring__and__Field_Oidom(u)
| ~ equal(c_Polynomial_Opoly(v,w,u),c_HOL_Ozero__class_Ozero(u))
| ~ equal(c_Polynomial_Oorder(w,v,u),c_HOL_Ozero__class_Ozero(tc_nat))
| equal(v,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(u))) ),
file('ALG424-1.p',unknown),
[] ).
cnf(904,axiom,
equal(c_Polynomial_Opoly(v_pa____,v_a____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex)),
file('ALG424-1.p',unknown),
[] ).
cnf(905,axiom,
( c_Ring__and__Field_Odvd__class_Odvd(v_pa____,c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| equal(c_Polynomial_Oorder(v_a____,v_pa____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_nat)) ),
file('ALG424-1.p',unknown),
[] ).
cnf(974,axiom,
class_Ring__and__Field_Oidom(tc_Complex_Ocomplex),
file('ALG424-1.p',unknown),
[] ).
cnf(1033,axiom,
~ c_Ring__and__Field_Odvd__class_Odvd(v_pa____,c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('ALG424-1.p',unknown),
[] ).
cnf(1040,plain,
equal(c_Polynomial_Oorder(v_a____,v_pa____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_nat)),
inference(mrr,[status(thm)],[905,1033]),
[iquote('0:MRR:905.0,1033.0')] ).
cnf(1082,plain,
( ~ class_Ring__and__Field_Oidom(tc_Complex_Ocomplex)
| ~ equal(c_Polynomial_Opoly(v_pa____,v_a____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex))
| equal(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_pa____) ),
inference(res,[status(thm),theory(equality)],[1040,903]),
[iquote('0:Res:1040.0,903.1')] ).
cnf(1101,plain,
( ~ class_Ring__and__Field_Oidom(tc_Complex_Ocomplex)
| ~ equal(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex))
| equal(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_pa____) ),
inference(rew,[status(thm),theory(equality)],[904,1082]),
[iquote('0:Rew:904.0,1082.1')] ).
cnf(1102,plain,
( ~ class_Ring__and__Field_Oidom(tc_Complex_Ocomplex)
| equal(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_pa____) ),
inference(obv,[status(thm),theory(equality)],[1101]),
[iquote('0:Obv:1101.1')] ).
cnf(1103,plain,
$false,
inference(mrr,[status(thm)],[1102,974,900]),
[iquote('0:MRR:1102.0,1102.1,974.0,900.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG424-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 8 21:19:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.50/0.66
% 0.50/0.66 SPASS V 3.9
% 0.50/0.66 SPASS beiseite: Proof found.
% 0.50/0.66 % SZS status Theorem
% 0.50/0.66 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.66 SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 898 clauses.
% 0.50/0.66 SPASS allocated 77337 KBytes.
% 0.50/0.66 SPASS spent 0:00:00.31 on the problem.
% 0.50/0.66 0:00:00.08 for the input.
% 0.50/0.66 0:00:00.00 for the FLOTTER CNF translation.
% 0.50/0.66 0:00:00.00 for inferences.
% 0.50/0.66 0:00:00.00 for the backtracking.
% 0.50/0.66 0:00:00.14 for the reduction.
% 0.50/0.66
% 0.50/0.66
% 0.50/0.66 Here is a proof with depth 1, length 11 :
% 0.50/0.66 % SZS output start Refutation
% See solution above
% 0.50/0.66 Formulae used in the proof : cls_CHAINED_0 cls_CHAINED_0_01 cls_CHAINED_0_02 cls_CHAINED_0_03 clsarity_Complex__Ocomplex__Ring__and__Field_Oidom cls_conjecture_0
% 0.50/0.66
%------------------------------------------------------------------------------