TSTP Solution File: PUZ001-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ001-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %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 : 300s
% DateTime : Thu Aug 31 13:11:27 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 45 ( 17 unt; 9 typ; 0 def)
% Number of atoms : 62 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 24 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 21 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
someone: $i ).
tff(decl_23,type,
lives_at_dreadsbury: $i > $o ).
tff(decl_24,type,
aunt_agatha: $i ).
tff(decl_25,type,
killed: ( $i * $i ) > $o ).
tff(decl_26,type,
butler: $i ).
tff(decl_27,type,
charles: $i ).
tff(decl_28,type,
hates: ( $i * $i ) > $o ).
tff(decl_29,type,
richer: ( $i * $i ) > $o ).
tff(decl_30,type,
every_one_but: $i > $i ).
cnf(killer_hates_victim,axiom,
( hates(X1,X2)
| ~ killed(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',killer_hates_victim) ).
cnf(someone_killed_agatha,axiom,
killed(someone,aunt_agatha),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',someone_killed_agatha) ).
cnf(noone_else_lives_at_mansion,axiom,
( X1 = aunt_agatha
| X1 = butler
| X1 = charles
| ~ lives_at_dreadsbury(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',noone_else_lives_at_mansion) ).
cnf(someone_in_mansion,axiom,
lives_at_dreadsbury(someone),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',someone_in_mansion) ).
cnf(noone_hates_everyone,axiom,
~ hates(X1,every_one_but(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',noone_hates_everyone) ).
cnf(butler_and_agatha_hate_the_same_people,axiom,
( hates(butler,X1)
| ~ hates(aunt_agatha,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',butler_and_agatha_hate_the_same_people) ).
cnf(killer_poorer_than_victim,axiom,
( ~ killed(X1,X2)
| ~ richer(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',killer_poorer_than_victim) ).
cnf(butler_hates_poor_people,axiom,
( richer(X1,aunt_agatha)
| hates(butler,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',butler_hates_poor_people) ).
cnf(charles_and_agatha_hate_different_people,axiom,
( ~ hates(aunt_agatha,X1)
| ~ hates(charles,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',charles_and_agatha_hate_different_people) ).
cnf(agatha_likes_only_butler,axiom,
( X1 = butler
| hates(aunt_agatha,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agatha_likes_only_butler) ).
cnf(agatha_is_not_the_butler,axiom,
aunt_agatha != butler,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agatha_is_not_the_butler) ).
cnf(prove_agatha_killed_herself,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_agatha_killed_herself) ).
cnf(c_0_12,axiom,
( hates(X1,X2)
| ~ killed(X1,X2) ),
killer_hates_victim ).
cnf(c_0_13,axiom,
killed(someone,aunt_agatha),
someone_killed_agatha ).
cnf(c_0_14,axiom,
( X1 = aunt_agatha
| X1 = butler
| X1 = charles
| ~ lives_at_dreadsbury(X1) ),
noone_else_lives_at_mansion ).
cnf(c_0_15,axiom,
lives_at_dreadsbury(someone),
someone_in_mansion ).
cnf(c_0_16,plain,
hates(someone,aunt_agatha),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( someone = charles
| someone = butler
| someone = aunt_agatha ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
~ hates(X1,every_one_but(X1)),
noone_hates_everyone ).
cnf(c_0_19,axiom,
( hates(butler,X1)
| ~ hates(aunt_agatha,X1) ),
butler_and_agatha_hate_the_same_people ).
cnf(c_0_20,axiom,
( ~ killed(X1,X2)
| ~ richer(X1,X2) ),
killer_poorer_than_victim ).
cnf(c_0_21,axiom,
( richer(X1,aunt_agatha)
| hates(butler,X1) ),
butler_hates_poor_people ).
cnf(c_0_22,axiom,
( ~ hates(aunt_agatha,X1)
| ~ hates(charles,X1) ),
charles_and_agatha_hate_different_people ).
cnf(c_0_23,plain,
( someone = aunt_agatha
| someone = butler
| hates(charles,aunt_agatha) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
~ hates(aunt_agatha,every_one_but(butler)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,axiom,
( X1 = butler
| hates(aunt_agatha,X1) ),
agatha_likes_only_butler ).
cnf(c_0_26,plain,
( hates(butler,X1)
| ~ killed(X1,aunt_agatha) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( someone = butler
| someone = aunt_agatha
| ~ hates(aunt_agatha,aunt_agatha) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
aunt_agatha != butler,
agatha_is_not_the_butler ).
cnf(c_0_29,plain,
every_one_but(butler) = butler,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
hates(butler,someone),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
( someone = aunt_agatha
| someone = butler ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28]) ).
cnf(c_0_32,plain,
~ hates(butler,butler),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_33,plain,
someone = aunt_agatha,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
prove_agatha_killed_herself ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.16/0.35 % Computer : n020.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Sat Aug 26 22:52:15 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.005000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------