%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV219+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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 : Wed Jul 20 21:41:40 EDT 2022
% Result : Theorem 0.22s 0.51s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 16 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
equal(n4,n3),
file('SWV219+1.p',unknown),
[] ).
cnf(36,axiom,
equal(succ(n0),n1),
file('SWV219+1.p',unknown),
[] ).
cnf(41,axiom,
equal(succ(succ(n0)),n2),
file('SWV219+1.p',unknown),
[] ).
cnf(60,axiom,
equal(succ(succ(succ(n0))),n3),
file('SWV219+1.p',unknown),
[] ).
cnf(67,axiom,
equal(succ(succ(succ(succ(n0)))),n4),
file('SWV219+1.p',unknown),
[] ).
cnf(88,axiom,
( ~ equal(n3,n5)
| ~ equal(n4,n5) ),
file('SWV219+1.p',unknown),
[] ).
cnf(89,axiom,
equal(succ(succ(succ(succ(succ(n0))))),n5),
file('SWV219+1.p',unknown),
[] ).
cnf(159,plain,
equal(succ(n1),n2),
inference(rew,[status(thm),theory(equality)],[36,41]),
[iquote('0:Rew:36.0,41.0')] ).
cnf(162,plain,
equal(succ(n2),n3),
inference(rew,[status(thm),theory(equality)],[159,60,36]),
[iquote('0:Rew:159.0,60.0,36.0,60.0')] ).
cnf(164,plain,
equal(succ(n3),n3),
inference(rew,[status(thm),theory(equality)],[162,67,159,36,6]),
[iquote('0:Rew:162.0,67.0,159.0,67.0,36.0,67.0,6.0,67.0')] ).
cnf(167,plain,
equal(n3,n5),
inference(rew,[status(thm),theory(equality)],[164,89,162,159,36]),
[iquote('0:Rew:164.0,89.0,164.0,89.0,162.0,89.0,159.0,89.0,36.0,89.0')] ).
cnf(168,plain,
equal(n4,n5),
inference(rew,[status(thm),theory(equality)],[167,6]),
[iquote('0:Rew:167.0,6.0')] ).
cnf(173,plain,
( ~ equal(n5,n5)
| ~ equal(n5,n5) ),
inference(rew,[status(thm),theory(equality)],[168,88,167]),
[iquote('0:Rew:168.0,88.1,167.0,88.0')] ).
cnf(174,plain,
$false,
inference(obv,[status(thm),theory(equality)],[173]),
[iquote('0:Obv:173.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV219+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 06:15:12 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.51
% 0.22/0.51 SPASS V 3.9
% 0.22/0.51 SPASS beiseite: Proof found.
% 0.22/0.51 % SZS status Theorem
% 0.22/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 27 clauses.
% 0.22/0.51 SPASS allocated 85777 KBytes.
% 0.22/0.51 SPASS spent 0:00:00.14 on the problem.
% 0.22/0.51 0:00:00.04 for the input.
% 0.22/0.51 0:00:00.08 for the FLOTTER CNF translation.
% 0.22/0.51 0:00:00.00 for inferences.
% 0.22/0.51 0:00:00.00 for the backtracking.
% 0.22/0.51 0:00:00.00 for the reduction.
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 Here is a proof with depth 0, length 14 :
% 0.22/0.51 % SZS output start Refutation
% See solution above
% 0.22/0.51 Formulae used in the proof : quaternion_ds1_symm_0321 successor_1 successor_2 successor_3 successor_4 successor_5
% 0.22/0.51
%------------------------------------------------------------------------------