TSTP Solution File: MSC015-1.005 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MSC015-1.005 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 : Sun Jul 17 22:59:38 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 7
% Syntax : Number of clauses : 39 ( 34 unt; 0 nHn; 39 RR)
% Number of literals : 44 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
p(s0,s0,s0,s0,s0),
file('MSC015-1.005.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(u,v,w,x,s0)
| p(u,v,w,x,s1) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(u,v,w,s0,s1)
| p(u,v,w,s1,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(u,v,s0,s1,s1)
| p(u,v,s1,s0,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(u,s0,s1,s1,s1)
| p(u,s1,s0,s0,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(6,axiom,
( ~ p(s0,s1,s1,s1,s1)
| p(s1,s0,s0,s0,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(7,axiom,
~ p(s1,s1,s1,s1,s1),
file('MSC015-1.005.p',unknown),
[] ).
cnf(8,plain,
~ p(s1,s1,s1,s1,s0),
inference(res,[status(thm),theory(equality)],[2,7]),
[iquote('0:Res:2.1,7.0')] ).
cnf(9,plain,
p(s0,s0,s0,s0,s1),
inference(res,[status(thm),theory(equality)],[1,2]),
[iquote('0:Res:1.0,2.0')] ).
cnf(10,plain,
p(s0,s0,s0,s1,s0),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.0,3.0')] ).
cnf(11,plain,
p(s0,s0,s0,s1,s1),
inference(res,[status(thm),theory(equality)],[10,2]),
[iquote('0:Res:10.0,2.0')] ).
cnf(12,plain,
p(s0,s0,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[11,4]),
[iquote('0:Res:11.0,4.0')] ).
cnf(13,plain,
p(s0,s0,s1,s0,s1),
inference(res,[status(thm),theory(equality)],[12,2]),
[iquote('0:Res:12.0,2.0')] ).
cnf(14,plain,
p(s0,s0,s1,s1,s0),
inference(res,[status(thm),theory(equality)],[13,3]),
[iquote('0:Res:13.0,3.0')] ).
cnf(15,plain,
p(s0,s0,s1,s1,s1),
inference(res,[status(thm),theory(equality)],[14,2]),
[iquote('0:Res:14.0,2.0')] ).
cnf(16,plain,
p(s0,s1,s0,s0,s0),
inference(res,[status(thm),theory(equality)],[15,5]),
[iquote('0:Res:15.0,5.0')] ).
cnf(17,plain,
p(s0,s1,s0,s0,s1),
inference(res,[status(thm),theory(equality)],[16,2]),
[iquote('0:Res:16.0,2.0')] ).
cnf(18,plain,
p(s0,s1,s0,s1,s0),
inference(res,[status(thm),theory(equality)],[17,3]),
[iquote('0:Res:17.0,3.0')] ).
cnf(19,plain,
p(s0,s1,s0,s1,s1),
inference(res,[status(thm),theory(equality)],[18,2]),
[iquote('0:Res:18.0,2.0')] ).
cnf(20,plain,
p(s0,s1,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[19,4]),
[iquote('0:Res:19.0,4.0')] ).
cnf(21,plain,
p(s0,s1,s1,s0,s1),
inference(res,[status(thm),theory(equality)],[20,2]),
[iquote('0:Res:20.0,2.0')] ).
cnf(22,plain,
p(s0,s1,s1,s1,s0),
inference(res,[status(thm),theory(equality)],[21,3]),
[iquote('0:Res:21.0,3.0')] ).
cnf(23,plain,
p(s0,s1,s1,s1,s1),
inference(res,[status(thm),theory(equality)],[22,2]),
[iquote('0:Res:22.0,2.0')] ).
cnf(24,plain,
p(s1,s0,s0,s0,s0),
inference(mrr,[status(thm)],[6,23]),
[iquote('0:MRR:6.0,23.0')] ).
cnf(25,plain,
p(s1,s0,s0,s0,s1),
inference(res,[status(thm),theory(equality)],[24,2]),
[iquote('0:Res:24.0,2.0')] ).
cnf(26,plain,
p(s1,s0,s0,s1,s0),
inference(res,[status(thm),theory(equality)],[25,3]),
[iquote('0:Res:25.0,3.0')] ).
cnf(27,plain,
p(s1,s0,s0,s1,s1),
inference(res,[status(thm),theory(equality)],[26,2]),
[iquote('0:Res:26.0,2.0')] ).
cnf(28,plain,
p(s1,s0,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[27,4]),
[iquote('0:Res:27.0,4.0')] ).
cnf(29,plain,
p(s1,s0,s1,s0,s1),
inference(res,[status(thm),theory(equality)],[28,2]),
[iquote('0:Res:28.0,2.0')] ).
cnf(30,plain,
p(s1,s0,s1,s1,s0),
inference(res,[status(thm),theory(equality)],[29,3]),
[iquote('0:Res:29.0,3.0')] ).
cnf(31,plain,
p(s1,s0,s1,s1,s1),
inference(res,[status(thm),theory(equality)],[30,2]),
[iquote('0:Res:30.0,2.0')] ).
cnf(32,plain,
p(s1,s1,s0,s0,s0),
inference(res,[status(thm),theory(equality)],[31,5]),
[iquote('0:Res:31.0,5.0')] ).
cnf(33,plain,
p(s1,s1,s0,s0,s1),
inference(res,[status(thm),theory(equality)],[32,2]),
[iquote('0:Res:32.0,2.0')] ).
cnf(34,plain,
p(s1,s1,s0,s1,s0),
inference(res,[status(thm),theory(equality)],[33,3]),
[iquote('0:Res:33.0,3.0')] ).
cnf(35,plain,
p(s1,s1,s0,s1,s1),
inference(res,[status(thm),theory(equality)],[34,2]),
[iquote('0:Res:34.0,2.0')] ).
cnf(36,plain,
p(s1,s1,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[35,4]),
[iquote('0:Res:35.0,4.0')] ).
cnf(37,plain,
p(s1,s1,s1,s0,s1),
inference(res,[status(thm),theory(equality)],[36,2]),
[iquote('0:Res:36.0,2.0')] ).
cnf(38,plain,
p(s1,s1,s1,s1,s0),
inference(res,[status(thm),theory(equality)],[37,3]),
[iquote('0:Res:37.0,3.0')] ).
cnf(39,plain,
$false,
inference(mrr,[status(thm)],[38,8]),
[iquote('0:MRR:38.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC015-1.005 : TPTP v8.1.0. Released v3.5.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.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 : Fri Jul 1 16:10:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41
% 0.19/0.41 SPASS V 3.9
% 0.19/0.41 SPASS beiseite: Proof found.
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 38 clauses.
% 0.19/0.41 SPASS allocated 63102 KBytes.
% 0.19/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.41 0:00:00.04 for the input.
% 0.19/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41 0:00:00.00 for inferences.
% 0.19/0.41 0:00:00.00 for the backtracking.
% 0.19/0.41 0:00:00.00 for the reduction.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Here is a proof with depth 15, length 39 :
% 0.19/0.41 % SZS output start Refutation
% See solution above
% 0.19/0.41 Formulae used in the proof : init rule1 rule2 rule3 rule4 rule5 goal
% 0.19/0.41
%------------------------------------------------------------------------------