TSTP Solution File: PUZ001+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 22 unt; 5 nHn; 33 RR)
% Number of literals : 47 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
lives(skc1),
file('PUZ001+1.p',unknown),
[] ).
cnf(5,axiom,
killed(skc1,agatha),
file('PUZ001+1.p',unknown),
[] ).
cnf(6,axiom,
~ killed(agatha,agatha),
file('PUZ001+1.p',unknown),
[] ).
cnf(7,axiom,
~ equal(butler,agatha),
file('PUZ001+1.p',unknown),
[] ).
cnf(8,axiom,
~ hates(u,skf1(u)),
file('PUZ001+1.p',unknown),
[] ).
cnf(9,axiom,
( equal(u,butler)
| hates(agatha,u) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(10,axiom,
( richer(u,agatha)
| hates(butler,u) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ killed(u,v)
| hates(u,v) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ hates(agatha,u)
| hates(butler,u) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ richer(u,v)
| ~ killed(u,v) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ hates(charles,u)
| ~ hates(agatha,u) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ lives(u)
| equal(u,charles)
| equal(u,butler)
| equal(u,agatha) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(17,plain,
richer(skf1(butler),agatha),
inference(res,[status(thm),theory(equality)],[10,8]),
[iquote('0:Res:10.1,8.0')] ).
cnf(21,plain,
~ hates(agatha,skf1(butler)),
inference(res,[status(thm),theory(equality)],[12,8]),
[iquote('0:Res:12.1,8.0')] ).
cnf(25,plain,
equal(skf1(butler),butler),
inference(res,[status(thm),theory(equality)],[9,21]),
[iquote('0:Res:9.1,21.0')] ).
cnf(26,plain,
richer(butler,agatha),
inference(rew,[status(thm),theory(equality)],[25,17]),
[iquote('0:Rew:25.0,17.0')] ).
cnf(31,plain,
( ~ killed(charles,u)
| ~ hates(agatha,u) ),
inference(res,[status(thm),theory(equality)],[11,14]),
[iquote('0:Res:11.1,14.0')] ).
cnf(38,plain,
( ~ killed(charles,u)
| equal(u,butler) ),
inference(res,[status(thm),theory(equality)],[9,31]),
[iquote('0:Res:9.1,31.1')] ).
cnf(39,plain,
~ richer(skc1,agatha),
inference(res,[status(thm),theory(equality)],[5,13]),
[iquote('0:Res:5.0,13.1')] ).
cnf(40,plain,
( equal(skc1,charles)
| equal(skc1,butler)
| equal(skc1,agatha) ),
inference(ems,[status(thm)],[15,1]),
[iquote('0:EmS:15.0,1.0')] ).
cnf(44,plain,
equal(skc1,charles),
inference(spt,[spt(split,[position(s1)])],[40]),
[iquote('1:Spt:40.0')] ).
cnf(46,plain,
killed(charles,agatha),
inference(rew,[status(thm),theory(equality)],[44,5]),
[iquote('1:Rew:44.0,5.0')] ).
cnf(51,plain,
equal(butler,agatha),
inference(res,[status(thm),theory(equality)],[46,38]),
[iquote('1:Res:46.0,38.0')] ).
cnf(52,plain,
$false,
inference(mrr,[status(thm)],[51,7]),
[iquote('1:MRR:51.0,7.0')] ).
cnf(53,plain,
~ equal(skc1,charles),
inference(spt,[spt(split,[position(sa)])],[52,44]),
[iquote('1:Spt:52.0,40.0,44.0')] ).
cnf(54,plain,
( equal(skc1,butler)
| equal(skc1,agatha) ),
inference(spt,[spt(split,[position(s2)])],[40]),
[iquote('1:Spt:52.0,40.1,40.2')] ).
cnf(55,plain,
equal(skc1,butler),
inference(spt,[spt(split,[position(s2s1)])],[54]),
[iquote('2:Spt:54.0')] ).
cnf(58,plain,
~ richer(butler,agatha),
inference(rew,[status(thm),theory(equality)],[55,39]),
[iquote('2:Rew:55.0,39.0')] ).
cnf(60,plain,
$false,
inference(mrr,[status(thm)],[58,26]),
[iquote('2:MRR:58.0,26.0')] ).
cnf(61,plain,
~ equal(skc1,butler),
inference(spt,[spt(split,[position(s2sa)])],[60,55]),
[iquote('2:Spt:60.0,54.0,55.0')] ).
cnf(62,plain,
equal(skc1,agatha),
inference(spt,[spt(split,[position(s2s2)])],[54]),
[iquote('2:Spt:60.0,54.1')] ).
cnf(64,plain,
killed(agatha,agatha),
inference(rew,[status(thm),theory(equality)],[62,5]),
[iquote('2:Rew:62.0,5.0')] ).
cnf(65,plain,
$false,
inference(mrr,[status(thm)],[64,6]),
[iquote('2:MRR:64.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 22:21:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43
% 0.18/0.43 SPASS V 3.9
% 0.18/0.43 SPASS beiseite: Proof found.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 SPASS derived 42 clauses, backtracked 11 clauses, performed 2 splits and kept 49 clauses.
% 0.18/0.43 SPASS allocated 97592 KBytes.
% 0.18/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.18/0.43 0:00:00.04 for the input.
% 0.18/0.43 0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.43 0:00:00.00 for inferences.
% 0.18/0.43 0:00:00.00 for the backtracking.
% 0.18/0.43 0:00:00.00 for the reduction.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Here is a proof with depth 3, length 33 :
% 0.18/0.43 % SZS output start Refutation
% See solution above
% 0.18/0.43 Formulae used in the proof : pel55_1 pel55 pel55_11 pel55_10 pel55_7 pel55_8 pel55_4 pel55_9 pel55_5 pel55_6 pel55_3
% 0.18/0.43
%------------------------------------------------------------------------------