TSTP Solution File: ALG396-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG396-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:34 EDT 2022
% Result : Unsatisfiable 0.14s 0.43s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 4 RR)
% Number of literals : 4 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(708,axiom,
equal(c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(u,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_Polynomial_Opoly(v_pa____,u,tc_Complex_Ocomplex)),
file('ALG396-1.p',unknown),
[] ).
cnf(873,axiom,
~ equal(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)),
file('ALG396-1.p',unknown),
[] ).
cnf(876,plain,
~ equal(c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex)),
inference(rew,[status(thm),theory(equality)],[708,873]),
[iquote('0:Rew:708.0,873.0')] ).
cnf(877,plain,
$false,
inference(obv,[status(thm),theory(equality)],[876]),
[iquote('0:Obv:876.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : ALG396-1 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.10 % Command : run_spass %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Tue Jun 7 22:06:06 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.14/0.43
% 0.14/0.43 SPASS V 3.9
% 0.14/0.43 SPASS beiseite: Proof found.
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.43 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 254 clauses.
% 0.14/0.43 SPASS allocated 76932 KBytes.
% 0.14/0.43 SPASS spent 0:00:00.13 on the problem.
% 0.14/0.43 0:00:00.05 for the input.
% 0.14/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.14/0.43 0:00:00.00 for inferences.
% 0.14/0.43 0:00:00.00 for the backtracking.
% 0.14/0.43 0:00:00.02 for the reduction.
% 0.14/0.43
% 0.14/0.43
% 0.14/0.43 Here is a proof with depth 0, length 4 :
% 0.14/0.43 % SZS output start Refutation
% See solution above
% 0.14/0.43 Formulae used in the proof : cls_CHAINED_0 cls_conjecture_0
% 0.14/0.43
%------------------------------------------------------------------------------