%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ136^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:36 AM UTC 2026
% Result : Theorem 0.24s 0.29s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 3 equ; 0 cnn)
% Maximal formula atoms : 2 ( 0 avg)
% Number of connectives : 45 ( 12 ~; 3 |; 2 &; 28 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 13 !; 6 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
parent: $i > $i > $o ).
thf(decl_24,type,
kronus: $i ).
thf(decl_25,type,
zeus: $i ).
thf(decl_26,type,
sutekh: $i ).
thf(decl_27,type,
horus: $i ).
thf(hotwo,conjecture,
? [X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X2 )
& ~ ( X1 @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.2ymViiNqmR/E---3.1_3512469.p',hotwo) ).
thf(ax2,axiom,
~ ( parent @ sutekh @ horus ),
file('/export/starexec/sandbox/tmp/tmp.2ymViiNqmR/E---3.1_3512469.p',ax2) ).
thf(ax1,axiom,
parent @ kronus @ zeus,
file('/export/starexec/sandbox/tmp/tmp.2ymViiNqmR/E---3.1_3512469.p',ax1) ).
thf(c_0_3,negated_conjecture,
~ ? [X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X2 )
& ~ ( X1 @ X3 ) ),
inference(assume_negation,[status(cth)],[hotwo]) ).
thf(c_0_4,negated_conjecture,
! [X7: $i > $o,X8: $i,X9: $i] :
( ~ ( X7 @ X8 )
| ( X7 @ X9 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_5,plain,
~ ( parent @ sutekh @ horus ),
inference(fof_simplification,[status(thm)],[ax2]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i] :
( ( X1 @ X3 )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
~ ( parent @ sutekh @ horus ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i,X11: $i > $i,X10: $i > $i,X3: $i] :
( ( ( X10 @ X2 )
= ( X11 @ X2 ) )
| ( ( X10 @ X3 )
!= ( X11 @ X3 ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_9,plain,
~ ( parent @ sutekh @ horus ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i,X3: $i] : ( X2 = X3 ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
~ ( parent @ kronus @ kronus ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
thf(c_0_12,plain,
parent @ kronus @ zeus,
inference(split_conjunct,[status(thm)],[ax1]) ).
thf(c_0_13,negated_conjecture,
! [X2: $i] :
~ ( parent @ X2 @ X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
thf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ136^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n015.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:29:47 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.26 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.2ymViiNqmR/E---3.1_3512469.p
% 0.24/0.29 % Version: 3.5.1-ho
% 0.24/0.29 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.29 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.29 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.29 % Starting new_bool_9 with 300s (1) cores
% 0.24/0.29 % Starting post_as_ho1 with 300s (1) cores
% 0.24/0.29 % Starting post_as_ho4 with 300s (1) cores
% 0.24/0.29 % Starting post_as_ho2 with 300s (1) cores
% 0.24/0.29 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.29 % Starting full_lambda_10 with 300s (1) cores
% 0.24/0.29 % Starting new_ho_8 with 300s (1) cores
% 0.24/0.29 % post_as_ho12 with pid 3512483 completed with status 0
% 0.24/0.29 % Result found by post_as_ho12
% 0.24/0.29 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.29 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.29 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.29 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.29 % No SInE strategy applied
% 0.24/0.29 % Search class: HHUNF-FFSF00-SSSFFSBN
% 0.24/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.29 % SubtermCWHack with pid 3512491 completed with status 10
% 0.24/0.29 % Starting post_as_ho12 with 31s (1) cores
% 0.24/0.29 % post_as_ho12 with pid 3512495 completed with status 0
% 0.24/0.29 % Result found by post_as_ho12
% 0.24/0.29 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.29 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.29 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.29 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.29 % No SInE strategy applied
% 0.24/0.29 % Search class: HHUNF-FFSF00-SSSFFSBN
% 0.24/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.29 % SubtermCWHack with pid 3512491 completed with status 10
% 0.24/0.29 % Starting post_as_ho12 with 31s (1) cores
% 0.24/0.29 % Preprocessing time : 0.001 s
% 0.24/0.29 % Presaturation interreduction done
% 0.24/0.29
% 0.24/0.29 % Proof found!
% 0.24/0.29 % SZS status Theorem
% 0.24/0.29 % SZS output start CNFRefutation
% See solution above
% 0.24/0.29 % Parsed axioms : 8
% 0.24/0.29 % Removed by relevancy pruning/SinE : 0
% 0.24/0.29 % Initial clauses : 8
% 0.24/0.29 % Removed in clause preprocessing : 5
% 0.24/0.29 % Initial clauses in saturation : 3
% 0.24/0.29 % Processed clauses : 12
% 0.24/0.29 % ...of these trivial : 0
% 0.24/0.29 % ...subsumed : 0
% 0.24/0.29 % ...remaining for further processing : 11
% 0.24/0.29 % Other redundant clauses eliminated : 0
% 0.24/0.29 % Clauses deleted for lack of memory : 0
% 0.24/0.29 % Backward-subsumed : 2
% 0.24/0.29 % Backward-rewritten : 2
% 0.24/0.29 % Generated clauses : 14
% 0.24/0.29 % ...of the previous two non-redundant : 11
% 0.24/0.29 % ...aggressively subsumed : 0
% 0.24/0.29 % Contextual simplify-reflections : 0
% 0.24/0.29 % Paramodulations : 4
% 0.24/0.29 % Factorizations : 0
% 0.24/0.29 % NegExts : 0
% 0.24/0.29 % Equation resolutions : 5
% 0.24/0.29 % Disequality decompositions : 0
% 0.24/0.29 % Total rewrite steps : 3
% 0.24/0.29 % ...of those cached : 0
% 0.24/0.29 % Propositional unsat checks : 0
% 0.24/0.29 % Propositional check models : 0
% 0.24/0.29 % Propositional check unsatisfiable : 0
% 0.24/0.29 % Propositional clauses : 0
% 0.24/0.29 % Propositional clauses after purity: 0
% 0.24/0.29 % Propositional unsat core size : 0
% 0.24/0.29 % Propositional preprocessing time : 0.000
% 0.24/0.29 % Propositional encoding time : 0.000
% 0.24/0.29 % Propositional solver time : 0.000
% 0.24/0.29 % Success case prop preproc time : 0.000
% 0.24/0.29 % Success case prop encoding time : 0.000
% 0.24/0.29 % Success case prop solver time : 0.000
% 0.24/0.29 % Current number of processed clauses : 4
% 0.24/0.29 % Positive orientable unit clauses : 0
% 0.24/0.29 % Positive unorientable unit clauses: 2
% 0.24/0.29 % Negative unit clauses : 1
% 0.24/0.29 % Non-unit-clauses : 1
% 0.24/0.29 % Current number of unprocessed clauses: 1
% 0.24/0.29 % ...number of literals in the above : 1
% 0.24/0.29 % Current number of archived formulas : 0
% 0.24/0.29 % Current number of archived clauses : 7
% 0.24/0.29 % Clause-clause subsumption calls (NU) : 1
% 0.24/0.29 % Rec. Clause-clause subsumption calls : 1
% 0.24/0.29 % Non-unit clause-clause subsumptions : 0
% 0.24/0.29 % Unit Clause-clause subsumption calls : 5
% 0.24/0.29 % Rewrite failures with RHS unbound : 0
% 0.24/0.29 % BW rewrite match attempts : 34
% 0.24/0.29 % BW rewrite match successes : 16
% 0.24/0.29 % Condensation attempts : 0
% 0.24/0.29 % Condensation successes : 0
% 0.24/0.29 % Termbank termtop insertions : 413
% 0.24/0.29 % Search garbage collected termcells : 35
% 0.24/0.29
% 0.24/0.29 % -------------------------------------------------
% 0.24/0.29 % User time : 0.004 s
% 0.24/0.29 % System time : 0.003 s
% 0.24/0.29 % Total time : 0.007 s
% 0.24/0.29 % Maximum resident set size: 3628 pages
% 0.24/0.29
% 0.24/0.29 % -------------------------------------------------
% 0.24/0.29 % User time : 0.008 s
% 0.24/0.29 % System time : 0.006 s
% 0.24/0.29 % Total time : 0.014 s
% 0.24/0.29 % Maximum resident set size: 4864 pages
% 0.24/0.29 % E exiting
%------------------------------------------------------------------------------