TSTP Solution File: ALG428-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG428-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.36s 0.61s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 1 nHn; 9 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(78,axiom,
( ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),u,tc_nat)
| equal(c_Suc(c_HOL_Ominus__class_Ominus(u,c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat)),u) ),
file('ALG428-1.p',unknown),
[] ).
cnf(667,axiom,
( equal(u,c_HOL_Ozero__class_Ozero(tc_nat))
| c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),u,tc_nat) ),
file('ALG428-1.p',unknown),
[] ).
cnf(791,axiom,
~ equal(c_Polynomial_Odegree(v,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_nat)),
file('ALG428-1.p',unknown),
[] ).
cnf(890,axiom,
~ v_thesis____,
file('ALG428-1.p',unknown),
[] ).
cnf(891,axiom,
( ~ equal(c_Polynomial_Odegree(v,tc_Complex_Ocomplex),c_Suc(u))
| v_thesis____ ),
file('ALG428-1.p',unknown),
[] ).
cnf(892,plain,
~ equal(c_Polynomial_Odegree(v,tc_Complex_Ocomplex),c_Suc(u)),
inference(mrr,[status(thm)],[891,890]),
[iquote('0:MRR:891.1,890.0')] ).
cnf(981,plain,
~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),c_Polynomial_Odegree(v,tc_Complex_Ocomplex),tc_nat),
inference(res,[status(thm),theory(equality)],[78,892]),
[iquote('0:Res:78.1,892.0')] ).
cnf(1076,plain,
equal(c_Polynomial_Odegree(v,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_nat)),
inference(res,[status(thm),theory(equality)],[667,981]),
[iquote('0:Res:667.1,981.0')] ).
cnf(1080,plain,
$false,
inference(mrr,[status(thm)],[1076,791]),
[iquote('0:MRR:1076.0,791.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG428-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n026.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 06:08:47 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.36/0.61
% 0.36/0.61 SPASS V 3.9
% 0.36/0.61 SPASS beiseite: Proof found.
% 0.36/0.61 % SZS status Theorem
% 0.36/0.61 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.36/0.61 SPASS derived 89 clauses, backtracked 0 clauses, performed 0 splits and kept 743 clauses.
% 0.36/0.61 SPASS allocated 77046 KBytes.
% 0.36/0.61 SPASS spent 0:00:00.25 on the problem.
% 0.36/0.61 0:00:00.07 for the input.
% 0.36/0.61 0:00:00.00 for the FLOTTER CNF translation.
% 0.36/0.61 0:00:00.00 for inferences.
% 0.36/0.61 0:00:00.00 for the backtracking.
% 0.36/0.61 0:00:00.11 for the reduction.
% 0.36/0.61
% 0.36/0.61
% 0.36/0.61 Here is a proof with depth 2, length 9 :
% 0.36/0.61 % SZS output start Refutation
% See solution above
% 0.36/0.61 Formulae used in the proof : cls_Suc__pred_0 cls_gr0I_0 cls_CHAINED_0 cls_conjecture_0 cls_conjecture_1
% 0.36/0.61
%------------------------------------------------------------------------------