↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Computer : n002.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:19 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(not_knight_and_knave,axiom,
    ( ~ a_truth(knave(X),Y)
    | ~ a_truth(knight(X),Y) ),
    file('theBenchmark.p',not_knight_and_knave) ).

cnf(knight_or_knave,axiom,
    ( a_truth(knave(X),Y)
    | a_truth(knight(X),Y) ),
    file('theBenchmark.p',knight_or_knave) ).

cnf(not_rich_and_poor,axiom,
    ( ~ a_truth(poor(X),Y)
    | ~ a_truth(rich(X),Y) ),
    file('theBenchmark.p',not_rich_and_poor) ).

cnf(rich_or_poor,axiom,
    ( a_truth(poor(X),Y)
    | a_truth(rich(X),Y) ),
    file('theBenchmark.p',rich_or_poor) ).

cnf(knights_tell_truth1,axiom,
    ( a_truth(Y,Z)
    | ~ says(X,Y)
    | ~ a_truth(knight(X),Z) ),
    file('theBenchmark.p',knights_tell_truth1) ).

cnf(knights_tell_truth2,axiom,
    ( ~ a_truth(Y,Z)
    | says(X,Y)
    | ~ a_truth(knight(X),Z) ),
    file('theBenchmark.p',knights_tell_truth2) ).

cnf(knaves_lie1,axiom,
    ( ~ a_truth(Y,Z)
    | ~ says(X,Y)
    | ~ a_truth(knave(X),Z) ),
    file('theBenchmark.p',knaves_lie1) ).

cnf(knaves_lie2,axiom,
    ( a_truth(Y,Z)
    | says(X,Y)
    | ~ a_truth(knave(X),Z) ),
    file('theBenchmark.p',knaves_lie2) ).

cnf(conjunction1,axiom,
    ( a_truth(X,Z)
    | ~ a_truth(and(X,Y),Z) ),
    file('theBenchmark.p',conjunction1) ).

cnf(conjunction2,axiom,
    ( a_truth(Y,Z)
    | ~ a_truth(and(X,Y),Z) ),
    file('theBenchmark.p',conjunction2) ).

cnf(conjunction3,axiom,
    ( ~ a_truth(Y,Z)
    | ~ a_truth(X,Z)
    | a_truth(and(X,Y),Z) ),
    file('theBenchmark.p',conjunction3) ).

cnf(prove_statement_exists1,negated_conjecture,
    ( ~ a_truth(and(knave(me),rich(me)),X)
    | ~ says(me,X) ),
    file('theBenchmark.p',prove_statement_exists1) ).

cnf(prove_statement_exists2,negated_conjecture,
    ( a_truth(and(knave(me),rich(me)),X)
    | says(me,X) ),
    file('theBenchmark.p',prove_statement_exists2) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ021-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37  % Computer : n002.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Sat Sep 19 19:58:54 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.13/5.50  % SZS status Unsatisfiable for theBenchmark
% 0.13/5.50  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------