↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : PUZ035-6 : TPTP v9.3.1. Released v2.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 : n011.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.14s 5.60s
% Output   : Proof 0.14s
% 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,
    ( ~ says(P,S)
    | ~ truth(isa(P,knight))
    | truth(S) ),
    file('theBenchmark.p',knights_make_true_statements1) ).

cnf(knights_make_true_statements2,axiom,
    ( ~ says(P,S)
    | ~ truth(S)
    | truth(isa(P,knight)) ),
    file('theBenchmark.p',knights_make_true_statements2) ).

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(not1,axiom,
    ( truth(not(C))
    | truth(C) ),
    file('theBenchmark.p',not1) ).

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

cnf(says_yes,axiom,
    says(asked,not(or(isa(asked,knight),isa(other,knight)))),
    file('theBenchmark.p',says_yes) ).

cnf(query,negated_conjecture,
    ( ~ truth(isa(other,Y))
    | ~ truth(isa(asked,X)) ),
    file('theBenchmark.p',query) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ035-6 : 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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.55  % Computer : n011.cluster.edu
% 0.10/5.55  % Model    : x86_64 x86_64
% 0.10/5.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.55  % Memory   : 8046.5625MB
% 0.10/5.55  % OS       : Linux 6.8.0-71-generic
% 0.10/5.55  % CPULimit : 300
% 0.10/5.55  % WCLimit  : 300
% 0.10/5.55  % DateTime : Sat Sep 19 19:58:00 UTC 2026
% 0.10/5.55  % CPUTime  : 
% 0.14/5.60  % SZS status Unsatisfiable for theBenchmark
% 0.14/5.60  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------