%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP035^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:05:20 AM UTC 2026
% Result : Theorem 0.20s 0.35s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 9 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 19 ( 4 ~; 0 |; 0 &; 15 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 3 ^; 1 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
complex: $tType ).
thf(decl_24,type,
deriv_complex: ( complex > complex ) > complex > complex ).
thf(decl_37,type,
id_complex: complex > complex ).
thf(decl_42,type,
one_one_complex: complex ).
thf(decl_88,type,
w: complex ).
thf(conj_0,conjecture,
( ( deriv_complex @ id_complex @ w )
= one_one_complex ),
file('/export/starexec/sandbox2/tmp/tmp.Gy0w3nkRji/E---3.1_549285.p',conj_0) ).
thf(fact_3_deriv__id,axiom,
( ( deriv_complex @ id_complex )
= ( ^ [X3: complex] : one_one_complex ) ),
file('/export/starexec/sandbox2/tmp/tmp.Gy0w3nkRji/E---3.1_549285.p',fact_3_deriv__id) ).
thf(c_0_2,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_3,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
( ( deriv_complex @ id_complex )
= ( ^ [Z0: complex] : one_one_complex ) ),
inference(fof_simplification,[status(thm)],[fact_3_deriv__id]) ).
thf(c_0_5,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
( ( deriv_complex @ id_complex )
= ( ^ [Z0: complex] : one_one_complex ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X2: complex] :
( ( deriv_complex @ id_complex @ X2 )
= one_one_complex ),
inference(arg_cong,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP035^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n018.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 19:42:12 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.20/0.27 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.Gy0w3nkRji/E---3.1_549285.p
% 0.20/0.35 % Version: 3.5.1-ho
% 0.20/0.35 % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.20/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.35 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.35 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.35 % new_bool_1 with pid 549321 completed with status 0
% 0.20/0.35 % Result found by new_bool_1
% 0.20/0.35 % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.20/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.35 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.35 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.35 % Search class: HGUSM-FSLM32-DHSFFSBN
% 0.20/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.35 % SubtermCWHack with pid 549324 completed with status 0
% 0.20/0.35 % Result found by SubtermCWHack
% 0.20/0.35 % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.20/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.35 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.35 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.35 % Search class: HGUSM-FSLM32-DHSFFSBN
% 0.20/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.35 % Preprocessing time : 0.006 s
% 0.20/0.35
% 0.20/0.35 % Proof found!
% 0.20/0.35 % SZS status Theorem
% 0.20/0.35 % SZS output start CNFRefutation
% See solution above
% 0.20/0.35 % Parsed axioms : 433
% 0.20/0.35 % Removed by relevancy pruning/SinE : 163
% 0.20/0.35 % Initial clauses : 410
% 0.20/0.35 % Removed in clause preprocessing : 33
% 0.20/0.35 % Initial clauses in saturation : 377
% 0.20/0.35 % Processed clauses : 75
% 0.20/0.35 % ...of these trivial : 30
% 0.20/0.35 % ...subsumed : 0
% 0.20/0.35 % ...remaining for further processing : 45
% 0.20/0.35 % Other redundant clauses eliminated : 0
% 0.20/0.35 % Clauses deleted for lack of memory : 0
% 0.20/0.35 % Backward-subsumed : 0
% 0.20/0.35 % Backward-rewritten : 2
% 0.20/0.35 % Generated clauses : 28
% 0.20/0.35 % ...of the previous two non-redundant : 20
% 0.20/0.35 % ...aggressively subsumed : 0
% 0.20/0.35 % Contextual simplify-reflections : 0
% 0.20/0.35 % Paramodulations : 8
% 0.20/0.35 % Factorizations : 0
% 0.20/0.35 % NegExts : 0
% 0.20/0.35 % Equation resolutions : 0
% 0.20/0.35 % Disequality decompositions : 0
% 0.20/0.35 % Total rewrite steps : 44
% 0.20/0.35 % ...of those cached : 17
% 0.20/0.35 % Propositional unsat checks : 0
% 0.20/0.35 % Propositional check models : 0
% 0.20/0.35 % Propositional check unsatisfiable : 0
% 0.20/0.35 % Propositional clauses : 0
% 0.20/0.35 % Propositional clauses after purity: 0
% 0.20/0.35 % Propositional unsat core size : 0
% 0.20/0.35 % Propositional preprocessing time : 0.000
% 0.20/0.35 % Propositional encoding time : 0.000
% 0.20/0.35 % Propositional solver time : 0.000
% 0.20/0.35 % Success case prop preproc time : 0.000
% 0.20/0.35 % Success case prop encoding time : 0.000
% 0.20/0.35 % Success case prop solver time : 0.000
% 0.20/0.35 % Current number of processed clauses : 43
% 0.20/0.35 % Positive orientable unit clauses : 38
% 0.20/0.35 % Positive unorientable unit clauses: 0
% 0.20/0.35 % Negative unit clauses : 5
% 0.20/0.35 % Non-unit-clauses : 0
% 0.20/0.35 % Current number of unprocessed clauses: 322
% 0.20/0.35 % ...number of literals in the above : 848
% 0.20/0.35 % Current number of archived formulas : 0
% 0.20/0.35 % Current number of archived clauses : 2
% 0.20/0.35 % Clause-clause subsumption calls (NU) : 0
% 0.20/0.35 % Rec. Clause-clause subsumption calls : 0
% 0.20/0.35 % Non-unit clause-clause subsumptions : 0
% 0.20/0.35 % Unit Clause-clause subsumption calls : 5
% 0.20/0.35 % Rewrite failures with RHS unbound : 0
% 0.20/0.35 % BW rewrite match attempts : 9
% 0.20/0.35 % BW rewrite match successes : 2
% 0.20/0.35 % Condensation attempts : 0
% 0.20/0.35 % Condensation successes : 0
% 0.20/0.35 % Termbank termtop insertions : 30475
% 0.20/0.35 % Search garbage collected termcells : 8760
% 0.20/0.35
% 0.20/0.35 % -------------------------------------------------
% 0.20/0.35 % User time : 0.032 s
% 0.20/0.35 % System time : 0.009 s
% 0.20/0.35 % Total time : 0.040 s
% 0.20/0.35 % Maximum resident set size: 6008 pages
% 0.20/0.35
% 0.20/0.35 % -------------------------------------------------
% 0.20/0.35 % User time : 0.046 s
% 0.20/0.35 % System time : 0.013 s
% 0.20/0.35 % Total time : 0.059 s
% 0.20/0.35 % Maximum resident set size: 5632 pages
% 0.20/0.35 % E exiting
%------------------------------------------------------------------------------