%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ081^2 : TPTP v9.3.1. Bugfixed v7.1.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 : Wed Sep 30 08:20:32 AM UTC 2026
% Result : Theorem 0.11s 0.26s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 118 ( 18 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 231 ( 58 ~; 45 |; 21 &; 102 @)
% ( 1 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 20 !; 4 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
mel: $i ).
thf(decl_24,type,
zoey: $i ).
thf(decl_25,type,
knight: $i > $o ).
thf(decl_26,type,
knave: $i > $o ).
thf(decl_27,type,
says: $i > $o > $o ).
thf(zoey_speaks,axiom,
says @ zoey @ ( knave @ mel ),
file('/export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p',zoey_speaks) ).
thf(mel_speaks,axiom,
( says @ mel
@ ( ~ ( knave @ zoey )
& ~ ( knave @ mel ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p',mel_speaks) ).
thf(knights_tell_truth,axiom,
! [X1: $i,X2: $o] :
( ( ( knight @ X1 )
& ( says @ X1 @ X2 ) )
=> X2 ),
file('/export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p',knights_tell_truth) ).
thf(knights_xor_knaves,axiom,
! [X1: $i] :
( ( knight @ X1 )
<~> ( knave @ X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p',knights_xor_knaves) ).
thf(knaves_lie,axiom,
! [X1: $i,X2: $o] :
( ( ( knave @ X1 )
& ( says @ X1 @ X2 ) )
=> ~ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p',knaves_lie) ).
thf(what_are_zoey_and_mel,conjecture,
? [X3: $i > $o,X4: $i > $o] :
( ( ( X3 = knight )
| ( X3 = knave ) )
& ( ( X4 = knight )
| ( X4 = knave ) )
& ( X3 @ zoey )
& ( X4 @ mel ) ),
file('/export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p',what_are_zoey_and_mel) ).
thf(c_0_6,axiom,
( ( ~ ( knave @ mel )
| ( says @ zoey @ $true ) )
& ( ( knave @ mel )
| ( says @ zoey @ $false ) ) ),
inference(fool_unroll,[status(thm)],[zoey_speaks]) ).
thf(c_0_7,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])]) ).
thf(c_0_8,plain,
! [X13: $i,X14: $o] :
( ~ ( knight @ X13 )
| ~ ( says @ X13 @ X14 )
| X14 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[knights_tell_truth])])]) ).
thf(c_0_9,plain,
( ( ~ ( knave @ mel )
| ( says @ zoey @ $true ) )
& ( ( knave @ mel )
| ( says @ zoey @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: $i] :
~ ( ( knight @ X1 )
<=> ( knave @ X1 ) ),
inference(fof_simplification,[status(thm)],[knights_xor_knaves]) ).
thf(c_0_11,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_7])])]) ).
thf(c_0_12,plain,
! [X1: $i] :
( ~ ( knight @ X1 )
| ~ ( says @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])]) ).
thf(c_0_13,plain,
( ( knave @ mel )
| ( says @ zoey @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
! [X12: $i] :
( ( ~ ( knight @ X12 )
| ~ ( knave @ X12 ) )
& ( ( knight @ X12 )
| ( knave @ X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
thf(c_0_15,plain,
! [X1: $i,X2: $o] :
( ( ( knave @ X1 )
& ( says @ X1 @ X2 ) )
=> ~ X2 ),
inference(fof_simplification,[status(thm)],[knaves_lie]) ).
thf(c_0_16,negated_conjecture,
~ ? [X3: $i > $o,X4: $i > $o] :
( ( ( X3 = knight )
| ( X3 = knave ) )
& ( ( X4 = knight )
| ( X4 = knave ) )
& ( X3 @ zoey )
& ( X4 @ mel ) ),
inference(assume_negation,[status(cth)],[what_are_zoey_and_mel]) ).
thf(c_0_17,plain,
( ( says @ mel @ ~ $true )
| ~ ( knave @ zoey ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,plain,
( ( knave @ mel )
| ~ ( knight @ zoey ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_19,plain,
! [X1: $i] :
( ( knight @ X1 )
| ( knave @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
! [X15: $i,X16: $o] :
( ~ ( knave @ X15 )
| ~ ( says @ X15 @ X16 )
| ~ X16 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
thf(c_0_21,negated_conjecture,
! [X17: $i > $o,X18: $i > $o] :
( ( ( X18 != knight )
| ( X17 != knight )
| ~ ( X17 @ zoey )
| ~ ( X18 @ mel ) )
& ( ( X18 != knave )
| ( X17 != knight )
| ~ ( X17 @ zoey )
| ~ ( X18 @ mel ) )
& ( ( X18 != knight )
| ( X17 != knave )
| ~ ( X17 @ zoey )
| ~ ( X18 @ mel ) )
& ( ( X18 != knave )
| ( X17 != knave )
| ~ ( X17 @ zoey )
| ~ ( X18 @ mel ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
thf(c_0_22,plain,
( ~ ( knight @ mel )
| ~ ( knave @ zoey ) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
thf(c_0_23,plain,
( ( knave @ zoey )
| ( knave @ mel ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_24,plain,
! [X1: $i] :
( ~ ( knave @ X1 )
| ~ ( says @ X1 @ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_20])])]) ).
thf(c_0_25,plain,
( ( says @ zoey @ $true )
| ~ ( knave @ mel ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_26,negated_conjecture,
! [X4: $i > $o,X3: $i > $o] :
( ( X3 != knave )
| ( X4 != knight )
| ~ ( X4 @ zoey )
| ~ ( X3 @ mel ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_27,plain,
knave @ mel,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_23]) ).
thf(c_0_28,plain,
( ~ ( knave @ zoey )
| ~ ( knave @ mel ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_29,negated_conjecture,
~ ( knight @ zoey ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]),c_0_27])]) ).
thf(c_0_30,plain,
~ ( knave @ zoey ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27])]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ081^2 : TPTP v9.3.1. Bugfixed v7.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n016.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 13:26:19 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.24 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.vRYnzPAVxa/E---3.1_334024.p
% 0.11/0.26 % Version: 3.5.1-ho
% 0.11/0.26 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.26 % Starting new_ho_3 with 300s (1) cores
% 0.11/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.26 % ehoh_best2_full_lfho with pid 334043 completed with status 0
% 0.11/0.26 % Result found by ehoh_best2_full_lfho
% 0.11/0.26 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.26 % Starting new_ho_3 with 300s (1) cores
% 0.11/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.26 % No SInE strategy applied
% 0.11/0.26 % Search class: HGHSF-FFSF00-SSSFFSBN
% 0.11/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.26 % SubtermCWHack with pid 334048 completed with status 0
% 0.11/0.26 % Result found by SubtermCWHack
% 0.11/0.26 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.26 % Starting new_ho_3 with 300s (1) cores
% 0.11/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.26 % No SInE strategy applied
% 0.11/0.26 % Search class: HGHSF-FFSF00-SSSFFSBN
% 0.11/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.26 % Preprocessing time : 0.001 s
% 0.11/0.26
% 0.11/0.26 % Proof found!
% 0.11/0.26 % SZS status Theorem
% 0.11/0.26 % SZS output start CNFRefutation
% See solution above
% 0.11/0.26 % Parsed axioms : 11
% 0.11/0.26 % Removed by relevancy pruning/SinE : 0
% 0.11/0.26 % Initial clauses : 18
% 0.11/0.26 % Removed in clause preprocessing : 5
% 0.11/0.26 % Initial clauses in saturation : 13
% 0.11/0.26 % Processed clauses : 23
% 0.11/0.26 % ...of these trivial : 0
% 0.11/0.26 % ...subsumed : 2
% 0.11/0.26 % ...remaining for further processing : 21
% 0.11/0.26 % Other redundant clauses eliminated : 4
% 0.11/0.26 % Clauses deleted for lack of memory : 0
% 0.11/0.26 % Backward-subsumed : 3
% 0.11/0.26 % Backward-rewritten : 6
% 0.11/0.26 % Generated clauses : 15
% 0.11/0.26 % ...of the previous two non-redundant : 13
% 0.11/0.26 % ...aggressively subsumed : 0
% 0.11/0.26 % Contextual simplify-reflections : 1
% 0.11/0.26 % Paramodulations : 13
% 0.11/0.26 % Factorizations : 0
% 0.11/0.26 % NegExts : 0
% 0.11/0.26 % Equation resolutions : 4
% 0.11/0.26 % Disequality decompositions : 0
% 0.11/0.26 % Total rewrite steps : 8
% 0.11/0.26 % ...of those cached : 7
% 0.11/0.26 % Propositional unsat checks : 0
% 0.11/0.26 % Propositional check models : 0
% 0.11/0.26 % Propositional check unsatisfiable : 0
% 0.11/0.26 % Propositional clauses : 0
% 0.11/0.26 % Propositional clauses after purity: 0
% 0.11/0.26 % Propositional unsat core size : 0
% 0.11/0.26 % Propositional preprocessing time : 0.000
% 0.11/0.26 % Propositional encoding time : 0.000
% 0.11/0.26 % Propositional solver time : 0.000
% 0.11/0.26 % Success case prop preproc time : 0.000
% 0.11/0.26 % Success case prop encoding time : 0.000
% 0.11/0.26 % Success case prop solver time : 0.000
% 0.11/0.26 % Current number of processed clauses : 10
% 0.11/0.26 % Positive orientable unit clauses : 3
% 0.11/0.26 % Positive unorientable unit clauses: 0
% 0.11/0.26 % Negative unit clauses : 3
% 0.11/0.26 % Non-unit-clauses : 4
% 0.11/0.26 % Current number of unprocessed clauses: 3
% 0.11/0.26 % ...number of literals in the above : 10
% 0.11/0.26 % Current number of archived formulas : 0
% 0.11/0.26 % Current number of archived clauses : 9
% 0.11/0.26 % Clause-clause subsumption calls (NU) : 9
% 0.11/0.26 % Rec. Clause-clause subsumption calls : 8
% 0.11/0.26 % Non-unit clause-clause subsumptions : 3
% 0.11/0.26 % Unit Clause-clause subsumption calls : 2
% 0.11/0.26 % Rewrite failures with RHS unbound : 0
% 0.11/0.26 % BW rewrite match attempts : 1
% 0.11/0.26 % BW rewrite match successes : 1
% 0.11/0.26 % Condensation attempts : 0
% 0.11/0.26 % Condensation successes : 0
% 0.11/0.26 % Termbank termtop insertions : 1121
% 0.11/0.26 % Search garbage collected termcells : 199
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.006 s
% 0.11/0.26 % System time : 0.001 s
% 0.11/0.26 % Total time : 0.007 s
% 0.11/0.26 % Maximum resident set size: 3892 pages
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.008 s
% 0.11/0.26 % System time : 0.005 s
% 0.11/0.26 % Total time : 0.013 s
% 0.11/0.26 % Maximum resident set size: 4608 pages
% 0.11/0.26 % E exiting
%------------------------------------------------------------------------------