%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 02:01:32 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 57 ( 16 unt; 10 nHn; 57 RR)
% Number of literals : 134 ( 0 equ; 76 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 14 ( 13 usr; 14 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c6,axiom,
( ~ some_irish_fight_not
| ~ some_scotch_dance_not
| some_germans_play ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).
cnf(c10,axiom,
( ~ some_monitors_are_not_awake
| ~ some_english_sing
| some_irish_fight_not ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c19,axiom,
some_scotch_dance_not,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c19) ).
cnf(c18,axiom,
some_english_sing,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c18) ).
cnf(prove_all_monitors_are_awake,negated_conjecture,
some_monitors_are_not_awake,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_all_monitors_are_awake) ).
cnf(c4,axiom,
( ~ some_monitors_are_not_awake
| ~ some_monitors_are_awake
| some_irish_fight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c4) ).
cnf(c1,axiom,
( ~ some_english_sing_not
| ~ some_english_sing
| some_monitors_are_awake ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c1) ).
cnf(c9,axiom,
( ~ some_germans_play
| ~ some_scotch_dance_not
| ~ some_english_sing
| some_english_sing_not ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c9) ).
cnf(c7,axiom,
( ~ some_scotch_dance
| ~ some_welsh_eat
| ~ some_monitors_are_awake ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c7) ).
cnf(c2,axiom,
( ~ some_irish_fight
| ~ some_scotch_dance
| some_welsh_eat ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c2) ).
cnf(c5,axiom,
( ~ some_germans_play
| some_welsh_eat_not
| some_scotch_dance ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c5) ).
cnf(c3,axiom,
( ~ some_germans_play
| some_of_the_eleven_are_not_oiling
| some_germans_play_not ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c3) ).
cnf(c11,axiom,
( ~ some_of_the_eleven_are_not_oiling
| ~ some_monitors_are_awake
| some_scotch_dance ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c17,axiom,
( some_germans_play_not
| some_germans_play ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c17) ).
cnf(c8,axiom,
( ~ some_irish_fight
| ~ some_welsh_eat_not
| ~ some_germans_play_not ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c8) ).
cnf(c_0_15,plain,
( ~ some_irish_fight_not
| ~ some_scotch_dance_not
| some_germans_play ),
inference(fof_simplification,[status(thm)],[c6]) ).
cnf(c_0_16,plain,
( ~ some_monitors_are_not_awake
| ~ some_english_sing
| some_irish_fight_not ),
inference(fof_simplification,[status(thm)],[c10]) ).
cnf(c_0_17,plain,
( ~ some_irish_fight_not
| ~ some_scotch_dance_not
| some_germans_play ),
c_0_15 ).
cnf(c_0_18,axiom,
some_scotch_dance_not,
c19 ).
cnf(c_0_19,plain,
( ~ some_monitors_are_not_awake
| ~ some_english_sing
| some_irish_fight_not ),
c_0_16 ).
cnf(c_0_20,axiom,
some_english_sing,
c18 ).
cnf(c_0_21,negated_conjecture,
some_monitors_are_not_awake,
prove_all_monitors_are_awake ).
cnf(c_0_22,plain,
( ~ some_monitors_are_not_awake
| ~ some_monitors_are_awake
| some_irish_fight ),
inference(fof_simplification,[status(thm)],[c4]) ).
cnf(c_0_23,plain,
( ~ some_english_sing_not
| ~ some_english_sing
| some_monitors_are_awake ),
inference(fof_simplification,[status(thm)],[c1]) ).
cnf(c_0_24,plain,
( ~ some_germans_play
| ~ some_scotch_dance_not
| ~ some_english_sing
| some_english_sing_not ),
inference(fof_simplification,[status(thm)],[c9]) ).
cnf(c_0_25,plain,
( ~ some_irish_fight_not
| some_germans_play ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_26,plain,
some_irish_fight_not,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_27,plain,
( ~ some_scotch_dance
| ~ some_welsh_eat
| ~ some_monitors_are_awake ),
inference(fof_simplification,[status(thm)],[c7]) ).
cnf(c_0_28,plain,
( ~ some_irish_fight
| ~ some_scotch_dance
| some_welsh_eat ),
inference(fof_simplification,[status(thm)],[c2]) ).
cnf(c_0_29,plain,
( ~ some_monitors_are_not_awake
| ~ some_monitors_are_awake
| some_irish_fight ),
c_0_22 ).
cnf(c_0_30,plain,
( ~ some_english_sing_not
| ~ some_english_sing
| some_monitors_are_awake ),
c_0_23 ).
cnf(c_0_31,plain,
( ~ some_germans_play
| ~ some_scotch_dance_not
| ~ some_english_sing
| some_english_sing_not ),
c_0_24 ).
cnf(c_0_32,plain,
some_germans_play,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_33,plain,
( ~ some_scotch_dance
| ~ some_welsh_eat
| ~ some_monitors_are_awake ),
c_0_27 ).
cnf(c_0_34,plain,
( ~ some_irish_fight
| ~ some_scotch_dance
| some_welsh_eat ),
c_0_28 ).
cnf(c_0_35,plain,
( ~ some_monitors_are_awake
| some_irish_fight ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_21])]) ).
cnf(c_0_36,plain,
( ~ some_english_sing_not
| some_monitors_are_awake ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_20])]) ).
cnf(c_0_37,plain,
some_english_sing_not,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_20]),c_0_32]),c_0_18])]) ).
cnf(c_0_38,plain,
( ~ some_germans_play
| some_welsh_eat_not
| some_scotch_dance ),
inference(fof_simplification,[status(thm)],[c5]) ).
cnf(c_0_39,plain,
( ~ some_germans_play
| some_of_the_eleven_are_not_oiling
| some_germans_play_not ),
inference(fof_simplification,[status(thm)],[c3]) ).
cnf(c_0_40,plain,
( ~ some_of_the_eleven_are_not_oiling
| ~ some_monitors_are_awake
| some_scotch_dance ),
inference(fof_simplification,[status(thm)],[c11]) ).
cnf(c_0_41,plain,
( ~ some_monitors_are_awake
| ~ some_scotch_dance ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_42,plain,
some_monitors_are_awake,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_43,plain,
( ~ some_germans_play
| some_welsh_eat_not
| some_scotch_dance ),
c_0_38 ).
cnf(c_0_44,plain,
( ~ some_germans_play
| some_of_the_eleven_are_not_oiling
| some_germans_play_not ),
c_0_39 ).
cnf(c_0_45,axiom,
( some_germans_play_not
| some_germans_play ),
c17 ).
cnf(c_0_46,plain,
( ~ some_of_the_eleven_are_not_oiling
| ~ some_monitors_are_awake
| some_scotch_dance ),
c_0_40 ).
cnf(c_0_47,plain,
~ some_scotch_dance,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_48,plain,
( ~ some_irish_fight
| ~ some_welsh_eat_not
| ~ some_germans_play_not ),
inference(fof_simplification,[status(thm)],[c8]) ).
cnf(c_0_49,plain,
( some_scotch_dance
| some_welsh_eat_not ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_32])]) ).
cnf(c_0_50,plain,
( some_germans_play_not
| some_of_the_eleven_are_not_oiling ),
inference(csr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
~ some_of_the_eleven_are_not_oiling,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_42])]),c_0_47]) ).
cnf(c_0_52,plain,
( ~ some_irish_fight
| ~ some_welsh_eat_not
| ~ some_germans_play_not ),
c_0_48 ).
cnf(c_0_53,plain,
some_irish_fight,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_42])]) ).
cnf(c_0_54,plain,
some_welsh_eat_not,
inference(sr,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_55,plain,
some_germans_play_not,
inference(sr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 03:50:25 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42 % Version: 3.5.1
% 0.10/0.42 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.42 % Starting sh5l with 300s (1) cores
% 0.10/0.42 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1483368 completed with status 0
% 0.10/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.10/0.42 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.10/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.42 % No SInE strategy applied
% 0.10/0.42 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 0.10/0.42 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.10/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.42 % SubtermCWHack with pid 1483372 completed with status 0
% 0.10/0.42 % Result found by SubtermCWHack
% 0.10/0.42 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.10/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.42 % No SInE strategy applied
% 0.10/0.42 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.42 % Preprocessing time : 0.001 s
% 0.10/0.42
% 0.10/0.42 % Proof found!
% 0.10/0.42 % SZS status Unsatisfiable
% 0.10/0.42 % SZS output start CNFRefutation
% See solution above
% 0.10/0.42 % Parsed axioms : 20
% 0.10/0.42 % Removed by relevancy pruning/SinE : 0
% 0.10/0.42 % Initial clauses : 20
% 0.10/0.42 % Removed in clause preprocessing : 0
% 0.10/0.42 % Initial clauses in saturation : 20
% 0.10/0.42 % Processed clauses : 33
% 0.10/0.42 % ...of these trivial : 4
% 0.10/0.42 % ...subsumed : 0
% 0.10/0.42 % ...remaining for further processing : 28
% 0.10/0.42 % Other redundant clauses eliminated : 0
% 0.10/0.42 % Clauses deleted for lack of memory : 0
% 0.10/0.42 % Backward-subsumed : 4
% 0.10/0.42 % Backward-rewritten : 10
% 0.10/0.42 % Generated clauses : 6
% 0.10/0.42 % ...of the previous two non-redundant : 14
% 0.10/0.42 % ...aggressively subsumed : 0
% 0.10/0.42 % Contextual simplify-reflections : 2
% 0.10/0.42 % Paramodulations : 4
% 0.10/0.42 % Factorizations : 0
% 0.10/0.42 % NegExts : 0
% 0.10/0.42 % Equation resolutions : 0
% 0.10/0.42 % Disequality decompositions : 0
% 0.10/0.42 % Total rewrite steps : 24
% 0.10/0.42 % ...of those cached : 14
% 0.10/0.42 % Propositional unsat checks : 0
% 0.10/0.42 % Propositional check models : 0
% 0.10/0.42 % Propositional check unsatisfiable : 0
% 0.10/0.42 % Propositional clauses : 0
% 0.10/0.42 % Propositional clauses after purity: 0
% 0.10/0.42 % Propositional unsat core size : 0
% 0.10/0.42 % Propositional preprocessing time : 0.000
% 0.10/0.42 % Propositional encoding time : 0.000
% 0.10/0.42 % Propositional solver time : 0.000
% 0.10/0.42 % Success case prop preproc time : 0.000
% 0.10/0.42 % Success case prop encoding time : 0.000
% 0.10/0.42 % Success case prop solver time : 0.000
% 0.10/0.42 % Current number of processed clauses : 12
% 0.10/0.42 % Positive orientable unit clauses : 10
% 0.10/0.42 % Positive unorientable unit clauses: 0
% 0.10/0.42 % Negative unit clauses : 2
% 0.10/0.42 % Non-unit-clauses : 0
% 0.10/0.42 % Current number of unprocessed clauses: 0
% 0.10/0.42 % ...number of literals in the above : 0
% 0.10/0.42 % Current number of archived formulas : 0
% 0.10/0.42 % Current number of archived clauses : 16
% 0.10/0.42 % Clause-clause subsumption calls (NU) : 21
% 0.10/0.42 % Rec. Clause-clause subsumption calls : 16
% 0.10/0.42 % Non-unit clause-clause subsumptions : 3
% 0.10/0.42 % Unit Clause-clause subsumption calls : 11
% 0.10/0.42 % Rewrite failures with RHS unbound : 0
% 0.10/0.42 % BW rewrite match attempts : 6
% 0.10/0.42 % BW rewrite match successes : 6
% 0.10/0.42 % Condensation attempts : 0
% 0.10/0.42 % Condensation successes : 0
% 0.10/0.42 % Termbank termtop insertions : 467
% 0.10/0.42 % Search garbage collected termcells : 34
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.003 s
% 0.10/0.42 % System time : 0.003 s
% 0.10/0.42 % Total time : 0.006 s
% 0.10/0.42 % Maximum resident set size: 3632 pages
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.013 s
% 0.10/0.42 % System time : 0.007 s
% 0.10/0.42 % Total time : 0.020 s
% 0.10/0.42 % Maximum resident set size: 4608 pages
% 0.10/0.42 % E exiting
%------------------------------------------------------------------------------