%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ081^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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.22s 0.27s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 128 ( 28 ~; 19 |; 8 &; 68 @)
% ( 1 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 24 !; 4 ?; 28 :)
% 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(who_is_knight_and_knave,conjecture,
? [X3: $i,X4: $i] :
( ( knight @ X3 )
& ( knave @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.LTKRwUucZC/E---3.1_1262438.p',who_is_knight_and_knave) ).
thf(knights_xor_knaves,axiom,
! [X1: $i] :
( ( knight @ X1 )
<~> ( knave @ X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.LTKRwUucZC/E---3.1_1262438.p',knights_xor_knaves) ).
thf(knaves_lie,axiom,
! [X1: $i,X2: $o] :
( ( ( knave @ X1 )
& ( says @ X1 @ X2 ) )
=> ~ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.LTKRwUucZC/E---3.1_1262438.p',knaves_lie) ).
thf(zoey_speaks,axiom,
says @ zoey @ ( knave @ mel ),
file('/export/starexec/sandbox2/tmp/tmp.LTKRwUucZC/E---3.1_1262438.p',zoey_speaks) ).
thf(knights_tell_truth,axiom,
! [X1: $i,X2: $o] :
( ( ( knight @ X1 )
& ( says @ X1 @ X2 ) )
=> X2 ),
file('/export/starexec/sandbox2/tmp/tmp.LTKRwUucZC/E---3.1_1262438.p',knights_tell_truth) ).
thf(c_0_5,negated_conjecture,
~ ? [X3: $i,X4: $i] :
( ( knight @ X3 )
& ( knave @ X4 ) ),
inference(assume_negation,[status(cth)],[who_is_knight_and_knave]) ).
thf(c_0_6,plain,
! [X1: $i] :
~ ( ( knight @ X1 )
<=> ( knave @ X1 ) ),
inference(fof_simplification,[status(thm)],[knights_xor_knaves]) ).
thf(c_0_7,plain,
! [X1: $i,X2: $o] :
( ( ( knave @ X1 )
& ( says @ X1 @ X2 ) )
=> ~ X2 ),
inference(fof_simplification,[status(thm)],[knaves_lie]) ).
thf(c_0_8,axiom,
( ( ~ ( knave @ mel )
| ( says @ zoey @ $true ) )
& ( ( knave @ mel )
| ( says @ zoey @ $false ) ) ),
inference(fool_unroll,[status(thm)],[zoey_speaks]) ).
thf(c_0_9,negated_conjecture,
! [X17: $i,X18: $i] :
( ~ ( knight @ X17 )
| ~ ( knave @ X18 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_10,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_6])])]) ).
thf(c_0_11,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_12,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_7])])]) ).
thf(c_0_13,plain,
( ( ~ ( knave @ mel )
| ( says @ zoey @ $true ) )
& ( ( knave @ mel )
| ( says @ zoey @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X3: $i] :
( ~ ( knight @ X1 )
| ~ ( knave @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X1: $i] :
( ( knight @ X1 )
| ( knave @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X1: $i] :
( ~ ( knight @ X1 )
| ~ ( says @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_11])])]) ).
thf(c_0_17,plain,
! [X1: $i] :
( ~ ( knave @ X1 )
| ~ ( says @ X1 @ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12])])]) ).
thf(c_0_18,plain,
( ( says @ zoey @ $true )
| ~ ( knave @ mel ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X3: $i] :
( ( knave @ X1 )
| ~ ( knave @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
! [X1: $i] :
( ( knave @ X1 )
| ~ ( says @ X1 @ ~ $true ) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_21,plain,
( ( knave @ mel )
| ( says @ zoey @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_22,plain,
~ ( knave @ zoey ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_23,plain,
knave @ mel,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] : ( knave @ X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
thf(c_0_25,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ081^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n004.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:21:37 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.LTKRwUucZC/E---3.1_1262438.p
% 0.22/0.27 % Version: 3.5.1-ho
% 0.22/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.22/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.27 % Starting sh4l with 300s (1) cores
% 0.22/0.27 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.27 % ehoh_best_nonlift_rwall with pid 1262477 completed with status 0
% 0.22/0.27 % Result found by ehoh_best_nonlift_rwall
% 0.22/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.22/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.27 % Starting sh4l with 300s (1) cores
% 0.22/0.27 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.22/0.27 % No SInE strategy applied
% 0.22/0.27 % Search class: HGHNF-FFSF00-SFFFFFNN
% 0.22/0.27 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.27 % SubtermCWHack with pid 1262479 completed with status 0
% 0.22/0.27 % Result found by SubtermCWHack
% 0.22/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.22/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.27 % Starting sh4l with 300s (1) cores
% 0.22/0.27 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.22/0.27 % No SInE strategy applied
% 0.22/0.27 % Search class: HGHNF-FFSF00-SFFFFFNN
% 0.22/0.27 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.27 % Preprocessing time : 0.001 s
% 0.22/0.27
% 0.22/0.27 % Proof found!
% 0.22/0.27 % SZS status Theorem
% 0.22/0.27 % SZS output start CNFRefutation
% See solution above
% 0.22/0.27 % Parsed axioms : 11
% 0.22/0.27 % Removed by relevancy pruning/SinE : 0
% 0.22/0.27 % Initial clauses : 15
% 0.22/0.27 % Removed in clause preprocessing : 5
% 0.22/0.27 % Initial clauses in saturation : 10
% 0.22/0.27 % Processed clauses : 15
% 0.22/0.27 % ...of these trivial : 0
% 0.22/0.27 % ...subsumed : 1
% 0.22/0.27 % ...remaining for further processing : 14
% 0.22/0.27 % Other redundant clauses eliminated : 0
% 0.22/0.27 % Clauses deleted for lack of memory : 0
% 0.22/0.27 % Backward-subsumed : 1
% 0.22/0.27 % Backward-rewritten : 11
% 0.22/0.27 % Generated clauses : 7
% 0.22/0.27 % ...of the previous two non-redundant : 9
% 0.22/0.27 % ...aggressively subsumed : 0
% 0.22/0.27 % Contextual simplify-reflections : 1
% 0.22/0.27 % Paramodulations : 7
% 0.22/0.27 % Factorizations : 0
% 0.22/0.27 % NegExts : 0
% 0.22/0.27 % Equation resolutions : 0
% 0.22/0.27 % Disequality decompositions : 0
% 0.22/0.27 % Total rewrite steps : 12
% 0.22/0.27 % ...of those cached : 7
% 0.22/0.27 % Propositional unsat checks : 0
% 0.22/0.27 % Propositional check models : 0
% 0.22/0.27 % Propositional check unsatisfiable : 0
% 0.22/0.27 % Propositional clauses : 0
% 0.22/0.27 % Propositional clauses after purity: 0
% 0.22/0.27 % Propositional unsat core size : 0
% 0.22/0.27 % Propositional preprocessing time : 0.000
% 0.22/0.27 % Propositional encoding time : 0.000
% 0.22/0.27 % Propositional solver time : 0.000
% 0.22/0.27 % Success case prop preproc time : 0.000
% 0.22/0.27 % Success case prop encoding time : 0.000
% 0.22/0.27 % Success case prop solver time : 0.000
% 0.22/0.27 % Current number of processed clauses : 2
% 0.22/0.27 % Positive orientable unit clauses : 1
% 0.22/0.27 % Positive unorientable unit clauses: 0
% 0.22/0.27 % Negative unit clauses : 0
% 0.22/0.27 % Non-unit-clauses : 1
% 0.22/0.27 % Current number of unprocessed clauses: 2
% 0.22/0.27 % ...number of literals in the above : 2
% 0.22/0.27 % Current number of archived formulas : 0
% 0.22/0.27 % Current number of archived clauses : 12
% 0.22/0.27 % Clause-clause subsumption calls (NU) : 3
% 0.22/0.27 % Rec. Clause-clause subsumption calls : 3
% 0.22/0.27 % Non-unit clause-clause subsumptions : 2
% 0.22/0.27 % Unit Clause-clause subsumption calls : 1
% 0.22/0.27 % Rewrite failures with RHS unbound : 0
% 0.22/0.27 % BW rewrite match attempts : 5
% 0.22/0.27 % BW rewrite match successes : 5
% 0.22/0.27 % Condensation attempts : 0
% 0.22/0.27 % Condensation successes : 0
% 0.22/0.27 % Termbank termtop insertions : 875
% 0.22/0.27 % Search garbage collected termcells : 133
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.003 s
% 0.22/0.27 % System time : 0.002 s
% 0.22/0.27 % Total time : 0.005 s
% 0.22/0.27 % Maximum resident set size: 3636 pages
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.004 s
% 0.22/0.27 % System time : 0.007 s
% 0.22/0.27 % Total time : 0.011 s
% 0.22/0.27 % Maximum resident set size: 4864 pages
% 0.22/0.27 % E exiting
%------------------------------------------------------------------------------