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