%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ013-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:22:44 AM UTC 2026
% Result : Unsatisfiable 0.04s 15.55s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 28 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 8 ( 7 usr; 8 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(c1,axiom,
( some_monitors_are_awake
| ~ some_english_sing_not
| ~ some_english_sing ),
file('theBenchmark.p',c1) ).
cnf(c_1,plain,
( some_monitors_are_awake
| ~ some_english_sing_not
| ~ some_english_sing ),
inference(clausify,[status(thm)],[c1]) ).
fof(c6,axiom,
( some_germans_play
| ~ some_irish_fight_not
| ~ some_scotch_dance_not ),
file('theBenchmark.p',c6) ).
cnf(c_6,plain,
( some_germans_play
| ~ some_irish_fight_not
| ~ some_scotch_dance_not ),
inference(clausify,[status(thm)],[c6]) ).
fof(c9,axiom,
( ~ some_germans_play
| ~ some_scotch_dance_not
| some_english_sing_not
| ~ some_english_sing ),
file('theBenchmark.p',c9) ).
cnf(c_9,plain,
( ~ some_germans_play
| ~ some_scotch_dance_not
| some_english_sing_not
| ~ some_english_sing ),
inference(clausify,[status(thm)],[c9]) ).
fof(c10,axiom,
( some_irish_fight_not
| ~ some_monitors_are_not_awake
| ~ some_english_sing ),
file('theBenchmark.p',c10) ).
cnf(c_10,plain,
( some_irish_fight_not
| ~ some_monitors_are_not_awake
| ~ some_english_sing ),
inference(clausify,[status(thm)],[c10]) ).
fof(c13,axiom,
( some_monitors_are_awake
| some_monitors_are_not_awake ),
file('theBenchmark.p',c13) ).
cnf(c_13,plain,
( some_monitors_are_awake
| some_monitors_are_not_awake ),
inference(clausify,[status(thm)],[c13]) ).
fof(c18,axiom,
some_english_sing,
file('theBenchmark.p',c18) ).
cnf(c_18,plain,
some_english_sing,
inference(clausify,[status(thm)],[c18]) ).
fof(c19,axiom,
some_scotch_dance_not,
file('theBenchmark.p',c19) ).
cnf(c_19,plain,
some_scotch_dance_not,
inference(clausify,[status(thm)],[c19]) ).
fof(prove_some_monitors_are_awake,axiom,
~ some_monitors_are_awake,
file('theBenchmark.p',prove_some_monitors_are_awake) ).
cnf(c_20,plain,
~ some_monitors_are_awake,
inference(clausify,[status(thm)],[prove_some_monitors_are_awake]) ).
cnf(c_21,plain,
( some_irish_fight_not
| ~ some_monitors_are_not_awake ),
inference(resolve,[status(thm)],[c_18,c_10]) ).
cnf(c_29,plain,
( ~ some_germans_play
| ~ some_scotch_dance_not
| some_english_sing_not ),
inference(resolve,[status(thm)],[c_18,c_9]) ).
cnf(c_22,plain,
( ~ some_germans_play
| some_english_sing_not ),
inference(resolve,[status(thm)],[c_19,c_29]) ).
cnf(c_30,plain,
( some_monitors_are_awake
| ~ some_english_sing_not ),
inference(resolve,[status(thm)],[c_18,c_1]) ).
cnf(c_23,plain,
~ some_english_sing_not,
inference(resolve,[status(thm)],[c_20,c_30]) ).
cnf(c_24,plain,
( some_germans_play
| ~ some_irish_fight_not ),
inference(resolve,[status(thm)],[c_19,c_6]) ).
cnf(c_25,plain,
some_monitors_are_not_awake,
inference(resolve,[status(thm)],[c_20,c_13]) ).
cnf(c_26,plain,
~ some_germans_play,
inference(resolve,[status(thm)],[c_23,c_22]) ).
cnf(c_27,plain,
some_irish_fight_not,
inference(resolve,[status(thm)],[c_25,c_21]) ).
cnf(c_31,plain,
some_germans_play,
inference(resolve,[status(thm)],[c_27,c_24]) ).
cnf(c_28,plain,
$false,
inference(resolve,[status(thm)],[c_26,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PUZ013-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/15.54 % Computer : n012.cluster.edu
% 0.04/15.54 % Model : x86_64 x86_64
% 0.04/15.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/15.54 % Memory : 8046.5625MB
% 0.04/15.54 % OS : Linux 6.8.0-71-generic
% 0.04/15.54 % CPULimit : 300
% 0.04/15.54 % WCLimit : 300
% 0.04/15.54 % DateTime : Sat Sep 26 05:03:39 UTC 2026
% 0.04/15.54 % CPUTime :
% 0.04/15.54 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.04/15.54 % Process 3957660 was started by sandbox2 on n012,
% 0.04/15.54 % Sat Sep 26 05:03:39 2026
% 0.04/15.54 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.04/15.54
% 0.04/15.54 % From the command line: assign(max_seconds, 300).
% 0.04/15.55
% 0.04/15.55 % SZS status Unsatisfiable for theBenchmark
% 0.04/15.55
% 0.04/15.55 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.04/15.55 % Length of proof is 16.
% 0.04/15.55 % Level of proof is 3.
% 0.04/15.55 % Maximum clause weight is 4.000.
% 0.04/15.55 % Given clauses 0.
% 0.04/15.55
% 0.04/15.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------