TSTP Solution File: ALG386-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG386-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:33 EDT 2022
% Result : Unsatisfiable 0.15s 0.45s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 5 unt; 1 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(421,axiom,
( ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(u,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),u,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('ALG386-1.p',unknown),
[] ).
cnf(592,axiom,
~ v_thesis____,
file('ALG386-1.p',unknown),
[] ).
cnf(593,axiom,
( v_thesis____
| c_lessequals(u,c_RealVector_Onorm__class_Onorm(v_x(u),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('ALG386-1.p',unknown),
[] ).
cnf(594,axiom,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(u),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
file('ALG386-1.p',unknown),
[] ).
cnf(595,plain,
c_lessequals(u,c_RealVector_Onorm__class_Onorm(v_x(u),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(mrr,[status(thm)],[593,592]),
[iquote('0:MRR:593.0,592.0')] ).
cnf(620,plain,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(u),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(mrr,[status(thm)],[594,592]),
[iquote('0:MRR:594.1,592.0')] ).
cnf(835,plain,
~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(v_x(u),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(res,[status(thm),theory(equality)],[421,620]),
[iquote('0:Res:421.1,620.0')] ).
cnf(861,plain,
$false,
inference(unc,[status(thm)],[835,595]),
[iquote('0:UnC:835.0,595.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ALG386-1 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.11 % Command : run_spass %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Wed Jun 8 01:46:21 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.45
% 0.15/0.45 SPASS V 3.9
% 0.15/0.45 SPASS beiseite: Proof found.
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.45 SPASS derived 51 clauses, backtracked 0 clauses, performed 0 splits and kept 538 clauses.
% 0.15/0.45 SPASS allocated 76570 KBytes.
% 0.15/0.45 SPASS spent 0:00:00.13 on the problem.
% 0.15/0.45 0:00:00.04 for the input.
% 0.15/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.15/0.45 0:00:00.00 for inferences.
% 0.15/0.45 0:00:00.00 for the backtracking.
% 0.15/0.45 0:00:00.05 for the reduction.
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45 Here is a proof with depth 1, length 8 :
% 0.15/0.45 % SZS output start Refutation
% See solution above
% 0.15/0.45 Formulae used in the proof : cls_CHAINED_0 cls_conjecture_0 cls_conjecture_1 cls_conjecture_2
% 0.15/0.45
%------------------------------------------------------------------------------