↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : PUZ035-7 : TPTP v9.3.1. Released v2.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 : n009.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:22 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(everyone_a_knight_or_knave,axiom,
    ( truth(isa(P,knave))
    | truth(isa(P,knight)) ),
    file('theBenchmark.p',everyone_a_knight_or_knave) ).

cnf(not_both_a_knight_and_knave,axiom,
    ( ~ truth(isa(P,knave))
    | ~ truth(isa(P,knight)) ),
    file('theBenchmark.p',not_both_a_knight_and_knave) ).

cnf(knights_make_true_statements1,axiom,
    ( ~ reply(P,Q,yes)
    | ~ truth(isa(P,knight))
    | truth(Q) ),
    file('theBenchmark.p',knights_make_true_statements1) ).

cnf(knights_make_true_statements2,axiom,
    ( ~ reply(P,Q,yes)
    | truth(isa(P,knight))
    | ~ truth(Q) ),
    file('theBenchmark.p',knights_make_true_statements2) ).

cnf(knights_make_true_statements3,axiom,
    ( reply(P,Q,yes)
    | ~ truth(isa(P,knight))
    | ~ truth(Q) ),
    file('theBenchmark.p',knights_make_true_statements3) ).

cnf(knights_make_true_statements4,axiom,
    ( reply(P,Q,yes)
    | truth(isa(P,knight))
    | truth(Q) ),
    file('theBenchmark.p',knights_make_true_statements4) ).

cnf(yes_or_no,axiom,
    ( reply(P,Q,no)
    | reply(P,Q,yes) ),
    file('theBenchmark.p',yes_or_no) ).

cnf(not_yes_and_no,axiom,
    ( ~ reply(P,Q,no)
    | ~ reply(P,Q,yes) ),
    file('theBenchmark.p',not_yes_and_no) ).

cnf(true1,axiom,
    ( truth(not(C))
    | truth(C) ),
    file('theBenchmark.p',true1) ).

cnf(true2,axiom,
    ( ~ truth(not(C))
    | ~ truth(C) ),
    file('theBenchmark.p',true2) ).

cnf(or1,axiom,
    ( ~ truth(or(A,B))
    | truth(B)
    | truth(A) ),
    file('theBenchmark.p',or1) ).

cnf(or2,axiom,
    ( ~ truth(A)
    | truth(or(A,B)) ),
    file('theBenchmark.p',or2) ).

cnf(or3,axiom,
    ( ~ truth(B)
    | truth(or(A,B)) ),
    file('theBenchmark.p',or3) ).

cnf(prove_answer,negated_conjecture,
    ( ~ truth(isa(other,Y))
    | ~ truth(isa(asked,X))
    | ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R) ),
    file('theBenchmark.p',prove_answer) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_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.10/0.35  % Computer : n009.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sat Sep 19 19:57:42 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.55/0.84  % SZS status Unsatisfiable for theBenchmark
% 0.55/0.84  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------