TSTP Solution File: PUZ009-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:12 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 3 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(13,axiom,
( d_is_a_knight
| a_is_a_knight
| c_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(16,axiom,
( a_is_a_knight
| e_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(17,axiom,
( ~ c_is_a_knight
| a_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(18,axiom,
b_is_a_knight,
file('PUZ009-1.p',unknown),
[] ).
cnf(19,plain,
( d_is_a_knight
| a_is_a_knight ),
inference(mrr,[status(thm)],[13,17]),
[iquote('0:MRR:13.2,17.0')] ).
cnf(21,plain,
~ a_is_a_knight,
inference(mrr,[status(thm)],[3,18]),
[iquote('0:MRR:3.0,18.0')] ).
cnf(22,plain,
e_is_a_knight,
inference(mrr,[status(thm)],[16,21]),
[iquote('0:MRR:16.0,21.0')] ).
cnf(23,plain,
~ c_is_a_knight,
inference(mrr,[status(thm)],[17,21]),
[iquote('0:MRR:17.1,21.0')] ).
cnf(24,plain,
d_is_a_knight,
inference(mrr,[status(thm)],[19,21]),
[iquote('0:MRR:19.1,21.0')] ).
cnf(26,plain,
$false,
inference(mrr,[status(thm)],[10,22,24,23]),
[iquote('0:MRR:10.0,10.1,10.2,22.0,24.0,23.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun May 29 02:56:51 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.40
% 0.18/0.40 SPASS V 3.9
% 0.18/0.40 SPASS beiseite: Proof found.
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.18/0.40 SPASS allocated 63085 KBytes.
% 0.18/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.40 0:00:00.04 for the input.
% 0.18/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40 0:00:00.00 for inferences.
% 0.18/0.40 0:00:00.00 for the backtracking.
% 0.18/0.40 0:00:00.00 for the reduction.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Here is a proof with depth 0, length 12 :
% 0.18/0.40 % SZS output start Refutation
% See solution above
% 0.18/0.40 Formulae used in the proof : c3 c10 c13 c16 c17 c18
% 0.18/0.40
%------------------------------------------------------------------------------