TSTP Solution File: ALG425-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG425-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:38 EDT 2022
% Result : Unsatisfiable 0.18s 0.55s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 2
% Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 3 RR)
% Number of literals : 3 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(678,axiom,
equal(c_HOL_Otimes__class_Otimes(v_pa____,c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),v_c____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex))),
file('ALG425-1.p',unknown),
[] ).
cnf(793,axiom,
~ equal(c_HOL_Otimes__class_Otimes(v_pa____,u,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex))),
file('ALG425-1.p',unknown),
[] ).
cnf(849,plain,
$false,
inference(mrr,[status(thm)],[678,793]),
[iquote('0:MRR:678.0,793.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG425-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 19:03:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.55
% 0.18/0.55 SPASS V 3.9
% 0.18/0.55 SPASS beiseite: Proof found.
% 0.18/0.55 % SZS status Theorem
% 0.18/0.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.55 SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 629 clauses.
% 0.18/0.55 SPASS allocated 76941 KBytes.
% 0.18/0.55 SPASS spent 0:00:00.21 on the problem.
% 0.18/0.55 0:00:00.06 for the input.
% 0.18/0.55 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.55 0:00:00.00 for inferences.
% 0.18/0.55 0:00:00.00 for the backtracking.
% 0.18/0.55 0:00:00.08 for the reduction.
% 0.18/0.55
% 0.18/0.55
% 0.18/0.55 Here is a proof with depth 0, length 3 :
% 0.18/0.55 % SZS output start Refutation
% See solution above
% 0.18/0.55 Formulae used in the proof : cls_CHAINED_0 cls_conjecture_0
% 0.18/0.55
%------------------------------------------------------------------------------