%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ082^1 : 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 : n019.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.25s 0.33s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 43 ( 0 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 88 ( 20 ~; 14 |; 4 &; 44 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
peter: $i ).
thf(decl_24,type,
says: $i > $o > $o ).
thf(decl_25,type,
epred1_0: $o ).
thf(thm,conjecture,
~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 ),
file('/export/starexec/sandbox2/tmp/tmp.q73lBEXpuM/E---3.1_747825.p',thm) ).
thf(ax1,axiom,
( says @ peter
@ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.q73lBEXpuM/E---3.1_747825.p',ax1) ).
thf(c_0_2,negated_conjecture,
~ ~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_3,plain,
( ( ~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 )
| ( says @ peter @ $true ) )
& ( ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 )
| ( says @ peter @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax1])]) ).
thf(c_0_4,negated_conjecture,
~ ~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
! [X4: $o] :
( ( ~ epred1_0
| ( says @ peter @ $true )
| ( says @ peter @ $true ) )
& ( epred1_0
| ( says @ peter @ $false )
| ( says @ peter @ $true ) )
& ( epred1_0
| ( says @ peter @ $true ) )
& ( ~ ( says @ peter @ X4 )
| ~ X4
| ( says @ peter @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X5: $o] :
( ~ ( says @ peter @ X5 )
| ~ X5 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_7,plain,
( ( says @ peter @ $true )
| ( says @ peter @ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( epred1_0
| ( says @ peter @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( says @ peter @ $true ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6])])]) ).
thf(c_0_10,plain,
( ( says @ peter @ $true )
| ~ epred1_0 ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
epred1_0,
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PUZ082^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n019.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 13:21:47 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.30 Running higher-order theorem proving
% 0.25/0.31 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.q73lBEXpuM/E---3.1_747825.p
% 0.25/0.33 % Version: 3.5.1-ho
% 0.25/0.33 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.25/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33 % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.33 % Starting ho_unfolding_6 with 300s (1) cores
% 0.25/0.33 % Starting sh4l with 300s (1) cores
% 0.25/0.33 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.25/0.33 % ho_unfolding_6 with pid 747839 completed with status 0
% 0.25/0.33 % Result found by ho_unfolding_6
% 0.25/0.33 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.25/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33 % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.33 % Starting ho_unfolding_6 with 300s (1) cores
% 0.25/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.33 % No SInE strategy applied
% 0.25/0.33 % Search class: HGUNF-FFSF00-SFFFFFNN
% 0.25/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.33 % SubtermCWHack with pid 747843 completed with status 0
% 0.25/0.33 % Result found by SubtermCWHack
% 0.25/0.33 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.25/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33 % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.33 % Starting ho_unfolding_6 with 300s (1) cores
% 0.25/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.33 % No SInE strategy applied
% 0.25/0.33 % Search class: HGUNF-FFSF00-SFFFFFNN
% 0.25/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.33 % Preprocessing time : 0.001 s
% 0.25/0.33
% 0.25/0.33 % Proof found!
% 0.25/0.33 % SZS status Theorem
% 0.25/0.33 % SZS output start CNFRefutation
% See solution above
% 0.25/0.33 % Parsed axioms : 4
% 0.25/0.33 % Removed by relevancy pruning/SinE : 0
% 0.25/0.33 % Initial clauses : 7
% 0.25/0.33 % Removed in clause preprocessing : 2
% 0.25/0.33 % Initial clauses in saturation : 5
% 0.25/0.34 % Processed clauses : 3
% 0.25/0.34 % ...of these trivial : 0
% 0.25/0.34 % ...subsumed : 0
% 0.25/0.34 % ...remaining for further processing : 2
% 0.25/0.34 % Other redundant clauses eliminated : 0
% 0.25/0.34 % Clauses deleted for lack of memory : 0
% 0.25/0.34 % Backward-subsumed : 0
% 0.25/0.34 % Backward-rewritten : 0
% 0.25/0.34 % Generated clauses : 0
% 0.25/0.34 % ...of the previous two non-redundant : 0
% 0.25/0.34 % ...aggressively subsumed : 0
% 0.25/0.34 % Contextual simplify-reflections : 0
% 0.25/0.34 % Paramodulations : 0
% 0.25/0.34 % Factorizations : 0
% 0.25/0.34 % NegExts : 0
% 0.25/0.34 % Equation resolutions : 0
% 0.25/0.34 % Disequality decompositions : 0
% 0.25/0.34 % Total rewrite steps : 1
% 0.25/0.34 % ...of those cached : 0
% 0.25/0.34 % Propositional unsat checks : 0
% 0.25/0.34 % Propositional check models : 0
% 0.25/0.34 % Propositional check unsatisfiable : 0
% 0.25/0.34 % Propositional clauses : 0
% 0.25/0.34 % Propositional clauses after purity: 0
% 0.25/0.34 % Propositional unsat core size : 0
% 0.25/0.34 % Propositional preprocessing time : 0.000
% 0.25/0.34 % Propositional encoding time : 0.000
% 0.25/0.34 % Propositional solver time : 0.000
% 0.25/0.34 % Success case prop preproc time : 0.000
% 0.25/0.34 % Success case prop encoding time : 0.000
% 0.25/0.34 % Success case prop solver time : 0.000
% 0.25/0.34 % Current number of processed clauses : 2
% 0.25/0.34 % Positive orientable unit clauses : 1
% 0.25/0.34 % Positive unorientable unit clauses: 0
% 0.25/0.34 % Negative unit clauses : 1
% 0.25/0.34 % Non-unit-clauses : 0
% 0.25/0.34 % Current number of unprocessed clauses: 2
% 0.25/0.34 % ...number of literals in the above : 5
% 0.25/0.34 % Current number of archived formulas : 0
% 0.25/0.34 % Current number of archived clauses : 0
% 0.25/0.34 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.34 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.34 % Non-unit clause-clause subsumptions : 0
% 0.25/0.34 % Unit Clause-clause subsumption calls : 0
% 0.25/0.34 % Rewrite failures with RHS unbound : 0
% 0.25/0.34 % BW rewrite match attempts : 0
% 0.25/0.34 % BW rewrite match successes : 0
% 0.25/0.34 % Condensation attempts : 0
% 0.25/0.34 % Condensation successes : 0
% 0.25/0.34 % Termbank termtop insertions : 402
% 0.25/0.34 % Search garbage collected termcells : 72
% 0.25/0.34
% 0.25/0.34 % -------------------------------------------------
% 0.25/0.34 % User time : 0.003 s
% 0.25/0.34 % System time : 0.002 s
% 0.25/0.34 % Total time : 0.005 s
% 0.25/0.34 % Maximum resident set size: 3572 pages
% 0.25/0.34
% 0.25/0.34 % -------------------------------------------------
% 0.25/0.34 % User time : 0.005 s
% 0.25/0.34 % System time : 0.006 s
% 0.25/0.34 % Total time : 0.011 s
% 0.25/0.34 % Maximum resident set size: 4864 pages
% 0.25/0.34 % E exiting
%------------------------------------------------------------------------------