%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PUZ081_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:02:34 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ081_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:50:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % sh5l with pid 4161195 completed with status 0
% 0.11/0.44 % Result found by sh5l
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.44 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 4161201 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.44 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% 0.11/0.44 tff(decl_23, type, mel: $i).
% 0.11/0.44 tff(decl_24, type, zoey: $i).
% 0.11/0.44 tff(decl_25, type, knight: $i > $o).
% 0.11/0.44 tff(decl_26, type, knave: $i > $o).
% 0.11/0.44 tff(decl_27, type, says: ($i * $o) > $o).
% 0.11/0.44 fof(knights_xor_knaves, axiom, ![X1]:((knight(X1)<~>knave(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', knights_xor_knaves)).
% 0.11/0.44 fof(knights_tell_truth, axiom, ![X1, X2:$o]:(((knight(X1)&says(X1,X2))=>X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', knights_tell_truth)).
% 0.11/0.44 fof(zoey_speaks, axiom, says(zoey,knave(mel)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', zoey_speaks)).
% 0.11/0.44 fof(mel_speaks, axiom, says(mel,(~(knave(zoey))&~(knave(mel)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mel_speaks)).
% 0.11/0.44 fof(knaves_lie, axiom, ![X1, X2:$o]:(((knave(X1)&says(X1,X2))=>~(X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', knaves_lie)).
% 0.11/0.44 fof(who_is_knight_and_knave, conjecture, ?[X3, X4]:((knight(X3)&knave(X4))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', who_is_knight_and_knave)).
% 0.11/0.44 fof(c_0_6, plain, ![X1]:(~((knight(X1)<=>knave(X1)))), inference(fof_simplification,[status(thm)],[knights_xor_knaves])).
% 0.11/0.44 fof(c_0_7, plain, ![X10, X11:$o]:((~knight(X10)|~says(X10,X11)|X11)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[knights_tell_truth])])])).
% 0.11/0.44 fof(c_0_8, plain, ![X7]:(((~knight(X7)|~knave(X7))&(knight(X7)|knave(X7)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
% 0.11/0.44 fof(c_0_9, axiom, ((~knave(mel)|says(zoey,$true))&(knave(mel)|says(zoey,$false))), inference(fool_unroll,[status(thm)],[zoey_speaks])).
% 0.11/0.44 fof(c_0_10, plain, ((~((~knave(zoey)&~knave(mel)))|says(mel,$true))&((~knave(zoey)&~knave(mel))|says(mel,$false))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[mel_speaks])])).
% 0.11/0.44 cnf(c_0_11, plain, (~knight(X1)|~says(X1,$false)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])])).
% 0.11/0.44 cnf(c_0_12, plain, (knight(X1)|knave(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.11/0.44 fof(c_0_13, plain, ((~knave(mel)|says(zoey,$true))&(knave(mel)|says(zoey,$false))), inference(fof_nnf,[status(thm)],[c_0_9])).
% 0.11/0.44 fof(c_0_14, plain, ![X1, X2:$o]:(((knave(X1)&says(X1,X2))=>~X2)), inference(fof_simplification,[status(thm)],[knaves_lie])).
% 0.11/0.44 fof(c_0_15, negated_conjecture, ~(?[X3, X4]:((knight(X3)&knave(X4)))), inference(assume_negation,[status(cth)],[who_is_knight_and_knave])).
% 0.11/0.44 fof(c_0_16, plain, ((knave(zoey)|knave(mel)|says(mel,$true))&((~knave(zoey)|says(mel,$false))&(~knave(mel)|says(mel,$false)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
% 0.11/0.44 cnf(c_0_17, plain, (knave(X1)|~says(X1,$false)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.11/0.44 cnf(c_0_18, plain, (knave(mel)|says(zoey,$false)), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.11/0.44 fof(c_0_19, plain, ![X8, X9:$o]:((~knave(X8)|~says(X8,X9)|~X9)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
% 0.11/0.44 fof(c_0_20, negated_conjecture, ![X5, X6]:((~knight(X5)|~knave(X6))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
% 0.11/0.44 cnf(c_0_21, plain, (says(mel,$false)|~knave(zoey)), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.11/0.44 cnf(c_0_22, plain, (knave(mel)|knave(zoey)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.11/0.44 cnf(c_0_23, plain, (~knave(X1)|~says(X1,$true)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_19])])])).
% 0.11/0.44 cnf(c_0_24, plain, (says(zoey,$true)|~knave(mel)), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.11/0.44 cnf(c_0_25, negated_conjecture, (~knight(X1)|~knave(X3)), inference(split_conjunct,[status(thm)],[c_0_20])).
% 0.11/0.44 cnf(c_0_26, plain, (knave(mel)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_21]), c_0_22])).
% 0.11/0.44 cnf(c_0_27, plain, (~knave(zoey)|~knave(mel)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.11/0.44 cnf(c_0_28, negated_conjecture, (~knight(X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
% 0.11/0.44 cnf(c_0_29, plain, (~knave(zoey)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_26])])).
% 0.11/0.44 cnf(c_0_30, plain, (knave(X1)), inference(sr,[status(thm)],[c_0_12, c_0_28])).
% 0.11/0.44 cnf(c_0_31, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_30])]), ['proof']).
% 0.11/0.44 % SZS output end CNFRefutation
% 0.11/0.44 % Parsed axioms : 11
% 0.11/0.44 % Removed by relevancy pruning/SinE : 5
% 0.11/0.44 % Initial clauses : 10
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 10
% 0.11/0.44 % Processed clauses : 17
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 1
% 0.11/0.44 % ...remaining for further processing : 16
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 4
% 0.11/0.44 % Backward-rewritten : 9
% 0.11/0.44 % Generated clauses : 10
% 0.11/0.44 % ...of the previous two non-redundant : 11
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 1
% 0.11/0.44 % Paramodulations : 9
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 9
% 0.11/0.44 % ...of those cached : 5
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 2
% 0.11/0.44 % Positive orientable unit clauses : 1
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 1
% 0.11/0.44 % Non-unit-clauses : 0
% 0.11/0.44 % Current number of unprocessed clauses: 3
% 0.11/0.44 % ...number of literals in the above : 4
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 14
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 5
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 5
% 0.11/0.44 % Non-unit clause-clause subsumptions : 3
% 0.11/0.44 % Unit Clause-clause subsumption calls : 3
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 4
% 0.11/0.44 % BW rewrite match successes : 4
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 667
% 0.11/0.44 % Search garbage collected termcells : 96
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.003 s
% 0.11/0.44 % System time : 0.003 s
% 0.11/0.44 % Total time : 0.005 s
% 0.11/0.44 % Maximum resident set size: 3636 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.006 s
% 0.11/0.44 % System time : 0.005 s
% 0.11/0.44 % Total time : 0.011 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------