TSTP Solution File: ALG387-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG387-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 6 unt; 1 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 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(681,axiom,
( ~ c_lessequals(c_HOL_Oabs__class_Oabs(u,tc_RealDef_Oreal),v,tc_RealDef_Oreal)
| c_lessequals(u,v,tc_RealDef_Oreal) ),
file('ALG387-1.p',unknown),
[] ).
cnf(712,axiom,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(u,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,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('ALG387-1.p',unknown),
[] ).
cnf(715,axiom,
( ~ c_lessequals(v_r____,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),v_v____,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('ALG387-1.p',unknown),
[] ).
cnf(719,axiom,
( c_lessequals(u,v,tc_RealDef_Oreal)
| c_lessequals(v,u,tc_RealDef_Oreal) ),
file('ALG387-1.p',unknown),
[] ).
cnf(884,axiom,
~ c_lessequals(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),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,u),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('ALG387-1.p',unknown),
[] ).
cnf(932,plain,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal),
inference(res,[status(thm),theory(equality)],[712,884]),
[iquote('0:Res:712.1,884.0')] ).
cnf(933,plain,
~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(res,[status(thm),theory(equality)],[715,884]),
[iquote('0:Res:715.1,884.0')] ).
cnf(1283,plain,
c_lessequals(c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(res,[status(thm),theory(equality)],[719,932]),
[iquote('0:Res:719.0,932.0')] ).
cnf(1411,plain,
c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(res,[status(thm),theory(equality)],[1283,681]),
[iquote('0:Res:1283.0,681.0')] ).
cnf(1420,plain,
$false,
inference(mrr,[status(thm)],[1411,933]),
[iquote('0:MRR:1411.0,933.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG387-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n019.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 13:38:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.47/0.65
% 0.47/0.65 SPASS V 3.9
% 0.47/0.65 SPASS beiseite: Proof found.
% 0.47/0.65 % SZS status Theorem
% 0.47/0.65 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65 SPASS derived 402 clauses, backtracked 0 clauses, performed 0 splits and kept 900 clauses.
% 0.47/0.65 SPASS allocated 77234 KBytes.
% 0.47/0.65 SPASS spent 0:00:00.30 on the problem.
% 0.47/0.65 0:00:00.07 for the input.
% 0.47/0.65 0:00:00.00 for the FLOTTER CNF translation.
% 0.47/0.65 0:00:00.01 for inferences.
% 0.47/0.65 0:00:00.00 for the backtracking.
% 0.47/0.65 0:00:00.15 for the reduction.
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 Here is a proof with depth 3, length 10 :
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.65 Formulae used in the proof : cls_abs__le__interval__iff_1 cls_v_0 cls_v0_0 cls_real__le__linear_0 cls_conjecture_0
% 0.47/0.65
%------------------------------------------------------------------------------