%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL620^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 : n010.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:12:01 AM UTC 2026
% Result : Theorem 0.09s 0.28s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 11 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 14 ~; 8 |; 5 &; 51 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 38 ( 26 ^; 12 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_42,type,
epred1_0: $i > $o ).
thf(decl_43,type,
epred2_0: $i > $o ).
thf(decl_44,type,
esk1_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.codNp8ZZB6/E---3.1_2614046.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.codNp8ZZB6/E---3.1_2614046.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.codNp8ZZB6/E---3.1_2614046.p',mor) ).
thf(thm,conjecture,
! [X10: $i > $i > $o,X19: $i > $o,X5: $i > $o] : ( mvalid @ ( mimpl @ ( mnot @ ( mand @ X19 @ X5 ) ) @ ( mor @ ( mnot @ X19 ) @ ( mnot @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.codNp8ZZB6/E---3.1_2614046.p',thm) ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X5: $i > $o,X3: $i] :
( ( X6 @ X3 )
& ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.codNp8ZZB6/E---3.1_2614046.p',mand) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.codNp8ZZB6/E---3.1_2614046.p',mvalid) ).
thf(c_0_6,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_7,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_8,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_9,negated_conjecture,
~ ! [X10: $i > $i > $o,X19: $i > $o,X5: $i > $o] : ( mvalid @ ( mimpl @ ( mnot @ ( mand @ X19 @ X5 ) ) @ ( mor @ ( mnot @ X19 ) @ ( mnot @ X5 ) ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_10,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_11,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_12,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_13,negated_conjecture,
~ ! [X10: $i > $i > $o,X19: $i > $o,X5: $i > $o,X23: $i] :
( ~ ~ ( ( X19 @ X23 )
& ( X5 @ X23 ) )
| ~ ( X19 @ X23 )
| ~ ( X5 @ X23 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_7]),c_0_8]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( epred1_0 @ esk1_0 )
& ( epred2_0 @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_13])])])])]) ).
thf(c_0_15,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
epred1_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
epred2_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL620^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 09:26:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.codNp8ZZB6/E---3.1_2614046.p
% 0.09/0.28 % Version: 3.5.1-ho
% 0.09/0.28 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.28 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.28 % Starting sh1l with 300s (1) cores
% 0.09/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.28 % post_as_ho10 with pid 2614070 completed with status 0
% 0.09/0.28 % Result found by post_as_ho10
% 0.09/0.28 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.28 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.28 % Starting sh1l with 300s (1) cores
% 0.09/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.28 % No SInE strategy applied
% 0.09/0.28 % Search class: HUHNF-FFSF00-SHSSMFNN
% 0.09/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.28 % SubtermCWHack with pid 2614076 completed with status 0
% 0.09/0.28 % Result found by SubtermCWHack
% 0.09/0.28 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.28 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.28 % Starting sh1l with 300s (1) cores
% 0.09/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.28 % No SInE strategy applied
% 0.09/0.28 % Search class: HUHNF-FFSF00-SHSSMFNN
% 0.09/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.28 % Preprocessing time : 0.001 s
% 0.09/0.28
% 0.09/0.28 % Proof found!
% 0.09/0.28 % SZS status Theorem
% 0.09/0.28 % SZS output start CNFRefutation
% See solution above
% 0.09/0.28 % Parsed axioms : 36
% 0.09/0.28 % Removed by relevancy pruning/SinE : 0
% 0.09/0.28 % Initial clauses : 23
% 0.09/0.28 % Removed in clause preprocessing : 20
% 0.09/0.28 % Initial clauses in saturation : 3
% 0.09/0.28 % Processed clauses : 3
% 0.09/0.28 % ...of these trivial : 0
% 0.09/0.28 % ...subsumed : 0
% 0.09/0.28 % ...remaining for further processing : 2
% 0.09/0.28 % Other redundant clauses eliminated : 0
% 0.09/0.28 % Clauses deleted for lack of memory : 0
% 0.09/0.28 % Backward-subsumed : 0
% 0.09/0.28 % Backward-rewritten : 0
% 0.09/0.28 % Generated clauses : 0
% 0.09/0.28 % ...of the previous two non-redundant : 0
% 0.09/0.28 % ...aggressively subsumed : 0
% 0.09/0.28 % Contextual simplify-reflections : 0
% 0.09/0.28 % Paramodulations : 0
% 0.09/0.28 % Factorizations : 0
% 0.09/0.28 % NegExts : 0
% 0.09/0.28 % Equation resolutions : 0
% 0.09/0.28 % Disequality decompositions : 0
% 0.09/0.28 % Total rewrite steps : 2
% 0.09/0.28 % ...of those cached : 0
% 0.09/0.28 % Propositional unsat checks : 0
% 0.09/0.28 % Propositional check models : 0
% 0.09/0.28 % Propositional check unsatisfiable : 0
% 0.09/0.28 % Propositional clauses : 0
% 0.09/0.28 % Propositional clauses after purity: 0
% 0.09/0.28 % Propositional unsat core size : 0
% 0.09/0.28 % Propositional preprocessing time : 0.000
% 0.09/0.28 % Propositional encoding time : 0.000
% 0.09/0.28 % Propositional solver time : 0.000
% 0.09/0.28 % Success case prop preproc time : 0.000
% 0.09/0.28 % Success case prop encoding time : 0.000
% 0.09/0.28 % Success case prop solver time : 0.000
% 0.09/0.28 % Current number of processed clauses : 2
% 0.09/0.28 % Positive orientable unit clauses : 2
% 0.09/0.28 % Positive unorientable unit clauses: 0
% 0.09/0.28 % Negative unit clauses : 0
% 0.09/0.28 % Non-unit-clauses : 0
% 0.09/0.28 % Current number of unprocessed clauses: 0
% 0.09/0.28 % ...number of literals in the above : 0
% 0.09/0.28 % Current number of archived formulas : 0
% 0.09/0.28 % Current number of archived clauses : 0
% 0.09/0.28 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.28 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.28 % Non-unit clause-clause subsumptions : 0
% 0.09/0.28 % Unit Clause-clause subsumption calls : 0
% 0.09/0.28 % Rewrite failures with RHS unbound : 0
% 0.09/0.28 % BW rewrite match attempts : 0
% 0.09/0.28 % BW rewrite match successes : 0
% 0.09/0.28 % Condensation attempts : 0
% 0.09/0.28 % Condensation successes : 0
% 0.09/0.28 % Termbank termtop insertions : 975
% 0.09/0.28 % Search garbage collected termcells : 184
% 0.09/0.28
% 0.09/0.28 % -------------------------------------------------
% 0.09/0.28 % User time : 0.006 s
% 0.09/0.28 % System time : 0.001 s
% 0.09/0.28 % Total time : 0.007 s
% 0.09/0.28 % Maximum resident set size: 3616 pages
% 0.09/0.28
% 0.09/0.28 % -------------------------------------------------
% 0.09/0.28 % User time : 0.009 s
% 0.09/0.28 % System time : 0.007 s
% 0.09/0.28 % Total time : 0.016 s
% 0.09/0.28 % Maximum resident set size: 4608 pages
% 0.09/0.28 % E exiting
%------------------------------------------------------------------------------