%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ084^1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 26 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 15 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 94 ( 14 ~; 10 |; 1 &; 69 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 2 con; 0-3 aty)
% Number of variables : 50 ( 34 ^; 16 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
peter: $i > $i > $o ).
thf(decl_56,type,
wife: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_57,type,
esk1_0: $i ).
thf(decl_58,type,
epred1_0: $i > $o ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mor) ).
thf(conj,conjecture,
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ ( wife @ peter ) @ X18 ) @ X18 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',conj) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',mreflexive) ).
thf(refl_wife_peter,axiom,
mreflexive @ ( wife @ peter ),
file('/export/starexec/sandbox2/tmp/tmp.a0jMRsdGsh/E---3.1_1035614.p',refl_wife_peter) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,negated_conjecture,
~ ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ ( wife @ peter ) @ X18 ) @ X18 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_14,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_15,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_16,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_17,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_18,negated_conjecture,
~ ! [X36: $i,X35: $i > $o] :
( ~ ! [X34: $i] :
( ~ ( wife @ peter @ X36 @ X34 )
| ( X35 @ X34 ) )
| ( X35 @ X36 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
thf(c_0_19,plain,
! [X24: $i] : ( wife @ peter @ X24 @ X24 ),
inference(apply_def,[status(thm)],[refl_wife_peter,c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X51: $i] :
( ( ~ ( wife @ peter @ esk1_0 @ X51 )
| ( epred1_0 @ X51 ) )
& ~ ( epred1_0 @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
thf(c_0_21,plain,
! [X39: $i] : ( wife @ peter @ X39 @ X39 ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 )
| ~ ( wife @ peter @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,plain,
! [X3: $i] : ( wife @ peter @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ084^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n020.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:22:49 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/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.a0jMRsdGsh/E---3.1_1035614.p
% 0.07/0.25 % Version: 3.5.1-ho
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.07/0.25 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.07/0.25 % Starting sh5l with 300s (1) cores
% 0.07/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.07/0.25 % ehoh_best2_full_lfho with pid 1035627 completed with status 0
% 0.07/0.25 % Result found by ehoh_best2_full_lfho
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.07/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.25 % No SInE strategy applied
% 0.07/0.25 % Search class: HHUNS-FFSF00-SHHSMFNN
% 0.07/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.25 % Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.07/0.25 % Starting sh5l with 136s (1) cores
% 0.07/0.25 % Starting new_bool_1 with 136s (1) cores
% 0.07/0.25 % Starting new_bool_2 with 136s (1) cores
% 0.07/0.25 % SubtermCWHack with pid 1035631 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HHUNS-FFSF00-SHHSMFNN
% 0.07/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.26 % Preprocessing time : 0.001 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 73
% 0.07/0.26 % Removed by relevancy pruning/SinE : 0
% 0.07/0.26 % Initial clauses : 43
% 0.07/0.26 % Removed in clause preprocessing : 35
% 0.07/0.26 % Initial clauses in saturation : 8
% 0.07/0.26 % Processed clauses : 5
% 0.07/0.26 % ...of these trivial : 0
% 0.07/0.26 % ...subsumed : 0
% 0.07/0.26 % ...remaining for further processing : 5
% 0.07/0.26 % Other redundant clauses eliminated : 0
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 0
% 0.07/0.26 % Generated clauses : 1
% 0.07/0.26 % ...of the previous two non-redundant : 0
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 1
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 0
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 0
% 0.07/0.26 % ...of those cached : 0
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 5
% 0.07/0.26 % Positive orientable unit clauses : 3
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 1
% 0.07/0.26 % Non-unit-clauses : 1
% 0.07/0.26 % Current number of unprocessed clauses: 3
% 0.07/0.26 % ...number of literals in the above : 9
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 0
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.26 % Non-unit clause-clause subsumptions : 0
% 0.07/0.26 % Unit Clause-clause subsumption calls : 0
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 0
% 0.07/0.26 % BW rewrite match successes : 0
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 2474
% 0.07/0.26 % Search garbage collected termcells : 475
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.004 s
% 0.07/0.26 % System time : 0.002 s
% 0.07/0.26 % Total time : 0.006 s
% 0.07/0.26 % Maximum resident set size: 3700 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.008 s
% 0.07/0.26 % System time : 0.010 s
% 0.07/0.26 % Total time : 0.018 s
% 0.07/0.26 % Maximum resident set size: 4864 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------