↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : PUZ001-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 08:54:15 AM UTC 2026

% Result   : Unsatisfiable 0.21s 0.55s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(someone_in_mansion,axiom,
    lives_at_dreadsbury(someone),
    file('theBenchmark.p',someone_in_mansion) ).

cnf(someone_killed_agatha,axiom,
    killed(someone,aunt_agatha),
    file('theBenchmark.p',someone_killed_agatha) ).

cnf(agatha_lives_at_mansion,axiom,
    lives_at_dreadsbury(aunt_agatha),
    file('theBenchmark.p',agatha_lives_at_mansion) ).

cnf(butler_lives_at_mansion,axiom,
    lives_at_dreadsbury(butler),
    file('theBenchmark.p',butler_lives_at_mansion) ).

cnf(charles_lives_at_mansion,axiom,
    lives_at_dreadsbury(charles),
    file('theBenchmark.p',charles_lives_at_mansion) ).

cnf(noone_else_lives_at_mansion,axiom,
    ( Person = charles
    | Person = butler
    | Person = aunt_agatha
    | ~ lives_at_dreadsbury(Person) ),
    file('theBenchmark.p',noone_else_lives_at_mansion) ).

cnf(killer_hates_victim,axiom,
    ( hates(Killer,Victim)
    | ~ killed(Killer,Victim) ),
    file('theBenchmark.p',killer_hates_victim) ).

cnf(killer_poorer_than_victim,axiom,
    ( ~ richer(Killer,Victim)
    | ~ killed(Killer,Victim) ),
    file('theBenchmark.p',killer_poorer_than_victim) ).

cnf(charles_and_agatha_hate_different_people,axiom,
    ( ~ hates(charles,Person)
    | ~ hates(aunt_agatha,Person) ),
    file('theBenchmark.p',charles_and_agatha_hate_different_people) ).

cnf(agatha_likes_only_butler,axiom,
    ( hates(aunt_agatha,Person)
    | Person = butler ),
    file('theBenchmark.p',agatha_likes_only_butler) ).

cnf(butler_hates_poor_people,axiom,
    ( hates(butler,Person)
    | richer(Person,aunt_agatha) ),
    file('theBenchmark.p',butler_hates_poor_people) ).

cnf(butler_and_agatha_hate_the_same_people,axiom,
    ( hates(butler,Person)
    | ~ hates(aunt_agatha,Person) ),
    file('theBenchmark.p',butler_and_agatha_hate_the_same_people) ).

cnf(noone_hates_everyone,axiom,
    ~ hates(Person,every_one_but(Person)),
    file('theBenchmark.p',noone_hates_everyone) ).

cnf(agatha_is_not_the_butler,axiom,
    aunt_agatha != butler,
    file('theBenchmark.p',agatha_is_not_the_butler) ).

cnf(prove_agatha_killed_herself,negated_conjecture,
    ~ killed(aunt_agatha,aunt_agatha),
    file('theBenchmark.p',prove_agatha_killed_herself) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( every_one_but(Eq_x_0) = every_one_but(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( lives_at_dreadsbury(Eq_y_0)
    | ~ lives_at_dreadsbury(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_6,axiom,
    ( killed(Eq_y_0,Eq_y_1)
    | ~ killed(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_7,axiom,
    ( hates(Eq_y_0,Eq_y_1)
    | ~ hates(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_8,axiom,
    ( richer(Eq_y_0,Eq_y_1)
    | ~ richer(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n026.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 19 19:57:21 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.21/0.55  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.55  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------