%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ035-6 : 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 : n012.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.03s 0.32s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 14 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 5 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(says_yes,axiom,
says(asked,not(or(isa(asked,knight),isa(other,knight)))),
file('theBenchmark.p',says_yes) ).
cnf(c_1,plain,
says(asked,not(or(isa(asked,knight),isa(other,knight)))),
inference(clausify,[status(thm)],[says_yes]) ).
fof(knights_make_true_statements2,axiom,
! [VAR_0,VAR_1] :
( ~ says(VAR_0,VAR_1)
| ~ truth(VAR_1)
| truth(isa(VAR_0,knight)) ),
file('theBenchmark.p',knights_make_true_statements2) ).
cnf(c_2,plain,
( ~ says(A,B)
| ~ truth(B)
| truth(isa(A,knight)) ),
inference(clausify,[status(thm)],[knights_make_true_statements2]) ).
cnf(c_5,plain,
( ~ truth(not(or(isa(asked,knight),isa(other,knight))))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(query,axiom,
! [VAR_0,VAR_1] :
( ~ truth(isa(other,VAR_1))
| ~ truth(isa(asked,VAR_0)) ),
file('theBenchmark.p',query) ).
cnf(c_6,plain,
( ~ truth(isa(other,B))
| ~ truth(isa(asked,A)) ),
inference(clausify,[status(thm)],[query]) ).
fof(not1,axiom,
! [VAR_0] :
( truth(not(VAR_0))
| truth(VAR_0) ),
file('theBenchmark.p',not1) ).
cnf(c_8,plain,
( truth(not(A))
| truth(A) ),
inference(clausify,[status(thm)],[not1]) ).
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(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_13,plain,
( truth(isa(A,knave))
| truth(isa(A,knight)) ),
inference(clausify,[status(thm)],[everyone_a_knight_or_knave]) ).
cnf(c_15,plain,
( truth(isa(asked,knight))
| truth(or(isa(asked,knight),isa(other,knight))) ),
inference(resolve,[status(thm)],[c_8,c_5]) ).
cnf(c_20,plain,
( ~ truth(isa(asked,A))
| truth(isa(other,knight)) ),
inference(resolve,[status(thm)],[c_13,c_6]) ).
cnf(c_21,plain,
( ~ truth(isa(other,A))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_13,c_6]) ).
cnf(c_38,plain,
( truth(isa(other,knight))
| truth(isa(asked,knight))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_15,c_11]) ).
cnf(c_22,plain,
( truth(isa(other,knight))
| truth(isa(asked,knight)) ),
inference(copy,[status(thm)],[c_38]) ).
cnf(c_39,plain,
( truth(isa(asked,knight))
| truth(isa(asked,knight)) ),
inference(resolve,[status(thm)],[c_22,c_21]) ).
cnf(c_31,plain,
truth(isa(asked,knight)),
inference(copy,[status(thm)],[c_39]) ).
cnf(c_33,plain,
truth(isa(other,knight)),
inference(resolve,[status(thm)],[c_31,c_20]) ).
cnf(c_36,plain,
~ truth(isa(other,A)),
inference(resolve,[status(thm)],[c_31,c_6]) ).
cnf(c_37,plain,
$false,
inference(resolve,[status(thm)],[c_36,c_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PUZ035-6 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Sat Sep 26 05:06:35 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.31 % Process 3965147 was started by sandbox on n012,
% 0.03/0.31 % Sat Sep 26 05:06:35 2026
% 0.03/0.31 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.03/0.31
% 0.03/0.31 % From the command line: assign(max_seconds, 300).
% 0.03/0.32
% 0.03/0.32 % SZS status Unsatisfiable for theBenchmark
% 0.03/0.32
% 0.03/0.32 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.03/0.32 % Length of proof is 15.
% 0.03/0.32 % Level of proof is 6.
% 0.03/0.32 % Maximum clause weight is 13.000.
% 0.03/0.32 % Given clauses 19.
% 0.03/0.32
% 0.03/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------