TSTP Solution File: SWW232+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW232+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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 21 01:28:09 EDT 2022
% Result : Theorem 0.99s 1.22s
% Output : Refutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 1 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ v_thesis____,
file('SWW232+1.p',unknown),
[] ).
cnf(217,axiom,
~ equal(c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_cs____),
file('SWW232+1.p',unknown),
[] ).
cnf(334,axiom,
c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,u,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,skf76(u))),
file('SWW232+1.p',unknown),
[] ).
cnf(1148,axiom,
( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,v_da____,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____)),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,c_Polynomial_OpCons(tc_Complex_Ocomplex,v_c____,v_cs____)),skf76(u))))
| v_thesis____ ),
file('SWW232+1.p',unknown),
[] ).
cnf(1443,axiom,
( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,skf39(u,v),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,w))
| c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,v,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,c_Polynomial_OpCons(tc_Complex_Ocomplex,u,v_cs____)),w)))
| equal(c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),v_cs____) ),
file('SWW232+1.p',unknown),
[] ).
cnf(1700,plain,
~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,v_da____,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____)),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,c_Polynomial_OpCons(tc_Complex_Ocomplex,v_c____,v_cs____)),skf76(u)))),
inference(mrr,[status(thm)],[1148,1]),
[iquote('0:MRR:1148.1,1.0')] ).
cnf(1724,plain,
( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,skf39(u,v),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,w))
| c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,v,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,c_Polynomial_OpCons(tc_Complex_Ocomplex,u,v_cs____)),w))) ),
inference(mrr,[status(thm)],[1443,217]),
[iquote('0:MRR:1443.2,217.0')] ).
cnf(1761,plain,
~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,skf39(v_c____,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,v_da____,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,v_aa____))),c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,skf76(u))),
inference(res,[status(thm),theory(equality)],[1724,1700]),
[iquote('0:Res:1724.1,1700.0')] ).
cnf(1777,plain,
$false,
inference(unc,[status(thm)],[1761,334]),
[iquote('0:UnC:1761.0,334.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW232+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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 : Sat Jun 4 13:28:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.99/1.22
% 0.99/1.22 SPASS V 3.9
% 0.99/1.22 SPASS beiseite: Proof found.
% 0.99/1.22 % SZS status Theorem
% 0.99/1.22 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/1.22 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 1363 clauses.
% 0.99/1.22 SPASS allocated 104981 KBytes.
% 0.99/1.22 SPASS spent 0:00:00.86 on the problem.
% 0.99/1.22 0:00:00.06 for the input.
% 0.99/1.22 0:00:00.39 for the FLOTTER CNF translation.
% 0.99/1.22 0:00:00.00 for inferences.
% 0.99/1.22 0:00:00.00 for the backtracking.
% 0.99/1.22 0:00:00.28 for the reduction.
% 0.99/1.22
% 0.99/1.22
% 0.99/1.22 Here is a proof with depth 1, length 9 :
% 0.99/1.22 % SZS output start Refutation
% See solution above
% 0.99/1.22 Formulae used in the proof : conj_1 fact_H conj_0 fact_pCons_Ohyps
% 0.99/1.22
%------------------------------------------------------------------------------