%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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 : Sun Sep 27 08:23:11 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 82 ( 29 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 20 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(everyone_a_knight_or_knave,axiom,
! [VAR_0] :
( truth(isa(VAR_0,knave))
| truth(isa(VAR_0,knight)) ),
file('theBenchmark.p',everyone_a_knight_or_knave) ).
cnf(c_1,plain,
( truth(isa(A,knave))
| truth(isa(A,knight)) ),
inference(clausify,[status(thm)],[everyone_a_knight_or_knave]) ).
fof(knights_make_true_statements3,axiom,
! [VAR_0,VAR_1] :
( reply(VAR_1,VAR_0,yes)
| ~ truth(isa(VAR_1,knight))
| ~ truth(VAR_0) ),
file('theBenchmark.p',knights_make_true_statements3) ).
cnf(c_5,plain,
( reply(B,A,yes)
| ~ truth(isa(B,knight))
| ~ truth(A) ),
inference(clausify,[status(thm)],[knights_make_true_statements3]) ).
fof(knights_make_true_statements4,axiom,
! [VAR_0,VAR_1] :
( reply(VAR_1,VAR_0,yes)
| truth(isa(VAR_1,knight))
| truth(VAR_0) ),
file('theBenchmark.p',knights_make_true_statements4) ).
cnf(c_6,plain,
( reply(B,A,yes)
| truth(isa(B,knight))
| truth(A) ),
inference(clausify,[status(thm)],[knights_make_true_statements4]) ).
fof(yes_or_no,axiom,
! [VAR_0,VAR_1] :
( reply(VAR_0,VAR_1,no)
| reply(VAR_0,VAR_1,yes) ),
file('theBenchmark.p',yes_or_no) ).
cnf(c_7,plain,
( reply(A,B,no)
| reply(A,B,yes) ),
inference(clausify,[status(thm)],[yes_or_no]) ).
fof(or1,axiom,
! [VAR_0,VAR_1] :
( ~ truth(or(VAR_0,VAR_1))
| truth(VAR_1)
| truth(VAR_0) ),
file('theBenchmark.p',or1) ).
cnf(c_11,plain,
( ~ truth(or(A,B))
| truth(B)
| truth(A) ),
inference(clausify,[status(thm)],[or1]) ).
fof(or2,axiom,
! [VAR_0,VAR_1] :
( ~ truth(VAR_0)
| truth(or(VAR_0,VAR_1)) ),
file('theBenchmark.p',or2) ).
cnf(c_12,plain,
( ~ truth(A)
| truth(or(A,B)) ),
inference(clausify,[status(thm)],[or2]) ).
fof(prove_answer,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ truth(isa(other,VAR_2))
| ~ truth(isa(asked,VAR_1))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),VAR_0) ),
file('theBenchmark.p',prove_answer) ).
cnf(c_14,plain,
( ~ truth(isa(other,C))
| ~ truth(isa(asked,B))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),A) ),
inference(clausify,[status(thm)],[prove_answer]) ).
cnf(c_24,plain,
( reply(asked,or(isa(asked,knight),isa(other,knight)),yes)
| ~ truth(isa(other,B))
| ~ truth(isa(asked,A)) ),
inference(resolve,[status(thm)],[c_14,c_7]) ).
cnf(c_25,plain,
( truth(isa(asked,knight))
| truth(or(isa(asked,knight),isa(other,knight)))
| ~ truth(isa(other,B))
| ~ truth(isa(asked,A)) ),
inference(resolve,[status(thm)],[c_14,c_6]) ).
cnf(c_41,plain,
( truth(isa(asked,knight))
| reply(asked,or(isa(asked,knight),isa(other,knight)),yes)
| ~ truth(isa(other,A)) ),
inference(resolve,[status(thm)],[c_24,c_1]) ).
cnf(c_230,plain,
( truth(isa(asked,knight))
| truth(isa(asked,knight))
| truth(or(isa(asked,knight),isa(other,knight)))
| ~ truth(isa(other,A)) ),
inference(resolve,[status(thm)],[c_25,c_1]) ).
cnf(c_43,plain,
( truth(isa(asked,knight))
| truth(or(isa(asked,knight),isa(other,knight)))
| ~ truth(isa(other,A)) ),
inference(copy,[status(thm)],[c_230]) ).
cnf(c_54,plain,
( truth(isa(other,knight))
| truth(isa(asked,knight))
| truth(or(isa(asked,knight),isa(other,knight))) ),
inference(resolve,[status(thm)],[c_43,c_1]) ).
cnf(c_231,plain,
( truth(isa(other,knight))
| truth(isa(asked,knight))
| truth(isa(other,knight))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_54,c_11]) ).
cnf(c_232,plain,
( truth(isa(other,knight))
| truth(isa(other,knight))
| truth(isa(asked,knight)) ),
inference(copy,[status(thm)],[c_231]) ).
cnf(c_57,plain,
( truth(isa(other,knight))
| truth(isa(asked,knight)) ),
inference(copy,[status(thm)],[c_232]) ).
cnf(c_233,plain,
( truth(isa(asked,knight))
| truth(isa(asked,knight))
| reply(asked,or(isa(asked,knight),isa(other,knight)),yes) ),
inference(resolve,[status(thm)],[c_41,c_57]) ).
cnf(c_123,plain,
( truth(isa(asked,knight))
| reply(asked,or(isa(asked,knight),isa(other,knight)),yes) ),
inference(copy,[status(thm)],[c_233]) ).
cnf(c_124,plain,
( ~ truth(isa(other,B))
| ~ truth(isa(asked,A))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_123,c_14]) ).
cnf(c_234,plain,
( truth(isa(asked,knight))
| ~ truth(isa(other,A))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_124,c_1]) ).
cnf(c_126,plain,
( ~ truth(isa(other,A))
| truth(isa(asked,knight)) ),
inference(copy,[status(thm)],[c_234]) ).
cnf(c_235,plain,
( truth(isa(asked,knight))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_126,c_57]) ).
cnf(c_138,plain,
truth(isa(asked,knight)),
inference(copy,[status(thm)],[c_235]) ).
cnf(c_151,plain,
truth(or(isa(asked,knight),A)),
inference(resolve,[status(thm)],[c_138,c_12]) ).
cnf(c_152,plain,
( reply(asked,A,yes)
| ~ truth(A) ),
inference(resolve,[status(thm)],[c_138,c_5]) ).
cnf(c_192,plain,
reply(asked,or(isa(asked,knight),A),yes),
inference(resolve,[status(thm)],[c_151,c_152]) ).
cnf(c_236,plain,
( ~ truth(isa(other,B))
| ~ truth(isa(asked,A)) ),
inference(resolve,[status(thm)],[c_14,c_192]) ).
cnf(c_227,plain,
~ truth(isa(other,A)),
inference(resolve,[status(thm)],[c_236,c_138]) ).
cnf(c_237,plain,
truth(isa(other,knight)),
inference(resolve,[status(thm)],[c_227,c_1]) ).
cnf(c_229,plain,
$false,
inference(resolve,[status(thm)],[c_227,c_237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 05:06:21 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 1975900 was started by sandbox on n013,
% 0.09/0.36 % Sat Sep 26 05:06:21 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 0.09/0.39
% 0.09/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39
% 0.09/0.39 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.09/0.39 % Length of proof is 22.
% 0.09/0.39 % Level of proof is 12.
% 0.09/0.39 % Maximum clause weight is 35.000.
% 0.09/0.39 % Given clauses 96.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------