TSTP Solution File: SWW196+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW196+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:05 EDT 2022
% Result : Theorem 1.01s 1.20s
% Output : Refutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 16 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ v_thesis____,
file('SWW196+1.p',unknown),
[] ).
cnf(180,axiom,
c_Parity_Oeven__odd__class_Oeven(tc_Nat_Onat,v_na____),
file('SWW196+1.p',unknown),
[] ).
cnf(249,axiom,
equal(c_Nat_OSuc(c_Groups_Ozero__class_Ozero(tc_Nat_Onat)),c_Groups_Oone__class_Oone(tc_Nat_Onat)),
file('SWW196+1.p',unknown),
[] ).
cnf(389,axiom,
equal(c_Int_Onumber__class_Onumber__of(tc_Nat_Onat,c_Int_OBit0(c_Int_OBit1(c_Int_OPls))),c_Nat_OSuc(c_Nat_OSuc(c_Groups_Ozero__class_Ozero(tc_Nat_Onat)))),
file('SWW196+1.p',unknown),
[] ).
cnf(639,axiom,
( ~ equal(c_Groups_Otimes__class_Otimes(tc_Nat_Onat,c_Int_Onumber__class_Onumber__of(tc_Nat_Onat,c_Int_OBit0(c_Int_OBit1(c_Int_OPls))),u),v_na____)
| v_thesis____ ),
file('SWW196+1.p',unknown),
[] ).
cnf(738,axiom,
( ~ c_Parity_Oeven__odd__class_Oeven(tc_Nat_Onat,u)
| equal(c_Groups_Otimes__class_Otimes(tc_Nat_Onat,c_Nat_OSuc(c_Nat_OSuc(c_Groups_Ozero__class_Ozero(tc_Nat_Onat))),skf24(u)),u) ),
file('SWW196+1.p',unknown),
[] ).
cnf(1652,plain,
equal(c_Int_Onumber__class_Onumber__of(tc_Nat_Onat,c_Int_OBit0(c_Int_OBit1(c_Int_OPls))),c_Nat_OSuc(c_Groups_Oone__class_Oone(tc_Nat_Onat))),
inference(rew,[status(thm),theory(equality)],[249,389]),
[iquote('0:Rew:249.0,389.0')] ).
cnf(1668,plain,
( ~ equal(c_Groups_Otimes__class_Otimes(tc_Nat_Onat,c_Nat_OSuc(c_Groups_Oone__class_Oone(tc_Nat_Onat)),u),v_na____)
| v_thesis____ ),
inference(rew,[status(thm),theory(equality)],[1652,639]),
[iquote('0:Rew:1652.0,639.0')] ).
cnf(1669,plain,
~ equal(c_Groups_Otimes__class_Otimes(tc_Nat_Onat,c_Nat_OSuc(c_Groups_Oone__class_Oone(tc_Nat_Onat)),u),v_na____),
inference(mrr,[status(thm)],[1668,1]),
[iquote('0:MRR:1668.1,1.0')] ).
cnf(1732,plain,
( ~ c_Parity_Oeven__odd__class_Oeven(tc_Nat_Onat,u)
| equal(c_Groups_Otimes__class_Otimes(tc_Nat_Onat,c_Nat_OSuc(c_Groups_Oone__class_Oone(tc_Nat_Onat)),skf24(u)),u) ),
inference(rew,[status(thm),theory(equality)],[249,738]),
[iquote('0:Rew:249.0,738.1')] ).
cnf(1972,plain,
~ c_Parity_Oeven__odd__class_Oeven(tc_Nat_Onat,v_na____),
inference(res,[status(thm),theory(equality)],[1732,1669]),
[iquote('0:Res:1732.1,1669.0')] ).
cnf(2038,plain,
$false,
inference(mrr,[status(thm)],[1972,180]),
[iquote('0:MRR:1972.0,180.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW196+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 6 01:59:17 EDT 2022
% 0.12/0.32 % CPUTime :
% 1.01/1.20
% 1.01/1.20 SPASS V 3.9
% 1.01/1.20 SPASS beiseite: Proof found.
% 1.01/1.20 % SZS status Theorem
% 1.01/1.20 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.01/1.20 SPASS derived 45 clauses, backtracked 0 clauses, performed 0 splits and kept 1286 clauses.
% 1.01/1.20 SPASS allocated 104210 KBytes.
% 1.01/1.20 SPASS spent 0:00:00.85 on the problem.
% 1.01/1.20 0:00:00.06 for the input.
% 1.01/1.20 0:00:00.39 for the FLOTTER CNF translation.
% 1.01/1.20 0:00:00.00 for inferences.
% 1.01/1.20 0:00:00.00 for the backtracking.
% 1.01/1.20 0:00:00.29 for the reduction.
% 1.01/1.20
% 1.01/1.20
% 1.01/1.20 Here is a proof with depth 1, length 12 :
% 1.01/1.20 % SZS output start Refutation
% See solution above
% 1.01/1.20 Formulae used in the proof : conj_1 fact_e fact_One__nat__def fact_semiring__norm_I115_J conj_0 fact_even__nat__equiv__def2
% 1.01/1.20
%------------------------------------------------------------------------------