TSTP Solution File: SWW219+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW219+1 : TPTP v8.1.0. Released v5.2.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 21 01:28:07 EDT 2022
% Result : Theorem 1.20s 1.39s
% Output : Refutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 8 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ v_thesis____,
file('SWW219+1.p',unknown),
[] ).
cnf(361,axiom,
c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(skc7,u)),v_r),
file('SWW219+1.p',unknown),
[] ).
cnf(1413,axiom,
c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v),hAPP(skc7,u))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(u))))),
file('SWW219+1.p',unknown),
[] ).
cnf(1723,axiom,
( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(u,skf155(u))),v_r)
| ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v),hAPP(u,skf156(u)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(skf156(u))))))
| v_thesis____ ),
file('SWW219+1.p',unknown),
[] ).
cnf(1868,plain,
( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(u,skf155(u))),v_r)
| ~ c_Orderings_Oord__class_Oless(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v),hAPP(u,skf156(u)))),c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,c_Groups_Ouminus__class_Ouminus(tc_RealDef_Oreal,v_s____),c_Rings_Oinverse__class_Odivide(tc_RealDef_Oreal,c_Groups_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(tc_Nat_Onat,c_Nat_OSuc(skf156(u)))))) ),
inference(mrr,[status(thm)],[1723,1]),
[iquote('0:MRR:1723.2,1.0')] ).
cnf(1871,plain,
~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_RealVector_Onorm__class_Onorm(tc_Complex_Ocomplex,hAPP(skc7,skf155(skc7))),v_r),
inference(res,[status(thm),theory(equality)],[1413,1868]),
[iquote('0:Res:1413.0,1868.1')] ).
cnf(1872,plain,
$false,
inference(mrr,[status(thm)],[1871,361]),
[iquote('0:MRR:1871.0,361.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWW219+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jun 5 22:13:49 EDT 2022
% 0.11/0.31 % CPUTime :
% 1.20/1.39
% 1.20/1.39 SPASS V 3.9
% 1.20/1.39 SPASS beiseite: Proof found.
% 1.20/1.39 % SZS status Theorem
% 1.20/1.39 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.20/1.39 SPASS derived 11 clauses, backtracked 0 clauses, performed 0 splits and kept 1514 clauses.
% 1.20/1.39 SPASS allocated 106202 KBytes.
% 1.20/1.39 SPASS spent 0:00:01.04 on the problem.
% 1.20/1.39 0:00:00.04 for the input.
% 1.20/1.39 0:00:00.49 for the FLOTTER CNF translation.
% 1.20/1.39 0:00:00.00 for inferences.
% 1.20/1.39 0:00:00.00 for the backtracking.
% 1.20/1.39 0:00:00.36 for the reduction.
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Here is a proof with depth 1, length 7 :
% 1.20/1.39 % SZS output start Refutation
% See solution above
% 1.20/1.39 Formulae used in the proof : conj_1 fact__096EX_Af_O_AALL_Ax_O_Acmod_A_If_Ax_J_A_060_061_Ar_A_G_Acmod_A_Ipoly_Ap_A_If_Ax_J_J_A_060_A_N_As_A_L_A1_A_P_Areal_A_ISuc_Ax_J_096 conj_0
% 1.20/1.39
%------------------------------------------------------------------------------