TSTP Solution File: PUZ001+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 24 unt; 7 nHn; 15 RR)
% Number of literals : 52 ( 0 equ; 17 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 47 ( 39 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
predicate1(skc3,live,skc4),
file('PUZ001+2.p',unknown),
[] ).
cnf(2,axiom,
modifier_pp(skc3,in,DreadburyMansion),
file('PUZ001+2.p',unknown),
[] ).
cnf(3,axiom,
~ equal(Butler,AuntAgatha),
file('PUZ001+2.p',unknown),
[] ).
cnf(4,axiom,
predicate2(skc5,kill,skc4,AuntAgatha),
file('PUZ001+2.p',unknown),
[] ).
cnf(5,axiom,
~ predicate2(u,kill,AuntAgatha,AuntAgatha),
file('PUZ001+2.p',unknown),
[] ).
cnf(7,axiom,
~ predicate2(u,hate,v,skf5(v)),
file('PUZ001+2.p',unknown),
[] ).
cnf(8,axiom,
( equal(u,Butler)
| predicate2(skf8(u),hate,AuntAgatha,u) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(9,axiom,
( property2(u,rich,comp_than,AuntAgatha)
| predicate2(skf7(u),hate,Butler,u) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ predicate2(u,hate,AuntAgatha,v)
| predicate2(skf6(v),hate,Butler,v) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ predicate2(u,hate,Charles,v)
| ~ predicate2(w,hate,AuntAgatha,v) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(12,axiom,
( ~ predicate2(u,kill,v,w)
| ~ property2(v,rich,comp_than,w) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(13,axiom,
( ~ predicate2(u,kill,v,w)
| predicate2(skf9(w,v),hate,v,w) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(14,axiom,
( ~ predicate1(u,live,v)
| ~ modifier_pp(u,in,DreadburyMansion)
| equal(v,Charles)
| equal(v,Butler)
| equal(v,AuntAgatha) ),
file('PUZ001+2.p',unknown),
[] ).
cnf(19,plain,
property2(skf5(Butler),rich,comp_than,AuntAgatha),
inference(res,[status(thm),theory(equality)],[9,7]),
[iquote('0:Res:9.1,7.0')] ).
cnf(20,plain,
( equal(u,Butler)
| predicate2(skf6(u),hate,Butler,u) ),
inference(res,[status(thm),theory(equality)],[8,10]),
[iquote('0:Res:8.1,10.0')] ).
cnf(21,plain,
equal(skf5(Butler),Butler),
inference(res,[status(thm),theory(equality)],[20,7]),
[iquote('0:Res:20.1,7.0')] ).
cnf(22,plain,
property2(Butler,rich,comp_than,AuntAgatha),
inference(rew,[status(thm),theory(equality)],[21,19]),
[iquote('0:Rew:21.0,19.0')] ).
cnf(27,plain,
~ property2(skc4,rich,comp_than,AuntAgatha),
inference(res,[status(thm),theory(equality)],[4,12]),
[iquote('0:Res:4.0,12.0')] ).
cnf(28,plain,
predicate2(skf9(AuntAgatha,skc4),hate,skc4,AuntAgatha),
inference(res,[status(thm),theory(equality)],[4,13]),
[iquote('0:Res:4.0,13.0')] ).
cnf(29,plain,
( ~ modifier_pp(skc3,in,DreadburyMansion)
| equal(skc4,Charles)
| equal(skc4,Butler)
| equal(skc4,AuntAgatha) ),
inference(res,[status(thm),theory(equality)],[1,14]),
[iquote('0:Res:1.0,14.0')] ).
cnf(30,plain,
( equal(skc4,Charles)
| equal(skc4,Butler)
| equal(skc4,AuntAgatha) ),
inference(mrr,[status(thm)],[29,2]),
[iquote('0:MRR:29.0,2.0')] ).
cnf(31,plain,
equal(skc4,Charles),
inference(spt,[spt(split,[position(s1)])],[30]),
[iquote('1:Spt:30.0')] ).
cnf(35,plain,
predicate2(skf9(AuntAgatha,Charles),hate,Charles,AuntAgatha),
inference(rew,[status(thm),theory(equality)],[31,28]),
[iquote('1:Rew:31.0,28.0')] ).
cnf(40,plain,
~ predicate2(u,hate,AuntAgatha,AuntAgatha),
inference(res,[status(thm),theory(equality)],[35,11]),
[iquote('1:Res:35.0,11.0')] ).
cnf(41,plain,
equal(Butler,AuntAgatha),
inference(res,[status(thm),theory(equality)],[8,40]),
[iquote('1:Res:8.1,40.0')] ).
cnf(42,plain,
$false,
inference(mrr,[status(thm)],[41,3]),
[iquote('1:MRR:41.0,3.0')] ).
cnf(43,plain,
~ equal(skc4,Charles),
inference(spt,[spt(split,[position(sa)])],[42,31]),
[iquote('1:Spt:42.0,30.0,31.0')] ).
cnf(44,plain,
( equal(skc4,Butler)
| equal(skc4,AuntAgatha) ),
inference(spt,[spt(split,[position(s2)])],[30]),
[iquote('1:Spt:42.0,30.1,30.2')] ).
cnf(45,plain,
equal(skc4,Butler),
inference(spt,[spt(split,[position(s2s1)])],[44]),
[iquote('2:Spt:44.0')] ).
cnf(49,plain,
~ property2(Butler,rich,comp_than,AuntAgatha),
inference(rew,[status(thm),theory(equality)],[45,27]),
[iquote('2:Rew:45.0,27.0')] ).
cnf(51,plain,
$false,
inference(mrr,[status(thm)],[49,22]),
[iquote('2:MRR:49.0,22.0')] ).
cnf(52,plain,
~ equal(skc4,Butler),
inference(spt,[spt(split,[position(s2sa)])],[51,45]),
[iquote('2:Spt:51.0,44.0,45.0')] ).
cnf(53,plain,
equal(skc4,AuntAgatha),
inference(spt,[spt(split,[position(s2s2)])],[44]),
[iquote('2:Spt:51.0,44.1')] ).
cnf(57,plain,
predicate2(skc5,kill,AuntAgatha,AuntAgatha),
inference(rew,[status(thm),theory(equality)],[53,4]),
[iquote('2:Rew:53.0,4.0')] ).
cnf(58,plain,
$false,
inference(mrr,[status(thm)],[57,5]),
[iquote('2:MRR:57.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.09 % Command : run_spass %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sun May 29 00:35:56 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.13/0.36
% 0.13/0.36 SPASS V 3.9
% 0.13/0.36 SPASS beiseite: Proof found.
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36 SPASS derived 32 clauses, backtracked 13 clauses, performed 2 splits and kept 48 clauses.
% 0.13/0.36 SPASS allocated 85123 KBytes.
% 0.13/0.36 SPASS spent 0:00:00.07 on the problem.
% 0.13/0.36 0:00:00.03 for the input.
% 0.13/0.36 0:00:00.02 for the FLOTTER CNF translation.
% 0.13/0.36 0:00:00.00 for inferences.
% 0.13/0.36 0:00:00.00 for the backtracking.
% 0.13/0.36 0:00:00.00 for the reduction.
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 Here is a proof with depth 3, length 35 :
% 0.13/0.36 % SZS output start Refutation
% See solution above
% 0.13/0.36 Formulae used in the proof : background prove
% 0.13/0.36
%------------------------------------------------------------------------------