%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ081^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 : 10
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 144 ( 33 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 342 ( 61 ~; 60 |; 18 &; 190 @)
% ( 2 <=>; 7 =>; 0 <=; 4 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 25 ( 0 ^; 19 !; 6 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
islander: $i ).
thf(decl_24,type,
knight: $i ).
thf(decl_25,type,
knave: $i ).
thf(decl_26,type,
says: $i > $o > $o ).
thf(decl_27,type,
zoey: $i ).
thf(decl_28,type,
mel: $i ).
thf(decl_29,type,
is_a: $i > $i > $o ).
thf(kk_6_5,axiom,
says @ zoey @ ( is_a @ mel @ knave ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',kk_6_5) ).
thf(kk_6_6,axiom,
( says @ mel
@ ~ ( ( is_a @ zoey @ knave )
| ( is_a @ mel @ knave ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',kk_6_6) ).
thf(kk_6_2,axiom,
! [X1: $i] :
( ( is_a @ X1 @ knight )
=> ! [X2: $o] :
( ( says @ X1 @ X2 )
=> X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',kk_6_2) ).
thf(kk_6_1,axiom,
! [X1: $i] :
( ( is_a @ X1 @ islander )
=> ( ( is_a @ X1 @ knight )
| ( is_a @ X1 @ knave ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',kk_6_1) ).
thf(kk_6_3,axiom,
! [X1: $i] :
( ( is_a @ X1 @ knave )
=> ! [X2: $o] :
( ( says @ X1 @ X2 )
=> ~ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',kk_6_3) ).
thf(kk_6_4,axiom,
( ( is_a @ zoey @ islander )
& ( is_a @ mel @ islander ) ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',kk_6_4) ).
thf(query,conjecture,
? [X3: $i,X4: $i] :
( ( ( X3 = knight )
<~> ( X3 = knave ) )
& ( ( X4 = knight )
<~> ( X4 = knave ) )
& ( is_a @ mel @ X3 )
& ( is_a @ zoey @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p',query) ).
thf(c_0_7,axiom,
( ( ~ ( is_a @ mel @ knave )
| ( says @ zoey @ $true ) )
& ( ( is_a @ mel @ knave )
| ( says @ zoey @ $false ) ) ),
inference(fool_unroll,[status(thm)],[kk_6_5]) ).
thf(c_0_8,axiom,
( ( ~ ~ ( ( is_a @ zoey @ knave )
| ( is_a @ mel @ knave ) )
| ( says @ mel @ $true ) )
& ( ~ ( ( is_a @ zoey @ knave )
| ( is_a @ mel @ knave ) )
| ( says @ mel @ $false ) ) ),
inference(fool_unroll,[status(thm)],[kk_6_6]) ).
thf(c_0_9,plain,
! [X13: $i,X14: $o] :
( ~ ( is_a @ X13 @ knight )
| ~ ( says @ X13 @ X14 )
| X14 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kk_6_2])])])]) ).
thf(c_0_10,plain,
( ( ~ ( is_a @ mel @ knave )
| ( says @ zoey @ $true ) )
& ( ( is_a @ mel @ knave )
| ( says @ zoey @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X12: $i] :
( ~ ( is_a @ X12 @ islander )
| ( is_a @ X12 @ knight )
| ( is_a @ X12 @ knave ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kk_6_1])])]) ).
thf(c_0_12,plain,
! [X1: $i] :
( ( is_a @ X1 @ knave )
=> ! [X2: $o] :
( ( says @ X1 @ X2 )
=> ~ X2 ) ),
inference(fof_simplification,[status(thm)],[kk_6_3]) ).
thf(c_0_13,plain,
( ( ( is_a @ zoey @ knave )
| ( is_a @ mel @ knave )
| ( says @ mel @ $true ) )
& ( ~ ( is_a @ zoey @ knave )
| ( says @ mel @ $false ) )
& ( ~ ( is_a @ mel @ knave )
| ( says @ mel @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ~ ( is_a @ X1 @ knight )
| ~ ( says @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])]) ).
thf(c_0_15,plain,
( ( is_a @ mel @ knave )
| ( says @ zoey @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X1: $i] :
( ( is_a @ X1 @ knight )
| ( is_a @ X1 @ knave )
| ~ ( is_a @ X1 @ islander ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
is_a @ zoey @ islander,
inference(split_conjunct,[status(thm)],[kk_6_4]) ).
thf(c_0_18,plain,
! [X15: $i,X16: $o] :
( ~ ( is_a @ X15 @ knave )
| ~ ( says @ X15 @ X16 )
| ~ X16 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
thf(c_0_19,plain,
( ( says @ mel @ ~ $true )
| ~ ( is_a @ zoey @ knave ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,plain,
( ( is_a @ mel @ knave )
| ~ ( is_a @ zoey @ knight ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_21,plain,
( ( is_a @ zoey @ knight )
| ( is_a @ zoey @ knave ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
is_a @ mel @ islander,
inference(split_conjunct,[status(thm)],[kk_6_4]) ).
thf(c_0_23,negated_conjecture,
~ ? [X3: $i,X4: $i] :
( ( ( X3 = knight )
<~> ( X3 = knave ) )
& ( ( X4 = knight )
<~> ( X4 = knave ) )
& ( is_a @ mel @ X3 )
& ( is_a @ zoey @ X4 ) ),
inference(assume_negation,[status(cth)],[query]) ).
thf(c_0_24,plain,
! [X1: $i] :
( ~ ( is_a @ X1 @ knave )
| ~ ( says @ X1 @ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_18])])]) ).
thf(c_0_25,plain,
( ( says @ zoey @ $true )
| ~ ( is_a @ mel @ knave ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_26,plain,
( ~ ( is_a @ mel @ knight )
| ~ ( is_a @ zoey @ knave ) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
thf(c_0_27,plain,
( ( is_a @ zoey @ knave )
| ( is_a @ mel @ knave ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_28,plain,
( ( is_a @ mel @ knight )
| ( is_a @ mel @ knave ) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
thf(c_0_29,negated_conjecture,
~ ? [X3: $i,X4: $i] :
( ~ ( ( X3 = knight )
<=> ( X3 = knave ) )
& ~ ( ( X4 = knight )
<=> ( X4 = knave ) )
& ( is_a @ mel @ X3 )
& ( is_a @ zoey @ X4 ) ),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
thf(c_0_30,plain,
( ~ ( is_a @ zoey @ knave )
| ~ ( is_a @ mel @ knave ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_31,plain,
is_a @ mel @ knave,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_32,plain,
( ( says @ mel @ ~ $true )
| ~ ( is_a @ mel @ knave ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_33,negated_conjecture,
! [X17: $i,X18: $i] :
( ( ( X18 != knight )
| ( X18 = knave )
| ( X17 != knight )
| ( X17 = knave )
| ~ ( is_a @ mel @ X17 )
| ~ ( is_a @ zoey @ X18 ) )
& ( ( X18 != knave )
| ( X18 = knight )
| ( X17 != knight )
| ( X17 = knave )
| ~ ( is_a @ mel @ X17 )
| ~ ( is_a @ zoey @ X18 ) )
& ( ( X18 != knight )
| ( X18 = knave )
| ( X17 != knave )
| ( X17 = knight )
| ~ ( is_a @ mel @ X17 )
| ~ ( is_a @ zoey @ X18 ) )
& ( ( X18 != knave )
| ( X18 = knight )
| ( X17 != knave )
| ( X17 = knight )
| ~ ( is_a @ mel @ X17 )
| ~ ( is_a @ zoey @ X18 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
thf(c_0_34,plain,
~ ( is_a @ zoey @ knave ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
thf(c_0_35,plain,
( ~ ( is_a @ mel @ knight )
| ~ ( is_a @ mel @ knave ) ),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
thf(c_0_36,negated_conjecture,
! [X3: $i,X1: $i] :
( ( X1 = knave )
| ( X3 = knight )
| ( X1 != knight )
| ( X3 != knave )
| ~ ( is_a @ mel @ X3 )
| ~ ( is_a @ zoey @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_37,plain,
is_a @ zoey @ knight,
inference(sr,[status(thm)],[c_0_21,c_0_34]) ).
thf(c_0_38,plain,
~ ( is_a @ mel @ knight ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_31])]) ).
thf(c_0_39,negated_conjecture,
knight = knave,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]),c_0_37]),c_0_31])]) ).
thf(c_0_40,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ081^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n013.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:06 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.DUfkcVV0ec/E---3.1_2089497.p
% 0.22/0.27 % Version: 3.5.1-ho
% 0.22/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 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 new_bool_1 with 300s (1) cores
% 0.22/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.22/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.27 % new_ho_10_unif with pid 2089513 completed with status 0
% 0.22/0.27 % Result found by new_ho_10_unif
% 0.22/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 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 new_bool_1 with 300s (1) cores
% 0.22/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.22/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.27 % No SInE strategy applied
% 0.22/0.27 % Search class: HGHSF-FFSS00-SFFFFFNN
% 0.22/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27 % SubtermCWHack with pid 2089514 completed with status 0
% 0.22/0.27 % Result found by SubtermCWHack
% 0.22/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 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 new_bool_1 with 300s (1) cores
% 0.22/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.22/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.27 % No SInE strategy applied
% 0.22/0.27 % Search class: HGHSF-FFSS00-SFFFFFNN
% 0.22/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 28s (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 : 14
% 0.22/0.27 % Removed by relevancy pruning/SinE : 0
% 0.22/0.27 % Initial clauses : 21
% 0.22/0.27 % Removed in clause preprocessing : 7
% 0.22/0.27 % Initial clauses in saturation : 14
% 0.22/0.27 % Processed clauses : 29
% 0.22/0.27 % ...of these trivial : 0
% 0.22/0.27 % ...subsumed : 3
% 0.22/0.27 % ...remaining for further processing : 26
% 0.22/0.27 % Other redundant clauses eliminated : 4
% 0.22/0.27 % Clauses deleted for lack of memory : 0
% 0.22/0.27 % Backward-subsumed : 3
% 0.22/0.27 % Backward-rewritten : 12
% 0.22/0.27 % Generated clauses : 16
% 0.22/0.27 % ...of the previous two non-redundant : 18
% 0.22/0.27 % ...aggressively subsumed : 0
% 0.22/0.27 % Contextual simplify-reflections : 1
% 0.22/0.27 % Paramodulations : 13
% 0.22/0.27 % Factorizations : 0
% 0.22/0.27 % NegExts : 0
% 0.22/0.27 % Equation resolutions : 4
% 0.22/0.27 % Disequality decompositions : 0
% 0.22/0.27 % Total rewrite steps : 14
% 0.22/0.27 % ...of those cached : 11
% 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 : 8
% 0.22/0.27 % Positive orientable unit clauses : 6
% 0.22/0.27 % Positive unorientable unit clauses: 0
% 0.22/0.27 % Negative unit clauses : 1
% 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 : 12
% 0.22/0.27 % Current number of archived formulas : 0
% 0.22/0.27 % Current number of archived clauses : 16
% 0.22/0.27 % Clause-clause subsumption calls (NU) : 15
% 0.22/0.27 % Rec. Clause-clause subsumption calls : 9
% 0.22/0.27 % Non-unit clause-clause subsumptions : 2
% 0.22/0.27 % Unit Clause-clause subsumption calls : 2
% 0.22/0.27 % Rewrite failures with RHS unbound : 0
% 0.22/0.27 % BW rewrite match attempts : 2
% 0.22/0.27 % BW rewrite match successes : 2
% 0.22/0.27 % Condensation attempts : 0
% 0.22/0.27 % Condensation successes : 0
% 0.22/0.27 % Termbank termtop insertions : 1317
% 0.22/0.27 % Search garbage collected termcells : 196
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.002 s
% 0.22/0.27 % System time : 0.004 s
% 0.22/0.27 % Total time : 0.006 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.005 s
% 0.22/0.27 % System time : 0.007 s
% 0.22/0.27 % Total time : 0.012 s
% 0.22/0.27 % Maximum resident set size: 4864 pages
% 0.22/0.27 % E exiting
%------------------------------------------------------------------------------