%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ036-1.005 : TPTP v8.1.0. Released v2.0.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 : Mon Jul 18 18:27:21 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 12 unt; 0 nHn; 15 RR)
% Number of literals : 18 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-20 aty)
% Number of functors : 40 ( 40 usr; 40 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
state(p_5,p_4,p_3,p_2,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
file('PUZ036-1.005.p',unknown),
[] ).
cnf(2,axiom,
( ~ state(u,v,w,x,y,z,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14)
| state(v,w,x,y,z,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14,u) ),
file('PUZ036-1.005.p',unknown),
[] ).
cnf(3,axiom,
( ~ state(u,v,w,x,y,z,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14)
| state(x14,u,v,w,x,y,z,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13) ),
file('PUZ036-1.005.p',unknown),
[] ).
cnf(4,axiom,
( ~ state(u,v,w,x,y,z,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14)
| state(x,w,v,u,y,z,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,x14) ),
file('PUZ036-1.005.p',unknown),
[] ).
cnf(5,axiom,
~ state(p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
file('PUZ036-1.005.p',unknown),
[] ).
cnf(8,plain,
~ state(p_4,p_3,p_2,p_1,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
inference(res,[status(thm),theory(equality)],[4,5]),
[iquote('0:Res:4.1,5.0')] ).
cnf(9,plain,
state(p_2,p_3,p_4,p_5,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
inference(res,[status(thm),theory(equality)],[1,4]),
[iquote('0:Res:1.0,4.0')] ).
cnf(17,plain,
state(p_3,p_4,p_5,p_1,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_2),
inference(res,[status(thm),theory(equality)],[9,2]),
[iquote('0:Res:9.0,2.0')] ).
cnf(29,plain,
state(p_1,p_5,p_4,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_2),
inference(res,[status(thm),theory(equality)],[17,4]),
[iquote('0:Res:17.0,4.0')] ).
cnf(55,plain,
state(p_2,p_1,p_5,p_4,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
inference(res,[status(thm),theory(equality)],[29,3]),
[iquote('0:Res:29.0,3.0')] ).
cnf(110,plain,
state(p_4,p_5,p_1,p_2,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
inference(res,[status(thm),theory(equality)],[55,4]),
[iquote('0:Res:55.0,4.0')] ).
cnf(213,plain,
state(p_5,p_1,p_2,p_3,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_4),
inference(res,[status(thm),theory(equality)],[110,2]),
[iquote('0:Res:110.0,2.0')] ).
cnf(428,plain,
state(p_3,p_2,p_1,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20,p_4),
inference(res,[status(thm),theory(equality)],[213,4]),
[iquote('0:Res:213.0,4.0')] ).
cnf(850,plain,
state(p_4,p_3,p_2,p_1,p_5,p_6,p_7,p_8,p_9,p_10,p_11,p_12,p_13,p_14,p_15,p_16,p_17,p_18,p_19,p_20),
inference(res,[status(thm),theory(equality)],[428,3]),
[iquote('0:Res:428.0,3.0')] ).
cnf(852,plain,
$false,
inference(mrr,[status(thm)],[850,8]),
[iquote('0:MRR:850.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ036-1.005 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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 : Sat May 28 21:34:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.52
% 0.19/0.52 SPASS V 3.9
% 0.19/0.52 SPASS beiseite: Proof found.
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 SPASS derived 846 clauses, backtracked 0 clauses, performed 0 splits and kept 571 clauses.
% 0.19/0.52 SPASS allocated 64474 KBytes.
% 0.19/0.52 SPASS spent 0:00:00.18 on the problem.
% 0.19/0.52 0:00:00.04 for the input.
% 0.19/0.52 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.52 0:00:00.02 for inferences.
% 0.19/0.52 0:00:00.00 for the backtracking.
% 0.19/0.52 0:00:00.06 for the reduction.
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Here is a proof with depth 8, length 15 :
% 0.19/0.52 % SZS output start Refutation
% See solution above
% 0.19/0.52 Formulae used in the proof : initial_configuration move_left move_right flip make_like_this
% 0.19/0.52
%------------------------------------------------------------------------------