TSTP Solution File: SWV216+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV216+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:39 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 18 unt; 0 nHn; 20 RR)
% Number of literals : 22 ( 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(n2,n1),
file('SWV216+1.p',unknown),
[] ).
cnf(7,axiom,
equal(n2,n4),
file('SWV216+1.p',unknown),
[] ).
cnf(37,axiom,
equal(succ(n0),n1),
file('SWV216+1.p',unknown),
[] ).
cnf(42,axiom,
equal(succ(succ(n0)),n2),
file('SWV216+1.p',unknown),
[] ).
cnf(61,axiom,
equal(succ(succ(succ(n0))),n3),
file('SWV216+1.p',unknown),
[] ).
cnf(100,axiom,
( ~ equal(n2,n5)
| ~ equal(n1,n5) ),
file('SWV216+1.p',unknown),
[] ).
cnf(101,axiom,
equal(succ(succ(succ(succ(succ(n0))))),n5),
file('SWV216+1.p',unknown),
[] ).
cnf(171,plain,
equal(n1,n4),
inference(rew,[status(thm),theory(equality)],[7,6]),
[iquote('0:Rew:7.0,6.0')] ).
cnf(172,plain,
equal(succ(n0),n4),
inference(rew,[status(thm),theory(equality)],[171,37]),
[iquote('0:Rew:171.0,37.0')] ).
cnf(173,plain,
equal(succ(n4),n4),
inference(rew,[status(thm),theory(equality)],[172,42,7]),
[iquote('0:Rew:172.0,42.0,7.0,42.0')] ).
cnf(179,plain,
equal(n4,n3),
inference(rew,[status(thm),theory(equality)],[173,61,172]),
[iquote('0:Rew:173.0,61.0,173.0,61.0,172.0,61.0')] ).
cnf(180,plain,
equal(n2,n3),
inference(rew,[status(thm),theory(equality)],[179,7]),
[iquote('0:Rew:179.0,7.0')] ).
cnf(181,plain,
equal(n1,n3),
inference(rew,[status(thm),theory(equality)],[179,171]),
[iquote('0:Rew:179.0,171.0')] ).
cnf(182,plain,
equal(succ(n0),n3),
inference(rew,[status(thm),theory(equality)],[179,172]),
[iquote('0:Rew:179.0,172.0')] ).
cnf(183,plain,
equal(succ(n3),n3),
inference(rew,[status(thm),theory(equality)],[179,173]),
[iquote('0:Rew:179.0,173.0')] ).
cnf(192,plain,
equal(n3,n5),
inference(rew,[status(thm),theory(equality)],[183,101,182]),
[iquote('0:Rew:183.0,101.0,183.0,101.0,183.0,101.0,183.0,101.0,182.0,101.0')] ).
cnf(194,plain,
equal(n2,n5),
inference(rew,[status(thm),theory(equality)],[192,180]),
[iquote('0:Rew:192.0,180.0')] ).
cnf(195,plain,
equal(n1,n5),
inference(rew,[status(thm),theory(equality)],[192,181]),
[iquote('0:Rew:192.0,181.0')] ).
cnf(201,plain,
( ~ equal(n5,n5)
| ~ equal(n5,n5) ),
inference(rew,[status(thm),theory(equality)],[195,100,194]),
[iquote('0:Rew:195.0,100.1,194.0,100.0')] ).
cnf(202,plain,
$false,
inference(obv,[status(thm),theory(equality)],[201]),
[iquote('0:Obv:201.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV216+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 02:19:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.53
% 0.20/0.53 SPASS V 3.9
% 0.20/0.53 SPASS beiseite: Proof found.
% 0.20/0.53 % SZS status Theorem
% 0.20/0.53 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 35 clauses.
% 0.20/0.53 SPASS allocated 85795 KBytes.
% 0.20/0.53 SPASS spent 0:00:00.17 on the problem.
% 0.20/0.53 0:00:00.04 for the input.
% 0.20/0.53 0:00:00.10 for the FLOTTER CNF translation.
% 0.20/0.53 0:00:00.00 for inferences.
% 0.20/0.53 0:00:00.00 for the backtracking.
% 0.20/0.53 0:00:00.00 for the reduction.
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 Here is a proof with depth 0, length 20 :
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.53 Formulae used in the proof : quaternion_ds1_symm_0201 successor_1 successor_2 successor_3 successor_5
% 0.20/0.53
%------------------------------------------------------------------------------