TSTP Solution File: PUZ005+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ005+1 : TPTP v8.1.0. Released v2.2.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 : Mon Jul 18 18:27:11 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 3 unt; 4 nHn; 26 RR)
% Number of literals : 72 ( 0 equ; 48 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
thursday(a_thursday),
file('PUZ005+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ wednesday(u)
| day(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ thursday(u)
| day(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ wednesday(u)
| lion_lies(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ thursday(u)
| unicorn_lies(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ lion_lies(u)
| day(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ unicorn_lies(u)
| day(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ thursday(u)
| wednesday(yesterday(u)) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ lion_lies(u)
| ~ thursday(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ unicorn_lies(u)
| ~ wednesday(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ day(u)
| ~ lies_on_one_of(a_unicorn,u,yesterday(u))
| ~ lies_on_one_of(a_lion,u,yesterday(u)) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ day(u)
| ~ day(v)
| ~ lion_lies(v)
| lies_on_one_of(a_lion,u,v)
| lion_lies(u) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ day(u)
| ~ day(v)
| ~ unicorn_lies(u)
| lies_on_one_of(a_unicorn,u,v)
| unicorn_lies(v) ),
file('PUZ005+1.p',unknown),
[] ).
cnf(47,plain,
( ~ unicorn_lies(u)
| ~ day(v)
| unicorn_lies(v)
| lies_on_one_of(a_unicorn,u,v) ),
inference(mrr,[status(thm)],[44,22]),
[iquote('0:MRR:44.0,22.1')] ).
cnf(50,plain,
( ~ lion_lies(u)
| ~ day(v)
| lion_lies(v)
| lies_on_one_of(a_lion,v,u) ),
inference(mrr,[status(thm)],[40,21]),
[iquote('0:MRR:40.1,21.1')] ).
cnf(143,plain,
( ~ lion_lies(yesterday(u))
| ~ day(u)
| ~ day(u)
| ~ lies_on_one_of(a_unicorn,u,yesterday(u))
| lion_lies(u) ),
inference(res,[status(thm),theory(equality)],[50,38]),
[iquote('0:Res:50.3,38.2')] ).
cnf(144,plain,
( ~ lion_lies(yesterday(u))
| ~ day(u)
| ~ lies_on_one_of(a_unicorn,u,yesterday(u))
| lion_lies(u) ),
inference(obv,[status(thm),theory(equality)],[143]),
[iquote('0:Obv:143.1')] ).
cnf(148,plain,
( ~ day(u)
| ~ wednesday(yesterday(u))
| ~ lies_on_one_of(a_unicorn,u,yesterday(u))
| lion_lies(u) ),
inference(sor,[status(thm)],[144,17]),
[iquote('0:SoR:144.0,17.1')] ).
cnf(151,plain,
( ~ day(u)
| ~ thursday(u)
| ~ lies_on_one_of(a_unicorn,u,yesterday(u))
| lion_lies(u) ),
inference(sor,[status(thm)],[148,26]),
[iquote('0:SoR:148.1,26.1')] ).
cnf(152,plain,
( ~ thursday(u)
| ~ lies_on_one_of(a_unicorn,u,yesterday(u))
| lion_lies(u) ),
inference(ssi,[status(thm)],[151,11]),
[iquote('0:SSi:151.0,11.1')] ).
cnf(153,plain,
( ~ thursday(u)
| ~ lies_on_one_of(a_unicorn,u,yesterday(u)) ),
inference(mrr,[status(thm)],[152,30]),
[iquote('0:MRR:152.2,30.0')] ).
cnf(154,plain,
( ~ unicorn_lies(u)
| ~ day(yesterday(u))
| ~ thursday(u)
| unicorn_lies(yesterday(u)) ),
inference(res,[status(thm),theory(equality)],[47,153]),
[iquote('0:Res:47.3,153.1')] ).
cnf(156,plain,
( ~ thursday(u)
| unicorn_lies(yesterday(u)) ),
inference(ssi,[status(thm)],[154,10,26,18]),
[iquote('0:SSi:154.1,154.0,10.1,26.1,18.1')] ).
cnf(159,plain,
( ~ thursday(u)
| ~ thursday(u) ),
inference(ems,[status(thm)],[36,156,26]),
[iquote('0:EmS:36.0,36.1,156.1,26.1')] ).
cnf(161,plain,
~ thursday(u),
inference(obv,[status(thm),theory(equality)],[159]),
[iquote('0:Obv:159.0')] ).
cnf(162,plain,
$false,
inference(unc,[status(thm)],[161,4]),
[iquote('0:UnC:161.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ005+1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat May 28 22:05:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47
% 0.20/0.47 SPASS V 3.9
% 0.20/0.47 SPASS beiseite: Proof found.
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 SPASS derived 66 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.20/0.47 SPASS allocated 97722 KBytes.
% 0.20/0.47 SPASS spent 0:00:00.11 on the problem.
% 0.20/0.47 0:00:00.04 for the input.
% 0.20/0.47 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.47 0:00:00.00 for inferences.
% 0.20/0.47 0:00:00.00 for the backtracking.
% 0.20/0.47 0:00:00.02 for the reduction.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Here is a proof with depth 5, length 26 :
% 0.20/0.47 % SZS output start Refutation
% See solution above
% 0.20/0.47 Formulae used in the proof : thursday wednesday_is_a_day thursday_is_a_day lion_lies_wednesday unicorn_lies_thursday lion_lies_on_a_day unicorn_lies_on_a_day thursday_follows_wednesday lion_does_not_lie_thursday unicorn_does_not_lie_wednesday prove_there_are_close_lying_days lion_lies_on_neither unicorn_lies_on_both
% 0.20/0.47
%------------------------------------------------------------------------------